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
|
/***
* Bitwuzla: Satisfiability Modulo Theories (SMT) solver.
*
* Copyright (C) 2023 by the authors listed in the AUTHORS file at
* https://github.com/bitwuzla/bitwuzla/blob/main/AUTHORS
*
* This file is part of Bitwuzla under the MIT license. See COPYING for more
* information at https://github.com/bitwuzla/bitwuzla/blob/main/COPYING
*/
#include <cassert>
#include <cmath>
#include <cstdint>
#include "node/node_manager.h"
#include "option/option.h"
#include "solving_context.h"
#include "test/unit/rewrite/test_rewriter.h"
namespace bzla::test {
using namespace bzla::node;
class TestRewriterBvOverflow : public TestRewriter
{
protected:
static constexpr uint32_t TEST_OVERFLOW_LOW = 1;
static constexpr uint32_t TEST_OVERFLOW_HIGH = 4;
int32_t neg(int32_t x) { return -x; }
int32_t add(int32_t x, int32_t y) { return x + y; }
int32_t sub(int32_t x, int32_t y) { return x - y; }
int32_t mul(int32_t x, int32_t y) { return x * y; }
int32_t div(int32_t x, int32_t y)
{
assert(y != 0);
return x / y;
}
void u_overflow_test(Kind kind, int32_t low, int32_t high, uint32_t rwl)
{
assert(low > 0);
assert(low <= high);
NodeManager nm;
option::Options options;
options.rewrite_level.set(rwl);
options.dbg_check_model.set(false);
options.dbg_check_unsat_core.set(false);
SolvingContext ctx = SolvingContext(nm, options);
for (int32_t num_bits = low; num_bits <= high; num_bits++)
{
for (int32_t i = 0, max = std::pow(2, num_bits); i < max; ++i)
{
if (kind == Kind::BV_NEGO)
{
int32_t result = neg(i);
Node val = nm.mk_value(BitVector::from_ui(num_bits, i));
ctx.push();
ctx.assert_formula(nm.mk_node(kind, {val}));
Result sat_res = ctx.solve();
ctx.pop();
ASSERT_TRUE(sat_res != Result::UNKNOWN);
if (sat_res == Result::SAT)
{
ASSERT_EQ(BitVector::from_si(num_bits, result),
BitVector::from_si(num_bits, i));
}
}
else
{
for (int32_t j = 0; j < max; ++j)
{
int32_t result = 0;
switch (kind)
{
case Kind::BV_UADDO:
case Kind::BV_SADDO: result = add(i, j); break;
case Kind::BV_USUBO:
case Kind::BV_SSUBO: result = sub(i, j); break;
case Kind::BV_UMULO:
case Kind::BV_SMULO: result = mul(i, j); break;
default: assert(kind == Kind::BV_SDIVO); result = div(i, j);
}
Node val1 = nm.mk_value(BitVector::from_ui(num_bits, i));
Node val2 = nm.mk_value(BitVector::from_ui(num_bits, j));
ctx.push();
ctx.assert_formula(nm.mk_node(kind, {val1, val2}));
Result sat_res = ctx.solve();
ctx.pop();
ASSERT_TRUE(sat_res != Result::UNKNOWN);
if (sat_res == Result::SAT)
{
ASSERT_TRUE(result < 0 || result >= max);
}
}
}
}
}
}
void s_overflow_test(Kind kind,
bool exclude_second_zero,
int32_t low,
int32_t high,
uint32_t rwl)
{
assert(low > 0);
assert(low <= high);
int32_t result;
NodeManager nm;
option::Options options;
options.rewrite_level.set(rwl);
options.dbg_check_model.set(false);
options.dbg_check_unsat_core.set(false);
SolvingContext ctx = SolvingContext(nm, options);
for (int32_t num_bits = low; num_bits <= high; num_bits++)
{
int32_t max = std::pow(2, num_bits - 1);
for (int32_t i = -max; i < max; i++)
{
for (int32_t j = -max; j < max; j++)
{
if (!exclude_second_zero || j != 0)
{
switch (kind)
{
case Kind::BV_UADDO:
case Kind::BV_SADDO: result = add(i, j); break;
case Kind::BV_USUBO:
case Kind::BV_SSUBO: result = sub(i, j); break;
case Kind::BV_UMULO:
case Kind::BV_SMULO: result = mul(i, j); break;
default: assert(kind == Kind::BV_SDIVO); result = div(i, j);
}
Node val1 = nm.mk_value(BitVector::from_si(num_bits, i));
Node val2 = nm.mk_value(BitVector::from_si(num_bits, j));
ctx.push();
ctx.assert_formula(nm.mk_node(kind, {val1, val2}));
Result sat_res = ctx.solve();
ctx.pop();
ASSERT_TRUE(sat_res != Result::UNKNOWN);
if (sat_res == Result::SAT)
{
ASSERT_TRUE(!(result >= -max && result < max));
}
}
}
}
}
}
};
TEST_F(TestRewriterBvOverflow, nego)
{
u_overflow_test(Kind::BV_NEGO, TEST_OVERFLOW_LOW, TEST_OVERFLOW_HIGH, 1);
}
TEST_F(TestRewriterBvOverflow, uaddo)
{
u_overflow_test(Kind::BV_UADDO, TEST_OVERFLOW_LOW, TEST_OVERFLOW_HIGH, 1);
}
TEST_F(TestRewriterBvOverflow, usubo)
{
u_overflow_test(Kind::BV_USUBO, TEST_OVERFLOW_LOW, TEST_OVERFLOW_HIGH, 1);
}
TEST_F(TestRewriterBvOverflow, umulo)
{
u_overflow_test(Kind::BV_UMULO, TEST_OVERFLOW_LOW, TEST_OVERFLOW_HIGH, 1);
}
TEST_F(TestRewriterBvOverflow, saddo)
{
s_overflow_test(
Kind::BV_SADDO, false, TEST_OVERFLOW_LOW, TEST_OVERFLOW_HIGH, 1);
}
TEST_F(TestRewriterBvOverflow, ssubo)
{
s_overflow_test(
Kind::BV_SSUBO, false, TEST_OVERFLOW_LOW, TEST_OVERFLOW_HIGH, 1);
}
TEST_F(TestRewriterBvOverflow, smulo)
{
s_overflow_test(
Kind::BV_SMULO, false, TEST_OVERFLOW_LOW, TEST_OVERFLOW_HIGH, 1);
}
TEST_F(TestRewriterBvOverflow, sdivo)
{
s_overflow_test(
Kind::BV_SDIVO, true, TEST_OVERFLOW_LOW, TEST_OVERFLOW_HIGH, 1);
}
} // namespace bzla::test
|
