mirror of
https://github.com/Z3Prover/z3
synced 2025-07-18 10:30:44 +00:00
add stub for cheap equality propagation
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
parent
6a45c5d17c
commit
d372af4782
13 changed files with 131 additions and 105 deletions
|
@ -64,22 +64,21 @@ namespace smt {
|
|||
expr* s = nullptr, *r = nullptr;
|
||||
expr* e = ctx.bool_var2expr(lit.var());
|
||||
expr_ref id(a().mk_int(e->get_id()), m);
|
||||
unsigned idx = 0;
|
||||
VERIFY(str().is_in_re(e, s, r));
|
||||
sort* seq_sort = m.get_sort(s);
|
||||
vector<expr_ref_vector> patterns;
|
||||
auto mk_cont = [&](unsigned idx) {
|
||||
auto mk_cont = [&](unsigned idx) {
|
||||
return sk().mk("seq.cont", id, a().mk_int(idx), seq_sort);
|
||||
};
|
||||
unsigned idx = 0;
|
||||
if (seq_rw().is_re_contains_pattern(r, patterns)) {
|
||||
expr_ref t(m);
|
||||
expr_ref_vector ts(m);
|
||||
ts.push_back(mk_cont(idx));
|
||||
for (auto const& p : patterns) {
|
||||
ts.append(p);
|
||||
ts.push_back(mk_cont(++idx));
|
||||
}
|
||||
t = th.mk_concat(ts, seq_sort);
|
||||
expr_ref t = th.mk_concat(ts, seq_sort);
|
||||
th.propagate_eq(lit, s, t, true);
|
||||
return true;
|
||||
}
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue