| 1 |
; EXPECT: unsat |
| 2 |
(set-logic UFNIA) |
| 3 |
(declare-fun pow2 (Int) Int) |
| 4 |
(define-fun intmax ((k Int)) Int (- (pow2 k) 1)) |
| 5 |
(define-fun in_range ((k Int) (x Int)) Bool (and (>= x 0) (<= x (intmax k)))) |
| 6 |
(define-fun intudivtotal ((k Int) (a Int) (b Int)) Int (ite (= b 0) (- (pow2 k) 1) (div a b) )) |
| 7 |
(define-fun intmodtotal ((k Int) (a Int) (b Int)) Int (ite (= b 0) a (mod a b))) |
| 8 |
(define-fun intshl ((k Int) (a Int) (b Int)) Int (intmodtotal k (* a (pow2 b)) (pow2 k))) |
| 9 |
(define-fun intadd ((k Int) (a Int) (b Int) ) Int (intmodtotal k (+ a b) (pow2 k))) |
| 10 |
(define-fun pow2_base_cases () Bool (and (= (pow2 0) 1) (= (pow2 1) 2) (= (pow2 2) 4) (= (pow2 3) 8) ) ) |
| 11 |
;qf axioms |
| 12 |
(define-fun pow2_ax () Bool pow2_base_cases) |
| 13 |
(define-fun and_ax ((k Int)) Bool true) |
| 14 |
(define-fun or_ax ((k Int)) Bool true) |
| 15 |
(define-fun xor_ax ((k Int)) Bool true) |
| 16 |
; helpers |
| 17 |
(define-fun is_bv_width ((k Int)) Bool |
| 18 |
(and |
| 19 |
(> k 0) |
| 20 |
(and_ax k) |
| 21 |
(or_ax k) |
| 22 |
(xor_ax k) |
| 23 |
) |
| 24 |
) |
| 25 |
(define-fun is_bv_var ((k Int) (x Int)) Bool (in_range k x)) |
| 26 |
; problem start |
| 27 |
(assert pow2_ax) |
| 28 |
(assert (not (forall ((s Int) (t Int) (k Int)) |
| 29 |
(=> |
| 30 |
(and (is_bv_var k s) (is_bv_var k t) (is_bv_width k)) |
| 31 |
(= (intadd k t (intadd k s (intshl k s t))) (intadd k s (intadd k t (intshl k s t)))) |
| 32 |
) |
| 33 |
) |
| 34 |
)) |
| 35 |
(check-sat) |