Debian Codegraph @

test/regress/cli/regress1/proofs/add_two_base.smt2

raw
1 ; COMMAND-LINE: --lfsc-flatten --lfsc-expand-trust
2 ; EXPECT: unsat
3
4 (set-logic QF_UFLIRA)
5 (declare-sort FArray 2)
6
7
8 ;-------------------------------------------------------------------------------
9 ; Constants :
10 ;-------------------------------------------------------------------------------
11
12
13
14 ;-------------------------------------------------------------------------------
15 ; State variables :
16 ;-------------------------------------------------------------------------------
17
18 (declare-fun add_two.usr.a (Int) Real)
19 (declare-fun add_two.usr.b (Int) Real)
20 (declare-fun add_two.usr.c (Int) Real)
21 (declare-fun add_two.res.init_flag (Int) Bool)
22 (declare-fun add_two.impl.usr.P (Int) Bool)
23 (set-info :system "Logical transition system generated by Kind2")
24 (set-info :input "add_two.lus")
25
26
27
28 ;-------------------------------------------------------------------------------
29 ; Function symbols :
30 ;-------------------------------------------------------------------------------
31
32 (define-fun __node_init_add_two_0
33 ((add_two.usr.a@0 Real)
34 (add_two.usr.b@0 Real)
35 (add_two.usr.c@0 Real)
36 (add_two.res.init_flag@0 Bool)
37 (add_two.impl.usr.P@0 Bool)) Bool
38 (let
39 ((X1 (+ add_two.usr.a@0 add_two.usr.b@0)))
40 (and
41 (= add_two.usr.c@0 1.0)
42 (= add_two.impl.usr.P@0 (=> (and (> add_two.usr.a@0 0.0) (> add_two.usr.b@0 0.0)) (> add_two.usr.c@0 0.0)))
43 add_two.res.init_flag@0)))
44
45 (define-fun __node_trans_add_two_0
46 ((add_two.usr.a@1 Real)
47 (add_two.usr.b@1 Real)
48 (add_two.usr.c@1 Real)
49 (add_two.res.init_flag@1 Bool)
50 (add_two.impl.usr.P@1 Bool)
51 (add_two.usr.a@0 Real)
52 (add_two.usr.b@0 Real)
53 (add_two.usr.c@0 Real)
54 (add_two.res.init_flag@0 Bool)
55 (add_two.impl.usr.P@0 Bool)) Bool
56 (let
57 ((X1 (+ add_two.usr.a@1 add_two.usr.b@1)))
58 (and
59 (= add_two.usr.c@1 (ite (> add_two.usr.c@0 X1) add_two.usr.c@0 X1))
60 (= add_two.impl.usr.P@1 (=> (and (> add_two.usr.a@1 0.0) (> add_two.usr.b@1 0.0)) (> add_two.usr.c@1 0.0)))
61 (not add_two.res.init_flag@1))))
62
63
64
65 ;-------------------------------------------------------------------------------
66 ; Initial states :
67 ;-------------------------------------------------------------------------------
68
69 (define-fun I1 ((i Int)) Bool
70 (__node_init_add_two_0
71 (add_two.usr.a i)
72 (add_two.usr.b i)
73 (add_two.usr.c i)
74 (add_two.res.init_flag i)
75 (add_two.impl.usr.P i)))
76
77
78
79 ;-------------------------------------------------------------------------------
80 ; Transition_relation :
81 ;-------------------------------------------------------------------------------
82
83 (define-fun T1 ((i Int) (j Int)) Bool
84 (__node_trans_add_two_0
85 (add_two.usr.a j)
86 (add_two.usr.b j)
87 (add_two.usr.c j)
88 (add_two.res.init_flag j)
89 (add_two.impl.usr.P j)
90 (add_two.usr.a i)
91 (add_two.usr.b i)
92 (add_two.usr.c i)
93 (add_two.res.init_flag i)
94 (add_two.impl.usr.P i)))
95
96
97
98 ;-------------------------------------------------------------------------------
99 ; Original property :
100 ;-------------------------------------------------------------------------------
101
102 (define-fun P1 ((i Int)) Bool (add_two.impl.usr.P i))
103
104
105
106 ;-------------------------------------------------------------------------------
107 ; k-Inductive invariant :
108 ;-------------------------------------------------------------------------------
109
110 (define-fun PHI1 ((i Int)) Bool (add_two.impl.usr.P i))
111
112
113
114 ;-------------------------------------------------------------------------------
115 ; Base case :
116 ;-------------------------------------------------------------------------------
117
118 (assert (and (I1 0) (not (PHI1 0))))
119
120 (check-sat)
121 (exit)