metaSMT: Focus On Your Application Not On Solver Integration

Example: Integer Factorization / Prime Test (2)
SMT-Lib 2.0
metaSMT
1 ; declare v a r i a b l e s
1
2 ( declare−fun a ( ) ( _ BitVec 32)) 2 b i t v e c t o r a=new_bitvector (bw) ;
3 ( declare−fun b ( ) ( _ BitVec 32)) 3 b i t v e c t o r b=new_bitvector (bw) ;
4
5
6
; a ssert a∗b == r (1234567)
Solver State
( a s s e r t i o n (=
Every ( bvmul (partial) expression
4
5
6
a s s e r t i o n ( ctx ,
bvmul (
equal (
7
8
needs( solver ( _ zero_extend state
( ( _ zero_extend
32) a )
32) b ) )
7
8
zero_extend (bw, a ) ,
zero_extend (bw , b ) ) ,
9 ( _ bv1234567 64 )
9 b v u i n t (1234567 , 2∗bw)
10
11
12
) boolector_eq(btor, )
...)
; a and be must not be 1
( sword.addOperator(...)
a s s e r t i o n
10
11
12
) ) ;
a s s e r t i o n ( ctx ,
13 Z3_mk_eq(z3, ( not (= a ( _ bv1 ...) 3 2 ) ) ) ) 13 nequal ( a , b v u i n t ( 1 ,bw) ) ) ;
14 ( a s s e r t i o n
14 a s s e r t i o n ( ctx ,
15 ( not (= b ( _ bv1 3 2 ) ) ) ) 15 nequal ( b , b v u i n t ( 1 ,bw) ) ) ;
16
16
17 ( check−sat )
17 i f ( solve ( c t x ) )
18 ( get−value ( a ) )
18 read_value ( ctx , a ) ,
19 ( get−value ( b ) )
19 read_value ( ctx , b ) ;
5