Introduce "stride" for range constraints

[chriseth]

We lose a lot of information by multiplying a range constraint by a number. Some of that information is kept in the bit masks, but this does not work at all if negative numbers are involved.
If we add another parameter stride, then we could retain all information arising from (non-wrapping) multiplications by numbers, divisions by the same or divisors and arbitrary additions of numbers.
This is especially useful since we don't always know how to normalize affine constraints.

[chriseth]

With this we could extend the try_split to extract a coefficient from the range constraints.
See #2751 (comment) and the test case added in #3157

[chriseth]

With this, the constraint splitter should be able to split the following:

    #[test]
    fn split_bit_decomp_bug() {
        let lin = GroupedExpression::from_unknown_variable("lin");
        let result = GroupedExpression::from_unknown_variable("result");
        let constr = lin.clone() - constant(4) * result.clone() - constant(4);
        let range_constraints = HashMap::from([
            ("lin", RangeConstraint::from_mask(0x8u32)),
            ("result", RangeConstraint::from_mask(0x1u32)),
        ]);
        let result = try_split_constraint(&constr, &range_constraints).unwrap();
    }