mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-10-06 07:53:59 +00:00
Code Activity
19028 commits 28 branches 52 tags 171 MiB
Commit graph

174 commits

Author SHA1 Message Date
Nikolaj Bjorner
9e2ec9d018 add stubs for proof production in elim_unconstrained 2023-01-25 13:32:51 -08:00
Nikolaj Bjorner
b3de7ac595 remove passing proof parameter to expr-inverter 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
 2023-01-25 11:15:09 -08:00
Nikolaj Bjorner
f100d2f4de add contextual simplification to bv-bounds-tactic 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
 2023-01-24 17:49:55 -08:00
Nikolaj Bjorner
47c7ed3b17 update ml example to 64 bit 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
 2023-01-24 04:33:52 -08:00
Nikolaj Bjorner
15d853dc04 add trail to avoid stale references in expr2var 2023-01-24 04:15:52 -08:00
Nikolaj Bjorner
3032c9315d handle to-real in variable mapping 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
 2023-01-23 14:31:24 -08:00
Nikolaj Bjorner
d9f9cceea4 use intervals for tracking bounds on arithmetic variables 
leverage interval propagation for bounds.
merge functionality with propagate-ineqs tactic
remove the new propagate-bounds tactic and instead use propagate-ineqs
 2023-01-23 14:13:03 -08:00
Nikolaj Bjorner
eb751bec4c fix riscv/aarch/powerpc build warnings 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
 2023-01-22 23:57:59 -08:00
Nikolaj Bjorner
3b5ae285d9 add outline for interval reasoning 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
 2023-01-22 23:28:36 -08:00
Nikolaj Bjorner
db79346ef7 Add new tactic bound-simplifier for integer-based bit-vector reasoning. 2023-01-22 22:07:28 -08:00
Nikolaj Bjorner
021ef699af detect bounds from mod 2023-01-22 14:40:19 -08:00
Nikolaj Bjorner
7368f9f7d3 increase build version, better propagation in euf-egraph, handle assumptions in sat.smt 
- increase build version to 4.12.1. This prepares updated release for MacOs-11 build on x86
- move literal propagation mode in euf-egraph to a callback and traversal of equivalence class. Track antecedent by newest equality instead of root. This makes equality propagation to literals have similar behavior as in legacy solver and appears to result in a speedup (10% fewer conflicts on QF_UF/QG-classification/qg5/iso_icl478.smt2 in preliminary testing)
- fix interaction of pre-processing and assumptions. Pre-processing has to freeze assumption literals so they don't get eliminated. This is similar to dependencies that are already frozen.
 2023-01-17 14:07:07 -08:00
Nikolaj Bjorner
d5fde2e578 #6538 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
 2023-01-15 15:58:29 -05:00
Nikolaj Bjorner
4f7f4376b8 fix bug in new core not detecting conflict, fix #6525, add tactic doc 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
 2023-01-14 17:20:43 -05:00
Nikolaj Bjorner
25b0b1430c move bound_manager to simplifiers, add bound manager to extract_eqs for solve-eqs #6532 2023-01-12 12:42:28 -08:00
Nikolaj Bjorner
64ec8acd30 fix model reconstruction ordering for elim_unconstrained 2023-01-09 15:18:19 -08:00
Nikolaj Bjorner
95cb06d8cf add quasi macro detection 2023-01-06 19:53:55 -08:00
Nikolaj Bjorner
25112e47b4 bugfix to flatten-clases simplifier 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
 2023-01-05 20:59:28 -08:00
Nikolaj Bjorner
6f95c77023 fix bugs in flatten_clauses simplifier, switch proof/fml 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
 2023-01-04 11:56:28 -08:00
Nikolaj Bjorner
f6d411d54b experimental feature to access congruence closure of SimpleSolver 
This update includes an experimental feature to access a congruence closure data-structure after search.
It comes with several caveats as pre-processing is free to eliminate terms. It is therefore necessary to use a solver that does not eliminate the terms you want to track for congruence of. This is partially addressed by using SimpleSolver or incremental mode solving.

```python
from z3 import *
s = SimpleSolver()
x, y, z = Ints('x y z')
s.add(x == y)
s.add(y == z)
s.check()
print(s.root(x), s.root(y), s.root(z))
print(s.next(x), s.next(y), s.next(z))
```
 2022-12-30 21:41:27 -08:00
Nikolaj Bjorner
5f6f2fc758 rename bit_blaster class to bit_blaster_simplifier to avoid name clash 2022-12-30 18:39:02 -08:00
Nikolaj Bjorner
2c3ecceb03 fix build 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
 2022-12-30 15:47:24 -08:00
