1 /********************* */
2 /*! \file theory_engine.h
4 ** Top contributors (to current version):
5 ** Morgan Deters, Dejan Jovanovic, Andrew Reynolds
6 ** This file is part of the CVC4 project.
7 ** Copyright (c) 2009-2017 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/cvc4_assert.h"
30 #include "context/cdhashset.h"
31 #include "expr/node.h"
32 #include "options/options.h"
33 #include "options/smt_options.h"
34 #include "prop/prop_engine.h"
35 #include "smt/command.h"
36 #include "smt_util/lemma_channels.h"
37 #include "theory/atom_requests.h"
38 #include "theory/bv/bv_to_bool.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/statistics_registry.h"
50 #include "util/unsafe_interrupt_exception.h"
54 class ResourceManager
;
55 class LemmaProofRecipe
;
58 * A pair of a theory and a node. This is used to mark the flow of
59 * propagations between theories.
61 struct NodeTheoryPair
{
63 theory::TheoryId theory
;
65 NodeTheoryPair(TNode node
, theory::TheoryId theory
, size_t timestamp
= 0)
66 : node(node
), theory(theory
), timestamp(timestamp
) {}
67 NodeTheoryPair() : theory(theory::THEORY_LAST
), timestamp() {}
68 // Comparison doesn't take into account the timestamp
69 bool operator == (const NodeTheoryPair
& pair
) const {
70 return node
== pair
.node
&& theory
== pair
.theory
;
72 };/* struct NodeTheoryPair */
74 struct NodeTheoryPairHashFunction
{
75 NodeHashFunction hashFunction
;
76 // Hash doesn't take into account the timestamp
77 size_t operator()(const NodeTheoryPair
& pair
) const {
78 uint64_t hash
= fnv1a::fnv1a_64(NodeHashFunction()(pair
.node
));
79 return static_cast<size_t>(fnv1a::fnv1a_64(pair
.theory
, hash
));
81 };/* struct NodeTheoryPairHashFunction */
84 /* Forward declarations */
87 class TheoryEngineModelBuilder
;
92 }/* CVC4::theory::eq namespace */
94 namespace quantifiers
{
98 class EntailmentCheckParameters
;
99 class EntailmentCheckSideEffects
;
100 }/* CVC4::theory namespace */
102 class DecisionEngine
;
103 class RemoveTermFormulas
;
104 class UnconstrainedSimplifier
;
107 * This is essentially an abstraction for a collection of theories. A
108 * TheoryEngine provides services to a PropEngine, making various
109 * T-solvers look like a single unit to the propositional part of
114 /** Shared terms database can use the internals notify the theories */
115 friend class SharedTermsDatabase
;
116 friend class theory::quantifiers::TermDb
;
118 /** Associated PropEngine engine */
119 prop::PropEngine
* d_propEngine
;
121 /** Access to decision engine */
122 DecisionEngine
* d_decisionEngine
;
125 context::Context
* d_context
;
127 /** Our user context */
128 context::UserContext
* d_userContext
;
131 * A table of from theory IDs to theory pointers. Never use this table
132 * directly, use theoryOf() instead.
134 theory::Theory
* d_theoryTable
[theory::THEORY_LAST
];
137 * A collection of theories that are "active" for the current run.
138 * This set is provided by the user (as a logic string, say, in SMT-LIBv2
139 * format input), or else by default it's all-inclusive. This is important
140 * because we can optimize for single-theory runs (no sharing), can reduce
141 * the cost of walking the DAG on registration, etc.
143 const LogicInfo
& d_logicInfo
;
146 * The database of shared terms.
148 SharedTermsDatabase d_sharedTerms
;
151 * Master equality engine, to share with theories.
153 theory::eq::EqualityEngine
* d_masterEqualityEngine
;
155 /** notify class for master equality engine */
156 class NotifyClass
: public theory::eq::EqualityEngineNotify
{
159 NotifyClass(TheoryEngine
& te
): d_te(te
) {}
160 bool eqNotifyTriggerEquality(TNode equality
, bool value
) override
164 bool eqNotifyTriggerPredicate(TNode predicate
, bool value
) override
168 bool eqNotifyTriggerTermEquality(theory::TheoryId tag
,
175 void eqNotifyConstantTermMerge(TNode t1
, TNode t2
) override
{}
176 void eqNotifyNewClass(TNode t
) override
{ d_te
.eqNotifyNewClass(t
); }
177 void eqNotifyPreMerge(TNode t1
, TNode t2
) override
179 d_te
.eqNotifyPreMerge(t1
, t2
);
181 void eqNotifyPostMerge(TNode t1
, TNode t2
) override
183 d_te
.eqNotifyPostMerge(t1
, t2
);
185 void eqNotifyDisequal(TNode t1
, TNode t2
, TNode reason
) override
187 d_te
.eqNotifyDisequal(t1
, t2
, reason
);
189 };/* class TheoryEngine::NotifyClass */
190 NotifyClass d_masterEENotify
;
193 * notification methods
195 void eqNotifyNewClass(TNode t
);
196 void eqNotifyPreMerge(TNode t1
, TNode t2
);
197 void eqNotifyPostMerge(TNode t1
, TNode t2
);
198 void eqNotifyDisequal(TNode t1
, TNode t2
, TNode reason
);
201 * The quantifiers engine
203 theory::QuantifiersEngine
* d_quantEngine
;
206 * Default model object
208 theory::TheoryModel
* d_curr_model
;
209 bool d_aloc_curr_model
;
211 * Model builder object
213 theory::TheoryEngineModelBuilder
* d_curr_model_builder
;
214 bool d_aloc_curr_model_builder
;
216 typedef std::unordered_map
<Node
, Node
, NodeHashFunction
> NodeMap
;
217 typedef std::unordered_map
<TNode
, Node
, TNodeHashFunction
> TNodeMap
;
220 * Cache for theory-preprocessing of assertions
225 * Used for "missed-t-propagations" dumping mode only. A set of all
226 * theory-propagable literals.
228 context::CDList
<TNode
> d_possiblePropagations
;
231 * Used for "missed-t-propagations" dumping mode only. A
232 * context-dependent set of those theory-propagable literals that
233 * have been propagated.
235 context::CDHashSet
<Node
, NodeHashFunction
> d_hasPropagated
;
239 * Statistics for a particular theory.
243 static std::string
mkName(std::string prefix
,
244 theory::TheoryId theory
,
245 std::string suffix
) {
246 std::stringstream ss
;
247 ss
<< prefix
<< theory
<< suffix
;
253 IntStat conflicts
, propagations
, lemmas
, requirePhase
, flipDecision
, restartDemands
;
255 Statistics(theory::TheoryId theory
);
257 };/* class TheoryEngine::Statistics */
260 * An output channel for Theory that passes messages
261 * back to a TheoryEngine.
263 class EngineOutputChannel
: public theory::OutputChannel
{
264 friend class TheoryEngine
;
267 * The theory engine we're communicating with.
269 TheoryEngine
* d_engine
;
272 * The statistics of the theory interractions.
274 Statistics d_statistics
;
276 /** The theory owning this channel. */
277 theory::TheoryId d_theory
;
280 EngineOutputChannel(TheoryEngine
* engine
, theory::TheoryId theory
)
281 : d_engine(engine
), d_statistics(theory
), d_theory(theory
) {}
283 void safePoint(uint64_t amount
) override
{
284 spendResource(amount
);
285 if (d_engine
->d_interrupted
) {
286 throw theory::Interrupted();
290 void conflict(TNode conflictNode
,
291 std::unique_ptr
<Proof
> pf
= nullptr) override
;
292 bool propagate(TNode literal
) override
;
294 theory::LemmaStatus
lemma(TNode lemma
, ProofRule rule
,
295 bool removable
= false, bool preprocess
= false,
296 bool sendAtoms
= false) override
;
298 theory::LemmaStatus
splitLemma(TNode lemma
,
299 bool removable
= false) override
;
301 void demandRestart() override
{
302 NodeManager
* curr
= NodeManager::currentNM();
303 Node restartVar
= curr
->mkSkolem(
304 "restartVar", curr
->booleanType(),
305 "A boolean variable asserted to be true to force a restart");
306 Trace("theory::restart")
307 << "EngineOutputChannel<" << d_theory
<< ">::restart(" << restartVar
309 ++d_statistics
.restartDemands
;
310 lemma(restartVar
, RULE_INVALID
, true);
313 void requirePhase(TNode n
, bool phase
) override
{
314 Debug("theory") << "EngineOutputChannel::requirePhase(" << n
<< ", "
315 << phase
<< ")" << std::endl
;
316 ++d_statistics
.requirePhase
;
317 d_engine
->d_propEngine
->requirePhase(n
, phase
);
320 bool flipDecision() override
{
321 Debug("theory") << "EngineOutputChannel::flipDecision()" << std::endl
;
322 ++d_statistics
.flipDecision
;
323 return d_engine
->d_propEngine
->flipDecision();
326 void setIncomplete() override
{
327 Trace("theory") << "TheoryEngine::setIncomplete()" << std::endl
;
328 d_engine
->setIncomplete(d_theory
);
331 void spendResource(unsigned amount
) override
{
332 d_engine
->spendResource(amount
);
335 void handleUserAttribute(const char* attr
, theory::Theory
* t
) override
{
336 d_engine
->handleUserAttribute(attr
, t
);
341 * A helper function for registering lemma recipes with the proof engine
343 void registerLemmaRecipe(Node lemma
, Node originalLemma
, bool preprocess
,
344 theory::TheoryId theoryId
);
345 }; /* class TheoryEngine::EngineOutputChannel */
348 * Output channels for individual theories.
350 EngineOutputChannel
* d_theoryOut
[theory::THEORY_LAST
];
353 * Are we in conflict.
355 context::CDO
<bool> d_inConflict
;
358 * Called by the theories to notify of a conflict.
360 void conflict(TNode conflict
, theory::TheoryId theoryId
);
363 * Debugging flag to ensure that shutdown() is called before the
369 * True if a theory has notified us of incompleteness (at this
370 * context level or below).
372 context::CDO
<bool> d_incomplete
;
375 * Called by the theories to notify that the current branch is incomplete.
377 void setIncomplete(theory::TheoryId theory
) {
383 * Mapping of propagations from recievers to senders.
385 typedef context::CDHashMap
<NodeTheoryPair
, NodeTheoryPair
, NodeTheoryPairHashFunction
> PropagationMap
;
386 PropagationMap d_propagationMap
;
389 * Timestamp of propagations
391 context::CDO
<size_t> d_propagationMapTimestamp
;
394 * Literals that are propagated by the theory. Note that these are TNodes.
395 * The theory can only propagate nodes that have an assigned literal in the
396 * SAT solver and are hence referenced in the SAT solver.
398 context::CDList
<TNode
> d_propagatedLiterals
;
401 * The index of the next literal to be propagated by a theory.
403 context::CDO
<unsigned> d_propagatedLiteralsIndex
;
406 * Called by the output channel to propagate literals and facts
407 * @return false if immediate conflict
409 bool propagate(TNode literal
, theory::TheoryId theory
);
412 * Internal method to call the propagation routines and collect the
413 * propagated literals.
415 void propagate(theory::Theory::Effort effort
);
418 * Called by the output channel to request decisions "as soon as
421 void propagateAsDecision(TNode literal
, theory::TheoryId theory
);
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
;
472 /** Container for lemma input and output channels. */
473 LemmaChannels
* d_channels
;
477 /** Constructs a theory engine */
478 TheoryEngine(context::Context
* context
, context::UserContext
* userContext
,
479 RemoveTermFormulas
& iteRemover
, const LogicInfo
& logic
,
480 LemmaChannels
* channels
);
482 /** Destroys a theory engine */
487 /** "Spend" a resource during a search or preprocessing.*/
488 void spendResource(unsigned amount
);
491 * Adds a theory. Only one theory per TheoryId can be present, so if
492 * there is another theory it will be deleted.
494 template <class TheoryClass
>
495 inline void addTheory(theory::TheoryId theoryId
) {
496 Assert(d_theoryTable
[theoryId
] == NULL
&& d_theoryOut
[theoryId
] == NULL
);
497 d_theoryOut
[theoryId
] = new EngineOutputChannel(this, theoryId
);
498 d_theoryTable
[theoryId
] =
499 new TheoryClass(d_context
, d_userContext
, *d_theoryOut
[theoryId
],
500 theory::Valuation(this), d_logicInfo
);
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
;
547 * Helper for preprocess
549 Node
ppTheoryRewrite(TNode term
);
552 * Queue of nodes for pre-registration.
554 std::queue
<TNode
> d_preregisterQueue
;
557 * Boolean flag denoting we are in pre-registration.
559 bool d_inPreregister
;
562 * Did the theories get any new facts since the last time we called
565 context::CDO
<bool> d_factsAsserted
;
568 * Map from equality atoms to theories that would like to be notified about them.
573 * Assert the formula to the given theory.
574 * @param assertion the assertion to send (not necesserily normalized)
575 * @param original the assertion as it was sent in from the propagating theory
576 * @param toTheoryId the theory to assert to
577 * @param fromTheoryId the theory that sent it
579 void assertToTheory(TNode assertion
, TNode originalAssertion
, theory::TheoryId toTheoryId
, theory::TheoryId fromTheoryId
);
582 * Marks a theory propagation from a theory to a theory where a
583 * theory could be the THEORY_SAT_SOLVER for literals coming from
584 * or being propagated to the SAT solver. If the receiving theory
585 * already recieved the literal, the method returns false, otherwise
588 * @param assertion the normalized assertion being sent
589 * @param originalAssertion the actual assertion that was sent
590 * @param toTheoryId the theory that is on the receiving end
591 * @param fromTheoryId the theory that sent the assertino
592 * @return true if a new assertion, false if theory already got it
594 bool markPropagation(TNode assertion
, TNode originalAssertions
, theory::TheoryId toTheoryId
, theory::TheoryId fromTheoryId
);
597 * Computes the explanation by travarsing the propagation graph and
598 * asking relevant theories to explain the propagations. Initially
599 * the explanation vector should contain only the element (node, theory)
600 * where the node is the one to be explained, and the theory is the
601 * theory that sent the literal. The lemmaProofRecipe will contain a list
602 * of the explanation steps required to produce the original node.
604 void getExplanation(std::vector
<NodeTheoryPair
>& explanationVector
, LemmaProofRecipe
* lemmaProofRecipe
);
609 * Signal the start of a new round of assertion preprocessing
611 void preprocessStart();
614 * Runs theory specific preprocessing on the non-Boolean parts of
615 * the formula. This is only called on input assertions, after ITEs
618 Node
preprocess(TNode node
);
620 /** Notify (preprocessed) assertions. */
621 void notifyPreprocessedAssertions(const std::vector
<Node
>& assertions
);
623 /** Return whether or not we are incomplete (in the current context). */
624 inline bool isIncomplete() const { return d_incomplete
; }
627 * Returns true if we need another round of checking. If this
628 * returns true, check(FULL_EFFORT) _must_ be called by the
629 * propositional layer before reporting SAT.
631 * This is especially necessary for incomplete theories that lazily
632 * output some lemmas on FULL_EFFORT check (e.g. quantifier reasoning
633 * outputing quantifier instantiations). In such a case, a lemma can
634 * be asserted that is simplified away (perhaps it's already true).
635 * However, we must maintain the invariant that, if a theory uses the
636 * OutputChannel, it implicitly requests that another check(FULL_EFFORT)
637 * be performed before exit, even if no new facts are on its fact queue,
638 * as it might decide to further instantiate some lemmas, precluding
641 inline bool needCheck() const {
642 return d_outputChannelUsed
|| d_lemmasAdded
;
646 * This is called at shutdown time by the SmtEngine, just before
647 * destruction. It is important because there are destruction
648 * ordering issues between PropEngine and Theory.
653 * Solve the given literal with a theory that owns it.
655 theory::Theory::PPAssertStatus
solve(TNode literal
,
656 theory::SubstitutionMap
& substitutionOut
);
659 * Preregister a Theory atom with the responsible theory (or
662 void preRegister(TNode preprocessed
);
665 * Assert the formula to the appropriate theory.
666 * @param node the assertion
668 void assertFact(TNode node
);
671 * Check all (currently-active) theories for conflicts.
672 * @param effort the effort level to use
674 void check(theory::Theory::Effort effort
);
677 * Run the combination framework.
679 void combineTheories();
682 * Calls ppStaticLearn() on all theories, accumulating their
683 * combined contributions in the "learned" builder.
685 void ppStaticLearn(TNode in
, NodeBuilder
<>& learned
);
688 * Calls presolve() on all theories and returns true
689 * if one of the theories discovers a conflict.
694 * Calls postsolve() on all theories.
699 * Calls notifyRestart() on all active theories.
701 void notifyRestart();
703 void getPropagatedLiterals(std::vector
<TNode
>& literals
) {
704 for (; d_propagatedLiteralsIndex
< d_propagatedLiterals
.size(); d_propagatedLiteralsIndex
= d_propagatedLiteralsIndex
+ 1) {
705 Debug("getPropagatedLiterals") << "TheoryEngine::getPropagatedLiterals: propagating: " << d_propagatedLiterals
[d_propagatedLiteralsIndex
] << std::endl
;
706 literals
.push_back(d_propagatedLiterals
[d_propagatedLiteralsIndex
]);
710 Node
getNextDecisionRequest();
712 bool properConflict(TNode conflict
) const;
713 bool properPropagation(TNode lit
) const;
714 bool properExplanation(TNode node
, TNode expl
) const;
717 * Returns an explanation of the node propagated to the SAT solver.
719 Node
getExplanation(TNode node
);
722 * Returns an explanation of the node propagated to the SAT solver and the theory
723 * that propagated it.
725 Node
getExplanationAndRecipe(TNode node
, LemmaProofRecipe
* proofRecipe
);
730 bool collectModelInfo(theory::TheoryModel
* m
);
731 /** post process model */
732 void postProcessModel( theory::TheoryModel
* m
);
735 * Get the current model
737 theory::TheoryModel
* getModel();
739 /** get synth solutions
741 * This function adds entries to sol_map that map functions-to-synthesize with
742 * their solutions, for all active conjectures. This should be called
743 * immediately after the solver answers unsat for sygus input.
745 * For details on what is added to sol_map, see
746 * CegConjecture::getSynthSolutions.
748 void getSynthSolutions(std::map
<Node
, Node
>& sol_map
);
751 * Get the model builder
753 theory::TheoryEngineModelBuilder
* getModelBuilder() { return d_curr_model_builder
; }
756 * Get the theory associated to a given Node.
758 * @returns the theory, or NULL if the TNode is
761 inline theory::Theory
* theoryOf(TNode node
) const {
762 return d_theoryTable
[theory::Theory::theoryOf(node
)];
766 * Get the theory associated to a the given theory id.
768 * @returns the theory
770 inline theory::Theory
* theoryOf(theory::TheoryId theoryId
) const {
771 return d_theoryTable
[theoryId
];
774 inline bool isTheoryEnabled(theory::TheoryId theoryId
) const {
775 return d_logicInfo
.isTheoryEnabled(theoryId
);
779 * Returns the equality status of the two terms, from the theory
780 * that owns the domain type. The types of a and b must be the same.
782 theory::EqualityStatus
getEqualityStatus(TNode a
, TNode b
);
785 * Returns the value that a theory that owns the type of var currently
786 * has (or null if none);
788 Node
getModelValue(TNode var
);
791 * Takes a literal and returns an equivalent literal that is guaranteed to be a SAT literal
793 Node
ensureLiteral(TNode n
);
796 * Print all instantiations made by the quantifiers module.
798 void printInstantiations( std::ostream
& out
);
801 * Print solution for synthesis conjectures found by ce_guided_instantiation module
803 void printSynthSolution( std::ostream
& out
);
806 * Get list of quantified formulas that were instantiated
808 void getInstantiatedQuantifiedFormulas( std::vector
< Node
>& qs
);
811 * Get instantiation methods
812 * first inputs forall x.q[x] and returns ( q[a], ..., q[z] )
813 * second inputs forall x.q[x] and returns ( a, ..., z )
814 * third and fourth return mappings e.g. forall x.q1[x] -> ( q1[a]...q1[z] ) , ... , forall x.qn[x] -> ( qn[a]...qn[z] )
816 void getInstantiations( Node q
, std::vector
< Node
>& insts
);
817 void getInstantiationTermVectors( Node q
, std::vector
< std::vector
< Node
> >& tvecs
);
818 void getInstantiations( std::map
< Node
, std::vector
< Node
> >& insts
);
819 void getInstantiationTermVectors( std::map
< Node
, std::vector
< std::vector
< Node
> > >& insts
);
822 * Get instantiated conjunction, returns q[t1] ^ ... ^ q[tn] where t1...tn are current set of instantiations for q.
823 * Can be used for quantifier elimination when satisfiable and q[t1] ^ ... ^ q[tn] |= q
825 Node
getInstantiatedConjunction( Node q
);
828 * Forwards an entailment check according to the given theoryOfMode.
829 * See theory.h for documentation on entailmentCheck().
831 std::pair
<bool, Node
> entailmentCheck(theory::TheoryOfMode mode
, TNode lit
, const theory::EntailmentCheckParameters
* params
= NULL
, theory::EntailmentCheckSideEffects
* out
= NULL
);
835 /** Default visitor for pre-registration */
836 PreRegisterVisitor d_preRegistrationVisitor
;
838 /** Visitor for collecting shared terms */
839 SharedTermsVisitor d_sharedTermsVisitor
;
841 /** Dump the assertions to the dump */
842 void dumpAssertions(const char* tag
);
845 * A collection of ite preprocessing passes.
847 theory::ITEUtilities
* d_iteUtilities
;
850 /** For preprocessing pass simplifying unconstrained expressions */
851 UnconstrainedSimplifier
* d_unconstrainedSimp
;
853 /** For preprocessing pass lifting bit-vectors of size 1 to booleans */
854 theory::bv::BvToBoolPreprocessor d_bvToBoolPreprocessor
;
856 void staticInitializeBVOptions(const std::vector
<Node
>& assertions
);
857 void ppBvToBool(const std::vector
<Node
>& assertions
, std::vector
<Node
>& new_assertions
);
858 void ppBoolToBv(const std::vector
<Node
>& assertions
, std::vector
<Node
>& new_assertions
);
859 bool ppBvAbstraction(const std::vector
<Node
>& assertions
, std::vector
<Node
>& new_assertions
);
860 void mkAckermanizationAssertions(std::vector
<Node
>& assertions
);
862 Node
ppSimpITE(TNode assertion
);
863 /** Returns false if an assertion simplified to false. */
864 bool donePPSimpITE(std::vector
<Node
>& assertions
);
866 void ppUnconstrainedSimp(std::vector
<Node
>& assertions
);
868 SharedTermsDatabase
* getSharedTermsDatabase() { return &d_sharedTerms
; }
870 theory::eq::EqualityEngine
* getMasterEqualityEngine() { return d_masterEqualityEngine
; }
872 RemoveTermFormulas
* getTermFormulaRemover() { return &d_tform_remover
; }
874 SortInference
* getSortInference() { return &d_sortInfer
; }
876 /** Prints the assertions to the debug stream */
877 void printAssertions(const char* tag
);
879 /** Theory alternative is in use. */
880 bool useTheoryAlternative(const std::string
& name
);
882 /** Enables using a theory alternative by name. */
883 void enableTheoryAlternative(const std::string
& name
);
886 std::set
< std::string
> d_theoryAlternatives
;
888 std::map
< std::string
, std::vector
< theory::Theory
* > > d_attr_handle
;
891 /** Set user attribute.
893 * This function is called when an attribute is set by a user. In SMT-LIBv2
894 * this is done via the syntax (! n :attr)
896 void setUserAttribute(const std::string
& attr
,
898 const std::vector
<Node
>& node_values
,
899 const std::string
& str_value
);
901 /** Handle user attribute.
903 * Associates theory t with the attribute attr. Theory t will be
904 * notified whenever an attribute of name attr is set.
906 void handleUserAttribute(const char* attr
, theory::Theory
* t
);
909 * Check that the theory assertions are satisfied in the model.
910 * This function is called from the smt engine's checkModel routine.
912 void checkTheoryAssertionsWithModel(bool hardFailure
);
915 IntStat d_arithSubstitutionsAdded
;
917 };/* class TheoryEngine */
919 }/* CVC4 namespace */
921 #endif /* __CVC4__THEORY_ENGINE_H */