File: capi_op_black.cpp

package info (click to toggle)
cvc5 1.3.2-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 87,260 kB
  • sloc: cpp: 383,850; java: 12,207; python: 12,090; sh: 5,679; ansic: 4,729; lisp: 763; perl: 208; makefile: 38
file content (352 lines) | stat: -rw-r--r-- 13,279 bytes parent folder | download
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
/******************************************************************************
 * Top contributors (to current version):
 *   Aina Niemetz
 *
 * This file is part of the cvc5 project.
 *
 * Copyright (c) 2009-2025 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.
 * ****************************************************************************
 *
 * Black box testing of the guards of the C API functions.
 */

extern "C" {
#include <cvc5/c/cvc5.h>
}

#include "base/output.h"
#include "gtest/gtest.h"

namespace cvc5::internal::test {

class TestCApiBlackOp : public ::testing::Test
{
 protected:
  void SetUp() override
  {
    d_tm = cvc5_term_manager_new();
    d_bool = cvc5_get_boolean_sort(d_tm);
    d_int = cvc5_get_integer_sort(d_tm);
    d_real = cvc5_get_real_sort(d_tm);
    d_uninterpreted = cvc5_mk_uninterpreted_sort(d_tm, "u");
  }
  void TearDown() override { cvc5_term_manager_delete(d_tm); }