Nikolaj Bjorner
293627c889 fix #6513 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
 2022-12-30 09:55:33 -08:00
Nikolaj Bjorner
07ab4d38b6 fix #6513 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
 2022-12-30 09:55:10 -08:00
Nikolaj Bjorner
b9c4f5d4fa #6506 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
 2022-12-25 18:33:01 -08:00
Nikolaj Bjorner
ecf25a4fe2 outline scheme 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
 2022-12-15 14:57:52 -08:00
Nikolaj Bjorner
2d7a38e95e fix #6488 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
 2022-12-13 16:07:41 -08:00
Nikolaj Bjorner
aded8e5bf4 fix #6488 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
 2022-12-12 11:40:59 -08:00
Nikolaj Bjorner
4598af70c8 fix #6488 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
 2022-12-12 11:04:46 -08:00
Nikolaj Bjorner
a3e6885680 fix #6488 2022-12-12 09:50:44 -08:00
Nikolaj Bjorner
039de6a2c8 build issues 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
 2022-12-11 15:05:13 -08:00
Nuno Lopes
cb8603177e fix build 2022-12-11 22:17:11 +00:00
Nikolaj Bjorner
2520dcb04b merge 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
 2022-12-11 14:03:22 -08:00
Nuno Lopes
2d43ccc4c6 Revert "fix crashes in elim-uncnstr2" 
This reverts commit a302c2f15e.
 2022-12-11 21:37:25 +00:00
Nikolaj Bjorner
6a1b3f7344 move debug output to before state update 2022-12-11 12:51:46 -08:00
Nikolaj Bjorner
f7269bb60a update doc 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
 2022-12-11 10:16:17 -08:00
Nikolaj Bjorner
a9f52b0069 doc fixes 2022-12-11 10:04:01 -08:00
Nuno Lopes
a302c2f15e fix crashes in elim-uncnstr2 
This would crash before:
(declare-fun x () (_ BitVec 4))
(assert (not (bvule x #x1)))
(apply elim-uncnstr2)

That's because the index_set iterator was querying qtail to compute the end of the iteration
But the problem is that elim-uncnstr2 may add new fmls to the goal, as in this case.
The bvule is replaced with an 'or', but since it's negated, it turns into 2 goals
Solve the issue by freezing the qtail for the iteration loop.
This is the right behavior for elim-uncnstr2, as it can't rewrite exprs that haven't been analyzed before

@NikolajBjorner please check if this the right behavior for the other simplifiers. Thank you
 2022-12-11 15:21:23 +00:00
Nuno Lopes
c6f9c09d70 cleanup more in dependent_expr_state_tactic to reduce mem consumption 2022-12-09 11:34:53 +00:00
Nikolaj Bjorner
7e69dab8f6 distribute forall cpp code 2022-12-06 18:15:18 -08:00
Nikolaj Bjorner
c33e58ee1a update distribute forall 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
 2022-12-06 17:59:33 -08:00
Nikolaj Bjorner
80033e8744 cave in to supporting proofs (partially) in simplifiers, updated doc 2022-12-06 17:02:04 -08:00
Nikolaj Bjorner
5a5758baaa add documentation to initial selection of tactics 2022-12-05 20:05:06 -08:00
Nuno Lopes
eb8c53c164 simplify factory of dependent_expr_state_tactic 
And as a side-effect, remove heap allocations for factories
 2022-12-05 14:07:57 +00:00
Nikolaj Bjorner
de916f50d6 add demodulator tactic based on demodulator-simplifier 
- some handling for commutative operators
- fix bug in demodulator_index where fwd and bwd are swapped
 2022-12-05 03:20:46 -08:00
Nikolaj Bjorner
ead2a46a88 build 2022-12-04 10:38:24 -08:00
Nikolaj Bjorner
b76ed6a47f proper fix to #6476 2022-12-04 10:19:39 -08:00
Nikolaj Bjorner
1974c224ab add demodulator simplifier 
refactor demodulator-rewriter a bit to separate reusable features.
 2022-12-04 09:39:28 -08:00
Nikolaj Bjorner
79e6d4e32d tune and debug elim-unconstrained (v2 - for simplifiers infrastructure) 2022-12-04 03:53:31 -08:00
Nikolaj Bjorner
3ebbb8472a fix perf bugs in new value propagation 2022-12-04 03:53:30 -08:00