1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
/*++
Copyright (c) 2026 Microsoft Corporation
Module Name:
bv_divrem_bounds_tactic.h
Abstract:
Tactic wrapper around the bv::divrem_bounds simplifier. It adds range
lemmas for bit-vector division and remainder terms with a non-constant
divisor. See ast/simplifiers/bv_divrem_bounds.h for details.
Author:
Nikolaj Bjorner (nbjorner)
Tactic Documentation
## Tactic bv-divrem-bounds
### Short Description
Add range lemmas for bit-vector division/remainder terms with a symbolic divisor.
### Long Description
For a divisor `b` that is not a numeral, the remainder magnitude is bounded by
the divisor magnitude and the unsigned quotient is bounded by the dividend.
These facts are hidden once a division circuit is bit-blasted, so the tactic
emits them as implied lemmas up front, letting a downstream SAT solver reason
about magnitudes without unfolding the circuit.
### Example
```z3
(declare-const a (_ BitVec 8))
(declare-const b (_ BitVec 8))
(declare-const c (_ BitVec 8))
(assert (= (bvsrem a (bvadd b c)) #x05))
(apply bv-divrem-bounds)
```
--*/
class ast_manager;
class tactic;
inline tactic*
/*
ADD_TACTIC("bv-divrem-bounds", "add range lemmas for bit-vector division/remainder terms with a symbolic divisor.", "mk_bv_divrem_bounds_tactic(m, p)")
ADD_SIMPLIFIER("bv-divrem-bounds", "add range lemmas for bit-vector division/remainder terms with a symbolic divisor.", "alloc(bv::divrem_bounds, m, s)")
*/