| 1 |
; COMMAND-LINE: --sygus-inst |
| 2 |
(set-info :smt-lib-version 2.6) |
| 3 |
(set-logic UFNIA) |
| 4 |
(set-info :source | |
| 5 |
Generated by: Mathias Preiner |
| 6 |
Generated on: 2019-03-22 |
| 7 |
Application: Verifying bit-vector rewrite rule candidates independent from bit-width. |
| 8 |
Target solver: CVC4, Z3, Vampire |
| 9 |
Publications: "Towards Bit-Width-Independent Proofs in SMT Solvers " by A. Niemetz, M. Preiner, A. Reynolds, Y. Zohar, C. Barrett, and C. Tinelli, CADE-27 (2019). |
| 10 |
|) |
| 11 |
(set-info :license "https://creativecommons.org/licenses/by/4.0/") |
| 12 |
(set-info :category "crafted") |
| 13 |
(set-info :status sat) |
| 14 |
(declare-fun p2 (Int) Int) |
| 15 |
(declare-fun intand (Int Int Int) Int) |
| 16 |
(declare-fun intor (Int Int Int) Int) |
| 17 |
(declare-fun intxor (Int Int Int) Int) |
| 18 |
(define-fun bitof ((k Int) (l Int) (a Int)) Int (mod (div a (p2 l)) 2)) |
| 19 |
(define-fun int_all_but_msb ((k Int) (a Int)) Int (mod a (p2 (- k 1)))) |
| 20 |
(define-fun intmax ((k Int)) Int (- (p2 k) 1)) |
| 21 |
(define-fun intmin ((k Int)) Int 0) |
| 22 |
(define-fun in_range ((k Int) (x Int)) Bool (and (>= x 0) (<= x (intmax k)))) |
| 23 |
(define-fun intudivtotal ((k Int) (a Int) (b Int)) Int (ite (= b 0) (- (p2 k) 1) (div a b) )) |
| 24 |
(define-fun intmodtotal ((k Int) (a Int) (b Int)) Int (ite (= b 0) a (mod a b))) |
| 25 |
(define-fun intneg ((k Int) (a Int)) Int (intmodtotal k (- (p2 k) a) (p2 k))) |
| 26 |
(define-fun intnot ((k Int) (a Int)) Int (- (intmax k) a)) |
| 27 |
(define-fun intmins ((k Int)) Int (p2 (- k 1))) |
| 28 |
(define-fun intmaxs ((k Int)) Int (intnot k (intmins k))) |
| 29 |
(define-fun intshl ((k Int) (a Int) (b Int)) Int (intmodtotal k (* a (p2 b)) (p2 k))) |
| 30 |
(define-fun intlshr ((k Int) (a Int) (b Int)) Int (intmodtotal k (intudivtotal k a (p2 b)) (p2 k))) |
| 31 |
(define-fun intashr ((k Int) (a Int) (b Int) ) Int (ite (= (bitof k (- k 1) a) 0) (intlshr k a b) (intnot k (intlshr k (intnot k a) b)))) |
| 32 |
(define-fun intconcat ((k Int) (m Int) (a Int) (b Int)) Int (+ (* a (p2 m)) b)) |
| 33 |
(define-fun intadd ((k Int) (a Int) (b Int) ) Int (intmodtotal k (+ a b) (p2 k))) |
| 34 |
(define-fun intmul ((k Int) (a Int) (b Int)) Int (intmodtotal k (* a b) (p2 k))) |
| 35 |
(define-fun intsub ((k Int) (a Int) (b Int)) Int (intadd k a (intneg k b))) |
| 36 |
(define-fun unsigned_to_signed ((k Int) (x Int)) Int (- (* 2 (int_all_but_msb k x)) x)) |
| 37 |
(define-fun intslt ((k Int) (a Int) (b Int)) Bool (< (unsigned_to_signed k a) (unsigned_to_signed k b)) ) |
| 38 |
(define-fun intsgt ((k Int) (a Int) (b Int)) Bool (> (unsigned_to_signed k a) (unsigned_to_signed k b)) ) |
| 39 |
(define-fun intsle ((k Int) (a Int) (b Int)) Bool (<= (unsigned_to_signed k a) (unsigned_to_signed k b)) ) |
| 40 |
(define-fun intsge ((k Int) (a Int) (b Int)) Bool (>= (unsigned_to_signed k a) (unsigned_to_signed k b)) ) |
| 41 |
(define-fun p2_base_cases () Bool (and (= (p2 0) 1) (= (p2 1) 2) (= (p2 2) 4) (= (p2 3) 8) ) ) |
| 42 |
;qf axioms |
| 43 |
(define-fun p2_ax () Bool p2_base_cases) |
| 44 |
(define-fun and_ax ((k Int)) Bool true) |
| 45 |
(define-fun or_ax ((k Int)) Bool true) |
| 46 |
(define-fun xor_ax ((k Int)) Bool true) |
| 47 |
|
| 48 |
; helpers |
| 49 |
(define-fun is_bv_width ((k Int)) Bool |
| 50 |
(and |
| 51 |
(> k 0) |
| 52 |
(and_ax k) |
| 53 |
(or_ax k) |
| 54 |
(xor_ax k) |
| 55 |
) |
| 56 |
) |
| 57 |
|
| 58 |
(define-fun is_bv_var ((k Int) (x Int)) Bool (in_range k x)) |
| 59 |
|
| 60 |
|
| 61 |
; problem start |
| 62 |
(assert p2_ax) |
| 63 |
(assert (not (forall ((s Int) (t Int) (k Int)) |
| 64 |
(=> |
| 65 |
(and (is_bv_var k s) (is_bv_var k t) (is_bv_width k)) |
| 66 |
(= (intshl k (intor k t (intnot k t)) t) (intshl k (intnot k (intlshr k s s)) t)) |
| 67 |
) |
| 68 |
) |
| 69 |
)) |
| 70 |
(set-info :status unknown) |
| 71 |
(check-sat) |
| 72 |
(exit) |