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
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
|
//===-- Z3Builder.cpp ------------------------------------------*- C++ -*-====//
//
// The KLEE Symbolic Virtual Machine
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
#include "klee/Config/config.h"
#ifdef ENABLE_Z3
#include "Z3Builder.h"
#include "klee/Expr.h"
#include "klee/Solver.h"
#include "klee/util/Bits.h"
#include "ConstantDivision.h"
#include "klee/SolverStats.h"
#include "llvm/Support/CommandLine.h"
using namespace klee;
namespace {
llvm::cl::opt<bool> UseConstructHashZ3(
"use-construct-hash-z3",
llvm::cl::desc("Use hash-consing during Z3 query construction."),
llvm::cl::init(true));
}
void custom_z3_error_handler(Z3_context ctx, Z3_error_code ec) {
::Z3_string errorMsg = Z3_get_error_msg(ctx, ec);
// FIXME: This is kind of a hack. The value comes from the enum
// Z3_CANCELED_MSG but this isn't currently exposed by Z3's C API
if (strcmp(errorMsg, "canceled") == 0) {
// Solver timeout is not a fatal error
return;
}
llvm::errs() << "Error: Incorrect use of Z3. [" << ec << "] " << errorMsg
<< "\n";
abort();
}
Z3ArrayExprHash::~Z3ArrayExprHash() {}
void Z3ArrayExprHash::clear() {
_update_node_hash.clear();
_array_hash.clear();
}
Z3Builder::Z3Builder(bool autoClearConstructCache)
: autoClearConstructCache(autoClearConstructCache) {
// FIXME: Should probably let the client pass in a Z3_config instead
Z3_config cfg = Z3_mk_config();
// It is very important that we ask Z3 to let us manage memory so that
// we are able to cache expressions and sorts.
ctx = Z3_mk_context_rc(cfg);
// Make sure we handle any errors reported by Z3.
Z3_set_error_handler(ctx, custom_z3_error_handler);
// When emitting Z3 expressions make them SMT-LIBv2 compliant
Z3_set_ast_print_mode(ctx, Z3_PRINT_SMTLIB2_COMPLIANT);
Z3_del_config(cfg);
}
Z3Builder::~Z3Builder() {
// Clear caches so exprs/sorts gets freed before the destroying context
// they aren associated with.
clearConstructCache();
_arr_hash.clear();
Z3_del_context(ctx);
}
Z3SortHandle Z3Builder::getBvSort(unsigned width) {
// FIXME: cache these
return Z3SortHandle(Z3_mk_bv_sort(ctx, width), ctx);
}
Z3SortHandle Z3Builder::getArraySort(Z3SortHandle domainSort,
Z3SortHandle rangeSort) {
// FIXME: cache these
return Z3SortHandle(Z3_mk_array_sort(ctx, domainSort, rangeSort), ctx);
}
Z3ASTHandle Z3Builder::buildArray(const char *name, unsigned indexWidth,
unsigned valueWidth) {
Z3SortHandle domainSort = getBvSort(indexWidth);
Z3SortHandle rangeSort = getBvSort(valueWidth);
Z3SortHandle t = getArraySort(domainSort, rangeSort);
Z3_symbol s = Z3_mk_string_symbol(ctx, const_cast<char *>(name));
return Z3ASTHandle(Z3_mk_const(ctx, s, t), ctx);
}
Z3ASTHandle Z3Builder::getTrue() { return Z3ASTHandle(Z3_mk_true(ctx), ctx); }
Z3ASTHandle Z3Builder::getFalse() { return Z3ASTHandle(Z3_mk_false(ctx), ctx); }
Z3ASTHandle Z3Builder::bvOne(unsigned width) { return bvZExtConst(width, 1); }
Z3ASTHandle Z3Builder::bvZero(unsigned width) { return bvZExtConst(width, 0); }
Z3ASTHandle Z3Builder::bvMinusOne(unsigned width) {
return bvSExtConst(width, (int64_t)-1);
}
Z3ASTHandle Z3Builder::bvConst32(unsigned width, uint32_t value) {
Z3SortHandle t = getBvSort(width);
return Z3ASTHandle(Z3_mk_unsigned_int(ctx, value, t), ctx);
}
Z3ASTHandle Z3Builder::bvConst64(unsigned width, uint64_t value) {
Z3SortHandle t = getBvSort(width);
return Z3ASTHandle(Z3_mk_unsigned_int64(ctx, value, t), ctx);
}
Z3ASTHandle Z3Builder::bvZExtConst(unsigned width, uint64_t value) {
if (width <= 64)
return bvConst64(width, value);
Z3ASTHandle expr = Z3ASTHandle(bvConst64(64, value), ctx);
Z3ASTHandle zero = Z3ASTHandle(bvConst64(64, 0), ctx);
for (width -= 64; width > 64; width -= 64)
expr = Z3ASTHandle(Z3_mk_concat(ctx, zero, expr), ctx);
return Z3ASTHandle(Z3_mk_concat(ctx, bvConst64(width, 0), expr), ctx);
}
Z3ASTHandle Z3Builder::bvSExtConst(unsigned width, uint64_t value) {
if (width <= 64)
return bvConst64(width, value);
Z3SortHandle t = getBvSort(width - 64);
if (value >> 63) {
Z3ASTHandle r = Z3ASTHandle(Z3_mk_int64(ctx, -1, t), ctx);
return Z3ASTHandle(Z3_mk_concat(ctx, r, bvConst64(64, value)), ctx);
}
Z3ASTHandle r = Z3ASTHandle(Z3_mk_int64(ctx, 0, t), ctx);
return Z3ASTHandle(Z3_mk_concat(ctx, r, bvConst64(64, value)), ctx);
}
Z3ASTHandle Z3Builder::bvBoolExtract(Z3ASTHandle expr, int bit) {
return Z3ASTHandle(Z3_mk_eq(ctx, bvExtract(expr, bit, bit), bvOne(1)), ctx);
}
Z3ASTHandle Z3Builder::bvExtract(Z3ASTHandle expr, unsigned top,
unsigned bottom) {
return Z3ASTHandle(Z3_mk_extract(ctx, top, bottom, expr), ctx);
}
Z3ASTHandle Z3Builder::eqExpr(Z3ASTHandle a, Z3ASTHandle b) {
return Z3ASTHandle(Z3_mk_eq(ctx, a, b), ctx);
}
// logical right shift
Z3ASTHandle Z3Builder::bvRightShift(Z3ASTHandle expr, unsigned shift) {
unsigned width = getBVLength(expr);
if (shift == 0) {
return expr;
} else if (shift >= width) {
return bvZero(width); // Overshift to zero
} else {
return Z3ASTHandle(
Z3_mk_concat(ctx, bvZero(shift), bvExtract(expr, width - 1, shift)),
ctx);
}
}
// logical left shift
Z3ASTHandle Z3Builder::bvLeftShift(Z3ASTHandle expr, unsigned shift) {
unsigned width = getBVLength(expr);
if (shift == 0) {
return expr;
} else if (shift >= width) {
return bvZero(width); // Overshift to zero
} else {
return Z3ASTHandle(
Z3_mk_concat(ctx, bvExtract(expr, width - shift - 1, 0), bvZero(shift)),
ctx);
}
}
// left shift by a variable amount on an expression of the specified width
Z3ASTHandle Z3Builder::bvVarLeftShift(Z3ASTHandle expr, Z3ASTHandle shift) {
unsigned width = getBVLength(expr);
Z3ASTHandle res = bvZero(width);
// construct a big if-then-elif-elif-... with one case per possible shift
// amount
for (int i = width - 1; i >= 0; i--) {
res =
iteExpr(eqExpr(shift, bvConst32(width, i)), bvLeftShift(expr, i), res);
}
// If overshifting, shift to zero
Z3ASTHandle ex = bvLtExpr(shift, bvConst32(getBVLength(shift), width));
res = iteExpr(ex, res, bvZero(width));
return res;
}
// logical right shift by a variable amount on an expression of the specified
// width
Z3ASTHandle Z3Builder::bvVarRightShift(Z3ASTHandle expr, Z3ASTHandle shift) {
unsigned width = getBVLength(expr);
Z3ASTHandle res = bvZero(width);
// construct a big if-then-elif-elif-... with one case per possible shift
// amount
for (int i = width - 1; i >= 0; i--) {
res =
iteExpr(eqExpr(shift, bvConst32(width, i)), bvRightShift(expr, i), res);
}
// If overshifting, shift to zero
Z3ASTHandle ex = bvLtExpr(shift, bvConst32(getBVLength(shift), width));
res = iteExpr(ex, res, bvZero(width));
return res;
}
// arithmetic right shift by a variable amount on an expression of the specified
// width
Z3ASTHandle Z3Builder::bvVarArithRightShift(Z3ASTHandle expr,
Z3ASTHandle shift) {
unsigned width = getBVLength(expr);
// get the sign bit to fill with
Z3ASTHandle signedBool = bvBoolExtract(expr, width - 1);
// start with the result if shifting by width-1
Z3ASTHandle res = constructAShrByConstant(expr, width - 1, signedBool);
// construct a big if-then-elif-elif-... with one case per possible shift
// amount
// XXX more efficient to move the ite on the sign outside all exprs?
// XXX more efficient to sign extend, right shift, then extract lower bits?
for (int i = width - 2; i >= 0; i--) {
res = iteExpr(eqExpr(shift, bvConst32(width, i)),
constructAShrByConstant(expr, i, signedBool), res);
}
// If overshifting, shift to zero
Z3ASTHandle ex = bvLtExpr(shift, bvConst32(getBVLength(shift), width));
res = iteExpr(ex, res, bvZero(width));
return res;
}
Z3ASTHandle Z3Builder::notExpr(Z3ASTHandle expr) {
return Z3ASTHandle(Z3_mk_not(ctx, expr), ctx);
}
Z3ASTHandle Z3Builder::bvNotExpr(Z3ASTHandle expr) {
return Z3ASTHandle(Z3_mk_bvnot(ctx, expr), ctx);
}
Z3ASTHandle Z3Builder::andExpr(Z3ASTHandle lhs, Z3ASTHandle rhs) {
::Z3_ast args[2] = {lhs, rhs};
return Z3ASTHandle(Z3_mk_and(ctx, 2, args), ctx);
}
Z3ASTHandle Z3Builder::bvAndExpr(Z3ASTHandle lhs, Z3ASTHandle rhs) {
return Z3ASTHandle(Z3_mk_bvand(ctx, lhs, rhs), ctx);
}
Z3ASTHandle Z3Builder::orExpr(Z3ASTHandle lhs, Z3ASTHandle rhs) {
::Z3_ast args[2] = {lhs, rhs};
return Z3ASTHandle(Z3_mk_or(ctx, 2, args), ctx);
}
Z3ASTHandle Z3Builder::bvOrExpr(Z3ASTHandle lhs, Z3ASTHandle rhs) {
return Z3ASTHandle(Z3_mk_bvor(ctx, lhs, rhs), ctx);
}
Z3ASTHandle Z3Builder::iffExpr(Z3ASTHandle lhs, Z3ASTHandle rhs) {
Z3SortHandle lhsSort = Z3SortHandle(Z3_get_sort(ctx, lhs), ctx);
Z3SortHandle rhsSort = Z3SortHandle(Z3_get_sort(ctx, rhs), ctx);
assert(Z3_get_sort_kind(ctx, lhsSort) == Z3_get_sort_kind(ctx, rhsSort) &&
"lhs and rhs sorts must match");
assert(Z3_get_sort_kind(ctx, lhsSort) == Z3_BOOL_SORT && "args must have BOOL sort");
return Z3ASTHandle(Z3_mk_iff(ctx, lhs, rhs), ctx);
}
Z3ASTHandle Z3Builder::bvXorExpr(Z3ASTHandle lhs, Z3ASTHandle rhs) {
return Z3ASTHandle(Z3_mk_bvxor(ctx, lhs, rhs), ctx);
}
Z3ASTHandle Z3Builder::bvSignExtend(Z3ASTHandle src, unsigned width) {
unsigned src_width =
Z3_get_bv_sort_size(ctx, Z3SortHandle(Z3_get_sort(ctx, src), ctx));
assert(src_width <= width && "attempted to extend longer data");
return Z3ASTHandle(Z3_mk_sign_ext(ctx, width - src_width, src), ctx);
}
Z3ASTHandle Z3Builder::writeExpr(Z3ASTHandle array, Z3ASTHandle index,
Z3ASTHandle value) {
return Z3ASTHandle(Z3_mk_store(ctx, array, index, value), ctx);
}
Z3ASTHandle Z3Builder::readExpr(Z3ASTHandle array, Z3ASTHandle index) {
return Z3ASTHandle(Z3_mk_select(ctx, array, index), ctx);
}
Z3ASTHandle Z3Builder::iteExpr(Z3ASTHandle condition, Z3ASTHandle whenTrue,
Z3ASTHandle whenFalse) {
return Z3ASTHandle(Z3_mk_ite(ctx, condition, whenTrue, whenFalse), ctx);
}
unsigned Z3Builder::getBVLength(Z3ASTHandle expr) {
return Z3_get_bv_sort_size(ctx, Z3SortHandle(Z3_get_sort(ctx, expr), ctx));
}
Z3ASTHandle Z3Builder::bvLtExpr(Z3ASTHandle lhs, Z3ASTHandle rhs) {
return Z3ASTHandle(Z3_mk_bvult(ctx, lhs, rhs), ctx);
}
Z3ASTHandle Z3Builder::bvLeExpr(Z3ASTHandle lhs, Z3ASTHandle rhs) {
return Z3ASTHandle(Z3_mk_bvule(ctx, lhs, rhs), ctx);
}
Z3ASTHandle Z3Builder::sbvLtExpr(Z3ASTHandle lhs, Z3ASTHandle rhs) {
return Z3ASTHandle(Z3_mk_bvslt(ctx, lhs, rhs), ctx);
}
Z3ASTHandle Z3Builder::sbvLeExpr(Z3ASTHandle lhs, Z3ASTHandle rhs) {
return Z3ASTHandle(Z3_mk_bvsle(ctx, lhs, rhs), ctx);
}
Z3ASTHandle Z3Builder::constructAShrByConstant(Z3ASTHandle expr, unsigned shift,
Z3ASTHandle isSigned) {
unsigned width = getBVLength(expr);
if (shift == 0) {
return expr;
} else if (shift >= width) {
return bvZero(width); // Overshift to zero
} else {
// FIXME: Is this really the best way to interact with Z3?
return iteExpr(isSigned,
Z3ASTHandle(Z3_mk_concat(ctx, bvMinusOne(shift),
bvExtract(expr, width - 1, shift)),
ctx),
bvRightShift(expr, shift));
}
}
Z3ASTHandle Z3Builder::getInitialArray(const Array *root) {
assert(root);
Z3ASTHandle array_expr;
bool hashed = _arr_hash.lookupArrayExpr(root, array_expr);
if (!hashed) {
// Unique arrays by name, so we make sure the name is unique by
// including the address.
char buf[32];
unsigned const addrlen =
sprintf(buf, "_%p", (const void *)root) + 1; // +1 for null-termination
unsigned const space = (root->name.length() > 32 - addrlen)
? (32 - addrlen)
: root->name.length();
memmove(buf + space, buf, addrlen); // moving the address part to the end
memcpy(buf, root->name.c_str(), space); // filling out the name part
array_expr = buildArray(buf, root->getDomain(), root->getRange());
if (root->isConstantArray()) {
// FIXME: Flush the concrete values into Z3. Ideally we would do this
// using assertions, which might be faster, but we need to fix the caching
// to work correctly in that case.
for (unsigned i = 0, e = root->size; i != e; ++i) {
Z3ASTHandle prev = array_expr;
array_expr = writeExpr(
prev, construct(ConstantExpr::alloc(i, root->getDomain()), 0),
construct(root->constantValues[i], 0));
}
}
_arr_hash.hashArrayExpr(root, array_expr);
}
return (array_expr);
}
Z3ASTHandle Z3Builder::getInitialRead(const Array *root, unsigned index) {
return readExpr(getInitialArray(root), bvConst32(32, index));
}
Z3ASTHandle Z3Builder::getArrayForUpdate(const Array *root,
const UpdateNode *un) {
if (!un) {
return (getInitialArray(root));
} else {
// FIXME: This really needs to be non-recursive.
Z3ASTHandle un_expr;
bool hashed = _arr_hash.lookupUpdateNodeExpr(un, un_expr);
if (!hashed) {
un_expr = writeExpr(getArrayForUpdate(root, un->next),
construct(un->index, 0), construct(un->value, 0));
_arr_hash.hashUpdateNodeExpr(un, un_expr);
}
return (un_expr);
}
}
/** if *width_out!=1 then result is a bitvector,
otherwise it is a bool */
Z3ASTHandle Z3Builder::construct(ref<Expr> e, int *width_out) {
// TODO: We could potentially use Z3_simplify() here
// to store simpler expressions.
if (!UseConstructHashZ3 || isa<ConstantExpr>(e)) {
return constructActual(e, width_out);
} else {
ExprHashMap<std::pair<Z3ASTHandle, unsigned> >::iterator it =
constructed.find(e);
if (it != constructed.end()) {
if (width_out)
*width_out = it->second.second;
return it->second.first;
} else {
int width;
if (!width_out)
width_out = &width;
Z3ASTHandle res = constructActual(e, width_out);
constructed.insert(std::make_pair(e, std::make_pair(res, *width_out)));
return res;
}
}
}
/** if *width_out!=1 then result is a bitvector,
otherwise it is a bool */
Z3ASTHandle Z3Builder::constructActual(ref<Expr> e, int *width_out) {
int width;
if (!width_out)
width_out = &width;
++stats::queryConstructs;
switch (e->getKind()) {
case Expr::Constant: {
ConstantExpr *CE = cast<ConstantExpr>(e);
*width_out = CE->getWidth();
// Coerce to bool if necessary.
if (*width_out == 1)
return CE->isTrue() ? getTrue() : getFalse();
// Fast path.
if (*width_out <= 32)
return bvConst32(*width_out, CE->getZExtValue(32));
if (*width_out <= 64)
return bvConst64(*width_out, CE->getZExtValue());
ref<ConstantExpr> Tmp = CE;
Z3ASTHandle Res = bvConst64(64, Tmp->Extract(0, 64)->getZExtValue());
while (Tmp->getWidth() > 64) {
Tmp = Tmp->Extract(64, Tmp->getWidth() - 64);
unsigned Width = std::min(64U, Tmp->getWidth());
Res = Z3ASTHandle(
Z3_mk_concat(ctx,
bvConst64(Width, Tmp->Extract(0, Width)->getZExtValue()),
Res),
ctx);
}
return Res;
}
// Special
case Expr::NotOptimized: {
NotOptimizedExpr *noe = cast<NotOptimizedExpr>(e);
return construct(noe->src, width_out);
}
case Expr::Read: {
ReadExpr *re = cast<ReadExpr>(e);
assert(re && re->updates.root);
*width_out = re->updates.root->getRange();
return readExpr(getArrayForUpdate(re->updates.root, re->updates.head),
construct(re->index, 0));
}
case Expr::Select: {
SelectExpr *se = cast<SelectExpr>(e);
Z3ASTHandle cond = construct(se->cond, 0);
Z3ASTHandle tExpr = construct(se->trueExpr, width_out);
Z3ASTHandle fExpr = construct(se->falseExpr, width_out);
return iteExpr(cond, tExpr, fExpr);
}
case Expr::Concat: {
ConcatExpr *ce = cast<ConcatExpr>(e);
unsigned numKids = ce->getNumKids();
Z3ASTHandle res = construct(ce->getKid(numKids - 1), 0);
for (int i = numKids - 2; i >= 0; i--) {
res =
Z3ASTHandle(Z3_mk_concat(ctx, construct(ce->getKid(i), 0), res), ctx);
}
*width_out = ce->getWidth();
return res;
}
case Expr::Extract: {
ExtractExpr *ee = cast<ExtractExpr>(e);
Z3ASTHandle src = construct(ee->expr, width_out);
*width_out = ee->getWidth();
if (*width_out == 1) {
return bvBoolExtract(src, ee->offset);
} else {
return bvExtract(src, ee->offset + *width_out - 1, ee->offset);
}
}
// Casting
case Expr::ZExt: {
int srcWidth;
CastExpr *ce = cast<CastExpr>(e);
Z3ASTHandle src = construct(ce->src, &srcWidth);
*width_out = ce->getWidth();
if (srcWidth == 1) {
return iteExpr(src, bvOne(*width_out), bvZero(*width_out));
} else {
return Z3ASTHandle(Z3_mk_concat(ctx, bvZero(*width_out - srcWidth), src),
ctx);
}
}
case Expr::SExt: {
int srcWidth;
CastExpr *ce = cast<CastExpr>(e);
Z3ASTHandle src = construct(ce->src, &srcWidth);
*width_out = ce->getWidth();
if (srcWidth == 1) {
return iteExpr(src, bvMinusOne(*width_out), bvZero(*width_out));
} else {
return bvSignExtend(src, *width_out);
}
}
// Arithmetic
case Expr::Add: {
AddExpr *ae = cast<AddExpr>(e);
Z3ASTHandle left = construct(ae->left, width_out);
Z3ASTHandle right = construct(ae->right, width_out);
assert(*width_out != 1 && "uncanonicalized add");
Z3ASTHandle result = Z3ASTHandle(Z3_mk_bvadd(ctx, left, right), ctx);
assert(getBVLength(result) == static_cast<unsigned>(*width_out) &&
"width mismatch");
return result;
}
case Expr::Sub: {
SubExpr *se = cast<SubExpr>(e);
Z3ASTHandle left = construct(se->left, width_out);
Z3ASTHandle right = construct(se->right, width_out);
assert(*width_out != 1 && "uncanonicalized sub");
Z3ASTHandle result = Z3ASTHandle(Z3_mk_bvsub(ctx, left, right), ctx);
assert(getBVLength(result) == static_cast<unsigned>(*width_out) &&
"width mismatch");
return result;
}
case Expr::Mul: {
MulExpr *me = cast<MulExpr>(e);
Z3ASTHandle right = construct(me->right, width_out);
assert(*width_out != 1 && "uncanonicalized mul");
Z3ASTHandle left = construct(me->left, width_out);
Z3ASTHandle result = Z3ASTHandle(Z3_mk_bvmul(ctx, left, right), ctx);
assert(getBVLength(result) == static_cast<unsigned>(*width_out) &&
"width mismatch");
return result;
}
case Expr::UDiv: {
UDivExpr *de = cast<UDivExpr>(e);
Z3ASTHandle left = construct(de->left, width_out);
assert(*width_out != 1 && "uncanonicalized udiv");
if (ConstantExpr *CE = dyn_cast<ConstantExpr>(de->right)) {
if (CE->getWidth() <= 64) {
uint64_t divisor = CE->getZExtValue();
if (bits64::isPowerOfTwo(divisor))
return bvRightShift(left, bits64::indexOfSingleBit(divisor));
}
}
Z3ASTHandle right = construct(de->right, width_out);
Z3ASTHandle result = Z3ASTHandle(Z3_mk_bvudiv(ctx, left, right), ctx);
assert(getBVLength(result) == static_cast<unsigned>(*width_out) &&
"width mismatch");
return result;
}
case Expr::SDiv: {
SDivExpr *de = cast<SDivExpr>(e);
Z3ASTHandle left = construct(de->left, width_out);
assert(*width_out != 1 && "uncanonicalized sdiv");
Z3ASTHandle right = construct(de->right, width_out);
Z3ASTHandle result = Z3ASTHandle(Z3_mk_bvsdiv(ctx, left, right), ctx);
assert(getBVLength(result) == static_cast<unsigned>(*width_out) &&
"width mismatch");
return result;
}
case Expr::URem: {
URemExpr *de = cast<URemExpr>(e);
Z3ASTHandle left = construct(de->left, width_out);
assert(*width_out != 1 && "uncanonicalized urem");
if (ConstantExpr *CE = dyn_cast<ConstantExpr>(de->right)) {
if (CE->getWidth() <= 64) {
uint64_t divisor = CE->getZExtValue();
if (bits64::isPowerOfTwo(divisor)) {
unsigned bits = bits64::indexOfSingleBit(divisor);
// special case for modding by 1 or else we bvExtract -1:0
if (bits == 0) {
return bvZero(*width_out);
} else {
return Z3ASTHandle(Z3_mk_concat(ctx, bvZero(*width_out - bits),
bvExtract(left, bits - 1, 0)),
ctx);
}
}
}
}
Z3ASTHandle right = construct(de->right, width_out);
Z3ASTHandle result = Z3ASTHandle(Z3_mk_bvurem(ctx, left, right), ctx);
assert(getBVLength(result) == static_cast<unsigned>(*width_out) &&
"width mismatch");
return result;
}
case Expr::SRem: {
SRemExpr *de = cast<SRemExpr>(e);
Z3ASTHandle left = construct(de->left, width_out);
Z3ASTHandle right = construct(de->right, width_out);
assert(*width_out != 1 && "uncanonicalized srem");
// LLVM's srem instruction says that the sign follows the dividend
// (``left``).
// Z3's C API says ``Z3_mk_bvsrem()`` does this so these seem to match.
Z3ASTHandle result = Z3ASTHandle(Z3_mk_bvsrem(ctx, left, right), ctx);
assert(getBVLength(result) == static_cast<unsigned>(*width_out) &&
"width mismatch");
return result;
}
// Bitwise
case Expr::Not: {
NotExpr *ne = cast<NotExpr>(e);
Z3ASTHandle expr = construct(ne->expr, width_out);
if (*width_out == 1) {
return notExpr(expr);
} else {
return bvNotExpr(expr);
}
}
case Expr::And: {
AndExpr *ae = cast<AndExpr>(e);
Z3ASTHandle left = construct(ae->left, width_out);
Z3ASTHandle right = construct(ae->right, width_out);
if (*width_out == 1) {
return andExpr(left, right);
} else {
return bvAndExpr(left, right);
}
}
case Expr::Or: {
OrExpr *oe = cast<OrExpr>(e);
Z3ASTHandle left = construct(oe->left, width_out);
Z3ASTHandle right = construct(oe->right, width_out);
if (*width_out == 1) {
return orExpr(left, right);
} else {
return bvOrExpr(left, right);
}
}
case Expr::Xor: {
XorExpr *xe = cast<XorExpr>(e);
Z3ASTHandle left = construct(xe->left, width_out);
Z3ASTHandle right = construct(xe->right, width_out);
if (*width_out == 1) {
// XXX check for most efficient?
return iteExpr(left, Z3ASTHandle(notExpr(right)), right);
} else {
return bvXorExpr(left, right);
}
}
case Expr::Shl: {
ShlExpr *se = cast<ShlExpr>(e);
Z3ASTHandle left = construct(se->left, width_out);
assert(*width_out != 1 && "uncanonicalized shl");
if (ConstantExpr *CE = dyn_cast<ConstantExpr>(se->right)) {
return bvLeftShift(left, (unsigned)CE->getLimitedValue());
} else {
int shiftWidth;
Z3ASTHandle amount = construct(se->right, &shiftWidth);
return bvVarLeftShift(left, amount);
}
}
case Expr::LShr: {
LShrExpr *lse = cast<LShrExpr>(e);
Z3ASTHandle left = construct(lse->left, width_out);
assert(*width_out != 1 && "uncanonicalized lshr");
if (ConstantExpr *CE = dyn_cast<ConstantExpr>(lse->right)) {
return bvRightShift(left, (unsigned)CE->getLimitedValue());
} else {
int shiftWidth;
Z3ASTHandle amount = construct(lse->right, &shiftWidth);
return bvVarRightShift(left, amount);
}
}
case Expr::AShr: {
AShrExpr *ase = cast<AShrExpr>(e);
Z3ASTHandle left = construct(ase->left, width_out);
assert(*width_out != 1 && "uncanonicalized ashr");
if (ConstantExpr *CE = dyn_cast<ConstantExpr>(ase->right)) {
unsigned shift = (unsigned)CE->getLimitedValue();
Z3ASTHandle signedBool = bvBoolExtract(left, *width_out - 1);
return constructAShrByConstant(left, shift, signedBool);
} else {
int shiftWidth;
Z3ASTHandle amount = construct(ase->right, &shiftWidth);
return bvVarArithRightShift(left, amount);
}
}
// Comparison
case Expr::Eq: {
EqExpr *ee = cast<EqExpr>(e);
Z3ASTHandle left = construct(ee->left, width_out);
Z3ASTHandle right = construct(ee->right, width_out);
if (*width_out == 1) {
if (ConstantExpr *CE = dyn_cast<ConstantExpr>(ee->left)) {
if (CE->isTrue())
return right;
return notExpr(right);
} else {
return iffExpr(left, right);
}
} else {
*width_out = 1;
return eqExpr(left, right);
}
}
case Expr::Ult: {
UltExpr *ue = cast<UltExpr>(e);
Z3ASTHandle left = construct(ue->left, width_out);
Z3ASTHandle right = construct(ue->right, width_out);
assert(*width_out != 1 && "uncanonicalized ult");
*width_out = 1;
return bvLtExpr(left, right);
}
case Expr::Ule: {
UleExpr *ue = cast<UleExpr>(e);
Z3ASTHandle left = construct(ue->left, width_out);
Z3ASTHandle right = construct(ue->right, width_out);
assert(*width_out != 1 && "uncanonicalized ule");
*width_out = 1;
return bvLeExpr(left, right);
}
case Expr::Slt: {
SltExpr *se = cast<SltExpr>(e);
Z3ASTHandle left = construct(se->left, width_out);
Z3ASTHandle right = construct(se->right, width_out);
assert(*width_out != 1 && "uncanonicalized slt");
*width_out = 1;
return sbvLtExpr(left, right);
}
case Expr::Sle: {
SleExpr *se = cast<SleExpr>(e);
Z3ASTHandle left = construct(se->left, width_out);
Z3ASTHandle right = construct(se->right, width_out);
assert(*width_out != 1 && "uncanonicalized sle");
*width_out = 1;
return sbvLeExpr(left, right);
}
// unused due to canonicalization
#if 0
case Expr::Ne:
case Expr::Ugt:
case Expr::Uge:
case Expr::Sgt:
case Expr::Sge:
#endif
default:
assert(0 && "unhandled Expr type");
return getTrue();
}
}
#endif // ENABLE_Z3
|