  Cvc5TermManager* d_tm;
  Cvc5Sort d_bool;
  Cvc5Sort d_int;
  Cvc5Sort d_real;
  Cvc5Sort d_uninterpreted;
};

TEST_F(TestCApiBlackOp, equal)
{
  std::vector<uint32_t> idxs = {4, 0};
  Cvc5Op op1 =
      cvc5_mk_op(d_tm, CVC5_KIND_BITVECTOR_EXTRACT, idxs.size(), idxs.data());
  idxs = {4, 1};
  Cvc5Op op2 =
      cvc5_mk_op(d_tm, CVC5_KIND_BITVECTOR_EXTRACT, idxs.size(), idxs.data());
  ASSERT_TRUE(cvc5_op_is_equal(op1, op1));
  ASSERT_TRUE(cvc5_op_is_disequal(op1, op2));
  ASSERT_FALSE(cvc5_op_is_equal(op1, nullptr));
  ASSERT_TRUE(cvc5_op_is_disequal(op1, nullptr));
}

TEST_F(TestCApiBlackOp, hash)
{
  ASSERT_DEATH(cvc5_op_hash(nullptr), "invalid operator");
  std::vector<uint32_t> idxs = {4, 0};
  Cvc5Op op1 =
      cvc5_mk_op(d_tm, CVC5_KIND_BITVECTOR_EXTRACT, idxs.size(), idxs.data());
  idxs = {4, 1};
  Cvc5Op op2 =
      cvc5_mk_op(d_tm, CVC5_KIND_BITVECTOR_EXTRACT, idxs.size(), idxs.data());
  ASSERT_EQ(cvc5_op_hash(op1), cvc5_op_hash(op1));
  ASSERT_NE(cvc5_op_hash(op1), cvc5_op_hash(op2));
}

TEST_F(TestCApiBlackOp, copy_release)
{
  ASSERT_DEATH(cvc5_op_copy(nullptr), "invalid op");
  ASSERT_DEATH(cvc5_op_release(nullptr), "invalid op");
  std::vector<uint32_t> idxs = {4, 0};
  Cvc5Op op =
      cvc5_mk_op(d_tm, CVC5_KIND_BITVECTOR_EXTRACT, idxs.size(), idxs.data());
  Cvc5Op op_copy = cvc5_op_copy(op);
  size_t hash1 = cvc5_op_hash(op);
  size_t hash2 = cvc5_op_hash(op_copy);
  ASSERT_EQ(hash1, hash2);
  cvc5_op_release(op);
  ASSERT_EQ(cvc5_op_hash(op), cvc5_op_hash(op_copy));
  cvc5_op_release(op);
  // we cannot reliably check that querying on the (now freed) term fails
  // unless ASAN is enabled
}

TEST_F(TestCApiBlackOp, get_kind)
{
  ASSERT_DEATH(cvc5_op_get_kind(nullptr), "invalid operator");
  std::vector<uint32_t> idxs = {4, 0};
  ASSERT_EQ(cvc5_op_get_kind(cvc5_mk_op(
                d_tm, CVC5_KIND_BITVECTOR_EXTRACT, idxs.size(), idxs.data())),
            CVC5_KIND_BITVECTOR_EXTRACT);
}

TEST_F(TestCApiBlackOp, mk_op)
{
  std::vector<uint32_t> idxs = {4, 0};
  ASSERT_DEATH(
      cvc5_mk_op(
          nullptr, CVC5_KIND_BITVECTOR_EXTRACT, idxs.size(), idxs.data()),
      "unexpected NULL argument");
  ASSERT_DEATH(
      cvc5_mk_op(d_tm, CVC5_KIND_BITVECTOR_EXTRACT, idxs.size(), nullptr),
      "unexpected NULL argument");
  (void)cvc5_mk_op(d_tm, CVC5_KIND_ADD, 0, nullptr);
  idxs.push_back(2);
  ASSERT_DEATH(
      cvc5_mk_op(d_tm, CVC5_KIND_BITVECTOR_EXTRACT, idxs.size(), idxs.data()),
      "invalid number of indices");
}

TEST_F(TestCApiBlackOp, get_num_indices)
{
  ASSERT_DEATH(cvc5_op_get_num_indices(nullptr), "invalid operator");

  // Operators with 0 indices
  Cvc5Op add = cvc5_mk_op(d_tm, CVC5_KIND_ADD, 0, nullptr);
  ASSERT_EQ(cvc5_op_get_num_indices(add), 0);

  // Operators with 1 index
  std::vector<uint32_t> idxs = {4};
  Cvc5Op divisible =
      cvc5_mk_op(d_tm, CVC5_KIND_DIVISIBLE, idxs.size(), idxs.data());
  idxs = {5};
  Cvc5Op bv_repeat =
      cvc5_mk_op(d_tm, CVC5_KIND_BITVECTOR_REPEAT, idxs.size(), idxs.data());
  idxs = {6};
  Cvc5Op bv_zext = cvc5_mk_op(
      d_tm, CVC5_KIND_BITVECTOR_ZERO_EXTEND, idxs.size(), idxs.data());
  idxs = {7};
  Cvc5Op bv_sext = cvc5_mk_op(
      d_tm, CVC5_KIND_BITVECTOR_SIGN_EXTEND, idxs.size(), idxs.data());
  idxs = {8};
  Cvc5Op bv_rol = cvc5_mk_op(
      d_tm, CVC5_KIND_BITVECTOR_ROTATE_LEFT, idxs.size(), idxs.data());
  idxs = {9};
  Cvc5Op bv_ror = cvc5_mk_op(
      d_tm, CVC5_KIND_BITVECTOR_ROTATE_RIGHT, idxs.size(), idxs.data());
  idxs = {10};
  Cvc5Op int_to_bv =
      cvc5_mk_op(d_tm, CVC5_KIND_INT_TO_BITVECTOR, idxs.size(), idxs.data());
  idxs = {12};
  Cvc5Op iand = cvc5_mk_op(d_tm, CVC5_KIND_IAND, idxs.size(), idxs.data());
  idxs = {12};
  Cvc5Op fp_to_ubv = cvc5_mk_op(
      d_tm, CVC5_KIND_FLOATINGPOINT_TO_UBV, idxs.size(), idxs.data());
  idxs = {13};
  Cvc5Op fp_to_sbv = cvc5_mk_op(
      d_tm, CVC5_KIND_FLOATINGPOINT_TO_SBV, idxs.size(), idxs.data());

  ASSERT_EQ(1, cvc5_op_get_num_indices(divisible));
  ASSERT_EQ(1, cvc5_op_get_num_indices(bv_repeat));
  ASSERT_EQ(1, cvc5_op_get_num_indices(bv_zext));
  ASSERT_EQ(1, cvc5_op_get_num_indices(bv_sext));
  ASSERT_EQ(1, cvc5_op_get_num_indices(bv_ror));
  ASSERT_EQ(1, cvc5_op_get_num_indices(bv_rol));
  ASSERT_EQ(1, cvc5_op_get_num_indices(int_to_bv));
  ASSERT_EQ(1, cvc5_op_get_num_indices(iand));
  ASSERT_EQ(1, cvc5_op_get_num_indices(fp_to_ubv));
  ASSERT_EQ(1, cvc5_op_get_num_indices(fp_to_sbv));

  // Operators with 2 indices
  idxs = {1, 0};
  Cvc5Op bv_ext =
      cvc5_mk_op(d_tm, CVC5_KIND_BITVECTOR_EXTRACT, idxs.size(), idxs.data());
  idxs = {3, 2};
  Cvc5Op to_fp_from_ieee =
      cvc5_mk_op(d_tm,
                 CVC5_KIND_FLOATINGPOINT_TO_FP_FROM_IEEE_BV,
                 idxs.size(),
                 idxs.data());
  idxs = {5, 4};
  Cvc5Op to_fp_from_fp = cvc5_mk_op(
      d_tm, CVC5_KIND_FLOATINGPOINT_TO_FP_FROM_FP, idxs.size(), idxs.data());
  idxs = {7, 6};
  Cvc5Op to_fp_from_real = cvc5_mk_op(
      d_tm, CVC5_KIND_FLOATINGPOINT_TO_FP_FROM_REAL, idxs.size(), idxs.data());
  idxs = {9, 8};
  Cvc5Op to_fp_from_sbv = cvc5_mk_op(
      d_tm, CVC5_KIND_FLOATINGPOINT_TO_FP_FROM_SBV, idxs.size(), idxs.data());
  idxs = {11, 10};
  Cvc5Op to_fp_from_ubv = cvc5_mk_op(
      d_tm, CVC5_KIND_FLOATINGPOINT_TO_FP_FROM_UBV, idxs.size(), idxs.data());
  idxs = {15, 14};
  Cvc5Op regexp_loop =
      cvc5_mk_op(d_tm, CVC5_KIND_REGEXP_LOOP, idxs.size(), idxs.data());

  ASSERT_EQ(2, cvc5_op_get_num_indices(bv_ext));
  ASSERT_EQ(2, cvc5_op_get_num_indices(to_fp_from_ieee));
  ASSERT_EQ(2, cvc5_op_get_num_indices(to_fp_from_fp));
  ASSERT_EQ(2, cvc5_op_get_num_indices(to_fp_from_real));
  ASSERT_EQ(2, cvc5_op_get_num_indices(to_fp_from_sbv));
  ASSERT_EQ(2, cvc5_op_get_num_indices(to_fp_from_ubv));
  ASSERT_EQ(2, cvc5_op_get_num_indices(regexp_loop));

  // Operators with n indices
  idxs = {0, 3, 2, 0, 1, 2};
  Cvc5Op tuple_proj =
      cvc5_mk_op(d_tm, CVC5_KIND_TUPLE_PROJECT, idxs.size(), idxs.data());
  ASSERT_EQ(idxs.size(), cvc5_op_get_num_indices(tuple_proj));

  Cvc5Op rel_proj =
      cvc5_mk_op(d_tm, CVC5_KIND_RELATION_PROJECT, idxs.size(), idxs.data());
  ASSERT_EQ(idxs.size(), cvc5_op_get_num_indices(rel_proj));

  Cvc5Op table_proj =
      cvc5_mk_op(d_tm, CVC5_KIND_TABLE_PROJECT, idxs.size(), idxs.data());
  ASSERT_EQ(idxs.size(), cvc5_op_get_num_indices(table_proj));
}

TEST_F(TestCApiBlackOp, subscript_operator)
{
  // Operators with 0 indices
  Cvc5Op add = cvc5_mk_op(d_tm, CVC5_KIND_ADD, 0, nullptr);
  ASSERT_DEATH(cvc5_op_get_index(nullptr, 0), "invalid operator");
  ASSERT_DEATH(cvc5_op_get_index(add, 0), "Op is not indexed");

  // Operators with 1 index
  std::vector<uint32_t> idxs = {4};
  Cvc5Op divisible =
      cvc5_mk_op(d_tm, CVC5_KIND_DIVISIBLE, idxs.size(), idxs.data());
  idxs = {5};
  Cvc5Op bv_repeat =
      cvc5_mk_op(d_tm, CVC5_KIND_BITVECTOR_REPEAT, idxs.size(), idxs.data());
  idxs = {6};
  Cvc5Op bv_zext = cvc5_mk_op(
      d_tm, CVC5_KIND_BITVECTOR_ZERO_EXTEND, idxs.size(), idxs.data());
  idxs = {7};
  Cvc5Op bv_sext = cvc5_mk_op(
      d_tm, CVC5_KIND_BITVECTOR_SIGN_EXTEND, idxs.size(), idxs.data());
  idxs = {8};
  Cvc5Op bv_rol = cvc5_mk_op(
      d_tm, CVC5_KIND_BITVECTOR_ROTATE_LEFT, idxs.size(), idxs.data());
  idxs = {9};
  Cvc5Op bv_ror = cvc5_mk_op(
      d_tm, CVC5_KIND_BITVECTOR_ROTATE_RIGHT, idxs.size(), idxs.data());
  idxs = {10};
  Cvc5Op int_to_bv =
      cvc5_mk_op(d_tm, CVC5_KIND_INT_TO_BITVECTOR, idxs.size(), idxs.data());
  idxs = {11};
  Cvc5Op iand = cvc5_mk_op(d_tm, CVC5_KIND_IAND, idxs.size(), idxs.data());
  idxs = {12};
  Cvc5Op fp_to_ubv = cvc5_mk_op(
      d_tm, CVC5_KIND_FLOATINGPOINT_TO_UBV, idxs.size(), idxs.data());
  idxs = {13};
  Cvc5Op fp_to_sbv = cvc5_mk_op(
      d_tm, CVC5_KIND_FLOATINGPOINT_TO_SBV, idxs.size(), idxs.data());
  idxs = {14};
  Cvc5Op regexp_repeat =
      cvc5_mk_op(d_tm, CVC5_KIND_REGEXP_REPEAT, idxs.size(), idxs.data());

  ASSERT_EQ(4, cvc5_term_get_uint32_value(cvc5_op_get_index(divisible, 0)));
  ASSERT_EQ(5, cvc5_term_get_uint32_value(cvc5_op_get_index(bv_repeat, 0)));
  ASSERT_EQ(6, cvc5_term_get_uint32_value(cvc5_op_get_index(bv_zext, 0)));
  ASSERT_EQ(7, cvc5_term_get_uint32_value(cvc5_op_get_index(bv_sext, 0)));
  ASSERT_EQ(8, cvc5_term_get_uint32_value(cvc5_op_get_index(bv_rol, 0)));
  ASSERT_EQ(9, cvc5_term_get_uint32_value(cvc5_op_get_index(bv_ror, 0)));
  ASSERT_EQ(10, cvc5_term_get_uint32_value(cvc5_op_get_index(int_to_bv, 0)));
  ASSERT_EQ(11, cvc5_term_get_uint32_value(cvc5_op_get_index(iand, 0)));
  ASSERT_EQ(12, cvc5_term_get_uint32_value(cvc5_op_get_index(fp_to_ubv, 0)));
  ASSERT_EQ(13, cvc5_term_get_uint32_value(cvc5_op_get_index(fp_to_sbv, 0)));
  ASSERT_EQ(14,
            cvc5_term_get_uint32_value(cvc5_op_get_index(regexp_repeat, 0)));

  // Operators with 2 indices
  idxs = {1, 0};
  Cvc5Op bv_ext =
      cvc5_mk_op(d_tm, CVC5_KIND_BITVECTOR_EXTRACT, idxs.size(), idxs.data());
  idxs = {3, 2};
  Cvc5Op to_fp_from_ieee =
      cvc5_mk_op(d_tm,
                 CVC5_KIND_FLOATINGPOINT_TO_FP_FROM_IEEE_BV,
                 idxs.size(),
                 idxs.data());
  idxs = {5, 4};
  Cvc5Op to_fp_from_fp = cvc5_mk_op(
      d_tm, CVC5_KIND_FLOATINGPOINT_TO_FP_FROM_FP, idxs.size(), idxs.data());
  idxs = {7, 6};
  Cvc5Op to_fp_from_real = cvc5_mk_op(
      d_tm, CVC5_KIND_FLOATINGPOINT_TO_FP_FROM_REAL, idxs.size(), idxs.data());
  idxs = {9, 8};
  Cvc5Op to_fp_from_sbv = cvc5_mk_op(
      d_tm, CVC5_KIND_FLOATINGPOINT_TO_FP_FROM_SBV, idxs.size(), idxs.data());
  idxs = {11, 10};
  Cvc5Op to_fp_from_ubv = cvc5_mk_op(
      d_tm, CVC5_KIND_FLOATINGPOINT_TO_FP_FROM_UBV, idxs.size(), idxs.data());
  idxs = {15, 14};
  Cvc5Op regexp_loop =
      cvc5_mk_op(d_tm, CVC5_KIND_REGEXP_LOOP, idxs.size(), idxs.data());

  ASSERT_EQ(1, cvc5_term_get_uint32_value(cvc5_op_get_index(bv_ext, 0)));
  ASSERT_EQ(0, cvc5_term_get_uint32_value(cvc5_op_get_index(bv_ext, 1)));
  ASSERT_EQ(3,
            cvc5_term_get_uint32_value(cvc5_op_get_index(to_fp_from_ieee, 0)));
  ASSERT_EQ(2,
            cvc5_term_get_uint32_value(cvc5_op_get_index(to_fp_from_ieee, 1)));
  ASSERT_EQ(5, cvc5_term_get_uint32_value(cvc5_op_get_index(to_fp_from_fp, 0)));
  ASSERT_EQ(4, cvc5_term_get_uint32_value(cvc5_op_get_index(to_fp_from_fp, 1)));
  ASSERT_EQ(7,
            cvc5_term_get_uint32_value(cvc5_op_get_index(to_fp_from_real, 0)));
  ASSERT_EQ(6,
            cvc5_term_get_uint32_value(cvc5_op_get_index(to_fp_from_real, 1)));
  ASSERT_EQ(9,
            cvc5_term_get_uint32_value(cvc5_op_get_index(to_fp_from_sbv, 0)));
  ASSERT_EQ(8,
            cvc5_term_get_uint32_value(cvc5_op_get_index(to_fp_from_sbv, 1)));
  ASSERT_EQ(11,
            cvc5_term_get_uint32_value(cvc5_op_get_index(to_fp_from_ubv, 0)));
  ASSERT_EQ(10,
            cvc5_term_get_uint32_value(cvc5_op_get_index(to_fp_from_ubv, 1)));
  ASSERT_EQ(15, cvc5_term_get_uint32_value(cvc5_op_get_index(regexp_loop, 0)));
  ASSERT_EQ(14, cvc5_term_get_uint32_value(cvc5_op_get_index(regexp_loop, 1)));

  // Operators with n indices
  idxs = {0, 3, 2, 0, 1, 2};
  Cvc5Op tuple_proj =
      cvc5_mk_op(d_tm, CVC5_KIND_TUPLE_PROJECT, idxs.size(), idxs.data());
  for (size_t i = 0, size = cvc5_op_get_num_indices(tuple_proj); i < size; ++i)
  {
    ASSERT_EQ(idxs[i],
              cvc5_term_get_uint32_value(cvc5_op_get_index(tuple_proj, i)));
  }

  Cvc5Op rel_proj =
      cvc5_mk_op(d_tm, CVC5_KIND_RELATION_PROJECT, idxs.size(), idxs.data());
  for (size_t i = 0, size = cvc5_op_get_num_indices(rel_proj); i < size; ++i)
  {
    ASSERT_EQ(idxs[i],
              cvc5_term_get_uint32_value(cvc5_op_get_index(rel_proj, i)));
  }

  Cvc5Op table_proj =
      cvc5_mk_op(d_tm, CVC5_KIND_TABLE_PROJECT, idxs.size(), idxs.data());
  for (size_t i = 0, size = cvc5_op_get_num_indices(table_proj); i < size; ++i)
  {
    ASSERT_EQ(idxs[i],
              cvc5_term_get_uint32_value(cvc5_op_get_index(table_proj, i)));
  }
}

TEST_F(TestCApiBlackOp, to_string)
{
  std::vector<uint32_t> idxs = {5};
  Cvc5Op bv_repeat =
      cvc5_mk_op(d_tm, CVC5_KIND_BITVECTOR_REPEAT, idxs.size(), idxs.data());
  ASSERT_EQ(cvc5_op_to_string(bv_repeat), cvc5_op_to_string(bv_repeat));
}
}  // namespace cvc5::internal::test