mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-24 09:35:32 +00:00
Code Activity

experimental feature to access congruence closure of SimpleSolver

Browse source 
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))
```
This commit is contained in:
Nikolaj Bjorner 2022-12-30 21:41:27 -08:00
parent c0f1f33898
commit f6d411d54b
21 changed files with 145 additions and 12 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/tactic/fd_solver/bounded_int2bv_solver.cpp
View file

@ -210,6 +210,8 @@ public:
void set_reason_unknown(char const* msg) override { m_solver->set_reason_unknown(msg); }
void get_labels(svector<symbol> & r) override { m_solver->get_labels(r); }
ast_manager& get_manager() const override { return m; }
expr* congruence_next(expr* e) override { return m_solver->congruence_next(e); }
expr* congruence_root(expr* e) override { return m_solver->congruence_root(e); }
expr_ref_vector cube(expr_ref_vector& vars, unsigned backtrack_level) override { flush_assertions(); return m_solver->cube(vars, backtrack_level); }
lbool find_mutexes(expr_ref_vector const& vars, vector<expr_ref_vector>& mutexes) override { return m_solver->find_mutexes(vars, mutexes); }
lbool get_consequences_core(expr_ref_vector const& asms, expr_ref_vector const& vars, expr_ref_vector& consequences) override {

3
src/tactic/fd_solver/enum2bv_solver.cpp
View file

@ -131,6 +131,9 @@ public:
expr_ref_vector cube(expr_ref_vector& vars, unsigned backtrack_level) override {
return m_solver->cube(vars, backtrack_level);
}
expr* congruence_next(expr* e) override { return m_solver->congruence_next(e); }
expr* congruence_root(expr* e) override { return m_solver->congruence_root(e); }
lbool get_consequences_core(expr_ref_vector const& asms, expr_ref_vector const& vars, expr_ref_vector& consequences) override {
datatype_util dt(m);

2
src/tactic/fd_solver/pb2bv_solver.cpp
View file

@ -122,6 +122,8 @@ public:
void get_labels(svector<symbol> & r) override { m_solver->get_labels(r); }
ast_manager& get_manager() const override { return m; }
expr_ref_vector cube(expr_ref_vector& vars, unsigned backtrack_level) override { flush_assertions(); return m_solver->cube(vars, backtrack_level); }
expr* congruence_next(expr* e) override { return m_solver->congruence_next(e); }
expr* congruence_root(expr* e) override { return m_solver->congruence_root(e); }
lbool find_mutexes(expr_ref_vector const& vars, vector<expr_ref_vector>& mutexes) override { return m_solver->find_mutexes(vars, mutexes); }
lbool get_consequences_core(expr_ref_vector const& asms, expr_ref_vector const& vars, expr_ref_vector& consequences) override {
flush_assertions();

4
src/tactic/fd_solver/smtfd_solver.cpp
View file

@ -2086,6 +2086,10 @@ namespace smtfd {
expr_ref_vector cube(expr_ref_vector& vars, unsigned backtrack_level) override {
return expr_ref_vector(m);
}
expr* congruence_root(expr* e) override { return e; }
expr* congruence_next(expr* e) override { return e; }
lbool get_consequences_core(expr_ref_vector const& asms, expr_ref_vector const& vars, expr_ref_vector& consequences) override {
return l_undef;