mirror of
https://github.com/Z3Prover/z3
synced 2025-04-29 20:05:51 +00:00
5c7eaec566
gc-ing definitions leads to unsoundness when they are not replayed. Instead of attempting to replay definitions theory internalization is irredundant by default. This is also the old solver behavior where TH_LEMMA is essentially never used, but is valid for top-level theory lemmas.
83 lines
2.6 KiB
C++
83 lines
2.6 KiB
C++
/*++
|
|
Copyright (c) 2014 Microsoft Corporation
|
|
|
|
Module Name:
|
|
|
|
fpa_solver.h
|
|
|
|
Abstract:
|
|
|
|
Floating-Point Theory Plugin
|
|
|
|
Author:
|
|
|
|
Christoph (cwinter) 2014-04-23
|
|
|
|
Revision History:
|
|
|
|
--*/
|
|
#pragma once
|
|
|
|
#include "sat/smt/euf_solver.h"
|
|
#include "ast/fpa/fpa2bv_converter.h"
|
|
#include "ast/fpa/fpa2bv_rewriter.h"
|
|
|
|
namespace fpa {
|
|
|
|
typedef euf::enode enode;
|
|
typedef euf::theory_var theory_var;
|
|
|
|
class solver : public euf::th_euf_solver {
|
|
protected:
|
|
th_rewriter m_th_rw;
|
|
fpa2bv_converter_wrapped m_converter;
|
|
fpa2bv_rewriter m_rw;
|
|
fpa_util & m_fpa_util;
|
|
bv_util & m_bv_util;
|
|
arith_util & m_arith_util;
|
|
obj_map<expr, expr*> m_conversions;
|
|
svector<std::tuple<enode*, bool, bool>> m_nodes;
|
|
unsigned m_nodes_qhead = 0;
|
|
|
|
bool visit(expr* e) override;
|
|
bool visited(expr* e) override;
|
|
bool post_visit(expr* e, bool sign, bool root) override;
|
|
|
|
expr_ref convert(expr* e);
|
|
sat::literal_vector mk_side_conditions();
|
|
void attach_new_th_var(enode* n);
|
|
void activate(expr* e);
|
|
void unit_propagate(std::tuple<enode*, bool, bool> const& t);
|
|
void ensure_equality_relation(theory_var x, theory_var y);
|
|
|
|
public:
|
|
solver(euf::solver& ctx);
|
|
~solver() override;
|
|
|
|
void asserted(sat::literal l) override;
|
|
void new_eq_eh(euf::th_eq const& eq) override;
|
|
bool use_diseqs() const override { return true; }
|
|
void new_diseq_eh(euf::th_eq const& eq) override;
|
|
|
|
sat::literal internalize(expr* e, bool sign, bool root) override;
|
|
void internalize(expr* e) override;
|
|
void apply_sort_cnstr(euf::enode* n, sort* s) override;
|
|
|
|
std::ostream& display(std::ostream& out) const override;
|
|
std::ostream& display_justification(std::ostream& out, sat::ext_justification_idx idx) const override { UNREACHABLE(); return out; }
|
|
std::ostream& display_constraint(std::ostream& out, sat::ext_constraint_idx idx) const override { UNREACHABLE(); return out; }
|
|
void add_value(euf::enode* n, model& mdl, expr_ref_vector& values) override;
|
|
bool add_dep(euf::enode* n, top_sort<euf::enode>& dep) override;
|
|
void finalize_model(model& mdl) override;
|
|
|
|
bool unit_propagate() override;
|
|
void get_antecedents(sat::literal l, sat::ext_justification_idx idx, sat::literal_vector& r, bool probing) override { UNREACHABLE(); }
|
|
sat::check_result check() override;
|
|
|
|
euf::th_solver* clone(euf::solver& ctx) override { return alloc(solver, ctx); }
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|