mirror of
https://github.com/Z3Prover/z3
synced 2025-04-14 04:48:45 +00:00
* adding dt-solver Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com> * dt Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com> * move mbp to self-contained module Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com> * files Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com> * Create CMakeLists.txt * dt Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com> * rename to bool_var2expr to indicate type class * mbp * na * add projection * na * na * na * na * na Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com> * deps Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com> * testing arith/q * na * newline for model printing Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
135 lines
3.7 KiB
C++
135 lines
3.7 KiB
C++
/*++
|
|
Copyright (c) 2012 Microsoft Corporation
|
|
|
|
Module Name:
|
|
|
|
expr_safe_replace.cpp
|
|
|
|
Abstract:
|
|
|
|
Version of expr_replace/expr_substitution that is safe for quantifiers.
|
|
|
|
Author:
|
|
|
|
Nikolaj Bjorner (nbjorner) 2012-11-30
|
|
|
|
Revision History:
|
|
|
|
|
|
--*/
|
|
|
|
#include "ast/rewriter/expr_safe_replace.h"
|
|
#include "ast/rewriter/var_subst.h"
|
|
#include "ast/ast_pp.h"
|
|
|
|
|
|
void expr_safe_replace::insert(expr* src, expr* dst) {
|
|
SASSERT(m.get_sort(src) == m.get_sort(dst));
|
|
m_src.push_back(src);
|
|
m_dst.push_back(dst);
|
|
m_subst.insert(src, dst);
|
|
}
|
|
|
|
void expr_safe_replace::operator()(expr_ref_vector& es) {
|
|
expr_ref val(m);
|
|
for (unsigned i = 0; i < es.size(); ++i) {
|
|
(*this)(es.get(i), val);
|
|
es[i] = val;
|
|
}
|
|
}
|
|
|
|
void expr_safe_replace::operator()(expr* e, expr_ref& res) {
|
|
m_todo.push_back(e);
|
|
expr* a, *b;
|
|
|
|
while (!m_todo.empty()) {
|
|
a = m_todo.back();
|
|
if (m_cache.contains(a)) {
|
|
m_todo.pop_back();
|
|
}
|
|
else if (m_subst.find(a, b)) {
|
|
m_cache.insert(a, b);
|
|
m_todo.pop_back();
|
|
}
|
|
else if (is_var(a)) {
|
|
m_cache.insert(a, a);
|
|
m_todo.pop_back();
|
|
}
|
|
else if (is_app(a)) {
|
|
app* c = to_app(a);
|
|
unsigned n = c->get_num_args();
|
|
m_args.reset();
|
|
bool arg_differs = false;
|
|
for (unsigned i = 0; i < n; ++i) {
|
|
expr* d = nullptr, *arg = c->get_arg(i);
|
|
if (m_cache.find(arg, d)) {
|
|
m_args.push_back(d);
|
|
arg_differs |= arg != d;
|
|
SASSERT(m.get_sort(arg) == m.get_sort(d));
|
|
}
|
|
else {
|
|
m_todo.push_back(arg);
|
|
}
|
|
}
|
|
if (m_args.size() == n) {
|
|
if (arg_differs) {
|
|
b = m.mk_app(c->get_decl(), m_args.size(), m_args.c_ptr());
|
|
m_refs.push_back(b);
|
|
SASSERT(m.get_sort(a) == m.get_sort(b));
|
|
} else {
|
|
b = a;
|
|
}
|
|
m_cache.insert(a, b);
|
|
m_todo.pop_back();
|
|
}
|
|
}
|
|
else {
|
|
SASSERT(is_quantifier(a));
|
|
quantifier* q = to_quantifier(a);
|
|
expr_safe_replace replace(m);
|
|
var_shifter shift(m);
|
|
expr_ref new_body(m), src(m), dst(m), tmp(m);
|
|
expr_ref_vector pats(m), nopats(m);
|
|
unsigned num_decls = q->get_num_decls();
|
|
for (unsigned i = 0; i < m_src.size(); ++i) {
|
|
shift(m_src[i].get(), num_decls, src);
|
|
shift(m_dst[i].get(), num_decls, dst);
|
|
replace.insert(src, dst);
|
|
}
|
|
unsigned np = q->get_num_patterns();
|
|
for (unsigned i = 0; i < np; ++i) {
|
|
replace(q->get_pattern(i), tmp);
|
|
pats.push_back(tmp);
|
|
}
|
|
np = q->get_num_no_patterns();
|
|
for (unsigned i = 0; i < np; ++i) {
|
|
replace(q->get_no_pattern(i), tmp);
|
|
nopats.push_back(tmp);
|
|
}
|
|
replace(q->get_expr(), new_body);
|
|
b = m.update_quantifier(q, pats.size(), pats.c_ptr(), nopats.size(), nopats.c_ptr(), new_body);
|
|
m_refs.push_back(b);
|
|
m_cache.insert(a, b);
|
|
m_todo.pop_back();
|
|
}
|
|
}
|
|
res = m_cache.find(e);
|
|
m_cache.reset();
|
|
m_todo.reset();
|
|
m_args.reset();
|
|
m_refs.reset();
|
|
}
|
|
|
|
void expr_safe_replace::reset() {
|
|
m_src.reset();
|
|
m_dst.reset();
|
|
m_subst.reset();
|
|
}
|
|
|
|
void expr_safe_replace::apply_substitution(expr* s, expr* def, expr_ref& t) {
|
|
reset();
|
|
insert(s, def);
|
|
(*this)(t, t);
|
|
reset();
|
|
}
|