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
|
/********************* */
/*! \file quantifiers_state.cpp
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds, Mathias Preiner, Morgan Deters
** This file is part of the CVC4 project.
** Copyright (c) 2009-2021 by the authors listed in the file AUTHORS
** in the top-level source directory and their institutional affiliations.
** All rights reserved. See the file COPYING in the top-level source
** directory for licensing information.\endverbatim
**
** \brief Utility for quantifiers state
**/
#include "theory/quantifiers/quantifiers_state.h"
#include "options/quantifiers_options.h"
#include "theory/uf/equality_engine_iterator.h"
namespace CVC5 {
namespace theory {
namespace quantifiers {
QuantifiersState::QuantifiersState(context::Context* c,
context::UserContext* u,
Valuation val,
const LogicInfo& logicInfo)
: TheoryState(c, u, val), d_ierCounterc(c), d_logicInfo(logicInfo)
{
// allow theory combination to go first, once initially
d_ierCounter = options::instWhenTcFirst() ? 0 : 1;
d_ierCounterc = d_ierCounter;
d_ierCounterLc = 0;
d_ierCounterLastLc = 0;
d_instWhenPhase =
1 + (options::instWhenPhase() < 1 ? 1 : options::instWhenPhase());
}
void QuantifiersState::incrementInstRoundCounters(Theory::Effort e)
{
if (e == Theory::EFFORT_FULL)
{
// increment if a last call happened, we are not strictly enforcing
// interleaving, or already were in phase
if (d_ierCounterLastLc != d_ierCounterLc
|| !options::instWhenStrictInterleave()
|| d_ierCounter % d_instWhenPhase != 0)
{
d_ierCounter = d_ierCounter + 1;
d_ierCounterLastLc = d_ierCounterLc;
d_ierCounterc = d_ierCounterc.get() + 1;
}
}
else if (e == Theory::EFFORT_LAST_CALL)
{
d_ierCounterLc = d_ierCounterLc + 1;
}
}
bool QuantifiersState::getInstWhenNeedsCheck(Theory::Effort e) const
{
Trace("qstate-debug") << "Get inst when needs check, counts=" << d_ierCounter
<< ", " << d_ierCounterLc << std::endl;
// determine if we should perform check, based on instWhenMode
bool performCheck = false;
if (options::instWhenMode() == options::InstWhenMode::FULL)
{
performCheck = (e >= Theory::EFFORT_FULL);
}
else if (options::instWhenMode() == options::InstWhenMode::FULL_DELAY)
{
performCheck = (e >= Theory::EFFORT_FULL) && !d_valuation.needCheck();
}
else if (options::instWhenMode() == options::InstWhenMode::FULL_LAST_CALL)
{
performCheck =
((e == Theory::EFFORT_FULL && d_ierCounter % d_instWhenPhase != 0)
|| e == Theory::EFFORT_LAST_CALL);
}
else if (options::instWhenMode()
== options::InstWhenMode::FULL_DELAY_LAST_CALL)
{
performCheck = ((e == Theory::EFFORT_FULL && !d_valuation.needCheck()
&& d_ierCounter % d_instWhenPhase != 0)
|| e == Theory::EFFORT_LAST_CALL);
}
else if (options::instWhenMode() == options::InstWhenMode::LAST_CALL)
{
performCheck = (e >= Theory::EFFORT_LAST_CALL);
}
else
{
performCheck = true;
}
Trace("qstate-debug") << "...returned " << performCheck << std::endl;
return performCheck;
}
uint64_t QuantifiersState::getInstRoundDepth() const
{
return d_ierCounterc.get();
}
uint64_t QuantifiersState::getInstRounds() const { return d_ierCounter; }
void QuantifiersState::debugPrintEqualityEngine(const char* c) const
{
bool traceEnabled = Trace.isOn(c);
if (!traceEnabled)
{
return;
}
eq::EqualityEngine* ee = getEqualityEngine();
eq::EqClassesIterator eqcs_i = eq::EqClassesIterator(ee);
std::map<TypeNode, uint64_t> tnum;
while (!eqcs_i.isFinished())
{
TNode r = (*eqcs_i);
TypeNode tr = r.getType();
if (tnum.find(tr) == tnum.end())
{
tnum[tr] = 0;
}
tnum[tr]++;
bool firstTime = true;
Trace(c) << " " << r;
Trace(c) << " : { ";
eq::EqClassIterator eqc_i = eq::EqClassIterator(r, ee);
while (!eqc_i.isFinished())
{
TNode n = (*eqc_i);
if (r != n)
{
if (firstTime)
{
Trace(c) << std::endl;
firstTime = false;
}
Trace(c) << " " << n << std::endl;
}
++eqc_i;
}
if (!firstTime)
{
Trace(c) << " ";
}
Trace(c) << "}" << std::endl;
++eqcs_i;
}
Trace(c) << std::endl;
for (const std::pair<const TypeNode, uint64_t>& t : tnum)
{
Trace(c) << "# eqc for " << t.first << " : " << t.second << std::endl;
}
}
const LogicInfo& QuantifiersState::getLogicInfo() const { return d_logicInfo; }
QuantifiersStatistics& QuantifiersState::getStats() { return d_statistics; }
} // namespace quantifiers
} // namespace theory
} // namespace CVC5
|
