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
|
//===-- TimingSolver.h ------------------------------------------*- C++ -*-===//
//
// The KLEE Symbolic Virtual Machine
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
#ifndef KLEE_TIMINGSOLVER_H
#define KLEE_TIMINGSOLVER_H
#include "klee/Expr.h"
#include "klee/Solver.h"
#include <vector>
namespace klee {
class ExecutionState;
class Solver;
class STPSolver;
/// TimingSolver - A simple class which wraps a solver and handles
/// tracking the statistics that we care about.
class TimingSolver {
public:
Solver *solver;
STPSolver *stpSolver;
bool simplifyExprs;
public:
/// TimingSolver - Construct a new timing solver.
///
/// \param _simplifyExprs - Whether expressions should be
/// simplified (via the constraint manager interface) prior to
/// querying.
TimingSolver(Solver *_solver, STPSolver *_stpSolver,
bool _simplifyExprs = true)
: solver(_solver), stpSolver(_stpSolver), simplifyExprs(_simplifyExprs) {}
~TimingSolver() {
delete solver;
}
void setTimeout(double t) {
stpSolver->setTimeout(t);
}
bool evaluate(const ExecutionState&, ref<Expr>, Solver::Validity &result);
bool mustBeTrue(const ExecutionState&, ref<Expr>, bool &result);
bool mustBeFalse(const ExecutionState&, ref<Expr>, bool &result);
bool mayBeTrue(const ExecutionState&, ref<Expr>, bool &result);
bool mayBeFalse(const ExecutionState&, ref<Expr>, bool &result);
bool getValue(const ExecutionState &, ref<Expr> expr,
ref<ConstantExpr> &result);
bool getInitialValues(const ExecutionState&,
const std::vector<const Array*> &objects,
std::vector< std::vector<unsigned char> > &result);
std::pair< ref<Expr>, ref<Expr> >
getRange(const ExecutionState&, ref<Expr> query);
};
}
#endif
|
