z3-z3-4.13.0.src.model.model.h Maven / Gradle / Ivy
The newest version!
/*++
Copyright (c) 2011 Microsoft Corporation
Module Name:
model.h
Abstract:
Model for satisfiable formulas
Author:
Leonardo de Moura (leonardo) 2011-04-30.
Revision History:
--*/
#pragma once
#include "util/ref.h"
#include "util/vector.h"
#include "ast/ast_translation.h"
#include "util/plugin_manager.h"
#include "model/model_core.h"
#include "model/model_evaluator.h"
#include "model/value_factory.h"
class model;
typedef ref model_ref;
class model : public model_core {
protected:
typedef obj_map*> sort2universe;
typedef obj_hashtable func_decl_set;
ptr_vector m_usorts;
sort2universe m_usort2universe;
model_evaluator m_mev;
bool m_cleaned;
bool m_inline;
plugin_manager m_factories;
struct deps_collector;
struct occs_collector;
struct top_sort;
func_decl_set* collect_deps(top_sort& ts, expr * e);
func_decl_set* collect_deps(top_sort& ts, func_interp* fi);
void collect_deps(top_sort& ts);
void collect_occs(top_sort& ts, func_decl* f);
void collect_occs(top_sort& ts, expr* e);
void cleanup_interp(top_sort& ts, func_decl * f, bool force_inline);
expr_ref cleanup_expr(top_sort& ts, expr* e, unsigned current_partition, bool force_inline);
void remove_decls(ptr_vector & decls, func_decl_set const & s);
bool can_inline_def(top_sort& ts, func_decl* f, bool force_inline);
value_factory* get_factory(sort* s);
public:
model(ast_manager & m);
~model() override;
void copy_func_interps(model const & source);
void copy_const_interps(model const & source);
void copy_usort_interps(model const & source);
model * copy() const;
bool eval_expr(expr * e, expr_ref & result, bool model_completion = false);
expr * get_some_value(sort * s) override;
expr * get_fresh_value(sort * s) override;
void register_value(expr* n);
bool get_some_values(sort * s, expr_ref & v1, expr_ref & v2) override;
ptr_vector const & get_universe(sort * s) const override;
unsigned get_num_uninterpreted_sorts() const override;
sort * get_uninterpreted_sort(unsigned idx) const override;
bool has_uninterpreted_sort(sort * s) const;
expr_ref get_inlined_const_interp(func_decl* f, bool force_inline);
expr_ref unfold_as_array(expr* e);
void set_inline() { m_inline = true; }
//
// Primitives for building models
//
void register_usort(sort * s, unsigned usize, expr * const * universe);
// Model translation
//
model * translate(ast_translation & translator) const;
void compress(bool force_inline = false);
void evaluate_constants();
void set_model_completion(bool f) { m_mev.set_model_completion(f); }
void updt_params(params_ref const & p);
/**
* evaluation using the model evaluator. Caches results.
*/
expr_ref operator()(expr* t);
expr_ref_vector operator()(expr_ref_vector const& ts);
bool is_true(expr* t);
bool is_false(expr* t);
bool is_true(expr_ref_vector const& ts);
bool is_false(expr_ref_vector const& ts);
bool are_equal(expr* s, expr* t);
void reset_eval_cache();
bool has_solver();
void set_solver(expr_solver* solver);
void add_rec_funs();
class scoped_model_completion {
bool m_old_completion;
model& m_model;
public:
scoped_model_completion(model& m, bool c):
m_old_completion(m.m_mev.get_model_completion()), m_model(m) {
m.set_model_completion(c);
}
scoped_model_completion(model_ref& m, bool c):
m_old_completion(m->m_mev.get_model_completion()), m_model(*m.get()) {
m->set_model_completion(c);
}
~scoped_model_completion() {
m_model.set_model_completion(m_old_completion);
}
};
};