1 /********************* */
2 /*! \file theory_engine.h
4 ** Top contributors (to current version):
5 ** Dejan Jovanovic, Morgan Deters, Andrew Reynolds
6 ** This file is part of the CVC4 project.
7 ** Copyright (c) 2009-2019 by the authors listed in the file AUTHORS
8 ** in the top-level source directory) and their institutional affiliations.
9 ** All rights reserved. See the file COPYING in the top-level source
10 ** directory for licensing information.\endverbatim
12 ** \brief The theory engine
17 #include "cvc4_private.h"
19 #ifndef CVC4__THEORY_ENGINE_H
20 #define CVC4__THEORY_ENGINE_H
25 #include <unordered_map>
29 #include "base/check.h"
30 #include "context/cdhashset.h"
31 #include "expr/node.h"
32 #include "options/options.h"
33 #include "options/smt_options.h"
34 #include "options/theory_options.h"
35 #include "prop/prop_engine.h"
36 #include "smt/command.h"
37 #include "theory/atom_requests.h"
38 #include "theory/decision_manager.h"
39 #include "theory/interrupted.h"
40 #include "theory/rewriter.h"
41 #include "theory/shared_terms_database.h"
42 #include "theory/sort_inference.h"
43 #include "theory/substitutions.h"
44 #include "theory/term_registration_visitor.h"
45 #include "theory/theory.h"
46 #include "theory/uf/equality_engine.h"
47 #include "theory/valuation.h"
48 #include "util/hash.h"
49 #include "util/resource_manager.h"
50 #include "util/statistics_registry.h"
51 #include "util/unsafe_interrupt_exception.h"
55 class ResourceManager
;
56 class LemmaProofRecipe
;
59 * A pair of a theory and a node. This is used to mark the flow of
60 * propagations between theories.
62 struct NodeTheoryPair
{
64 theory::TheoryId d_theory
;
66 NodeTheoryPair(TNode n
, theory::TheoryId t
, size_t ts
= 0)
67 : d_node(n
), d_theory(t
), d_timestamp(ts
)
70 NodeTheoryPair() : d_theory(theory::THEORY_LAST
), d_timestamp() {}
71 // Comparison doesn't take into account the timestamp
72 bool operator == (const NodeTheoryPair
& pair
) const {
73 return d_node
== pair
.d_node
&& d_theory
== pair
.d_theory
;
75 };/* struct NodeTheoryPair */
77 struct NodeTheoryPairHashFunction
{
78 NodeHashFunction hashFunction
;
79 // Hash doesn't take into account the timestamp
80 size_t operator()(const NodeTheoryPair
& pair
) const {
81 uint64_t hash
= fnv1a::fnv1a_64(NodeHashFunction()(pair
.d_node
));
82 return static_cast<size_t>(fnv1a::fnv1a_64(pair
.d_theory
, hash
));
84 };/* struct NodeTheoryPairHashFunction */
87 /* Forward declarations */
90 class TheoryEngineModelBuilder
;
94 }/* CVC4::theory::eq namespace */
96 namespace quantifiers
{
100 class EntailmentCheckParameters
;
101 class EntailmentCheckSideEffects
;
102 }/* CVC4::theory namespace */
104 class DecisionEngine
;
105 class RemoveTermFormulas
;
108 * This is essentially an abstraction for a collection of theories. A
109 * TheoryEngine provides services to a PropEngine, making various
110 * T-solvers look like a single unit to the propositional part of
115 /** Shared terms database can use the internals notify the theories */
116 friend class SharedTermsDatabase
;
117 friend class theory::quantifiers::TermDb
;
119 /** Associated PropEngine engine */
120 prop::PropEngine
* d_propEngine
;
122 /** Access to decision engine */
123 DecisionEngine
* d_decisionEngine
;
126 context::Context
* d_context
;
128 /** Our user context */
129 context::UserContext
* d_userContext
;
132 * A table of from theory IDs to theory pointers. Never use this table
133 * directly, use theoryOf() instead.
135 theory::Theory
* d_theoryTable
[theory::THEORY_LAST
];
138 * A collection of theories that are "active" for the current run.
139 * This set is provided by the user (as a logic string, say, in SMT-LIBv2
140 * format input), or else by default it's all-inclusive. This is important
141 * because we can optimize for single-theory runs (no sharing), can reduce
142 * the cost of walking the DAG on registration, etc.
144 const LogicInfo
& d_logicInfo
;
147 * The database of shared terms.
149 SharedTermsDatabase d_sharedTerms
;
152 * Master equality engine, to share with theories.
154 theory::eq::EqualityEngine
* d_masterEqualityEngine
;
156 /** notify class for master equality engine */
157 class NotifyClass
: public theory::eq::EqualityEngineNotify
{
160 NotifyClass(TheoryEngine
& te
): d_te(te
) {}
161 bool eqNotifyTriggerEquality(TNode equality
, bool value
) override
165 bool eqNotifyTriggerPredicate(TNode predicate
, bool value
) override
169 bool eqNotifyTriggerTermEquality(theory::TheoryId tag
,
176 void eqNotifyConstantTermMerge(TNode t1
, TNode t2
) override
{}
177 void eqNotifyNewClass(TNode t
) override
{ d_te
.eqNotifyNewClass(t
); }
178 void eqNotifyPreMerge(TNode t1
, TNode t2
) override
181 void eqNotifyPostMerge(TNode t1
, TNode t2
) override
184 void eqNotifyDisequal(TNode t1
, TNode t2
, TNode reason
) override
187 };/* class TheoryEngine::NotifyClass */
188 NotifyClass d_masterEENotify
;
191 * notification methods
193 void eqNotifyNewClass(TNode t
);
194 void eqNotifyPreMerge(TNode t1
, TNode t2
);
195 void eqNotifyPostMerge(TNode t1
, TNode t2
);
196 void eqNotifyDisequal(TNode t1
, TNode t2
, TNode reason
);
199 * The quantifiers engine
201 theory::QuantifiersEngine
* d_quantEngine
;
203 * The decision manager
205 std::unique_ptr
<theory::DecisionManager
> d_decManager
;
208 * Default model object
210 theory::TheoryModel
* d_curr_model
;
211 bool d_aloc_curr_model
;
213 * Model builder object
215 theory::TheoryEngineModelBuilder
* d_curr_model_builder
;
216 bool d_aloc_curr_model_builder
;
217 /** are we in eager model building mode? (see setEagerModelBuilding). */
218 bool d_eager_model_building
;
220 typedef std::unordered_map
<Node
, Node
, NodeHashFunction
> NodeMap
;
221 typedef std::unordered_map
<TNode
, Node
, TNodeHashFunction
> TNodeMap
;
224 * Cache for theory-preprocessing of assertions
229 * Used for "missed-t-propagations" dumping mode only. A set of all
230 * theory-propagable literals.
232 context::CDList
<TNode
> d_possiblePropagations
;
235 * Used for "missed-t-propagations" dumping mode only. A
236 * context-dependent set of those theory-propagable literals that
237 * have been propagated.
239 context::CDHashSet
<Node
, NodeHashFunction
> d_hasPropagated
;
243 * Statistics for a particular theory.
247 static std::string
mkName(std::string prefix
,
248 theory::TheoryId theory
,
249 std::string suffix
) {
250 std::stringstream ss
;
251 ss
<< prefix
<< theory
<< suffix
;
256 IntStat conflicts
, propagations
, lemmas
, requirePhase
, restartDemands
;
258 Statistics(theory::TheoryId theory
);
260 };/* class TheoryEngine::Statistics */
263 * An output channel for Theory that passes messages
264 * back to a TheoryEngine.
266 class EngineOutputChannel
: public theory::OutputChannel
{
267 friend class TheoryEngine
;
270 * The theory engine we're communicating with.
272 TheoryEngine
* d_engine
;
275 * The statistics of the theory interractions.
277 Statistics d_statistics
;
279 /** The theory owning this channel. */
280 theory::TheoryId d_theory
;
283 EngineOutputChannel(TheoryEngine
* engine
, theory::TheoryId theory
)
284 : d_engine(engine
), d_statistics(theory
), d_theory(theory
) {}
286 void safePoint(ResourceManager::Resource r
) override
289 if (d_engine
->d_interrupted
) {
290 throw theory::Interrupted();
294 void conflict(TNode conflictNode
,
295 std::unique_ptr
<Proof
> pf
= nullptr) override
;
296 bool propagate(TNode literal
) override
;
298 theory::LemmaStatus
lemma(TNode lemma
, ProofRule rule
,
299 bool removable
= false, bool preprocess
= false,
300 bool sendAtoms
= false) override
;
302 theory::LemmaStatus
splitLemma(TNode lemma
,
303 bool removable
= false) override
;
305 void demandRestart() override
{
306 NodeManager
* curr
= NodeManager::currentNM();
307 Node restartVar
= curr
->mkSkolem(
308 "restartVar", curr
->booleanType(),
309 "A boolean variable asserted to be true to force a restart");
310 Trace("theory::restart")
311 << "EngineOutputChannel<" << d_theory
<< ">::restart(" << restartVar
313 ++d_statistics
.restartDemands
;
314 lemma(restartVar
, RULE_INVALID
, true);
317 void requirePhase(TNode n
, bool phase
) override
{
318 Debug("theory") << "EngineOutputChannel::requirePhase(" << n
<< ", "
319 << phase
<< ")" << std::endl
;
320 ++d_statistics
.requirePhase
;
321 d_engine
->d_propEngine
->requirePhase(n
, phase
);
324 void setIncomplete() override
{
325 Trace("theory") << "TheoryEngine::setIncomplete()" << std::endl
;
326 d_engine
->setIncomplete(d_theory
);
329 void spendResource(ResourceManager::Resource r
) override
331 d_engine
->spendResource(r
);
334 void handleUserAttribute(const char* attr
, theory::Theory
* t
) override
{
335 d_engine
->handleUserAttribute(attr
, t
);
340 * A helper function for registering lemma recipes with the proof engine
342 void registerLemmaRecipe(Node lemma
, Node originalLemma
, bool preprocess
,
343 theory::TheoryId theoryId
);
344 }; /* class TheoryEngine::EngineOutputChannel */
347 * Output channels for individual theories.
349 EngineOutputChannel
* d_theoryOut
[theory::THEORY_LAST
];
352 * Are we in conflict.
354 context::CDO
<bool> d_inConflict
;
357 * Are we in "SAT mode"? In this state, the user can query for the model.
358 * This corresponds to the state in Figure 4.1, page 52 of the SMT-LIB
359 * standard, version 2.6.
364 * Called by the theories to notify of a conflict.
366 void conflict(TNode conflict
, theory::TheoryId theoryId
);
369 * Debugging flag to ensure that shutdown() is called before the
375 * True if a theory has notified us of incompleteness (at this
376 * context level or below).
378 context::CDO
<bool> d_incomplete
;
381 * Called by the theories to notify that the current branch is incomplete.
383 void setIncomplete(theory::TheoryId theory
) {
389 * Mapping of propagations from recievers to senders.
391 typedef context::CDHashMap
<NodeTheoryPair
, NodeTheoryPair
, NodeTheoryPairHashFunction
> PropagationMap
;
392 PropagationMap d_propagationMap
;
395 * Timestamp of propagations
397 context::CDO
<size_t> d_propagationMapTimestamp
;
400 * Literals that are propagated by the theory. Note that these are TNodes.
401 * The theory can only propagate nodes that have an assigned literal in the
402 * SAT solver and are hence referenced in the SAT solver.
404 context::CDList
<TNode
> d_propagatedLiterals
;
407 * The index of the next literal to be propagated by a theory.
409 context::CDO
<unsigned> d_propagatedLiteralsIndex
;
412 * Called by the output channel to propagate literals and facts
413 * @return false if immediate conflict
415 bool propagate(TNode literal
, theory::TheoryId theory
);
418 * Internal method to call the propagation routines and collect the
419 * propagated literals.
421 void propagate(theory::Theory::Effort effort
);
424 * A variable to mark if we added any lemmas.
429 * A variable to mark if the OutputChannel was "used" by any theory
430 * since the start of the last check. If it has been, we require
431 * a FULL_EFFORT check before exiting and reporting SAT.
433 * See the documentation for the needCheck() function, below.
435 bool d_outputChannelUsed
;
437 /** Atom requests from lemmas */
438 AtomRequests d_atomRequests
;
441 * Adds a new lemma, returning its status.
442 * @param node the lemma
443 * @param negated should the lemma be asserted negated
444 * @param removable can the lemma be remove (restrictions apply)
445 * @param needAtoms if not THEORY_LAST, then
447 theory::LemmaStatus
lemma(TNode node
,
452 theory::TheoryId atomsTo
);
454 /** Enusre that the given atoms are send to the given theory */
455 void ensureLemmaAtoms(const std::vector
<TNode
>& atoms
, theory::TheoryId theory
);
457 RemoveTermFormulas
& d_tform_remover
;
459 /** sort inference module */
460 SortInference d_sortInfer
;
462 /** Time spent in theory combination */
463 TimerStat d_combineTheoriesTime
;
468 /** Whether we were just interrupted (or not) */
470 ResourceManager
* d_resourceManager
;
473 /** Constructs a theory engine */
474 TheoryEngine(context::Context
* context
,
475 context::UserContext
* userContext
,
476 RemoveTermFormulas
& iteRemover
,
477 const LogicInfo
& logic
);
479 /** Destroys a theory engine */
484 /** "Spend" a resource during a search or preprocessing.*/
485 void spendResource(ResourceManager::Resource r
);
488 * Adds a theory. Only one theory per TheoryId can be present, so if
489 * there is another theory it will be deleted.
491 template <class TheoryClass
>
492 inline void addTheory(theory::TheoryId theoryId
)
494 Assert(d_theoryTable
[theoryId
] == NULL
&& d_theoryOut
[theoryId
] == NULL
);
495 d_theoryOut
[theoryId
] = new EngineOutputChannel(this, theoryId
);
496 d_theoryTable
[theoryId
] = new TheoryClass(d_context
,
498 *d_theoryOut
[theoryId
],
499 theory::Valuation(this),
503 inline void setPropEngine(prop::PropEngine
* propEngine
) {
504 Assert(d_propEngine
== NULL
);
505 d_propEngine
= propEngine
;
508 inline void setDecisionEngine(DecisionEngine
* decisionEngine
) {
509 Assert(d_decisionEngine
== NULL
);
510 d_decisionEngine
= decisionEngine
;
513 /** Called when all initialization of options/logic is done */
517 * Get a pointer to the underlying propositional engine.
519 inline prop::PropEngine
* getPropEngine() const {
524 * Get a pointer to the underlying sat context.
526 inline context::Context
* getSatContext() const {
531 * Get a pointer to the underlying user context.
533 inline context::Context
* getUserContext() const {
534 return d_userContext
;
538 * Get a pointer to the underlying quantifiers engine.
540 theory::QuantifiersEngine
* getQuantifiersEngine() const {
541 return d_quantEngine
;
544 * Get a pointer to the underlying decision manager.
546 theory::DecisionManager
* getDecisionManager() const
548 return d_decManager
.get();
553 * Helper for preprocess
555 Node
ppTheoryRewrite(TNode term
);
558 * Queue of nodes for pre-registration.
560 std::queue
<TNode
> d_preregisterQueue
;
563 * Boolean flag denoting we are in pre-registration.
565 bool d_inPreregister
;
568 * Did the theories get any new facts since the last time we called
571 context::CDO
<bool> d_factsAsserted
;
574 * Map from equality atoms to theories that would like to be notified about them.
579 * Assert the formula to the given theory.
580 * @param assertion the assertion to send (not necesserily normalized)
581 * @param original the assertion as it was sent in from the propagating theory
582 * @param toTheoryId the theory to assert to
583 * @param fromTheoryId the theory that sent it
585 void assertToTheory(TNode assertion
, TNode originalAssertion
, theory::TheoryId toTheoryId
, theory::TheoryId fromTheoryId
);
588 * Marks a theory propagation from a theory to a theory where a
589 * theory could be the THEORY_SAT_SOLVER for literals coming from
590 * or being propagated to the SAT solver. If the receiving theory
591 * already recieved the literal, the method returns false, otherwise
594 * @param assertion the normalized assertion being sent
595 * @param originalAssertion the actual assertion that was sent
596 * @param toTheoryId the theory that is on the receiving end
597 * @param fromTheoryId the theory that sent the assertino
598 * @return true if a new assertion, false if theory already got it
600 bool markPropagation(TNode assertion
, TNode originalAssertions
, theory::TheoryId toTheoryId
, theory::TheoryId fromTheoryId
);
603 * Computes the explanation by travarsing the propagation graph and
604 * asking relevant theories to explain the propagations. Initially
605 * the explanation vector should contain only the element (node, theory)
606 * where the node is the one to be explained, and the theory is the
607 * theory that sent the literal. The lemmaProofRecipe will contain a list
608 * of the explanation steps required to produce the original node.
610 void getExplanation(std::vector
<NodeTheoryPair
>& explanationVector
, LemmaProofRecipe
* lemmaProofRecipe
);
615 * Signal the start of a new round of assertion preprocessing
617 void preprocessStart();
620 * Runs theory specific preprocessing on the non-Boolean parts of
621 * the formula. This is only called on input assertions, after ITEs
624 Node
preprocess(TNode node
);
626 /** Notify (preprocessed) assertions. */
627 void notifyPreprocessedAssertions(const std::vector
<Node
>& assertions
);
629 /** Return whether or not we are incomplete (in the current context). */
630 inline bool isIncomplete() const { return d_incomplete
; }
633 * Returns true if we need another round of checking. If this
634 * returns true, check(FULL_EFFORT) _must_ be called by the
635 * propositional layer before reporting SAT.
637 * This is especially necessary for incomplete theories that lazily
638 * output some lemmas on FULL_EFFORT check (e.g. quantifier reasoning
639 * outputing quantifier instantiations). In such a case, a lemma can
640 * be asserted that is simplified away (perhaps it's already true).
641 * However, we must maintain the invariant that, if a theory uses the
642 * OutputChannel, it implicitly requests that another check(FULL_EFFORT)
643 * be performed before exit, even if no new facts are on its fact queue,
644 * as it might decide to further instantiate some lemmas, precluding
647 inline bool needCheck() const {
648 return d_outputChannelUsed
|| d_lemmasAdded
;
652 * This is called at shutdown time by the SmtEngine, just before
653 * destruction. It is important because there are destruction
654 * ordering issues between PropEngine and Theory.
659 * Solve the given literal with a theory that owns it.
661 theory::Theory::PPAssertStatus
solve(TNode literal
,
662 theory::SubstitutionMap
& substitutionOut
);
665 * Preregister a Theory atom with the responsible theory (or
668 void preRegister(TNode preprocessed
);
671 * Assert the formula to the appropriate theory.
672 * @param node the assertion
674 void assertFact(TNode node
);
677 * Check all (currently-active) theories for conflicts.
678 * @param effort the effort level to use
680 void check(theory::Theory::Effort effort
);
683 * Run the combination framework.
685 void combineTheories();
688 * Calls ppStaticLearn() on all theories, accumulating their
689 * combined contributions in the "learned" builder.
691 void ppStaticLearn(TNode in
, NodeBuilder
<>& learned
);
694 * Calls presolve() on all theories and returns true
695 * if one of the theories discovers a conflict.
700 * Calls postsolve() on all theories.
705 * Calls notifyRestart() on all active theories.
707 void notifyRestart();
709 void getPropagatedLiterals(std::vector
<TNode
>& literals
) {
710 for (; d_propagatedLiteralsIndex
< d_propagatedLiterals
.size(); d_propagatedLiteralsIndex
= d_propagatedLiteralsIndex
+ 1) {
711 Debug("getPropagatedLiterals") << "TheoryEngine::getPropagatedLiterals: propagating: " << d_propagatedLiterals
[d_propagatedLiteralsIndex
] << std::endl
;
712 literals
.push_back(d_propagatedLiterals
[d_propagatedLiteralsIndex
]);
717 * Returns the next decision request, or null if none exist. The next
718 * decision request is a literal that this theory engine prefers the SAT
719 * solver to make as its next decision. Decision requests are managed by
720 * the decision manager d_decManager.
722 Node
getNextDecisionRequest();
724 bool properConflict(TNode conflict
) const;
725 bool properPropagation(TNode lit
) const;
726 bool properExplanation(TNode node
, TNode expl
) const;
729 * Returns an explanation of the node propagated to the SAT solver.
731 Node
getExplanation(TNode node
);
734 * Returns an explanation of the node propagated to the SAT solver and the theory
735 * that propagated it.
737 Node
getExplanationAndRecipe(TNode node
, LemmaProofRecipe
* proofRecipe
);
742 bool collectModelInfo(theory::TheoryModel
* m
);
743 /** post process model */
744 void postProcessModel( theory::TheoryModel
* m
);
747 * Get the pointer to the model object used by this theory engine.
749 theory::TheoryModel
* getModel();
751 * Get the current model for the current set of assertions. This method
752 * should only be called immediately after a satisfiable or unknown
753 * response to a check-sat call, and only if produceModels is true.
755 * If the model is not already built, this will cause this theory engine
756 * to build the model.
758 * If the model is not available (for instance, if the last call to check-sat
759 * was interrupted), then this returns the null pointer.
761 theory::TheoryModel
* getBuiltModel();
762 /** set eager model building
764 * If this method is called, then this TheoryEngine will henceforth build
765 * its model immediately after every satisfiability check that results
766 * in a satisfiable or unknown result. The motivation for this mode is to
767 * accomodate API users that get the model object from the TheoryEngine,
768 * where we want to ensure that this model is always valid.
769 * TODO (#2648): revisit this.
771 void setEagerModelBuilding() { d_eager_model_building
= true; }
773 /** get synth solutions
775 * This method returns true if there is a synthesis solution available. This
776 * is the case if the last call to check satisfiability originated in a
777 * check-synth call, and the synthesis solver successfully found a solution
778 * for all active synthesis conjectures.
780 * This method adds entries to sol_map that map functions-to-synthesize with
781 * their solutions, for all active conjectures. This should be called
782 * immediately after the solver answers unsat for sygus input.
784 * For details on what is added to sol_map, see
785 * SynthConjecture::getSynthSolutions.
787 bool getSynthSolutions(std::map
<Node
, std::map
<Node
, Node
> >& sol_map
);
790 * Get the model builder
792 theory::TheoryEngineModelBuilder
* getModelBuilder() { return d_curr_model_builder
; }
795 * Get the theory associated to a given Node.
797 * @returns the theory, or NULL if the TNode is
800 inline theory::Theory
* theoryOf(TNode node
) const {
801 return d_theoryTable
[theory::Theory::theoryOf(node
)];
805 * Get the theory associated to a the given theory id.
807 * @returns the theory
809 inline theory::Theory
* theoryOf(theory::TheoryId theoryId
) const {
810 Assert(theoryId
< theory::THEORY_LAST
);
811 return d_theoryTable
[theoryId
];
814 inline bool isTheoryEnabled(theory::TheoryId theoryId
) const {
815 return d_logicInfo
.isTheoryEnabled(theoryId
);
817 /** get the logic info used by this theory engine */
818 const LogicInfo
& getLogicInfo() const;
820 * Returns the equality status of the two terms, from the theory
821 * that owns the domain type. The types of a and b must be the same.
823 theory::EqualityStatus
getEqualityStatus(TNode a
, TNode b
);
826 * Returns the value that a theory that owns the type of var currently
827 * has (or null if none);
829 Node
getModelValue(TNode var
);
832 * Takes a literal and returns an equivalent literal that is guaranteed to be a SAT literal
834 Node
ensureLiteral(TNode n
);
837 * Print all instantiations made by the quantifiers module.
839 void printInstantiations( std::ostream
& out
);
842 * Print solution for synthesis conjectures found by ce_guided_instantiation module
844 void printSynthSolution( std::ostream
& out
);
847 * Get list of quantified formulas that were instantiated
849 void getInstantiatedQuantifiedFormulas( std::vector
< Node
>& qs
);
852 * Get instantiation methods
853 * first inputs forall x.q[x] and returns ( q[a], ..., q[z] )
854 * second inputs forall x.q[x] and returns ( a, ..., z )
855 * third and fourth return mappings e.g. forall x.q1[x] -> ( q1[a]...q1[z] ) , ... , forall x.qn[x] -> ( qn[a]...qn[z] )
857 void getInstantiations( Node q
, std::vector
< Node
>& insts
);
858 void getInstantiationTermVectors( Node q
, std::vector
< std::vector
< Node
> >& tvecs
);
859 void getInstantiations( std::map
< Node
, std::vector
< Node
> >& insts
);
860 void getInstantiationTermVectors( std::map
< Node
, std::vector
< std::vector
< Node
> > >& insts
);
863 * Get instantiated conjunction, returns q[t1] ^ ... ^ q[tn] where t1...tn are current set of instantiations for q.
864 * Can be used for quantifier elimination when satisfiable and q[t1] ^ ... ^ q[tn] |= q
866 Node
getInstantiatedConjunction( Node q
);
869 * Forwards an entailment check according to the given theoryOfMode.
870 * See theory.h for documentation on entailmentCheck().
872 std::pair
<bool, Node
> entailmentCheck(
873 options::TheoryOfMode mode
,
875 const theory::EntailmentCheckParameters
* params
= NULL
,
876 theory::EntailmentCheckSideEffects
* out
= NULL
);
879 /** Default visitor for pre-registration */
880 PreRegisterVisitor d_preRegistrationVisitor
;
882 /** Visitor for collecting shared terms */
883 SharedTermsVisitor d_sharedTermsVisitor
;
885 /** Dump the assertions to the dump */
886 void dumpAssertions(const char* tag
);
888 /** For preprocessing pass lifting bit-vectors of size 1 to booleans */
890 void staticInitializeBVOptions(const std::vector
<Node
>& assertions
);
892 Node
ppSimpITE(TNode assertion
);
893 /** Returns false if an assertion simplified to false. */
894 bool donePPSimpITE(std::vector
<Node
>& assertions
);
896 SharedTermsDatabase
* getSharedTermsDatabase() { return &d_sharedTerms
; }
898 theory::eq::EqualityEngine
* getMasterEqualityEngine() { return d_masterEqualityEngine
; }
900 RemoveTermFormulas
* getTermFormulaRemover() { return &d_tform_remover
; }
902 SortInference
* getSortInference() { return &d_sortInfer
; }
904 /** Prints the assertions to the debug stream */
905 void printAssertions(const char* tag
);
907 /** Theory alternative is in use. */
908 bool useTheoryAlternative(const std::string
& name
);
910 /** Enables using a theory alternative by name. */
911 void enableTheoryAlternative(const std::string
& name
);
914 std::set
< std::string
> d_theoryAlternatives
;
916 std::map
< std::string
, std::vector
< theory::Theory
* > > d_attr_handle
;
919 /** Set user attribute.
921 * This function is called when an attribute is set by a user. In SMT-LIBv2
922 * this is done via the syntax (! n :attr)
924 void setUserAttribute(const std::string
& attr
,
926 const std::vector
<Node
>& node_values
,
927 const std::string
& str_value
);
929 /** Handle user attribute.
931 * Associates theory t with the attribute attr. Theory t will be
932 * notified whenever an attribute of name attr is set.
934 void handleUserAttribute(const char* attr
, theory::Theory
* t
);
937 * Check that the theory assertions are satisfied in the model.
938 * This function is called from the smt engine's checkModel routine.
940 void checkTheoryAssertionsWithModel(bool hardFailure
);
943 IntStat d_arithSubstitutionsAdded
;
945 };/* class TheoryEngine */
947 }/* CVC4 namespace */
949 #endif /* CVC4__THEORY_ENGINE_H */