Debian Codegraph @

src/plugins/wp/tests/wp_acsl/oracle/funvar_inv.1.res.oracle

raw
1 # frama-c -wp -wp-model 'Typed (Ref)' [...]
2 [kernel] Parsing funvar_inv.i (no preprocessing)
3 [wp] Running WP plugin...
4 [wp] Warning: Missing RTE guards
5 ------------------------------------------------------------
6 Function f
7 ------------------------------------------------------------
8
9 Goal Post-condition 'P_startof' in 'f':
10 Let a = global(G_G_20).
11 Let a_1 = shift_sint32(a, 0).
12 Assume {
13 Type: is_sint32(v) /\ is_sint32(Mint_0[shift_sint32(a, 1)]).
14 (* Goal *)
15 When: Mint_0[a_1] = 0.
16 (* Initializer *)
17 Init: Mint_0[global(L_i_27)] = 0.
18 If v <= 3
19 Then { (* Else *) Have: Mint_0[shift_sint32(a, v)] = 0. }
20 If 4 <= v
21 Then { Have: global(L_i_27) = f. }
22 Else { Have: shift_sint32(a, v) = f. }
23 }
24 Prove: a_1 = f.
25
26 ------------------------------------------------------------
27
28 Goal Post-condition 'P_addr' in 'f':
29 Let a = global(G_G_20).
30 Let x = Mint_0[shift_sint32(a, 0)].
31 Let a_1 = shift_sint32(a, 1).
32 Assume {
33 Type: is_sint32(v) /\ is_sint32(x).
34 (* Goal *)
35 When: (x != 0) /\ (Mint_0[a_1] = 0).
36 (* Initializer *)
37 Init: Mint_0[global(L_i_27)] = 0.
38 If v <= 3
39 Then { (* Else *) Have: Mint_0[shift_sint32(a, v)] = 0. }
40 If 4 <= v
41 Then { Have: global(L_i_27) = f. }
42 Else { Have: shift_sint32(a, v) = f. }
43 }
44 Prove: a_1 = f.
45
46 ------------------------------------------------------------
47
48 Goal Loop assigns 'qed_ok,index':
49 Prove: true.
50
51 ------------------------------------------------------------
52 ------------------------------------------------------------
53 Function f2
54 ------------------------------------------------------------
55
56 Goal Post-condition 'P_startof_shift' in 'f2':
57 Let a = global(G_G_20).
58 Let a_1 = shift_sint32(a, 0).
59 Assume {
60 Type: is_sint32(v) /\ is_sint32(Mint_0[shift_sint32(a, 1)]).
61 (* Goal *)
62 When: Mint_0[a_1] = 0.
63 (* Initializer *)
64 Init: Mint_0[global(L_i_32)] = 0.
65 If v <= 3
66 Then { (* Else *) Have: Mint_0[shift_sint32(a, v)] = 0. }
67 If 4 <= v
68 Then { Have: global(L_i_32) = f2_0. }
69 Else { Have: shift_sint32(a, v) = f2_0. }
70 }
71 Prove: a_1 = f2_0.
72
73 ------------------------------------------------------------
74
75 Goal Post-condition 'P_addr_shift' in 'f2':
76 Let a = global(G_G_20).
77 Let x = Mint_0[shift_sint32(a, 0)].
78 Let a_1 = shift_sint32(a, 1).
79 Assume {
80 Type: is_sint32(v) /\ is_sint32(x).
81 (* Goal *)
82 When: (x != 0) /\ (Mint_0[a_1] = 0).
83 (* Initializer *)
84 Init: Mint_0[global(L_i_32)] = 0.
85 If v <= 3
86 Then { (* Else *) Have: Mint_0[shift_sint32(a, v)] = 0. }
87 If 4 <= v
88 Then { Have: global(L_i_32) = f2_0. }
89 Else { Have: shift_sint32(a, v) = f2_0. }
90 }
91 Prove: a_1 = f2_0.
92
93 ------------------------------------------------------------
94
95 Goal Loop assigns 'qed_ok,index':
96 Prove: true.
97
98 ------------------------------------------------------------
99 ------------------------------------------------------------
100 Function g
101 ------------------------------------------------------------
102
103 Goal Post-condition 'P_addr_startof_shift' in 'g':
104 Let a = global(G_G_20).
105 Let a_1 = shift_sint32(a, 0).
106 Assume {
107 Type: is_sint32(v) /\ is_sint32(Mint_0[shift_sint32(a, 1)]).
108 (* Goal *)
109 When: Mint_0[a_1] = 0.
110 (* Initializer *)
111 Init: Mint_0[global(L_i_37)] = 0.
112 If v <= 3
113 Then { (* Else *) Have: Mint_0[shift_sint32(a, v)] = 0. }
114 If 4 <= v
115 Then { Have: global(L_i_37) = g. }
116 Else { Have: shift_sint32(a, v) = g. }
117 }
118 Prove: a_1 = g.
119
120 ------------------------------------------------------------
121
122 Goal Post-condition 'P_addr_addr_shift' in 'g':
123 Let a = global(G_G_20).
124 Let x = Mint_0[shift_sint32(a, 0)].
125 Let a_1 = shift_sint32(a, 1).
126 Assume {
127 Type: is_sint32(v) /\ is_sint32(x).
128 (* Goal *)
129 When: (x != 0) /\ (Mint_0[a_1] = 0).
130 (* Initializer *)
131 Init: Mint_0[global(L_i_37)] = 0.
132 If v <= 3
133 Then { (* Else *) Have: Mint_0[shift_sint32(a, v)] = 0. }
134 If 4 <= v
135 Then { Have: global(L_i_37) = g. }
136 Else { Have: shift_sint32(a, v) = g. }
137 }
138 Prove: a_1 = g.
139
140 ------------------------------------------------------------
141
142 Goal Loop assigns 'qed_ok':
143 Prove: true.
144
145 ------------------------------------------------------------