1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
|
/********************* */
/*! \file theory.cpp
** \verbatim
** Original author: mdeters
** Major contributors: taking
** Minor contributors (to current version): none
** This file is part of the CVC4 prototype.
** Copyright (c) 2009, 2010, 2011 The Analysis of Computer Systems Group (ACSys)
** Courant Institute of Mathematical Sciences
** New York University
** See the file COPYING in the top-level source directory for licensing
** information.\endverbatim
**
** \brief Base for theory interface.
**
** Base for theory interface.
**/
#include "theory/theory.h"
#include "util/Assert.h"
#include "theory/quantifiers_engine.h"
#include "theory/instantiator_default.h"
#include <vector>
using namespace std;
namespace CVC4 {
namespace theory {
/** Default value for the uninterpreted sorts is the UF theory */
TheoryId Theory::s_uninterpretedSortOwner = THEORY_UF;
std::ostream& operator<<(std::ostream& os, Theory::Effort level){
switch(level){
case Theory::EFFORT_STANDARD:
os << "EFFORT_STANDARD"; break;
case Theory::EFFORT_FULL:
os << "EFFORT_FULL"; break;
case Theory::EFFORT_COMBINATION:
os << "EFFORT_COMBINATION"; break;
case Theory::EFFORT_LAST_CALL:
os << "EFFORT_LAST_CALL"; break;
default:
Unreachable();
}
return os;
}/* ostream& operator<<(ostream&, Theory::Effort) */
Theory::~Theory() {
if(d_inst != NULL) {
delete d_inst;
d_inst = NULL;
}
StatisticsRegistry::unregisterStat(&d_computeCareGraphTime);
}
void Theory::addSharedTermInternal(TNode n) {
Debug("sharing") << "Theory::addSharedTerm<" << getId() << ">(" << n << ")" << endl;
Debug("theory::assertions") << "Theory::addSharedTerm<" << getId() << ">(" << n << ")" << endl;
d_sharedTerms.push_back(n);
addSharedTerm(n);
}
void Theory::computeCareGraph() {
Debug("sharing") << "Theory::computeCareGraph<" << getId() << ">()" << endl;
for (unsigned i = 0; i < d_sharedTerms.size(); ++ i) {
TNode a = d_sharedTerms[i];
TypeNode aType = a.getType();
for (unsigned j = i + 1; j < d_sharedTerms.size(); ++ j) {
TNode b = d_sharedTerms[j];
if (b.getType() != aType) {
// We don't care about the terms of different types
continue;
}
switch (d_valuation.getEqualityStatus(a, b)) {
case EQUALITY_TRUE_AND_PROPAGATED:
case EQUALITY_FALSE_AND_PROPAGATED:
// If we know about it, we should have propagated it, so we can skip
break;
default:
// Let's split on it
addCarePair(a, b);
break;
}
}
}
}
void Theory::printFacts(std::ostream& os) const {
unsigned i, n = d_facts.size();
for(i = 0; i < n; i++){
const Assertion& a_i = d_facts[i];
Node assertion = a_i;
os << d_id << '[' << i << ']' << " " << assertion << endl;
}
}
void Theory::debugPrintFacts() const{
DebugChannel.getStream() << "Theory::debugPrintFacts()" << endl;
printFacts(DebugChannel.getStream());
}
Instantiator::Instantiator(context::Context* c, QuantifiersEngine* qe, Theory* th) :
d_quantEngine(qe),
d_th(th) {
}
Instantiator::~Instantiator() {
}
void Instantiator::resetInstantiationRound(Theory::Effort effort) {
for(int i = 0; i < (int) d_instStrategies.size(); ++i) {
if(isActiveStrategy(d_instStrategies[i])) {
d_instStrategies[i]->resetInstantiationRound(effort);
}
}
processResetInstantiationRound(effort);
}
int Instantiator::doInstantiation(Node f, Theory::Effort effort, int e, int limitInst) {
if(hasConstraintsFrom(f)) {
int origLemmas = d_quantEngine->getNumLemmasWaiting();
int status = process(f, effort, e, limitInst);
if(limitInst <= 0 || (d_quantEngine->getNumLemmasWaiting()-origLemmas) < limitInst) {
if(d_instStrategies.empty()) {
Debug("inst-engine-inst") << "There are no instantiation strategies allocated." << endl;
} else {
for(int i = 0; i < (int) d_instStrategies.size(); ++i) {
if(isActiveStrategy(d_instStrategies[i])) {
Debug("inst-engine-inst") << d_instStrategies[i]->identify() << " process " << effort << endl;
//call the instantiation strategy's process method
int s_limitInst = limitInst > 0 ? limitInst - (d_quantEngine->getNumLemmasWaiting() - origLemmas) : 0;
int s_status = d_instStrategies[i]->doInstantiation(f, effort, e, s_limitInst);
Debug("inst-engine-inst") << " -> status is " << s_status << endl;
if(limitInst > 0 && (d_quantEngine->getNumLemmasWaiting() - origLemmas) >= limitInst) {
Assert( (d_quantEngine->getNumLemmasWaiting() - origLemmas) == limitInst );
i = (int) d_instStrategies.size();
status = InstStrategy::STATUS_UNKNOWN;
} else {
InstStrategy::updateStatus(status, s_status);
}
} else {
Debug("inst-engine-inst") << d_instStrategies[i]->identify() << " is not active." << endl;
}
}
}
}
return status;
} else {
Debug("inst-engine-inst") << "We have no constraints from this quantifier." << endl;
return InstStrategy::STATUS_SAT;
}
}
//void Instantiator::doInstantiation(int effort) {
// d_status = InstStrategy::STATUS_SAT;
// for( int q = 0; q < d_quantEngine->getNumQuantifiers(); ++q ) {
// Node f = d_quantEngine->getQuantifier(q);
// if( d_quantEngine->getActive(f) && hasConstraintsFrom(f) ) {
// int d_quantStatus = process( f, effort );
// InstStrategy::updateStatus( d_status, d_quantStatus );
// for( int i = 0; i < (int)d_instStrategies.size(); ++i ) {
// if( isActiveStrategy( d_instStrategies[i] ) ) {
// Debug("inst-engine-inst") << d_instStrategies[i]->identify() << " process " << effort << endl;
// //call the instantiation strategy's process method
// d_quantStatus = d_instStrategies[i]->process( f, effort );
// Debug("inst-engine-inst") << " -> status is " << d_quantStatus << endl;
// InstStrategy::updateStatus( d_status, d_quantStatus );
// }
// }
// }
// }
//}
void Instantiator::setHasConstraintsFrom(Node f) {
d_hasConstraints[f] = true;
if(! d_quantEngine->hasOwner(f)) {
d_quantEngine->setOwner(f, getTheory());
} else if(d_quantEngine->getOwner(f) != getTheory()) {
d_quantEngine->setOwner(f, NULL);
}
}
bool Instantiator::hasConstraintsFrom(Node f) {
return d_hasConstraints.find(f) != d_hasConstraints.end() && d_hasConstraints[f];
}
bool Instantiator::isOwnerOf(Node f) {
return d_quantEngine->hasOwner(f) && d_quantEngine->getOwner(f) == getTheory();
}
}/* CVC4::theory namespace */
}/* CVC4 namespace */
|
