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
|
/******************************************************************************
* Top contributors (to current version):
* Andres Noetzli, Mathias Preiner, Mudathir Mohamed
*
* This file is part of the cvc5 project.
*
* Copyright (c) 2009-2022 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.
* ****************************************************************************
*
* A simple test for SolverEngine::resetAssertions()
*
* This program indirectly also tests some corner cases w.r.t.
* context-dependent datastructures: resetAssertions() pops the contexts to
* zero but some context-dependent datastructures are created at leevel 1,
* which the datastructure needs to handle properly problematic.
*/
#include <iostream>
#include <sstream>
#include "api/cpp/cvc5.h"
using namespace cvc5;
int main()
{
Solver slv;
slv.setOption("incremental", "true");
Sort real = slv.getRealSort();
Term x = slv.mkConst(real, "x");
Term four = slv.mkReal(4);
Term xEqFour = slv.mkTerm(Kind::EQUAL, {x, four});
slv.assertFormula(xEqFour);
std::cout << slv.checkSat() << std::endl;
slv.resetAssertions();
Sort elementType = slv.getIntegerSort();
Sort indexType = slv.getIntegerSort();
Sort arrayType = slv.mkArraySort(indexType, elementType);
Term array = slv.mkConst(arrayType, "array");
Term fourInt = slv.mkInteger(4);
Term arrayAtFour = slv.mkTerm(Kind::SELECT, {array, fourInt});
Term ten = slv.mkInteger(10);
Term arrayAtFour_eq_ten = slv.mkTerm(Kind::EQUAL, {arrayAtFour, ten});
slv.assertFormula(arrayAtFour_eq_ten);
std::cout << slv.checkSat() << std::endl;
}
|
