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
|
//===-- TimingSolver.cpp --------------------------------------------------===//
//
// The KLEE Symbolic Virtual Machine
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
#include "TimingSolver.h"
#include "klee/Config/Version.h"
#include "klee/ExecutionState.h"
#include "klee/Solver.h"
#include "klee/Statistics.h"
#include "klee/TimerStatIncrementer.h"
#include "CoreStats.h"
using namespace klee;
using namespace llvm;
/***/
bool TimingSolver::evaluate(const ExecutionState& state, ref<Expr> expr,
Solver::Validity &result) {
// Fast path, to avoid timer and OS overhead.
if (ConstantExpr *CE = dyn_cast<ConstantExpr>(expr)) {
result = CE->isTrue() ? Solver::True : Solver::False;
return true;
}
TimerStatIncrementer timer(stats::solverTime);
if (simplifyExprs)
expr = state.constraints.simplifyExpr(expr);
bool success = solver->evaluate(Query(state.constraints, expr), result);
state.queryCost += timer.check() / 1e6;
return success;
}
bool TimingSolver::mustBeTrue(const ExecutionState& state, ref<Expr> expr,
bool &result) {
// Fast path, to avoid timer and OS overhead.
if (ConstantExpr *CE = dyn_cast<ConstantExpr>(expr)) {
result = CE->isTrue() ? true : false;
return true;
}
TimerStatIncrementer timer(stats::solverTime);
if (simplifyExprs)
expr = state.constraints.simplifyExpr(expr);
bool success = solver->mustBeTrue(Query(state.constraints, expr), result);
state.queryCost += timer.check() / 1e6;
return success;
}
bool TimingSolver::mustBeFalse(const ExecutionState& state, ref<Expr> expr,
bool &result) {
return mustBeTrue(state, Expr::createIsZero(expr), result);
}
bool TimingSolver::mayBeTrue(const ExecutionState& state, ref<Expr> expr,
bool &result) {
bool res;
if (!mustBeFalse(state, expr, res))
return false;
result = !res;
return true;
}
bool TimingSolver::mayBeFalse(const ExecutionState& state, ref<Expr> expr,
bool &result) {
bool res;
if (!mustBeTrue(state, expr, res))
return false;
result = !res;
return true;
}
bool TimingSolver::getValue(const ExecutionState& state, ref<Expr> expr,
ref<ConstantExpr> &result) {
// Fast path, to avoid timer and OS overhead.
if (ConstantExpr *CE = dyn_cast<ConstantExpr>(expr)) {
result = CE;
return true;
}
TimerStatIncrementer timer(stats::solverTime);
if (simplifyExprs)
expr = state.constraints.simplifyExpr(expr);
bool success = solver->getValue(Query(state.constraints, expr), result);
state.queryCost += timer.check() / 1e6;
return success;
}
bool
TimingSolver::getInitialValues(const ExecutionState& state,
const std::vector<const Array*>
&objects,
std::vector< std::vector<unsigned char> >
&result) {
if (objects.empty())
return true;
TimerStatIncrementer timer(stats::solverTime);
bool success = solver->getInitialValues(Query(state.constraints,
ConstantExpr::alloc(0, Expr::Bool)),
objects, result);
state.queryCost += timer.check() / 1e6;
return success;
}
std::pair< ref<Expr>, ref<Expr> >
TimingSolver::getRange(const ExecutionState& state, ref<Expr> expr) {
return solver->getRange(Query(state.constraints, expr));
}
|
