/*++ Copyright (c) 2020 Microsoft Corporation Module Name: user_solver.h Abstract: User-propagator plugin. Adds user plugins to propagate based on terms receiving fixed values or equalities. Author: Nikolaj Bjorner (nbjorner) 2020-08-17 --*/ #pragma once #include "sat/smt/sat_th.h" #include "solver/solver.h" namespace user { class solver : public euf::th_euf_solver, public ::solver::propagate_callback { struct prop_info { unsigned_vector m_ids; expr_ref m_conseq; svector> m_eqs; prop_info(unsigned num_fixed, unsigned const* fixed_ids, unsigned num_eqs, unsigned const* eq_lhs, unsigned const* eq_rhs, expr_ref const& c): m_ids(num_fixed, fixed_ids), m_conseq(c) { for (unsigned i = 0; i < num_eqs; ++i) m_eqs.push_back(std::make_pair(eq_lhs[i], eq_rhs[i])); } }; struct stats { unsigned m_num_propagations; stats() { reset(); } void reset() { memset(this, 0, sizeof(*this)); } }; void* m_user_context; ::solver::push_eh_t m_push_eh; ::solver::pop_eh_t m_pop_eh; ::solver::fresh_eh_t m_fresh_eh; ::solver::final_eh_t m_final_eh; ::solver::fixed_eh_t m_fixed_eh; ::solver::eq_eh_t m_eq_eh; ::solver::eq_eh_t m_diseq_eh; ::solver::context_obj* m_api_context { nullptr }; unsigned m_qhead { 0 }; vector m_prop; unsigned_vector m_prop_lim; vector m_id2justification; sat::literal_vector m_lits; euf::enode_pair_vector m_eqs; stats m_stats; struct justification { unsigned m_propagation_index { 0 }; justification(unsigned prop_index): m_propagation_index(prop_index) {} sat::ext_constraint_idx to_index() const { return sat::constraint_base::mem2base(this); } static justification& from_index(size_t idx) { return *reinterpret_cast(sat::constraint_base::from_index(idx)->mem()); } static size_t get_obj_size() { return sat::constraint_base::obj_size(sizeof(justification)); } }; sat::justification mk_justification(unsigned propagation_index); public: solver(euf::solver& ctx); ~solver() override; /* * \brief initial setup for user propagator. */ void add( void* ctx, ::solver::push_eh_t& push_eh, ::solver::pop_eh_t& pop_eh, ::solver::fresh_eh_t& fresh_eh) { m_user_context = ctx; m_push_eh = push_eh; m_pop_eh = pop_eh; m_fresh_eh = fresh_eh; } unsigned add_expr(expr* e); void register_final(::solver::final_eh_t& final_eh) { m_final_eh = final_eh; } void register_fixed(::solver::fixed_eh_t& fixed_eh) { m_fixed_eh = fixed_eh; } void register_eq(::solver::eq_eh_t& eq_eh) { m_eq_eh = eq_eh; } void register_diseq(::solver::eq_eh_t& diseq_eh) { m_diseq_eh = diseq_eh; } bool has_fixed() const { return (bool)m_fixed_eh; } void propagate_cb(unsigned num_fixed, unsigned const* fixed_ids, unsigned num_eqs, unsigned const* lhs, unsigned const* rhs, expr* conseq) override; void new_fixed_eh(euf::theory_var v, expr* value, unsigned num_lits, sat::literal const* jlits); void asserted(sat::literal lit) override; sat::check_result check() override; void push_core() override; void pop_core(unsigned n) override; bool unit_propagate() override; void get_antecedents(sat::literal l, sat::ext_justification_idx idx, sat::literal_vector & r, bool probing) override; void collect_statistics(statistics& st) const override; sat::literal internalize(expr* e, bool sign, bool root, bool learned) override { UNREACHABLE(); return sat::null_literal; } void internalize(expr* e, bool redundant) override { UNREACHABLE(); } std::ostream& display(std::ostream& out) const override; std::ostream& display_justification(std::ostream& out, sat::ext_justification_idx idx) const override; std::ostream& display_constraint(std::ostream& out, sat::ext_constraint_idx idx) const override; euf::th_solver* clone(euf::solver& ctx) override; }; };