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
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
|
/********************* */
/*! \file sort_black.h
** \verbatim
** Top contributors (to current version):
** Aina Niemetz, Andrew Reynolds
** This file is part of the CVC4 project.
** Copyright (c) 2009-2020 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 Black box testing of the guards of the C++ API functions.
**
** Black box testing of the guards of the C++ API functions.
**/
#include <cxxtest/TestSuite.h>
#include "api/cvc4cpp.h"
using namespace CVC4::api;
class SortBlack : public CxxTest::TestSuite
{
public:
void setUp() override;
void tearDown() override;
void testGetDatatype();
void testDatatypeSorts();
void testInstantiate();
void testGetFunctionArity();
void testGetFunctionDomainSorts();
void testGetFunctionCodomainSort();
void testGetArrayIndexSort();
void testGetArrayElementSort();
void testGetSetElementSort();
void testGetUninterpretedSortName();
void testIsUninterpretedSortParameterized();
void testGetUninterpretedSortParamSorts();
void testGetUninterpretedSortConstructorName();
void testGetUninterpretedSortConstructorArity();
void testGetBVSize();
void testGetFPExponentSize();
void testGetFPSignificandSize();
void testGetDatatypeParamSorts();
void testGetDatatypeArity();
void testGetTupleLength();
void testGetTupleSorts();
void testSortCompare();
void testSortSubtyping();
private:
Solver d_solver;
};
void SortBlack::setUp() {}
void SortBlack::tearDown() {}
void SortBlack::testGetDatatype()
{
// create datatype sort, check should not fail
DatatypeDecl dtypeSpec = d_solver.mkDatatypeDecl("list");
DatatypeConstructorDecl cons = d_solver.mkDatatypeConstructorDecl("cons");
cons.addSelector("head", d_solver.getIntegerSort());
dtypeSpec.addConstructor(cons);
DatatypeConstructorDecl nil = d_solver.mkDatatypeConstructorDecl("nil");
dtypeSpec.addConstructor(nil);
Sort dtypeSort = d_solver.mkDatatypeSort(dtypeSpec);
TS_ASSERT_THROWS_NOTHING(dtypeSort.getDatatype());
// create bv sort, check should fail
Sort bvSort = d_solver.mkBitVectorSort(32);
TS_ASSERT_THROWS(bvSort.getDatatype(), CVC4ApiException&);
}
void SortBlack::testDatatypeSorts()
{
Sort intSort = d_solver.getIntegerSort();
// create datatype sort to test
DatatypeDecl dtypeSpec = d_solver.mkDatatypeDecl("list");
DatatypeConstructorDecl cons = d_solver.mkDatatypeConstructorDecl("cons");
cons.addSelector("head", intSort);
cons.addSelectorSelf("tail");
dtypeSpec.addConstructor(cons);
DatatypeConstructorDecl nil = d_solver.mkDatatypeConstructorDecl("nil");
dtypeSpec.addConstructor(nil);
Sort dtypeSort = d_solver.mkDatatypeSort(dtypeSpec);
Datatype dt = dtypeSort.getDatatype();
TS_ASSERT(!dtypeSort.isConstructor());
TS_ASSERT_THROWS(dtypeSort.getConstructorCodomainSort(), CVC4ApiException&);
TS_ASSERT_THROWS(dtypeSort.getConstructorDomainSorts(), CVC4ApiException&);
TS_ASSERT_THROWS(dtypeSort.getConstructorArity(), CVC4ApiException&);
// get constructor
DatatypeConstructor dcons = dt[0];
Term consTerm = dcons.getConstructorTerm();
Sort consSort = consTerm.getSort();
TS_ASSERT(consSort.isConstructor());
TS_ASSERT(!consSort.isTester());
TS_ASSERT(!consSort.isSelector());
TS_ASSERT(consSort.getConstructorArity() == 2);
std::vector<Sort> consDomSorts = consSort.getConstructorDomainSorts();
TS_ASSERT(consDomSorts[0] == intSort);
TS_ASSERT(consDomSorts[1] == dtypeSort);
TS_ASSERT(consSort.getConstructorCodomainSort() == dtypeSort);
// get tester
Term isConsTerm = dcons.getTesterTerm();
TS_ASSERT(isConsTerm.getSort().isTester());
// get selector
DatatypeSelector dselTail = dcons[1];
Term tailTerm = dselTail.getSelectorTerm();
TS_ASSERT(tailTerm.getSort().isSelector());
}
void SortBlack::testInstantiate()
{
// instantiate parametric datatype, check should not fail
Sort sort = d_solver.mkParamSort("T");
DatatypeDecl paramDtypeSpec = d_solver.mkDatatypeDecl("paramlist", sort);
DatatypeConstructorDecl paramCons =
d_solver.mkDatatypeConstructorDecl("cons");
DatatypeConstructorDecl paramNil = d_solver.mkDatatypeConstructorDecl("nil");
paramCons.addSelector("head", sort);
paramDtypeSpec.addConstructor(paramCons);
paramDtypeSpec.addConstructor(paramNil);
Sort paramDtypeSort = d_solver.mkDatatypeSort(paramDtypeSpec);
TS_ASSERT_THROWS_NOTHING(
paramDtypeSort.instantiate(std::vector<Sort>{d_solver.getIntegerSort()}));
// instantiate non-parametric datatype sort, check should fail
DatatypeDecl dtypeSpec = d_solver.mkDatatypeDecl("list");
DatatypeConstructorDecl cons = d_solver.mkDatatypeConstructorDecl("cons");
cons.addSelector("head", d_solver.getIntegerSort());
dtypeSpec.addConstructor(cons);
DatatypeConstructorDecl nil = d_solver.mkDatatypeConstructorDecl("nil");
dtypeSpec.addConstructor(nil);
Sort dtypeSort = d_solver.mkDatatypeSort(dtypeSpec);
TS_ASSERT_THROWS(
dtypeSort.instantiate(std::vector<Sort>{d_solver.getIntegerSort()}),
CVC4ApiException&);
}
void SortBlack::testGetFunctionArity()
{
Sort funSort = d_solver.mkFunctionSort(d_solver.mkUninterpretedSort("u"),
d_solver.getIntegerSort());
TS_ASSERT_THROWS_NOTHING(funSort.getFunctionArity());
Sort bvSort = d_solver.mkBitVectorSort(32);
TS_ASSERT_THROWS(bvSort.getFunctionArity(), CVC4ApiException&);
}
void SortBlack::testGetFunctionDomainSorts()
{
Sort funSort = d_solver.mkFunctionSort(d_solver.mkUninterpretedSort("u"),
d_solver.getIntegerSort());
TS_ASSERT_THROWS_NOTHING(funSort.getFunctionDomainSorts());
Sort bvSort = d_solver.mkBitVectorSort(32);
TS_ASSERT_THROWS(bvSort.getFunctionDomainSorts(), CVC4ApiException&);
}
void SortBlack::testGetFunctionCodomainSort()
{
Sort funSort = d_solver.mkFunctionSort(d_solver.mkUninterpretedSort("u"),
d_solver.getIntegerSort());
TS_ASSERT_THROWS_NOTHING(funSort.getFunctionCodomainSort());
Sort bvSort = d_solver.mkBitVectorSort(32);
TS_ASSERT_THROWS(bvSort.getFunctionCodomainSort(), CVC4ApiException&);
}
void SortBlack::testGetArrayIndexSort()
{
Sort elementSort = d_solver.mkBitVectorSort(32);
Sort indexSort = d_solver.mkBitVectorSort(32);
Sort arraySort = d_solver.mkArraySort(indexSort, elementSort);
TS_ASSERT_THROWS_NOTHING(arraySort.getArrayIndexSort());
TS_ASSERT_THROWS(indexSort.getArrayIndexSort(), CVC4ApiException&);
}
void SortBlack::testGetArrayElementSort()
{
Sort elementSort = d_solver.mkBitVectorSort(32);
Sort indexSort = d_solver.mkBitVectorSort(32);
Sort arraySort = d_solver.mkArraySort(indexSort, elementSort);
TS_ASSERT_THROWS_NOTHING(arraySort.getArrayElementSort());
TS_ASSERT_THROWS(indexSort.getArrayElementSort(), CVC4ApiException&);
}
void SortBlack::testGetSetElementSort()
{
Sort setSort = d_solver.mkSetSort(d_solver.getIntegerSort());
TS_ASSERT_THROWS_NOTHING(setSort.getSetElementSort());
Sort bvSort = d_solver.mkBitVectorSort(32);
TS_ASSERT_THROWS(bvSort.getSetElementSort(), CVC4ApiException&);
}
void SortBlack::testGetUninterpretedSortName()
{
Sort uSort = d_solver.mkUninterpretedSort("u");
TS_ASSERT_THROWS_NOTHING(uSort.getUninterpretedSortName());
Sort bvSort = d_solver.mkBitVectorSort(32);
TS_ASSERT_THROWS(bvSort.getUninterpretedSortName(), CVC4ApiException&);
}
void SortBlack::testIsUninterpretedSortParameterized()
{
Sort uSort = d_solver.mkUninterpretedSort("u");
TS_ASSERT_THROWS_NOTHING(uSort.isUninterpretedSortParameterized());
Sort bvSort = d_solver.mkBitVectorSort(32);
TS_ASSERT_THROWS(bvSort.isUninterpretedSortParameterized(),
CVC4ApiException&);
}
void SortBlack::testGetUninterpretedSortParamSorts()
{
Sort uSort = d_solver.mkUninterpretedSort("u");
TS_ASSERT_THROWS_NOTHING(uSort.getUninterpretedSortParamSorts());
Sort bvSort = d_solver.mkBitVectorSort(32);
TS_ASSERT_THROWS(bvSort.getUninterpretedSortParamSorts(), CVC4ApiException&);
}
void SortBlack::testGetUninterpretedSortConstructorName()
{
Sort sSort = d_solver.mkSortConstructorSort("s", 2);
TS_ASSERT_THROWS_NOTHING(sSort.getSortConstructorName());
Sort bvSort = d_solver.mkBitVectorSort(32);
TS_ASSERT_THROWS(bvSort.getSortConstructorName(), CVC4ApiException&);
}
void SortBlack::testGetUninterpretedSortConstructorArity()
{
Sort sSort = d_solver.mkSortConstructorSort("s", 2);
TS_ASSERT_THROWS_NOTHING(sSort.getSortConstructorArity());
Sort bvSort = d_solver.mkBitVectorSort(32);
TS_ASSERT_THROWS(bvSort.getSortConstructorArity(), CVC4ApiException&);
}
void SortBlack::testGetBVSize()
{
Sort bvSort = d_solver.mkBitVectorSort(32);
TS_ASSERT_THROWS_NOTHING(bvSort.getBVSize());
Sort setSort = d_solver.mkSetSort(d_solver.getIntegerSort());
TS_ASSERT_THROWS(setSort.getBVSize(), CVC4ApiException&);
}
void SortBlack::testGetFPExponentSize()
{
Sort fpSort = d_solver.mkFloatingPointSort(4, 8);
TS_ASSERT_THROWS_NOTHING(fpSort.getFPExponentSize());
Sort setSort = d_solver.mkSetSort(d_solver.getIntegerSort());
TS_ASSERT_THROWS(setSort.getFPExponentSize(), CVC4ApiException&);
}
void SortBlack::testGetFPSignificandSize()
{
Sort fpSort = d_solver.mkFloatingPointSort(4, 8);
TS_ASSERT_THROWS_NOTHING(fpSort.getFPSignificandSize());
Sort setSort = d_solver.mkSetSort(d_solver.getIntegerSort());
TS_ASSERT_THROWS(setSort.getFPSignificandSize(), CVC4ApiException&);
}
void SortBlack::testGetDatatypeParamSorts()
{
// create parametric datatype, check should not fail
Sort sort = d_solver.mkParamSort("T");
DatatypeDecl paramDtypeSpec = d_solver.mkDatatypeDecl("paramlist", sort);
DatatypeConstructorDecl paramCons =
d_solver.mkDatatypeConstructorDecl("cons");
DatatypeConstructorDecl paramNil = d_solver.mkDatatypeConstructorDecl("nil");
paramCons.addSelector("head", sort);
paramDtypeSpec.addConstructor(paramCons);
paramDtypeSpec.addConstructor(paramNil);
Sort paramDtypeSort = d_solver.mkDatatypeSort(paramDtypeSpec);
TS_ASSERT_THROWS_NOTHING(paramDtypeSort.getDatatypeParamSorts());
// create non-parametric datatype sort, check should fail
DatatypeDecl dtypeSpec = d_solver.mkDatatypeDecl("list");
DatatypeConstructorDecl cons = d_solver.mkDatatypeConstructorDecl("cons");
cons.addSelector("head", d_solver.getIntegerSort());
dtypeSpec.addConstructor(cons);
DatatypeConstructorDecl nil = d_solver.mkDatatypeConstructorDecl("nil");
dtypeSpec.addConstructor(nil);
Sort dtypeSort = d_solver.mkDatatypeSort(dtypeSpec);
TS_ASSERT_THROWS(dtypeSort.getDatatypeParamSorts(), CVC4ApiException&);
}
void SortBlack::testGetDatatypeArity()
{
// create datatype sort, check should not fail
DatatypeDecl dtypeSpec = d_solver.mkDatatypeDecl("list");
DatatypeConstructorDecl cons = d_solver.mkDatatypeConstructorDecl("cons");
cons.addSelector("head", d_solver.getIntegerSort());
dtypeSpec.addConstructor(cons);
DatatypeConstructorDecl nil = d_solver.mkDatatypeConstructorDecl("nil");
dtypeSpec.addConstructor(nil);
Sort dtypeSort = d_solver.mkDatatypeSort(dtypeSpec);
TS_ASSERT_THROWS_NOTHING(dtypeSort.getDatatypeArity());
// create bv sort, check should fail
Sort bvSort = d_solver.mkBitVectorSort(32);
TS_ASSERT_THROWS(bvSort.getDatatypeArity(), CVC4ApiException&);
}
void SortBlack::testGetTupleLength()
{
Sort tupleSort = d_solver.mkTupleSort(
{d_solver.getIntegerSort(), d_solver.getIntegerSort()});
TS_ASSERT_THROWS_NOTHING(tupleSort.getTupleLength());
Sort bvSort = d_solver.mkBitVectorSort(32);
TS_ASSERT_THROWS(bvSort.getTupleLength(), CVC4ApiException&);
}
void SortBlack::testGetTupleSorts()
{
Sort tupleSort = d_solver.mkTupleSort(
{d_solver.getIntegerSort(), d_solver.getIntegerSort()});
TS_ASSERT_THROWS_NOTHING(tupleSort.getTupleSorts());
Sort bvSort = d_solver.mkBitVectorSort(32);
TS_ASSERT_THROWS(bvSort.getTupleSorts(), CVC4ApiException&);
}
void SortBlack::testSortCompare()
{
Sort boolSort = d_solver.getBooleanSort();
Sort intSort = d_solver.getIntegerSort();
Sort bvSort = d_solver.mkBitVectorSort(32);
Sort bvSort2 = d_solver.mkBitVectorSort(32);
TS_ASSERT(bvSort >= bvSort2);
TS_ASSERT(bvSort <= bvSort2);
TS_ASSERT((intSort > boolSort) != (intSort < boolSort));
TS_ASSERT((intSort > bvSort || intSort == bvSort) == (intSort >= bvSort));
}
void SortBlack::testSortSubtyping()
{
Sort intSort = d_solver.getIntegerSort();
Sort realSort = d_solver.getRealSort();
TS_ASSERT(intSort.isSubsortOf(realSort));
TS_ASSERT(!realSort.isSubsortOf(intSort));
TS_ASSERT(intSort.isComparableTo(realSort));
TS_ASSERT(realSort.isComparableTo(intSort));
Sort arraySortII = d_solver.mkArraySort(intSort, intSort);
Sort arraySortIR = d_solver.mkArraySort(intSort, realSort);
TS_ASSERT(!arraySortII.isComparableTo(intSort));
// we do not support subtyping for arrays
TS_ASSERT(!arraySortII.isComparableTo(arraySortIR));
Sort setSortI = d_solver.mkSetSort(intSort);
Sort setSortR = d_solver.mkSetSort(realSort);
// we support subtyping for sets
TS_ASSERT(setSortI.isSubsortOf(setSortR));
TS_ASSERT(setSortR.isComparableTo(setSortI));
}
|
