Debian Codegraph @

src/plugins/wp/tests/wp_acsl/oracle/init_value.0.res.oracle

raw
1 # frama-c -wp -wp-no-let [...]
2 [kernel] Parsing init_value.i (no preprocessing)
3 [wp] Running WP plugin...
4 [wp] Warning: Missing RTE guards
5 ------------------------------------------------------------
6 Function fa1
7 ------------------------------------------------------------
8
9 Goal Post-condition 'qed_ok' in 'fa1':
10 Let x = ta1_0[4].
11 Let x_1 = ta1_0[0].
12 Let x_2 = ta1_0[1].
13 Let x_3 = ta1_0[3].
14 Assume {
15 Type: is_sint32(x_1) /\ is_sint32(x_2) /\ is_sint32(x_3) /\ is_sint32(x).
16 (* Heap *)
17 Type: IsArray_sint32(ta1_0).
18 (* Initializer *)
19 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (ta1_0[i] = 0))).
20 (* Initializer *)
21 Init: ta1_0[2] = 1.
22 (* Initializer *)
23 Init: x = 1.
24 (* Initializer *)
25 Init: forall i : Z. ((3 <= i) -> ((i <= 3) -> (ta1_0[i] = 0))).
26 }
27 Prove: (x_2 = x_1) /\ (x_3 = x_2).
28
29 ------------------------------------------------------------
30
31 Goal Post-condition 'qed_ko' in 'fa1':
32 Let x = ta1_0[4].
33 Assume {
34 Type: is_sint32(ta1_0[0]) /\ is_sint32(ta1_0[1]) /\ is_sint32(ta1_0[3]) /\
35 is_sint32(x).
36 (* Heap *)
37 Type: IsArray_sint32(ta1_0).
38 (* Initializer *)
39 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (ta1_0[i] = 0))).
40 (* Initializer *)
41 Init: ta1_0[2] = 1.
42 (* Initializer *)
43 Init: x = 1.
44 (* Initializer *)
45 Init: forall i : Z. ((3 <= i) -> ((i <= 3) -> (ta1_0[i] = 0))).
46 }
47 Prove: x = 0.
48
49 ------------------------------------------------------------
50
51 Goal Post-condition 'qed_ko' in 'fa1':
52 Let x = ta1_0[4].
53 Let x_1 = ta1_0[3].
54 Assume {
55 Type: is_sint32(ta1_0[0]) /\ is_sint32(ta1_0[1]) /\ is_sint32(x_1) /\
56 is_sint32(x).
57 (* Heap *)
58 Type: IsArray_sint32(ta1_0).
59 (* Initializer *)
60 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (ta1_0[i] = 0))).
61 (* Initializer *)
62 Init: ta1_0[2] = 1.
63 (* Initializer *)
64 Init: x = 1.
65 (* Initializer *)
66 Init: forall i : Z. ((3 <= i) -> ((i <= 3) -> (ta1_0[i] = 0))).
67 }
68 Prove: x_1 = 1.
69
70 ------------------------------------------------------------
71 ------------------------------------------------------------
72 Function fa2
73 ------------------------------------------------------------
74
75 Goal Post-condition 'qed_ok' in 'fa2':
76 Let x = ta2_0[0].
77 Let x_1 = ta2_0[1].
78 Let x_2 = ta2_0[4].
79 Assume {
80 Type: is_sint32(x) /\ is_sint32(x_1) /\ is_sint32(x_2).
81 (* Heap *)
82 Type: IsArray_sint32(ta2_0).
83 (* Initializer *)
84 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (ta2_0[i] = 0))).
85 (* Initializer *)
86 Init: forall i : Z. ((2 <= i) -> ((i <= 3) -> (ta2_0[i] = 1))).
87 (* Initializer *)
88 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (ta2_0[i] = 0))).
89 }
90 Prove: (x_1 = x) /\ (x_2 = x_1).
91
92 ------------------------------------------------------------
93
94 Goal Post-condition 'qed_ko' in 'fa2':
95 Let x = ta2_0[4].
96 Assume {
97 Type: is_sint32(ta2_0[0]) /\ is_sint32(ta2_0[1]) /\ is_sint32(x).
98 (* Heap *)
99 Type: IsArray_sint32(ta2_0).
100 (* Initializer *)
101 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (ta2_0[i] = 0))).
102 (* Initializer *)
103 Init: forall i : Z. ((2 <= i) -> ((i <= 3) -> (ta2_0[i] = 1))).
104 (* Initializer *)
105 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (ta2_0[i] = 0))).
106 }
107 Prove: x = 1.
108
109 ------------------------------------------------------------
110
111 Goal Post-condition 'qed_ko' in 'fa2':
112 Let x = ta2_0[1].
113 Assume {
114 Type: is_sint32(ta2_0[0]) /\ is_sint32(x) /\ is_sint32(ta2_0[4]).
115 (* Heap *)
116 Type: IsArray_sint32(ta2_0).
117 (* Initializer *)
118 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (ta2_0[i] = 0))).
119 (* Initializer *)
120 Init: forall i : Z. ((2 <= i) -> ((i <= 3) -> (ta2_0[i] = 1))).
121 (* Initializer *)
122 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (ta2_0[i] = 0))).
123 }
124 Prove: x = 1.
125
126 ------------------------------------------------------------
127 ------------------------------------------------------------
128 Function fa3
129 ------------------------------------------------------------
130
131 Goal Post-condition 'qed_ok' in 'fa3':
132 Let x = ta1_0[4].
133 Let x_1 = ta1_0[2].
134 Let x_2 = ta3_0[0].
135 Let x_3 = ta3_0[2].
136 Assume {
137 Type: is_sint32(x_1) /\ is_sint32(x) /\ is_sint32(ta2_0[4]) /\
138 is_sint32(x_2) /\ is_sint32(x_3).
139 (* Heap *)
140 Type: IsArray_sint32(ta1_0) /\ IsArray_sint32(ta2_0) /\
141 IsArray_sint32(ta3_0).
142 (* Initializer *)
143 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (ta1_0[i] = 0))).
144 (* Initializer *)
145 Init: x_1 = 1.
146 (* Initializer *)
147 Init: x = 1.
148 (* Initializer *)
149 Init: forall i : Z. ((3 <= i) -> ((i <= 3) -> (ta1_0[i] = 0))).
150 (* Initializer *)
151 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (ta2_0[i] = 0))).
152 (* Initializer *)
153 Init: forall i : Z. ((2 <= i) -> ((i <= 3) -> (ta2_0[i] = 1))).
154 (* Initializer *)
155 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (ta2_0[i] = 0))).
156 (* Initializer *)
157 Init: forall i : Z. ((i <= 0) -> ((0 <= i) -> (ta3_0[i] = 0))).
158 (* Initializer *)
159 Init: ta3_0[1] = 1.
160 (* Initializer *)
161 Init: ta3_0[3] = 1.
162 (* Initializer *)
163 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (ta3_0[i] = 0))).
164 (* Initializer *)
165 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (ta3_0[i] = 0))).
166 }
167 Prove: (x = x_1) /\ (x_3 = x_2).
168
169 ------------------------------------------------------------
170
171 Goal Post-condition 'qed_ko' in 'fa3':
172 Let x = ta1_0[4].
173 Let x_1 = ta1_0[2].
174 Let x_2 = ta3_0[0].
175 Assume {
176 Type: is_sint32(x_1) /\ is_sint32(x) /\ is_sint32(ta2_0[4]) /\
177 is_sint32(x_2) /\ is_sint32(ta3_0[2]).
178 (* Heap *)
179 Type: IsArray_sint32(ta1_0) /\ IsArray_sint32(ta2_0) /\
180 IsArray_sint32(ta3_0).
181 (* Initializer *)
182 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (ta1_0[i] = 0))).
183 (* Initializer *)
184 Init: x_1 = 1.
185 (* Initializer *)
186 Init: x = 1.
187 (* Initializer *)
188 Init: forall i : Z. ((3 <= i) -> ((i <= 3) -> (ta1_0[i] = 0))).
189 (* Initializer *)
190 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (ta2_0[i] = 0))).
191 (* Initializer *)
192 Init: forall i : Z. ((2 <= i) -> ((i <= 3) -> (ta2_0[i] = 1))).
193 (* Initializer *)
194 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (ta2_0[i] = 0))).
195 (* Initializer *)
196 Init: forall i : Z. ((i <= 0) -> ((0 <= i) -> (ta3_0[i] = 0))).
197 (* Initializer *)
198 Init: ta3_0[1] = 1.
199 (* Initializer *)
200 Init: ta3_0[3] = 1.
201 (* Initializer *)
202 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (ta3_0[i] = 0))).
203 (* Initializer *)
204 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (ta3_0[i] = 0))).
205 }
206 Prove: x_2 = 1.
207
208 ------------------------------------------------------------
209
210 Goal Post-condition 'qed_ko' in 'fa3':
211 Let x = ta1_0[4].
212 Let x_1 = ta1_0[2].
213 Let x_2 = ta3_0[2].
214 Assume {
215 Type: is_sint32(x_1) /\ is_sint32(x) /\ is_sint32(ta2_0[4]) /\
216 is_sint32(ta3_0[0]) /\ is_sint32(x_2).
217 (* Heap *)
218 Type: IsArray_sint32(ta1_0) /\ IsArray_sint32(ta2_0) /\
219 IsArray_sint32(ta3_0).
220 (* Initializer *)
221 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (ta1_0[i] = 0))).
222 (* Initializer *)
223 Init: x_1 = 1.
224 (* Initializer *)
225 Init: x = 1.
226 (* Initializer *)
227 Init: forall i : Z. ((3 <= i) -> ((i <= 3) -> (ta1_0[i] = 0))).
228 (* Initializer *)
229 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (ta2_0[i] = 0))).
230 (* Initializer *)
231 Init: forall i : Z. ((2 <= i) -> ((i <= 3) -> (ta2_0[i] = 1))).
232 (* Initializer *)
233 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (ta2_0[i] = 0))).
234 (* Initializer *)
235 Init: forall i : Z. ((i <= 0) -> ((0 <= i) -> (ta3_0[i] = 0))).
236 (* Initializer *)
237 Init: ta3_0[1] = 1.
238 (* Initializer *)
239 Init: ta3_0[3] = 1.
240 (* Initializer *)
241 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (ta3_0[i] = 0))).
242 (* Initializer *)
243 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (ta3_0[i] = 0))).
244 }
245 Prove: x_2 = 1.
246
247 ------------------------------------------------------------
248
249 Goal Post-condition 'qed_ko' in 'fa3':
250 Let x = ta1_0[4].
251 Let x_1 = ta1_0[2].
252 Let x_2 = ta2_0[4].
253 Assume {
254 Type: is_sint32(x_1) /\ is_sint32(x) /\ is_sint32(x_2) /\
255 is_sint32(ta3_0[0]) /\ is_sint32(ta3_0[2]).
256 (* Heap *)
257 Type: IsArray_sint32(ta1_0) /\ IsArray_sint32(ta2_0) /\
258 IsArray_sint32(ta3_0).
259 (* Initializer *)
260 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (ta1_0[i] = 0))).
261 (* Initializer *)
262 Init: x_1 = 1.
263 (* Initializer *)
264 Init: x = 1.
265 (* Initializer *)
266 Init: forall i : Z. ((3 <= i) -> ((i <= 3) -> (ta1_0[i] = 0))).
267 (* Initializer *)
268 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (ta2_0[i] = 0))).
269 (* Initializer *)
270 Init: forall i : Z. ((2 <= i) -> ((i <= 3) -> (ta2_0[i] = 1))).
271 (* Initializer *)
272 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (ta2_0[i] = 0))).
273 (* Initializer *)
274 Init: forall i : Z. ((i <= 0) -> ((0 <= i) -> (ta3_0[i] = 0))).
275 (* Initializer *)
276 Init: ta3_0[1] = 1.
277 (* Initializer *)
278 Init: ta3_0[3] = 1.
279 (* Initializer *)
280 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (ta3_0[i] = 0))).
281 (* Initializer *)
282 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (ta3_0[i] = 0))).
283 }
284 Prove: x_2 = 1.
285
286 ------------------------------------------------------------
287 ------------------------------------------------------------
288 Function fs1
289 ------------------------------------------------------------
290
291 Goal Post-condition 'qed_ok' in 'fs1':
292 Let a = ts1_0[2].
293 Let x = a.F5_c.
294 Let x_1 = a.F5_b.
295 Let x_2 = a.F5_a.
296 Let a_1 = ts1_0[0].
297 Let a_2 = ts1_0[1].
298 Let a_3 = ts1_0[3].
299 Assume {
300 Type: IsS5(a_1) /\ IsS5(a_2) /\ IsS5(a_3) /\ is_sint32(a_1.F5_a) /\
301 is_sint32(x_2) /\ is_sint32(x_1) /\ is_sint32(x).
302 (* Heap *)
303 Type: IsArray_S5(ts1_0).
304 (* Initializer *)
305 Init: forall i : Z. let a_4 = ts1_0[i] in ((0 <= i) -> ((i <= 1) ->
306 (((a_4.F5_a) = 0) /\ ((a_4.F5_b) = 0) /\ ((a_4.F5_c) = 0)))).
307 (* Initializer *)
308 Init: x_2 = 1.
309 (* Initializer *)
310 Init: x_1 = 1.
311 (* Initializer *)
312 Init: x = 0.
313 (* Initializer *)
314 Init: forall i : Z. let a_4 = ts1_0[i] in ((3 <= i) -> ((i <= 3) ->
315 (((a_4.F5_a) = 0) /\ ((a_4.F5_b) = 0) /\ ((a_4.F5_c) = 0)))).
316 }
317 Prove: (x_1 = x_2) /\ EqS5(a_1, a_2) /\ EqS5(a_2, a_3).
318
319 ------------------------------------------------------------
320
321 Goal Post-condition 'qed_ko' in 'fs1':
322 Let a = ts1_0[2].
323 Let x = a.F5_c.
324 Let x_1 = a.F5_b.
325 Let x_2 = a.F5_a.
326 Let a_1 = ts1_0[0].
327 Assume {
328 Type: IsS5(a_1) /\ IsS5(ts1_0[1]) /\ IsS5(ts1_0[3]) /\
329 is_sint32(a_1.F5_a) /\ is_sint32(x_2) /\ is_sint32(x_1) /\
330 is_sint32(x).
331 (* Heap *)
332 Type: IsArray_S5(ts1_0).
333 (* Initializer *)
334 Init: forall i : Z. let a_2 = ts1_0[i] in ((0 <= i) -> ((i <= 1) ->
335 (((a_2.F5_a) = 0) /\ ((a_2.F5_b) = 0) /\ ((a_2.F5_c) = 0)))).
336 (* Initializer *)
337 Init: x_2 = 1.
338 (* Initializer *)
339 Init: x_1 = 1.
340 (* Initializer *)
341 Init: x = 0.
342 (* Initializer *)
343 Init: forall i : Z. let a_2 = ts1_0[i] in ((3 <= i) -> ((i <= 3) ->
344 (((a_2.F5_a) = 0) /\ ((a_2.F5_b) = 0) /\ ((a_2.F5_c) = 0)))).
345 }
346 Prove: x = 1.
347
348 ------------------------------------------------------------
349
350 Goal Post-condition 'qed_ko' in 'fs1':
351 Let a = ts1_0[2].
352 Let x = a.F5_c.
353 Let x_1 = a.F5_b.
354 Let x_2 = a.F5_a.
355 Let a_1 = ts1_0[0].
356 Let x_3 = a_1.F5_a.
357 Assume {
358 Type: IsS5(a_1) /\ IsS5(ts1_0[1]) /\ IsS5(ts1_0[3]) /\ is_sint32(x_3) /\
359 is_sint32(x_2) /\ is_sint32(x_1) /\ is_sint32(x).
360 (* Heap *)
361 Type: IsArray_S5(ts1_0).
362 (* Initializer *)
363 Init: forall i : Z. let a_2 = ts1_0[i] in ((0 <= i) -> ((i <= 1) ->
364 (((a_2.F5_a) = 0) /\ ((a_2.F5_b) = 0) /\ ((a_2.F5_c) = 0)))).
365 (* Initializer *)
366 Init: x_2 = 1.
367 (* Initializer *)
368 Init: x_1 = 1.
369 (* Initializer *)
370 Init: x = 0.
371 (* Initializer *)
372 Init: forall i : Z. let a_2 = ts1_0[i] in ((3 <= i) -> ((i <= 3) ->
373 (((a_2.F5_a) = 0) /\ ((a_2.F5_b) = 0) /\ ((a_2.F5_c) = 0)))).
374 }
375 Prove: x_3 = 1.
376
377 ------------------------------------------------------------
378 ------------------------------------------------------------
379 Function main
380 ------------------------------------------------------------
381
382 Goal Pre-condition 'qed_ok,Struct_Simple_a' in 'main':
383 Let x = u.F4_U_a.
384 Let a = sq0_0.F3_Sc_b.
385 Let x_1 = sc3_0.F3_Sc_c.
386 Let a_1 = sc3_0.F3_Sc_b.
387 Let a_2 = a_1[2].
388 Let x_2 = sc2_0.F3_Sc_c.
389 Let a_3 = sc2_0.F3_Sc_b.
390 Let a_4 = sc1_0.F3_Sc_b.
391 Let a_5 = sc0_0.F3_Sc_b.
392 Let a_6 = st_0.F2_St_tab.
393 Let a_7 = a_6[3].
394 Let x_3 = t[0].
395 Let x_4 = s.F1_S_b.
396 Let x_5 = s.F1_S_a.
397 Assume {
398 Type: IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\ is_uint8(tab_0[5]) /\
399 is_sint16(x) /\ is_sint32(x_3) /\ is_sint32(t[1]) /\
400 is_sint32(t1_0[4]) /\ is_sint32(x_5) /\ is_sint32(x_4) /\
401 is_sint32(x_2) /\ is_sint32(x_1) /\ is_sint32(a_3[2]) /\
402 is_sint32(a_2) /\ is_sint32(a[1]) /\ is_sint32(a[2]) /\
403 is_sint32(a_7) /\ is_sint32(a_6[5]).
404 (* Heap *)
405 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
406 IsS1_S(s) /\ IsS2_St(st_0) /\ IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\
407 IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsS3_Sc(sq0_0) /\ IsU4_U(u).
408 (* Initializer *)
409 Init: x_5 = 2.
410 (* Initializer *)
411 Init: x_4 = 0.
412 (* Initializer *)
413 Init: x_3 = 1.
414 (* Initializer *)
415 Init: forall i : Z. ((0 < i) -> ((i <= 1) -> (t[i] = 0))).
416 (* Initializer *)
417 Init: forall i : Z. ((0 <= i) -> ((i <= 3) -> (t1_0[i] = 1))).
418 (* Initializer *)
419 Init: forall i : Z. ((5 <= i) -> ((i <= 6) -> (t1_0[i] = 2))).
420 (* Initializer *)
421 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (t1_0[i] = 0))).
422 (* Initializer *)
423 Init: forall i : Z. ((7 <= i) -> ((i <= 9) -> (t1_0[i] = 0))).
424 (* Initializer *)
425 Init: a_6[0] = 1.
426 (* Initializer *)
427 Init: a_6[1] = 2.
428 (* Initializer *)
429 Init: a_6[2] = 3.
430 (* Initializer *)
431 Init: a_7 = 4.
432 (* Initializer *)
433 Init: forall i : Z. ((4 <= i) -> ((i <= 9) -> (a_6[i] = 0))).
434 (* Initializer *)
435 Init: (sc0_0.F3_Sc_a) = 1.
436 (* Initializer *)
437 Init: a_5[0] = 2.
438 (* Initializer *)
439 Init: a_5[1] = 3.
440 (* Initializer *)
441 Init: a_5[2] = 4.
442 (* Initializer *)
443 Init: (sc0_0.F3_Sc_c) = 5.
444 (* Initializer *)
445 Init: (sc1_0.F3_Sc_a) = 1.
446 (* Initializer *)
447 Init: a_4[0] = 2.
448 (* Initializer *)
449 Init: a_4[1] = 3.
450 (* Initializer *)
451 Init: a_4[2] = 4.
452 (* Initializer *)
453 Init: (sc1_0.F3_Sc_c) = 5.
454 (* Initializer *)
455 Init: (sc2_0.F3_Sc_a) = 1.
456 (* Initializer *)
457 Init: a_3[0] = 2.
458 (* Initializer *)
459 Init: a_3[1] = 3.
460 (* Initializer *)
461 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a_3[i] = 0))).
462 (* Initializer *)
463 Init: x_2 = 4.
464 (* Initializer *)
465 Init: (sc3_0.F3_Sc_a) = 1.
466 (* Initializer *)
467 Init: a_1[0] = 2.
468 (* Initializer *)
469 Init: a_1[1] = 3.
470 (* Initializer *)
471 Init: a_2 = 4.
472 (* Initializer *)
473 Init: x_1 = 0.
474 (* Initializer *)
475 Init: (sq0_0.F3_Sc_a) = 2.
476 (* Initializer *)
477 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (a[i] = 2))).
478 (* Initializer *)
479 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a[i] = 0))).
480 (* Initializer *)
481 Init: (sq0_0.F3_Sc_c) = 2.
482 (* Initializer *)
483 Init: forall i : Z. ((0 <= i) -> ((i <= 31) -> (tab_0[i] = 0))).
484 (* Initializer *)
485 Init: x = (-1).
486 }
487 Prove: x_5 = 2.
488
489 ------------------------------------------------------------
490
491 Goal Pre-condition 'qed_ok,Struct_Simple_b' in 'main':
492 Let x = u.F4_U_a.
493 Let a = sq0_0.F3_Sc_b.
494 Let x_1 = sc3_0.F3_Sc_c.
495 Let a_1 = sc3_0.F3_Sc_b.
496 Let a_2 = a_1[2].
497 Let x_2 = sc2_0.F3_Sc_c.
498 Let a_3 = sc2_0.F3_Sc_b.
499 Let a_4 = sc1_0.F3_Sc_b.
500 Let a_5 = sc0_0.F3_Sc_b.
501 Let a_6 = st_0.F2_St_tab.
502 Let a_7 = a_6[3].
503 Let x_3 = t[0].
504 Let x_4 = s.F1_S_b.
505 Let x_5 = s.F1_S_a.
506 Assume {
507 Type: IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\ is_uint8(tab_0[5]) /\
508 is_sint16(x) /\ is_sint32(x_3) /\ is_sint32(t[1]) /\
509 is_sint32(t1_0[4]) /\ is_sint32(x_5) /\ is_sint32(x_4) /\
510 is_sint32(x_2) /\ is_sint32(x_1) /\ is_sint32(a_3[2]) /\
511 is_sint32(a_2) /\ is_sint32(a[1]) /\ is_sint32(a[2]) /\
512 is_sint32(a_7) /\ is_sint32(a_6[5]).
513 (* Heap *)
514 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
515 IsS1_S(s) /\ IsS2_St(st_0) /\ IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\
516 IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsS3_Sc(sq0_0) /\ IsU4_U(u).
517 (* Initializer *)
518 Init: x_5 = 2.
519 (* Initializer *)
520 Init: x_4 = 0.
521 (* Initializer *)
522 Init: x_3 = 1.
523 (* Initializer *)
524 Init: forall i : Z. ((0 < i) -> ((i <= 1) -> (t[i] = 0))).
525 (* Initializer *)
526 Init: forall i : Z. ((0 <= i) -> ((i <= 3) -> (t1_0[i] = 1))).
527 (* Initializer *)
528 Init: forall i : Z. ((5 <= i) -> ((i <= 6) -> (t1_0[i] = 2))).
529 (* Initializer *)
530 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (t1_0[i] = 0))).
531 (* Initializer *)
532 Init: forall i : Z. ((7 <= i) -> ((i <= 9) -> (t1_0[i] = 0))).
533 (* Initializer *)
534 Init: a_6[0] = 1.
535 (* Initializer *)
536 Init: a_6[1] = 2.
537 (* Initializer *)
538 Init: a_6[2] = 3.
539 (* Initializer *)
540 Init: a_7 = 4.
541 (* Initializer *)
542 Init: forall i : Z. ((4 <= i) -> ((i <= 9) -> (a_6[i] = 0))).
543 (* Initializer *)
544 Init: (sc0_0.F3_Sc_a) = 1.
545 (* Initializer *)
546 Init: a_5[0] = 2.
547 (* Initializer *)
548 Init: a_5[1] = 3.
549 (* Initializer *)
550 Init: a_5[2] = 4.
551 (* Initializer *)
552 Init: (sc0_0.F3_Sc_c) = 5.
553 (* Initializer *)
554 Init: (sc1_0.F3_Sc_a) = 1.
555 (* Initializer *)
556 Init: a_4[0] = 2.
557 (* Initializer *)
558 Init: a_4[1] = 3.
559 (* Initializer *)
560 Init: a_4[2] = 4.
561 (* Initializer *)
562 Init: (sc1_0.F3_Sc_c) = 5.
563 (* Initializer *)
564 Init: (sc2_0.F3_Sc_a) = 1.
565 (* Initializer *)
566 Init: a_3[0] = 2.
567 (* Initializer *)
568 Init: a_3[1] = 3.
569 (* Initializer *)
570 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a_3[i] = 0))).
571 (* Initializer *)
572 Init: x_2 = 4.
573 (* Initializer *)
574 Init: (sc3_0.F3_Sc_a) = 1.
575 (* Initializer *)
576 Init: a_1[0] = 2.
577 (* Initializer *)
578 Init: a_1[1] = 3.
579 (* Initializer *)
580 Init: a_2 = 4.
581 (* Initializer *)
582 Init: x_1 = 0.
583 (* Initializer *)
584 Init: (sq0_0.F3_Sc_a) = 2.
585 (* Initializer *)
586 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (a[i] = 2))).
587 (* Initializer *)
588 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a[i] = 0))).
589 (* Initializer *)
590 Init: (sq0_0.F3_Sc_c) = 2.
591 (* Initializer *)
592 Init: forall i : Z. ((0 <= i) -> ((i <= 31) -> (tab_0[i] = 0))).
593 (* Initializer *)
594 Init: x = (-1).
595 }
596 Prove: x_4 = 0.
597
598 ------------------------------------------------------------
599
600 Goal Pre-condition 'qed_ok,Simple_Array_0' in 'main':
601 Let x = u.F4_U_a.
602 Let a = sq0_0.F3_Sc_b.
603 Let x_1 = sc3_0.F3_Sc_c.
604 Let a_1 = sc3_0.F3_Sc_b.
605 Let a_2 = a_1[2].
606 Let x_2 = sc2_0.F3_Sc_c.
607 Let a_3 = sc2_0.F3_Sc_b.
608 Let a_4 = sc1_0.F3_Sc_b.
609 Let a_5 = sc0_0.F3_Sc_b.
610 Let a_6 = st_0.F2_St_tab.
611 Let a_7 = a_6[3].
612 Let x_3 = t[0].
613 Let x_4 = s.F1_S_b.
614 Let x_5 = s.F1_S_a.
615 Assume {
616 Type: IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\ is_uint8(tab_0[5]) /\
617 is_sint16(x) /\ is_sint32(x_3) /\ is_sint32(t[1]) /\
618 is_sint32(t1_0[4]) /\ is_sint32(x_5) /\ is_sint32(x_4) /\
619 is_sint32(x_2) /\ is_sint32(x_1) /\ is_sint32(a_3[2]) /\
620 is_sint32(a_2) /\ is_sint32(a[1]) /\ is_sint32(a[2]) /\
621 is_sint32(a_7) /\ is_sint32(a_6[5]).
622 (* Heap *)
623 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
624 IsS1_S(s) /\ IsS2_St(st_0) /\ IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\
625 IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsS3_Sc(sq0_0) /\ IsU4_U(u).
626 (* Initializer *)
627 Init: x_5 = 2.
628 (* Initializer *)
629 Init: x_4 = 0.
630 (* Initializer *)
631 Init: x_3 = 1.
632 (* Initializer *)
633 Init: forall i : Z. ((0 < i) -> ((i <= 1) -> (t[i] = 0))).
634 (* Initializer *)
635 Init: forall i : Z. ((0 <= i) -> ((i <= 3) -> (t1_0[i] = 1))).
636 (* Initializer *)
637 Init: forall i : Z. ((5 <= i) -> ((i <= 6) -> (t1_0[i] = 2))).
638 (* Initializer *)
639 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (t1_0[i] = 0))).
640 (* Initializer *)
641 Init: forall i : Z. ((7 <= i) -> ((i <= 9) -> (t1_0[i] = 0))).
642 (* Initializer *)
643 Init: a_6[0] = 1.
644 (* Initializer *)
645 Init: a_6[1] = 2.
646 (* Initializer *)
647 Init: a_6[2] = 3.
648 (* Initializer *)
649 Init: a_7 = 4.
650 (* Initializer *)
651 Init: forall i : Z. ((4 <= i) -> ((i <= 9) -> (a_6[i] = 0))).
652 (* Initializer *)
653 Init: (sc0_0.F3_Sc_a) = 1.
654 (* Initializer *)
655 Init: a_5[0] = 2.
656 (* Initializer *)
657 Init: a_5[1] = 3.
658 (* Initializer *)
659 Init: a_5[2] = 4.
660 (* Initializer *)
661 Init: (sc0_0.F3_Sc_c) = 5.
662 (* Initializer *)
663 Init: (sc1_0.F3_Sc_a) = 1.
664 (* Initializer *)
665 Init: a_4[0] = 2.
666 (* Initializer *)
667 Init: a_4[1] = 3.
668 (* Initializer *)
669 Init: a_4[2] = 4.
670 (* Initializer *)
671 Init: (sc1_0.F3_Sc_c) = 5.
672 (* Initializer *)
673 Init: (sc2_0.F3_Sc_a) = 1.
674 (* Initializer *)
675 Init: a_3[0] = 2.
676 (* Initializer *)
677 Init: a_3[1] = 3.
678 (* Initializer *)
679 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a_3[i] = 0))).
680 (* Initializer *)
681 Init: x_2 = 4.
682 (* Initializer *)
683 Init: (sc3_0.F3_Sc_a) = 1.
684 (* Initializer *)
685 Init: a_1[0] = 2.
686 (* Initializer *)
687 Init: a_1[1] = 3.
688 (* Initializer *)
689 Init: a_2 = 4.
690 (* Initializer *)
691 Init: x_1 = 0.
692 (* Initializer *)
693 Init: (sq0_0.F3_Sc_a) = 2.
694 (* Initializer *)
695 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (a[i] = 2))).
696 (* Initializer *)
697 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a[i] = 0))).
698 (* Initializer *)
699 Init: (sq0_0.F3_Sc_c) = 2.
700 (* Initializer *)
701 Init: forall i : Z. ((0 <= i) -> ((i <= 31) -> (tab_0[i] = 0))).
702 (* Initializer *)
703 Init: x = (-1).
704 }
705 Prove: x_3 = 1.
706
707 ------------------------------------------------------------
708
709 Goal Pre-condition 'qed_ok,Simple_Array_1' in 'main':
710 Let x = u.F4_U_a.
711 Let a = sq0_0.F3_Sc_b.
712 Let x_1 = sc3_0.F3_Sc_c.
713 Let a_1 = sc3_0.F3_Sc_b.
714 Let a_2 = a_1[2].
715 Let x_2 = sc2_0.F3_Sc_c.
716 Let a_3 = sc2_0.F3_Sc_b.
717 Let a_4 = sc1_0.F3_Sc_b.
718 Let a_5 = sc0_0.F3_Sc_b.
719 Let a_6 = st_0.F2_St_tab.
720 Let a_7 = a_6[3].
721 Let x_3 = t[0].
722 Let x_4 = s.F1_S_b.
723 Let x_5 = s.F1_S_a.
724 Let x_6 = t[1].
725 Assume {
726 Type: IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\ is_uint8(tab_0[5]) /\
727 is_sint16(x) /\ is_sint32(x_3) /\ is_sint32(x_6) /\
728 is_sint32(t1_0[4]) /\ is_sint32(x_5) /\ is_sint32(x_4) /\
729 is_sint32(x_2) /\ is_sint32(x_1) /\ is_sint32(a_3[2]) /\
730 is_sint32(a_2) /\ is_sint32(a[1]) /\ is_sint32(a[2]) /\
731 is_sint32(a_7) /\ is_sint32(a_6[5]).
732 (* Heap *)
733 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
734 IsS1_S(s) /\ IsS2_St(st_0) /\ IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\
735 IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsS3_Sc(sq0_0) /\ IsU4_U(u).
736 (* Initializer *)
737 Init: x_5 = 2.
738 (* Initializer *)
739 Init: x_4 = 0.
740 (* Initializer *)
741 Init: x_3 = 1.
742 (* Initializer *)
743 Init: forall i : Z. ((0 < i) -> ((i <= 1) -> (t[i] = 0))).
744 (* Initializer *)
745 Init: forall i : Z. ((0 <= i) -> ((i <= 3) -> (t1_0[i] = 1))).
746 (* Initializer *)
747 Init: forall i : Z. ((5 <= i) -> ((i <= 6) -> (t1_0[i] = 2))).
748 (* Initializer *)
749 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (t1_0[i] = 0))).
750 (* Initializer *)
751 Init: forall i : Z. ((7 <= i) -> ((i <= 9) -> (t1_0[i] = 0))).
752 (* Initializer *)
753 Init: a_6[0] = 1.
754 (* Initializer *)
755 Init: a_6[1] = 2.
756 (* Initializer *)
757 Init: a_6[2] = 3.
758 (* Initializer *)
759 Init: a_7 = 4.
760 (* Initializer *)
761 Init: forall i : Z. ((4 <= i) -> ((i <= 9) -> (a_6[i] = 0))).
762 (* Initializer *)
763 Init: (sc0_0.F3_Sc_a) = 1.
764 (* Initializer *)
765 Init: a_5[0] = 2.
766 (* Initializer *)
767 Init: a_5[1] = 3.
768 (* Initializer *)
769 Init: a_5[2] = 4.
770 (* Initializer *)
771 Init: (sc0_0.F3_Sc_c) = 5.
772 (* Initializer *)
773 Init: (sc1_0.F3_Sc_a) = 1.
774 (* Initializer *)
775 Init: a_4[0] = 2.
776 (* Initializer *)
777 Init: a_4[1] = 3.
778 (* Initializer *)
779 Init: a_4[2] = 4.
780 (* Initializer *)
781 Init: (sc1_0.F3_Sc_c) = 5.
782 (* Initializer *)
783 Init: (sc2_0.F3_Sc_a) = 1.
784 (* Initializer *)
785 Init: a_3[0] = 2.
786 (* Initializer *)
787 Init: a_3[1] = 3.
788 (* Initializer *)
789 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a_3[i] = 0))).
790 (* Initializer *)
791 Init: x_2 = 4.
792 (* Initializer *)
793 Init: (sc3_0.F3_Sc_a) = 1.
794 (* Initializer *)
795 Init: a_1[0] = 2.
796 (* Initializer *)
797 Init: a_1[1] = 3.
798 (* Initializer *)
799 Init: a_2 = 4.
800 (* Initializer *)
801 Init: x_1 = 0.
802 (* Initializer *)
803 Init: (sq0_0.F3_Sc_a) = 2.
804 (* Initializer *)
805 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (a[i] = 2))).
806 (* Initializer *)
807 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a[i] = 0))).
808 (* Initializer *)
809 Init: (sq0_0.F3_Sc_c) = 2.
810 (* Initializer *)
811 Init: forall i : Z. ((0 <= i) -> ((i <= 31) -> (tab_0[i] = 0))).
812 (* Initializer *)
813 Init: x = (-1).
814 }
815 Prove: x_6 = 0.
816
817 ------------------------------------------------------------
818
819 Goal Pre-condition 'qed_ok,With_Array_Struct_5' in 'main':
820 Let x = u.F4_U_a.
821 Let a = sq0_0.F3_Sc_b.
822 Let x_1 = sc3_0.F3_Sc_c.
823 Let a_1 = sc3_0.F3_Sc_b.
824 Let a_2 = a_1[2].
825 Let x_2 = sc2_0.F3_Sc_c.
826 Let a_3 = sc2_0.F3_Sc_b.
827 Let a_4 = sc1_0.F3_Sc_b.
828 Let a_5 = sc0_0.F3_Sc_b.
829 Let a_6 = st_0.F2_St_tab.
830 Let a_7 = a_6[3].
831 Let x_3 = t[0].
832 Let x_4 = s.F1_S_b.
833 Let x_5 = s.F1_S_a.
834 Let a_8 = a_6[5].
835 Assume {
836 Type: IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\ is_uint8(tab_0[5]) /\
837 is_sint16(x) /\ is_sint32(x_3) /\ is_sint32(t[1]) /\
838 is_sint32(t1_0[4]) /\ is_sint32(x_5) /\ is_sint32(x_4) /\
839 is_sint32(x_2) /\ is_sint32(x_1) /\ is_sint32(a_3[2]) /\
840 is_sint32(a_2) /\ is_sint32(a[1]) /\ is_sint32(a[2]) /\
841 is_sint32(a_7) /\ is_sint32(a_8).
842 (* Heap *)
843 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
844 IsS1_S(s) /\ IsS2_St(st_0) /\ IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\
845 IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsS3_Sc(sq0_0) /\ IsU4_U(u).
846 (* Initializer *)
847 Init: x_5 = 2.
848 (* Initializer *)
849 Init: x_4 = 0.
850 (* Initializer *)
851 Init: x_3 = 1.
852 (* Initializer *)
853 Init: forall i : Z. ((0 < i) -> ((i <= 1) -> (t[i] = 0))).
854 (* Initializer *)
855 Init: forall i : Z. ((0 <= i) -> ((i <= 3) -> (t1_0[i] = 1))).
856 (* Initializer *)
857 Init: forall i : Z. ((5 <= i) -> ((i <= 6) -> (t1_0[i] = 2))).
858 (* Initializer *)
859 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (t1_0[i] = 0))).
860 (* Initializer *)
861 Init: forall i : Z. ((7 <= i) -> ((i <= 9) -> (t1_0[i] = 0))).
862 (* Initializer *)
863 Init: a_6[0] = 1.
864 (* Initializer *)
865 Init: a_6[1] = 2.
866 (* Initializer *)
867 Init: a_6[2] = 3.
868 (* Initializer *)
869 Init: a_7 = 4.
870 (* Initializer *)
871 Init: forall i : Z. ((4 <= i) -> ((i <= 9) -> (a_6[i] = 0))).
872 (* Initializer *)
873 Init: (sc0_0.F3_Sc_a) = 1.
874 (* Initializer *)
875 Init: a_5[0] = 2.
876 (* Initializer *)
877 Init: a_5[1] = 3.
878 (* Initializer *)
879 Init: a_5[2] = 4.
880 (* Initializer *)
881 Init: (sc0_0.F3_Sc_c) = 5.
882 (* Initializer *)
883 Init: (sc1_0.F3_Sc_a) = 1.
884 (* Initializer *)
885 Init: a_4[0] = 2.
886 (* Initializer *)
887 Init: a_4[1] = 3.
888 (* Initializer *)
889 Init: a_4[2] = 4.
890 (* Initializer *)
891 Init: (sc1_0.F3_Sc_c) = 5.
892 (* Initializer *)
893 Init: (sc2_0.F3_Sc_a) = 1.
894 (* Initializer *)
895 Init: a_3[0] = 2.
896 (* Initializer *)
897 Init: a_3[1] = 3.
898 (* Initializer *)
899 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a_3[i] = 0))).
900 (* Initializer *)
901 Init: x_2 = 4.
902 (* Initializer *)
903 Init: (sc3_0.F3_Sc_a) = 1.
904 (* Initializer *)
905 Init: a_1[0] = 2.
906 (* Initializer *)
907 Init: a_1[1] = 3.
908 (* Initializer *)
909 Init: a_2 = 4.
910 (* Initializer *)
911 Init: x_1 = 0.
912 (* Initializer *)
913 Init: (sq0_0.F3_Sc_a) = 2.
914 (* Initializer *)
915 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (a[i] = 2))).
916 (* Initializer *)
917 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a[i] = 0))).
918 (* Initializer *)
919 Init: (sq0_0.F3_Sc_c) = 2.
920 (* Initializer *)
921 Init: forall i : Z. ((0 <= i) -> ((i <= 31) -> (tab_0[i] = 0))).
922 (* Initializer *)
923 Init: x = (-1).
924 }
925 Prove: a_8 = 0.
926
927 ------------------------------------------------------------
928
929 Goal Pre-condition 'qed_ok,With_Array_Struct_3' in 'main':
930 Let x = u.F4_U_a.
931 Let a = sq0_0.F3_Sc_b.
932 Let x_1 = sc3_0.F3_Sc_c.
933 Let a_1 = sc3_0.F3_Sc_b.
934 Let a_2 = a_1[2].
935 Let x_2 = sc2_0.F3_Sc_c.
936 Let a_3 = sc2_0.F3_Sc_b.
937 Let a_4 = sc1_0.F3_Sc_b.
938 Let a_5 = sc0_0.F3_Sc_b.
939 Let a_6 = st_0.F2_St_tab.
940 Let a_7 = a_6[3].
941 Let x_3 = t[0].
942 Let x_4 = s.F1_S_b.
943 Let x_5 = s.F1_S_a.
944 Assume {
945 Type: IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\ is_uint8(tab_0[5]) /\
946 is_sint16(x) /\ is_sint32(x_3) /\ is_sint32(t[1]) /\
947 is_sint32(t1_0[4]) /\ is_sint32(x_5) /\ is_sint32(x_4) /\
948 is_sint32(x_2) /\ is_sint32(x_1) /\ is_sint32(a_3[2]) /\
949 is_sint32(a_2) /\ is_sint32(a[1]) /\ is_sint32(a[2]) /\
950 is_sint32(a_7) /\ is_sint32(a_6[5]).
951 (* Heap *)
952 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
953 IsS1_S(s) /\ IsS2_St(st_0) /\ IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\
954 IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsS3_Sc(sq0_0) /\ IsU4_U(u).
955 (* Initializer *)
956 Init: x_5 = 2.
957 (* Initializer *)
958 Init: x_4 = 0.
959 (* Initializer *)
960 Init: x_3 = 1.
961 (* Initializer *)
962 Init: forall i : Z. ((0 < i) -> ((i <= 1) -> (t[i] = 0))).
963 (* Initializer *)
964 Init: forall i : Z. ((0 <= i) -> ((i <= 3) -> (t1_0[i] = 1))).
965 (* Initializer *)
966 Init: forall i : Z. ((5 <= i) -> ((i <= 6) -> (t1_0[i] = 2))).
967 (* Initializer *)
968 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (t1_0[i] = 0))).
969 (* Initializer *)
970 Init: forall i : Z. ((7 <= i) -> ((i <= 9) -> (t1_0[i] = 0))).
971 (* Initializer *)
972 Init: a_6[0] = 1.
973 (* Initializer *)
974 Init: a_6[1] = 2.
975 (* Initializer *)
976 Init: a_6[2] = 3.
977 (* Initializer *)
978 Init: a_7 = 4.
979 (* Initializer *)
980 Init: forall i : Z. ((4 <= i) -> ((i <= 9) -> (a_6[i] = 0))).
981 (* Initializer *)
982 Init: (sc0_0.F3_Sc_a) = 1.
983 (* Initializer *)
984 Init: a_5[0] = 2.
985 (* Initializer *)
986 Init: a_5[1] = 3.
987 (* Initializer *)
988 Init: a_5[2] = 4.
989 (* Initializer *)
990 Init: (sc0_0.F3_Sc_c) = 5.
991 (* Initializer *)
992 Init: (sc1_0.F3_Sc_a) = 1.
993 (* Initializer *)
994 Init: a_4[0] = 2.
995 (* Initializer *)
996 Init: a_4[1] = 3.
997 (* Initializer *)
998 Init: a_4[2] = 4.
999 (* Initializer *)
1000 Init: (sc1_0.F3_Sc_c) = 5.
1001 (* Initializer *)
1002 Init: (sc2_0.F3_Sc_a) = 1.
1003 (* Initializer *)
1004 Init: a_3[0] = 2.
1005 (* Initializer *)
1006 Init: a_3[1] = 3.
1007 (* Initializer *)
1008 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a_3[i] = 0))).
1009 (* Initializer *)
1010 Init: x_2 = 4.
1011 (* Initializer *)
1012 Init: (sc3_0.F3_Sc_a) = 1.
1013 (* Initializer *)
1014 Init: a_1[0] = 2.
1015 (* Initializer *)
1016 Init: a_1[1] = 3.
1017 (* Initializer *)
1018 Init: a_2 = 4.
1019 (* Initializer *)
1020 Init: x_1 = 0.
1021 (* Initializer *)
1022 Init: (sq0_0.F3_Sc_a) = 2.
1023 (* Initializer *)
1024 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (a[i] = 2))).
1025 (* Initializer *)
1026 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a[i] = 0))).
1027 (* Initializer *)
1028 Init: (sq0_0.F3_Sc_c) = 2.
1029 (* Initializer *)
1030 Init: forall i : Z. ((0 <= i) -> ((i <= 31) -> (tab_0[i] = 0))).
1031 (* Initializer *)
1032 Init: x = (-1).
1033 }
1034 Prove: a_7 = 4.
1035
1036 ------------------------------------------------------------
1037
1038 Goal Pre-condition 'qed_ok,Sc_eq' in 'main':
1039 Let x = u.F4_U_a.
1040 Let a = sq0_0.F3_Sc_b.
1041 Let x_1 = sc3_0.F3_Sc_c.
1042 Let a_1 = sc3_0.F3_Sc_b.
1043 Let a_2 = a_1[2].
1044 Let x_2 = sc2_0.F3_Sc_c.
1045 Let a_3 = sc2_0.F3_Sc_b.
1046 Let a_4 = sc1_0.F3_Sc_b.
1047 Let a_5 = sc0_0.F3_Sc_b.
1048 Let a_6 = st_0.F2_St_tab.
1049 Let a_7 = a_6[3].
1050 Let x_3 = t[0].
1051 Let x_4 = s.F1_S_b.
1052 Let x_5 = s.F1_S_a.
1053 Assume {
1054 Type: IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\ is_uint8(tab_0[5]) /\
1055 is_sint16(x) /\ is_sint32(x_3) /\ is_sint32(t[1]) /\
1056 is_sint32(t1_0[4]) /\ is_sint32(x_5) /\ is_sint32(x_4) /\
1057 is_sint32(x_2) /\ is_sint32(x_1) /\ is_sint32(a_3[2]) /\
1058 is_sint32(a_2) /\ is_sint32(a[1]) /\ is_sint32(a[2]) /\
1059 is_sint32(a_7) /\ is_sint32(a_6[5]).
1060 (* Heap *)
1061 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
1062 IsS1_S(s) /\ IsS2_St(st_0) /\ IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\
1063 IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsS3_Sc(sq0_0) /\ IsU4_U(u).
1064 (* Initializer *)
1065 Init: x_5 = 2.
1066 (* Initializer *)
1067 Init: x_4 = 0.
1068 (* Initializer *)
1069 Init: x_3 = 1.
1070 (* Initializer *)
1071 Init: forall i : Z. ((0 < i) -> ((i <= 1) -> (t[i] = 0))).
1072 (* Initializer *)
1073 Init: forall i : Z. ((0 <= i) -> ((i <= 3) -> (t1_0[i] = 1))).
1074 (* Initializer *)
1075 Init: forall i : Z. ((5 <= i) -> ((i <= 6) -> (t1_0[i] = 2))).
1076 (* Initializer *)
1077 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (t1_0[i] = 0))).
1078 (* Initializer *)
1079 Init: forall i : Z. ((7 <= i) -> ((i <= 9) -> (t1_0[i] = 0))).
1080 (* Initializer *)
1081 Init: a_6[0] = 1.
1082 (* Initializer *)
1083 Init: a_6[1] = 2.
1084 (* Initializer *)
1085 Init: a_6[2] = 3.
1086 (* Initializer *)
1087 Init: a_7 = 4.
1088 (* Initializer *)
1089 Init: forall i : Z. ((4 <= i) -> ((i <= 9) -> (a_6[i] = 0))).
1090 (* Initializer *)
1091 Init: (sc0_0.F3_Sc_a) = 1.
1092 (* Initializer *)
1093 Init: a_5[0] = 2.
1094 (* Initializer *)
1095 Init: a_5[1] = 3.
1096 (* Initializer *)
1097 Init: a_5[2] = 4.
1098 (* Initializer *)
1099 Init: (sc0_0.F3_Sc_c) = 5.
1100 (* Initializer *)
1101 Init: (sc1_0.F3_Sc_a) = 1.
1102 (* Initializer *)
1103 Init: a_4[0] = 2.
1104 (* Initializer *)
1105 Init: a_4[1] = 3.
1106 (* Initializer *)
1107 Init: a_4[2] = 4.
1108 (* Initializer *)
1109 Init: (sc1_0.F3_Sc_c) = 5.
1110 (* Initializer *)
1111 Init: (sc2_0.F3_Sc_a) = 1.
1112 (* Initializer *)
1113 Init: a_3[0] = 2.
1114 (* Initializer *)
1115 Init: a_3[1] = 3.
1116 (* Initializer *)
1117 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a_3[i] = 0))).
1118 (* Initializer *)
1119 Init: x_2 = 4.
1120 (* Initializer *)
1121 Init: (sc3_0.F3_Sc_a) = 1.
1122 (* Initializer *)
1123 Init: a_1[0] = 2.
1124 (* Initializer *)
1125 Init: a_1[1] = 3.
1126 (* Initializer *)
1127 Init: a_2 = 4.
1128 (* Initializer *)
1129 Init: x_1 = 0.
1130 (* Initializer *)
1131 Init: (sq0_0.F3_Sc_a) = 2.
1132 (* Initializer *)
1133 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (a[i] = 2))).
1134 (* Initializer *)
1135 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a[i] = 0))).
1136 (* Initializer *)
1137 Init: (sq0_0.F3_Sc_c) = 2.
1138 (* Initializer *)
1139 Init: forall i : Z. ((0 <= i) -> ((i <= 31) -> (tab_0[i] = 0))).
1140 (* Initializer *)
1141 Init: x = (-1).
1142 }
1143 Prove: EqS3_Sc(sc1_0, sc0_0).
1144
1145 ------------------------------------------------------------
1146
1147 Goal Pre-condition 'qed_ok,Sc_t' in 'main':
1148 Let x = u.F4_U_a.
1149 Let a = sq0_0.F3_Sc_b.
1150 Let x_1 = sc3_0.F3_Sc_c.
1151 Let a_1 = sc3_0.F3_Sc_b.
1152 Let a_2 = a_1[2].
1153 Let x_2 = sc2_0.F3_Sc_c.
1154 Let a_3 = sc2_0.F3_Sc_b.
1155 Let a_4 = sc1_0.F3_Sc_b.
1156 Let a_5 = sc0_0.F3_Sc_b.
1157 Let a_6 = st_0.F2_St_tab.
1158 Let a_7 = a_6[3].
1159 Let x_3 = t[0].
1160 Let x_4 = s.F1_S_b.
1161 Let x_5 = s.F1_S_a.
1162 Let a_8 = a_3[2].
1163 Assume {
1164 Type: IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\ is_uint8(tab_0[5]) /\
1165 is_sint16(x) /\ is_sint32(x_3) /\ is_sint32(t[1]) /\
1166 is_sint32(t1_0[4]) /\ is_sint32(x_5) /\ is_sint32(x_4) /\
1167 is_sint32(x_2) /\ is_sint32(x_1) /\ is_sint32(a_8) /\ is_sint32(a_2) /\
1168 is_sint32(a[1]) /\ is_sint32(a[2]) /\ is_sint32(a_7) /\
1169 is_sint32(a_6[5]).
1170 (* Heap *)
1171 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
1172 IsS1_S(s) /\ IsS2_St(st_0) /\ IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\
1173 IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsS3_Sc(sq0_0) /\ IsU4_U(u).
1174 (* Initializer *)
1175 Init: x_5 = 2.
1176 (* Initializer *)
1177 Init: x_4 = 0.
1178 (* Initializer *)
1179 Init: x_3 = 1.
1180 (* Initializer *)
1181 Init: forall i : Z. ((0 < i) -> ((i <= 1) -> (t[i] = 0))).
1182 (* Initializer *)
1183 Init: forall i : Z. ((0 <= i) -> ((i <= 3) -> (t1_0[i] = 1))).
1184 (* Initializer *)
1185 Init: forall i : Z. ((5 <= i) -> ((i <= 6) -> (t1_0[i] = 2))).
1186 (* Initializer *)
1187 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (t1_0[i] = 0))).
1188 (* Initializer *)
1189 Init: forall i : Z. ((7 <= i) -> ((i <= 9) -> (t1_0[i] = 0))).
1190 (* Initializer *)
1191 Init: a_6[0] = 1.
1192 (* Initializer *)
1193 Init: a_6[1] = 2.
1194 (* Initializer *)
1195 Init: a_6[2] = 3.
1196 (* Initializer *)
1197 Init: a_7 = 4.
1198 (* Initializer *)
1199 Init: forall i : Z. ((4 <= i) -> ((i <= 9) -> (a_6[i] = 0))).
1200 (* Initializer *)
1201 Init: (sc0_0.F3_Sc_a) = 1.
1202 (* Initializer *)
1203 Init: a_5[0] = 2.
1204 (* Initializer *)
1205 Init: a_5[1] = 3.
1206 (* Initializer *)
1207 Init: a_5[2] = 4.
1208 (* Initializer *)
1209 Init: (sc0_0.F3_Sc_c) = 5.
1210 (* Initializer *)
1211 Init: (sc1_0.F3_Sc_a) = 1.
1212 (* Initializer *)
1213 Init: a_4[0] = 2.
1214 (* Initializer *)
1215 Init: a_4[1] = 3.
1216 (* Initializer *)
1217 Init: a_4[2] = 4.
1218 (* Initializer *)
1219 Init: (sc1_0.F3_Sc_c) = 5.
1220 (* Initializer *)
1221 Init: (sc2_0.F3_Sc_a) = 1.
1222 (* Initializer *)
1223 Init: a_3[0] = 2.
1224 (* Initializer *)
1225 Init: a_3[1] = 3.
1226 (* Initializer *)
1227 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a_3[i] = 0))).
1228 (* Initializer *)
1229 Init: x_2 = 4.
1230 (* Initializer *)
1231 Init: (sc3_0.F3_Sc_a) = 1.
1232 (* Initializer *)
1233 Init: a_1[0] = 2.
1234 (* Initializer *)
1235 Init: a_1[1] = 3.
1236 (* Initializer *)
1237 Init: a_2 = 4.
1238 (* Initializer *)
1239 Init: x_1 = 0.
1240 (* Initializer *)
1241 Init: (sq0_0.F3_Sc_a) = 2.
1242 (* Initializer *)
1243 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (a[i] = 2))).
1244 (* Initializer *)
1245 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a[i] = 0))).
1246 (* Initializer *)
1247 Init: (sq0_0.F3_Sc_c) = 2.
1248 (* Initializer *)
1249 Init: forall i : Z. ((0 <= i) -> ((i <= 31) -> (tab_0[i] = 0))).
1250 (* Initializer *)
1251 Init: x = (-1).
1252 }
1253 Prove: a_8 = 0.
1254
1255 ------------------------------------------------------------
1256
1257 Goal Pre-condition 'qed_ok,Sc_t' in 'main':
1258 Let x = u.F4_U_a.
1259 Let a = sq0_0.F3_Sc_b.
1260 Let x_1 = sc3_0.F3_Sc_c.
1261 Let a_1 = sc3_0.F3_Sc_b.
1262 Let a_2 = a_1[2].
1263 Let x_2 = sc2_0.F3_Sc_c.
1264 Let a_3 = sc2_0.F3_Sc_b.
1265 Let a_4 = sc1_0.F3_Sc_b.
1266 Let a_5 = sc0_0.F3_Sc_b.
1267 Let a_6 = st_0.F2_St_tab.
1268 Let a_7 = a_6[3].
1269 Let x_3 = t[0].
1270 Let x_4 = s.F1_S_b.
1271 Let x_5 = s.F1_S_a.
1272 Assume {
1273 Type: IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\ is_uint8(tab_0[5]) /\
1274 is_sint16(x) /\ is_sint32(x_3) /\ is_sint32(t[1]) /\
1275 is_sint32(t1_0[4]) /\ is_sint32(x_5) /\ is_sint32(x_4) /\
1276 is_sint32(x_2) /\ is_sint32(x_1) /\ is_sint32(a_3[2]) /\
1277 is_sint32(a_2) /\ is_sint32(a[1]) /\ is_sint32(a[2]) /\
1278 is_sint32(a_7) /\ is_sint32(a_6[5]).
1279 (* Heap *)
1280 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
1281 IsS1_S(s) /\ IsS2_St(st_0) /\ IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\
1282 IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsS3_Sc(sq0_0) /\ IsU4_U(u).
1283 (* Initializer *)
1284 Init: x_5 = 2.
1285 (* Initializer *)
1286 Init: x_4 = 0.
1287 (* Initializer *)
1288 Init: x_3 = 1.
1289 (* Initializer *)
1290 Init: forall i : Z. ((0 < i) -> ((i <= 1) -> (t[i] = 0))).
1291 (* Initializer *)
1292 Init: forall i : Z. ((0 <= i) -> ((i <= 3) -> (t1_0[i] = 1))).
1293 (* Initializer *)
1294 Init: forall i : Z. ((5 <= i) -> ((i <= 6) -> (t1_0[i] = 2))).
1295 (* Initializer *)
1296 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (t1_0[i] = 0))).
1297 (* Initializer *)
1298 Init: forall i : Z. ((7 <= i) -> ((i <= 9) -> (t1_0[i] = 0))).
1299 (* Initializer *)
1300 Init: a_6[0] = 1.
1301 (* Initializer *)
1302 Init: a_6[1] = 2.
1303 (* Initializer *)
1304 Init: a_6[2] = 3.
1305 (* Initializer *)
1306 Init: a_7 = 4.
1307 (* Initializer *)
1308 Init: forall i : Z. ((4 <= i) -> ((i <= 9) -> (a_6[i] = 0))).
1309 (* Initializer *)
1310 Init: (sc0_0.F3_Sc_a) = 1.
1311 (* Initializer *)
1312 Init: a_5[0] = 2.
1313 (* Initializer *)
1314 Init: a_5[1] = 3.
1315 (* Initializer *)
1316 Init: a_5[2] = 4.
1317 (* Initializer *)
1318 Init: (sc0_0.F3_Sc_c) = 5.
1319 (* Initializer *)
1320 Init: (sc1_0.F3_Sc_a) = 1.
1321 (* Initializer *)
1322 Init: a_4[0] = 2.
1323 (* Initializer *)
1324 Init: a_4[1] = 3.
1325 (* Initializer *)
1326 Init: a_4[2] = 4.
1327 (* Initializer *)
1328 Init: (sc1_0.F3_Sc_c) = 5.
1329 (* Initializer *)
1330 Init: (sc2_0.F3_Sc_a) = 1.
1331 (* Initializer *)
1332 Init: a_3[0] = 2.
1333 (* Initializer *)
1334 Init: a_3[1] = 3.
1335 (* Initializer *)
1336 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a_3[i] = 0))).
1337 (* Initializer *)
1338 Init: x_2 = 4.
1339 (* Initializer *)
1340 Init: (sc3_0.F3_Sc_a) = 1.
1341 (* Initializer *)
1342 Init: a_1[0] = 2.
1343 (* Initializer *)
1344 Init: a_1[1] = 3.
1345 (* Initializer *)
1346 Init: a_2 = 4.
1347 (* Initializer *)
1348 Init: x_1 = 0.
1349 (* Initializer *)
1350 Init: (sq0_0.F3_Sc_a) = 2.
1351 (* Initializer *)
1352 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (a[i] = 2))).
1353 (* Initializer *)
1354 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a[i] = 0))).
1355 (* Initializer *)
1356 Init: (sq0_0.F3_Sc_c) = 2.
1357 (* Initializer *)
1358 Init: forall i : Z. ((0 <= i) -> ((i <= 31) -> (tab_0[i] = 0))).
1359 (* Initializer *)
1360 Init: x = (-1).
1361 }
1362 Prove: a_2 = 4.
1363
1364 ------------------------------------------------------------
1365
1366 Goal Pre-condition 'qed_ok,Sc_c_2' in 'main':
1367 Let x = u.F4_U_a.
1368 Let a = sq0_0.F3_Sc_b.
1369 Let x_1 = sc3_0.F3_Sc_c.
1370 Let a_1 = sc3_0.F3_Sc_b.
1371 Let a_2 = a_1[2].
1372 Let x_2 = sc2_0.F3_Sc_c.
1373 Let a_3 = sc2_0.F3_Sc_b.
1374 Let a_4 = sc1_0.F3_Sc_b.
1375 Let a_5 = sc0_0.F3_Sc_b.
1376 Let a_6 = st_0.F2_St_tab.
1377 Let a_7 = a_6[3].
1378 Let x_3 = t[0].
1379 Let x_4 = s.F1_S_b.
1380 Let x_5 = s.F1_S_a.
1381 Assume {
1382 Type: IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\ is_uint8(tab_0[5]) /\
1383 is_sint16(x) /\ is_sint32(x_3) /\ is_sint32(t[1]) /\
1384 is_sint32(t1_0[4]) /\ is_sint32(x_5) /\ is_sint32(x_4) /\
1385 is_sint32(x_2) /\ is_sint32(x_1) /\ is_sint32(a_3[2]) /\
1386 is_sint32(a_2) /\ is_sint32(a[1]) /\ is_sint32(a[2]) /\
1387 is_sint32(a_7) /\ is_sint32(a_6[5]).
1388 (* Heap *)
1389 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
1390 IsS1_S(s) /\ IsS2_St(st_0) /\ IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\
1391 IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsS3_Sc(sq0_0) /\ IsU4_U(u).
1392 (* Initializer *)
1393 Init: x_5 = 2.
1394 (* Initializer *)
1395 Init: x_4 = 0.
1396 (* Initializer *)
1397 Init: x_3 = 1.
1398 (* Initializer *)
1399 Init: forall i : Z. ((0 < i) -> ((i <= 1) -> (t[i] = 0))).
1400 (* Initializer *)
1401 Init: forall i : Z. ((0 <= i) -> ((i <= 3) -> (t1_0[i] = 1))).
1402 (* Initializer *)
1403 Init: forall i : Z. ((5 <= i) -> ((i <= 6) -> (t1_0[i] = 2))).
1404 (* Initializer *)
1405 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (t1_0[i] = 0))).
1406 (* Initializer *)
1407 Init: forall i : Z. ((7 <= i) -> ((i <= 9) -> (t1_0[i] = 0))).
1408 (* Initializer *)
1409 Init: a_6[0] = 1.
1410 (* Initializer *)
1411 Init: a_6[1] = 2.
1412 (* Initializer *)
1413 Init: a_6[2] = 3.
1414 (* Initializer *)
1415 Init: a_7 = 4.
1416 (* Initializer *)
1417 Init: forall i : Z. ((4 <= i) -> ((i <= 9) -> (a_6[i] = 0))).
1418 (* Initializer *)
1419 Init: (sc0_0.F3_Sc_a) = 1.
1420 (* Initializer *)
1421 Init: a_5[0] = 2.
1422 (* Initializer *)
1423 Init: a_5[1] = 3.
1424 (* Initializer *)
1425 Init: a_5[2] = 4.
1426 (* Initializer *)
1427 Init: (sc0_0.F3_Sc_c) = 5.
1428 (* Initializer *)
1429 Init: (sc1_0.F3_Sc_a) = 1.
1430 (* Initializer *)
1431 Init: a_4[0] = 2.
1432 (* Initializer *)
1433 Init: a_4[1] = 3.
1434 (* Initializer *)
1435 Init: a_4[2] = 4.
1436 (* Initializer *)
1437 Init: (sc1_0.F3_Sc_c) = 5.
1438 (* Initializer *)
1439 Init: (sc2_0.F3_Sc_a) = 1.
1440 (* Initializer *)
1441 Init: a_3[0] = 2.
1442 (* Initializer *)
1443 Init: a_3[1] = 3.
1444 (* Initializer *)
1445 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a_3[i] = 0))).
1446 (* Initializer *)
1447 Init: x_2 = 4.
1448 (* Initializer *)
1449 Init: (sc3_0.F3_Sc_a) = 1.
1450 (* Initializer *)
1451 Init: a_1[0] = 2.
1452 (* Initializer *)
1453 Init: a_1[1] = 3.
1454 (* Initializer *)
1455 Init: a_2 = 4.
1456 (* Initializer *)
1457 Init: x_1 = 0.
1458 (* Initializer *)
1459 Init: (sq0_0.F3_Sc_a) = 2.
1460 (* Initializer *)
1461 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (a[i] = 2))).
1462 (* Initializer *)
1463 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a[i] = 0))).
1464 (* Initializer *)
1465 Init: (sq0_0.F3_Sc_c) = 2.
1466 (* Initializer *)
1467 Init: forall i : Z. ((0 <= i) -> ((i <= 31) -> (tab_0[i] = 0))).
1468 (* Initializer *)
1469 Init: x = (-1).
1470 }
1471 Prove: x_2 = 4.
1472
1473 ------------------------------------------------------------
1474
1475 Goal Pre-condition 'qed_ok,Sc_c_3' in 'main':
1476 Let x = u.F4_U_a.
1477 Let a = sq0_0.F3_Sc_b.
1478 Let x_1 = sc3_0.F3_Sc_c.
1479 Let a_1 = sc3_0.F3_Sc_b.
1480 Let a_2 = a_1[2].
1481 Let x_2 = sc2_0.F3_Sc_c.
1482 Let a_3 = sc2_0.F3_Sc_b.
1483 Let a_4 = sc1_0.F3_Sc_b.
1484 Let a_5 = sc0_0.F3_Sc_b.
1485 Let a_6 = st_0.F2_St_tab.
1486 Let a_7 = a_6[3].
1487 Let x_3 = t[0].
1488 Let x_4 = s.F1_S_b.
1489 Let x_5 = s.F1_S_a.
1490 Assume {
1491 Type: IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\ is_uint8(tab_0[5]) /\
1492 is_sint16(x) /\ is_sint32(x_3) /\ is_sint32(t[1]) /\
1493 is_sint32(t1_0[4]) /\ is_sint32(x_5) /\ is_sint32(x_4) /\
1494 is_sint32(x_2) /\ is_sint32(x_1) /\ is_sint32(a_3[2]) /\
1495 is_sint32(a_2) /\ is_sint32(a[1]) /\ is_sint32(a[2]) /\
1496 is_sint32(a_7) /\ is_sint32(a_6[5]).
1497 (* Heap *)
1498 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
1499 IsS1_S(s) /\ IsS2_St(st_0) /\ IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\
1500 IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsS3_Sc(sq0_0) /\ IsU4_U(u).
1501 (* Initializer *)
1502 Init: x_5 = 2.
1503 (* Initializer *)
1504 Init: x_4 = 0.
1505 (* Initializer *)
1506 Init: x_3 = 1.
1507 (* Initializer *)
1508 Init: forall i : Z. ((0 < i) -> ((i <= 1) -> (t[i] = 0))).
1509 (* Initializer *)
1510 Init: forall i : Z. ((0 <= i) -> ((i <= 3) -> (t1_0[i] = 1))).
1511 (* Initializer *)
1512 Init: forall i : Z. ((5 <= i) -> ((i <= 6) -> (t1_0[i] = 2))).
1513 (* Initializer *)
1514 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (t1_0[i] = 0))).
1515 (* Initializer *)
1516 Init: forall i : Z. ((7 <= i) -> ((i <= 9) -> (t1_0[i] = 0))).
1517 (* Initializer *)
1518 Init: a_6[0] = 1.
1519 (* Initializer *)
1520 Init: a_6[1] = 2.
1521 (* Initializer *)
1522 Init: a_6[2] = 3.
1523 (* Initializer *)
1524 Init: a_7 = 4.
1525 (* Initializer *)
1526 Init: forall i : Z. ((4 <= i) -> ((i <= 9) -> (a_6[i] = 0))).
1527 (* Initializer *)
1528 Init: (sc0_0.F3_Sc_a) = 1.
1529 (* Initializer *)
1530 Init: a_5[0] = 2.
1531 (* Initializer *)
1532 Init: a_5[1] = 3.
1533 (* Initializer *)
1534 Init: a_5[2] = 4.
1535 (* Initializer *)
1536 Init: (sc0_0.F3_Sc_c) = 5.
1537 (* Initializer *)
1538 Init: (sc1_0.F3_Sc_a) = 1.
1539 (* Initializer *)
1540 Init: a_4[0] = 2.
1541 (* Initializer *)
1542 Init: a_4[1] = 3.
1543 (* Initializer *)
1544 Init: a_4[2] = 4.
1545 (* Initializer *)
1546 Init: (sc1_0.F3_Sc_c) = 5.
1547 (* Initializer *)
1548 Init: (sc2_0.F3_Sc_a) = 1.
1549 (* Initializer *)
1550 Init: a_3[0] = 2.
1551 (* Initializer *)
1552 Init: a_3[1] = 3.
1553 (* Initializer *)
1554 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a_3[i] = 0))).
1555 (* Initializer *)
1556 Init: x_2 = 4.
1557 (* Initializer *)
1558 Init: (sc3_0.F3_Sc_a) = 1.
1559 (* Initializer *)
1560 Init: a_1[0] = 2.
1561 (* Initializer *)
1562 Init: a_1[1] = 3.
1563 (* Initializer *)
1564 Init: a_2 = 4.
1565 (* Initializer *)
1566 Init: x_1 = 0.
1567 (* Initializer *)
1568 Init: (sq0_0.F3_Sc_a) = 2.
1569 (* Initializer *)
1570 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (a[i] = 2))).
1571 (* Initializer *)
1572 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a[i] = 0))).
1573 (* Initializer *)
1574 Init: (sq0_0.F3_Sc_c) = 2.
1575 (* Initializer *)
1576 Init: forall i : Z. ((0 <= i) -> ((i <= 31) -> (tab_0[i] = 0))).
1577 (* Initializer *)
1578 Init: x = (-1).
1579 }
1580 Prove: x_1 = 0.
1581
1582 ------------------------------------------------------------
1583
1584 Goal Pre-condition 'qed_ok,Tab_no_init' in 'main':
1585 Let x = u.F4_U_a.
1586 Let a = sq0_0.F3_Sc_b.
1587 Let x_1 = sc3_0.F3_Sc_c.
1588 Let a_1 = sc3_0.F3_Sc_b.
1589 Let a_2 = a_1[2].
1590 Let x_2 = sc2_0.F3_Sc_c.
1591 Let a_3 = sc2_0.F3_Sc_b.
1592 Let a_4 = sc1_0.F3_Sc_b.
1593 Let a_5 = sc0_0.F3_Sc_b.
1594 Let a_6 = st_0.F2_St_tab.
1595 Let a_7 = a_6[3].
1596 Let x_3 = t[0].
1597 Let x_4 = s.F1_S_b.
1598 Let x_5 = s.F1_S_a.
1599 Let x_6 = tab_0[5].
1600 Assume {
1601 Type: IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\ is_uint8(x_6) /\ is_sint16(x) /\
1602 is_sint32(x_3) /\ is_sint32(t[1]) /\ is_sint32(t1_0[4]) /\
1603 is_sint32(x_5) /\ is_sint32(x_4) /\ is_sint32(x_2) /\ is_sint32(x_1) /\
1604 is_sint32(a_3[2]) /\ is_sint32(a_2) /\ is_sint32(a[1]) /\
1605 is_sint32(a[2]) /\ is_sint32(a_7) /\ is_sint32(a_6[5]).
1606 (* Heap *)
1607 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
1608 IsS1_S(s) /\ IsS2_St(st_0) /\ IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\
1609 IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsS3_Sc(sq0_0) /\ IsU4_U(u).
1610 (* Initializer *)
1611 Init: x_5 = 2.
1612 (* Initializer *)
1613 Init: x_4 = 0.
1614 (* Initializer *)
1615 Init: x_3 = 1.
1616 (* Initializer *)
1617 Init: forall i : Z. ((0 < i) -> ((i <= 1) -> (t[i] = 0))).
1618 (* Initializer *)
1619 Init: forall i : Z. ((0 <= i) -> ((i <= 3) -> (t1_0[i] = 1))).
1620 (* Initializer *)
1621 Init: forall i : Z. ((5 <= i) -> ((i <= 6) -> (t1_0[i] = 2))).
1622 (* Initializer *)
1623 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (t1_0[i] = 0))).
1624 (* Initializer *)
1625 Init: forall i : Z. ((7 <= i) -> ((i <= 9) -> (t1_0[i] = 0))).
1626 (* Initializer *)
1627 Init: a_6[0] = 1.
1628 (* Initializer *)
1629 Init: a_6[1] = 2.
1630 (* Initializer *)
1631 Init: a_6[2] = 3.
1632 (* Initializer *)
1633 Init: a_7 = 4.
1634 (* Initializer *)
1635 Init: forall i : Z. ((4 <= i) -> ((i <= 9) -> (a_6[i] = 0))).
1636 (* Initializer *)
1637 Init: (sc0_0.F3_Sc_a) = 1.
1638 (* Initializer *)
1639 Init: a_5[0] = 2.
1640 (* Initializer *)
1641 Init: a_5[1] = 3.
1642 (* Initializer *)
1643 Init: a_5[2] = 4.
1644 (* Initializer *)
1645 Init: (sc0_0.F3_Sc_c) = 5.
1646 (* Initializer *)
1647 Init: (sc1_0.F3_Sc_a) = 1.
1648 (* Initializer *)
1649 Init: a_4[0] = 2.
1650 (* Initializer *)
1651 Init: a_4[1] = 3.
1652 (* Initializer *)
1653 Init: a_4[2] = 4.
1654 (* Initializer *)
1655 Init: (sc1_0.F3_Sc_c) = 5.
1656 (* Initializer *)
1657 Init: (sc2_0.F3_Sc_a) = 1.
1658 (* Initializer *)
1659 Init: a_3[0] = 2.
1660 (* Initializer *)
1661 Init: a_3[1] = 3.
1662 (* Initializer *)
1663 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a_3[i] = 0))).
1664 (* Initializer *)
1665 Init: x_2 = 4.
1666 (* Initializer *)
1667 Init: (sc3_0.F3_Sc_a) = 1.
1668 (* Initializer *)
1669 Init: a_1[0] = 2.
1670 (* Initializer *)
1671 Init: a_1[1] = 3.
1672 (* Initializer *)
1673 Init: a_2 = 4.
1674 (* Initializer *)
1675 Init: x_1 = 0.
1676 (* Initializer *)
1677 Init: (sq0_0.F3_Sc_a) = 2.
1678 (* Initializer *)
1679 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (a[i] = 2))).
1680 (* Initializer *)
1681 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a[i] = 0))).
1682 (* Initializer *)
1683 Init: (sq0_0.F3_Sc_c) = 2.
1684 (* Initializer *)
1685 Init: forall i : Z. ((0 <= i) -> ((i <= 31) -> (tab_0[i] = 0))).
1686 (* Initializer *)
1687 Init: x = (-1).
1688 }
1689 Prove: x_6 = 0.
1690
1691 ------------------------------------------------------------
1692
1693 Goal Pre-condition 'qed_ok,Tab_todo' in 'main':
1694 Let x = u.F4_U_a.
1695 Let a = sq0_0.F3_Sc_b.
1696 Let x_1 = sc3_0.F3_Sc_c.
1697 Let a_1 = sc3_0.F3_Sc_b.
1698 Let a_2 = a_1[2].
1699 Let x_2 = sc2_0.F3_Sc_c.
1700 Let a_3 = sc2_0.F3_Sc_b.
1701 Let a_4 = sc1_0.F3_Sc_b.
1702 Let a_5 = sc0_0.F3_Sc_b.
1703 Let a_6 = st_0.F2_St_tab.
1704 Let a_7 = a_6[3].
1705 Let x_3 = t[0].
1706 Let x_4 = s.F1_S_b.
1707 Let x_5 = s.F1_S_a.
1708 Assume {
1709 Type: IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\ is_uint8(tab_0[5]) /\
1710 is_sint16(x) /\ is_sint32(x_3) /\ is_sint32(t[1]) /\
1711 is_sint32(t1_0[4]) /\ is_sint32(x_5) /\ is_sint32(x_4) /\
1712 is_sint32(x_2) /\ is_sint32(x_1) /\ is_sint32(a_3[2]) /\
1713 is_sint32(a_2) /\ is_sint32(a[1]) /\ is_sint32(a[2]) /\
1714 is_sint32(a_7) /\ is_sint32(a_6[5]).
1715 (* Heap *)
1716 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
1717 IsS1_S(s) /\ IsS2_St(st_0) /\ IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\
1718 IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsS3_Sc(sq0_0) /\ IsU4_U(u).
1719 (* Goal *)
1720 When: (0 <= i) /\ (i <= 31) /\ is_sint32(i).
1721 (* Initializer *)
1722 Init: x_5 = 2.
1723 (* Initializer *)
1724 Init: x_4 = 0.
1725 (* Initializer *)
1726 Init: x_3 = 1.
1727 (* Initializer *)
1728 Init: forall i_1 : Z. ((0 < i_1) -> ((i_1 <= 1) -> (t[i_1] = 0))).
1729 (* Initializer *)
1730 Init: forall i_1 : Z. ((0 <= i_1) -> ((i_1 <= 3) -> (t1_0[i_1] = 1))).
1731 (* Initializer *)
1732 Init: forall i_1 : Z. ((5 <= i_1) -> ((i_1 <= 6) -> (t1_0[i_1] = 2))).
1733 (* Initializer *)
1734 Init: forall i_1 : Z. ((4 <= i_1) -> ((i_1 <= 4) -> (t1_0[i_1] = 0))).
1735 (* Initializer *)
1736 Init: forall i_1 : Z. ((7 <= i_1) -> ((i_1 <= 9) -> (t1_0[i_1] = 0))).
1737 (* Initializer *)
1738 Init: a_6[0] = 1.
1739 (* Initializer *)
1740 Init: a_6[1] = 2.
1741 (* Initializer *)
1742 Init: a_6[2] = 3.
1743 (* Initializer *)
1744 Init: a_7 = 4.
1745 (* Initializer *)
1746 Init: forall i_1 : Z. ((4 <= i_1) -> ((i_1 <= 9) -> (a_6[i_1] = 0))).
1747 (* Initializer *)
1748 Init: (sc0_0.F3_Sc_a) = 1.
1749 (* Initializer *)
1750 Init: a_5[0] = 2.
1751 (* Initializer *)
1752 Init: a_5[1] = 3.
1753 (* Initializer *)
1754 Init: a_5[2] = 4.
1755 (* Initializer *)
1756 Init: (sc0_0.F3_Sc_c) = 5.
1757 (* Initializer *)
1758 Init: (sc1_0.F3_Sc_a) = 1.
1759 (* Initializer *)
1760 Init: a_4[0] = 2.
1761 (* Initializer *)
1762 Init: a_4[1] = 3.
1763 (* Initializer *)
1764 Init: a_4[2] = 4.
1765 (* Initializer *)
1766 Init: (sc1_0.F3_Sc_c) = 5.
1767 (* Initializer *)
1768 Init: (sc2_0.F3_Sc_a) = 1.
1769 (* Initializer *)
1770 Init: a_3[0] = 2.
1771 (* Initializer *)
1772 Init: a_3[1] = 3.
1773 (* Initializer *)
1774 Init: forall i_1 : Z. ((2 <= i_1) -> ((i_1 <= 2) -> (a_3[i_1] = 0))).
1775 (* Initializer *)
1776 Init: x_2 = 4.
1777 (* Initializer *)
1778 Init: (sc3_0.F3_Sc_a) = 1.
1779 (* Initializer *)
1780 Init: a_1[0] = 2.
1781 (* Initializer *)
1782 Init: a_1[1] = 3.
1783 (* Initializer *)
1784 Init: a_2 = 4.
1785 (* Initializer *)
1786 Init: x_1 = 0.
1787 (* Initializer *)
1788 Init: (sq0_0.F3_Sc_a) = 2.
1789 (* Initializer *)
1790 Init: forall i_1 : Z. ((0 <= i_1) -> ((i_1 <= 1) -> (a[i_1] = 2))).
1791 (* Initializer *)
1792 Init: forall i_1 : Z. ((2 <= i_1) -> ((i_1 <= 2) -> (a[i_1] = 0))).
1793 (* Initializer *)
1794 Init: (sq0_0.F3_Sc_c) = 2.
1795 (* Initializer *)
1796 Init: forall i_1 : Z. ((0 <= i_1) -> ((i_1 <= 31) -> (tab_0[i_1] = 0))).
1797 (* Initializer *)
1798 Init: x = (-1).
1799 }
1800 Prove: tab_0[i] <= 255.
1801
1802 ------------------------------------------------------------
1803
1804 Goal Pre-condition 'qed_ok' in 'main':
1805 Let x = u.F4_U_a.
1806 Let a = sq0_0.F3_Sc_b.
1807 Let x_1 = sc3_0.F3_Sc_c.
1808 Let a_1 = sc3_0.F3_Sc_b.
1809 Let a_2 = a_1[2].
1810 Let x_2 = sc2_0.F3_Sc_c.
1811 Let a_3 = sc2_0.F3_Sc_b.
1812 Let a_4 = sc1_0.F3_Sc_b.
1813 Let a_5 = sc0_0.F3_Sc_b.
1814 Let a_6 = st_0.F2_St_tab.
1815 Let a_7 = a_6[3].
1816 Let x_3 = t[0].
1817 Let x_4 = s.F1_S_b.
1818 Let x_5 = s.F1_S_a.
1819 Let a_8 = a[1].
1820 Assume {
1821 Type: IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\ is_uint8(tab_0[5]) /\
1822 is_sint16(x) /\ is_sint32(x_3) /\ is_sint32(t[1]) /\
1823 is_sint32(t1_0[4]) /\ is_sint32(x_5) /\ is_sint32(x_4) /\
1824 is_sint32(x_2) /\ is_sint32(x_1) /\ is_sint32(a_3[2]) /\
1825 is_sint32(a_2) /\ is_sint32(a_8) /\ is_sint32(a[2]) /\
1826 is_sint32(a_7) /\ is_sint32(a_6[5]).
1827 (* Heap *)
1828 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
1829 IsS1_S(s) /\ IsS2_St(st_0) /\ IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\
1830 IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsS3_Sc(sq0_0) /\ IsU4_U(u).
1831 (* Initializer *)
1832 Init: x_5 = 2.
1833 (* Initializer *)
1834 Init: x_4 = 0.
1835 (* Initializer *)
1836 Init: x_3 = 1.
1837 (* Initializer *)
1838 Init: forall i : Z. ((0 < i) -> ((i <= 1) -> (t[i] = 0))).
1839 (* Initializer *)
1840 Init: forall i : Z. ((0 <= i) -> ((i <= 3) -> (t1_0[i] = 1))).
1841 (* Initializer *)
1842 Init: forall i : Z. ((5 <= i) -> ((i <= 6) -> (t1_0[i] = 2))).
1843 (* Initializer *)
1844 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (t1_0[i] = 0))).
1845 (* Initializer *)
1846 Init: forall i : Z. ((7 <= i) -> ((i <= 9) -> (t1_0[i] = 0))).
1847 (* Initializer *)
1848 Init: a_6[0] = 1.
1849 (* Initializer *)
1850 Init: a_6[1] = 2.
1851 (* Initializer *)
1852 Init: a_6[2] = 3.
1853 (* Initializer *)
1854 Init: a_7 = 4.
1855 (* Initializer *)
1856 Init: forall i : Z. ((4 <= i) -> ((i <= 9) -> (a_6[i] = 0))).
1857 (* Initializer *)
1858 Init: (sc0_0.F3_Sc_a) = 1.
1859 (* Initializer *)
1860 Init: a_5[0] = 2.
1861 (* Initializer *)
1862 Init: a_5[1] = 3.
1863 (* Initializer *)
1864 Init: a_5[2] = 4.
1865 (* Initializer *)
1866 Init: (sc0_0.F3_Sc_c) = 5.
1867 (* Initializer *)
1868 Init: (sc1_0.F3_Sc_a) = 1.
1869 (* Initializer *)
1870 Init: a_4[0] = 2.
1871 (* Initializer *)
1872 Init: a_4[1] = 3.
1873 (* Initializer *)
1874 Init: a_4[2] = 4.
1875 (* Initializer *)
1876 Init: (sc1_0.F3_Sc_c) = 5.
1877 (* Initializer *)
1878 Init: (sc2_0.F3_Sc_a) = 1.
1879 (* Initializer *)
1880 Init: a_3[0] = 2.
1881 (* Initializer *)
1882 Init: a_3[1] = 3.
1883 (* Initializer *)
1884 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a_3[i] = 0))).
1885 (* Initializer *)
1886 Init: x_2 = 4.
1887 (* Initializer *)
1888 Init: (sc3_0.F3_Sc_a) = 1.
1889 (* Initializer *)
1890 Init: a_1[0] = 2.
1891 (* Initializer *)
1892 Init: a_1[1] = 3.
1893 (* Initializer *)
1894 Init: a_2 = 4.
1895 (* Initializer *)
1896 Init: x_1 = 0.
1897 (* Initializer *)
1898 Init: (sq0_0.F3_Sc_a) = 2.
1899 (* Initializer *)
1900 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (a[i] = 2))).
1901 (* Initializer *)
1902 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a[i] = 0))).
1903 (* Initializer *)
1904 Init: (sq0_0.F3_Sc_c) = 2.
1905 (* Initializer *)
1906 Init: forall i : Z. ((0 <= i) -> ((i <= 31) -> (tab_0[i] = 0))).
1907 (* Initializer *)
1908 Init: x = (-1).
1909 }
1910 Prove: a_8 = 2.
1911
1912 ------------------------------------------------------------
1913
1914 Goal Pre-condition 'qed_ok' in 'main':
1915 Let x = u.F4_U_a.
1916 Let a = sq0_0.F3_Sc_b.
1917 Let x_1 = sc3_0.F3_Sc_c.
1918 Let a_1 = sc3_0.F3_Sc_b.
1919 Let a_2 = a_1[2].
1920 Let x_2 = sc2_0.F3_Sc_c.
1921 Let a_3 = sc2_0.F3_Sc_b.
1922 Let a_4 = sc1_0.F3_Sc_b.
1923 Let a_5 = sc0_0.F3_Sc_b.
1924 Let a_6 = st_0.F2_St_tab.
1925 Let a_7 = a_6[3].
1926 Let x_3 = t[0].
1927 Let x_4 = s.F1_S_b.
1928 Let x_5 = s.F1_S_a.
1929 Let a_8 = a[2].
1930 Assume {
1931 Type: IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\ is_uint8(tab_0[5]) /\
1932 is_sint16(x) /\ is_sint32(x_3) /\ is_sint32(t[1]) /\
1933 is_sint32(t1_0[4]) /\ is_sint32(x_5) /\ is_sint32(x_4) /\
1934 is_sint32(x_2) /\ is_sint32(x_1) /\ is_sint32(a_3[2]) /\
1935 is_sint32(a_2) /\ is_sint32(a[1]) /\ is_sint32(a_8) /\
1936 is_sint32(a_7) /\ is_sint32(a_6[5]).
1937 (* Heap *)
1938 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
1939 IsS1_S(s) /\ IsS2_St(st_0) /\ IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\
1940 IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsS3_Sc(sq0_0) /\ IsU4_U(u).
1941 (* Initializer *)
1942 Init: x_5 = 2.
1943 (* Initializer *)
1944 Init: x_4 = 0.
1945 (* Initializer *)
1946 Init: x_3 = 1.
1947 (* Initializer *)
1948 Init: forall i : Z. ((0 < i) -> ((i <= 1) -> (t[i] = 0))).
1949 (* Initializer *)
1950 Init: forall i : Z. ((0 <= i) -> ((i <= 3) -> (t1_0[i] = 1))).
1951 (* Initializer *)
1952 Init: forall i : Z. ((5 <= i) -> ((i <= 6) -> (t1_0[i] = 2))).
1953 (* Initializer *)
1954 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (t1_0[i] = 0))).
1955 (* Initializer *)
1956 Init: forall i : Z. ((7 <= i) -> ((i <= 9) -> (t1_0[i] = 0))).
1957 (* Initializer *)
1958 Init: a_6[0] = 1.
1959 (* Initializer *)
1960 Init: a_6[1] = 2.
1961 (* Initializer *)
1962 Init: a_6[2] = 3.
1963 (* Initializer *)
1964 Init: a_7 = 4.
1965 (* Initializer *)
1966 Init: forall i : Z. ((4 <= i) -> ((i <= 9) -> (a_6[i] = 0))).
1967 (* Initializer *)
1968 Init: (sc0_0.F3_Sc_a) = 1.
1969 (* Initializer *)
1970 Init: a_5[0] = 2.
1971 (* Initializer *)
1972 Init: a_5[1] = 3.
1973 (* Initializer *)
1974 Init: a_5[2] = 4.
1975 (* Initializer *)
1976 Init: (sc0_0.F3_Sc_c) = 5.
1977 (* Initializer *)
1978 Init: (sc1_0.F3_Sc_a) = 1.
1979 (* Initializer *)
1980 Init: a_4[0] = 2.
1981 (* Initializer *)
1982 Init: a_4[1] = 3.
1983 (* Initializer *)
1984 Init: a_4[2] = 4.
1985 (* Initializer *)
1986 Init: (sc1_0.F3_Sc_c) = 5.
1987 (* Initializer *)
1988 Init: (sc2_0.F3_Sc_a) = 1.
1989 (* Initializer *)
1990 Init: a_3[0] = 2.
1991 (* Initializer *)
1992 Init: a_3[1] = 3.
1993 (* Initializer *)
1994 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a_3[i] = 0))).
1995 (* Initializer *)
1996 Init: x_2 = 4.
1997 (* Initializer *)
1998 Init: (sc3_0.F3_Sc_a) = 1.
1999 (* Initializer *)
2000 Init: a_1[0] = 2.
2001 (* Initializer *)
2002 Init: a_1[1] = 3.
2003 (* Initializer *)
2004 Init: a_2 = 4.
2005 (* Initializer *)
2006 Init: x_1 = 0.
2007 (* Initializer *)
2008 Init: (sq0_0.F3_Sc_a) = 2.
2009 (* Initializer *)
2010 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (a[i] = 2))).
2011 (* Initializer *)
2012 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a[i] = 0))).
2013 (* Initializer *)
2014 Init: (sq0_0.F3_Sc_c) = 2.
2015 (* Initializer *)
2016 Init: forall i : Z. ((0 <= i) -> ((i <= 31) -> (tab_0[i] = 0))).
2017 (* Initializer *)
2018 Init: x = (-1).
2019 }
2020 Prove: a_8 = 0.
2021
2022 ------------------------------------------------------------
2023
2024 Goal Pre-condition 'qed_ok' in 'main':
2025 Let x = u.F4_U_a.
2026 Let a = sq0_0.F3_Sc_b.
2027 Let x_1 = sc3_0.F3_Sc_c.
2028 Let a_1 = sc3_0.F3_Sc_b.
2029 Let a_2 = a_1[2].
2030 Let x_2 = sc2_0.F3_Sc_c.
2031 Let a_3 = sc2_0.F3_Sc_b.
2032 Let a_4 = sc1_0.F3_Sc_b.
2033 Let a_5 = sc0_0.F3_Sc_b.
2034 Let a_6 = st_0.F2_St_tab.
2035 Let a_7 = a_6[3].
2036 Let x_3 = t[0].
2037 Let x_4 = s.F1_S_b.
2038 Let x_5 = s.F1_S_a.
2039 Assume {
2040 Type: IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\ is_uint8(tab_0[5]) /\
2041 is_sint16(x) /\ is_sint32(x_3) /\ is_sint32(t[1]) /\
2042 is_sint32(t1_0[4]) /\ is_sint32(x_5) /\ is_sint32(x_4) /\
2043 is_sint32(x_2) /\ is_sint32(x_1) /\ is_sint32(a_3[2]) /\
2044 is_sint32(a_2) /\ is_sint32(a[1]) /\ is_sint32(a[2]) /\
2045 is_sint32(a_7) /\ is_sint32(a_6[5]).
2046 (* Heap *)
2047 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
2048 IsS1_S(s) /\ IsS2_St(st_0) /\ IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\
2049 IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsS3_Sc(sq0_0) /\ IsU4_U(u).
2050 (* Goal *)
2051 When: (0 <= i) /\ (i <= 3).
2052 (* Initializer *)
2053 Init: x_5 = 2.
2054 (* Initializer *)
2055 Init: x_4 = 0.
2056 (* Initializer *)
2057 Init: x_3 = 1.
2058 (* Initializer *)
2059 Init: forall i_1 : Z. ((0 < i_1) -> ((i_1 <= 1) -> (t[i_1] = 0))).
2060 (* Initializer *)
2061 Init: forall i_1 : Z. ((0 <= i_1) -> ((i_1 <= 3) -> (t1_0[i_1] = 1))).
2062 (* Initializer *)
2063 Init: forall i_1 : Z. ((5 <= i_1) -> ((i_1 <= 6) -> (t1_0[i_1] = 2))).
2064 (* Initializer *)
2065 Init: forall i_1 : Z. ((4 <= i_1) -> ((i_1 <= 4) -> (t1_0[i_1] = 0))).
2066 (* Initializer *)
2067 Init: forall i_1 : Z. ((7 <= i_1) -> ((i_1 <= 9) -> (t1_0[i_1] = 0))).
2068 (* Initializer *)
2069 Init: a_6[0] = 1.
2070 (* Initializer *)
2071 Init: a_6[1] = 2.
2072 (* Initializer *)
2073 Init: a_6[2] = 3.
2074 (* Initializer *)
2075 Init: a_7 = 4.
2076 (* Initializer *)
2077 Init: forall i_1 : Z. ((4 <= i_1) -> ((i_1 <= 9) -> (a_6[i_1] = 0))).
2078 (* Initializer *)
2079 Init: (sc0_0.F3_Sc_a) = 1.
2080 (* Initializer *)
2081 Init: a_5[0] = 2.
2082 (* Initializer *)
2083 Init: a_5[1] = 3.
2084 (* Initializer *)
2085 Init: a_5[2] = 4.
2086 (* Initializer *)
2087 Init: (sc0_0.F3_Sc_c) = 5.
2088 (* Initializer *)
2089 Init: (sc1_0.F3_Sc_a) = 1.
2090 (* Initializer *)
2091 Init: a_4[0] = 2.
2092 (* Initializer *)
2093 Init: a_4[1] = 3.
2094 (* Initializer *)
2095 Init: a_4[2] = 4.
2096 (* Initializer *)
2097 Init: (sc1_0.F3_Sc_c) = 5.
2098 (* Initializer *)
2099 Init: (sc2_0.F3_Sc_a) = 1.
2100 (* Initializer *)
2101 Init: a_3[0] = 2.
2102 (* Initializer *)
2103 Init: a_3[1] = 3.
2104 (* Initializer *)
2105 Init: forall i_1 : Z. ((2 <= i_1) -> ((i_1 <= 2) -> (a_3[i_1] = 0))).
2106 (* Initializer *)
2107 Init: x_2 = 4.
2108 (* Initializer *)
2109 Init: (sc3_0.F3_Sc_a) = 1.
2110 (* Initializer *)
2111 Init: a_1[0] = 2.
2112 (* Initializer *)
2113 Init: a_1[1] = 3.
2114 (* Initializer *)
2115 Init: a_2 = 4.
2116 (* Initializer *)
2117 Init: x_1 = 0.
2118 (* Initializer *)
2119 Init: (sq0_0.F3_Sc_a) = 2.
2120 (* Initializer *)
2121 Init: forall i_1 : Z. ((0 <= i_1) -> ((i_1 <= 1) -> (a[i_1] = 2))).
2122 (* Initializer *)
2123 Init: forall i_1 : Z. ((2 <= i_1) -> ((i_1 <= 2) -> (a[i_1] = 0))).
2124 (* Initializer *)
2125 Init: (sq0_0.F3_Sc_c) = 2.
2126 (* Initializer *)
2127 Init: forall i_1 : Z. ((0 <= i_1) -> ((i_1 <= 31) -> (tab_0[i_1] = 0))).
2128 (* Initializer *)
2129 Init: x = (-1).
2130 }
2131 Prove: t1_0[i] = 1.
2132
2133 ------------------------------------------------------------
2134
2135 Goal Pre-condition 'qed_ok,todo' in 'main':
2136 Let x = u.F4_U_a.
2137 Let a = sq0_0.F3_Sc_b.
2138 Let x_1 = sc3_0.F3_Sc_c.
2139 Let a_1 = sc3_0.F3_Sc_b.
2140 Let a_2 = a_1[2].
2141 Let x_2 = sc2_0.F3_Sc_c.
2142 Let a_3 = sc2_0.F3_Sc_b.
2143 Let a_4 = sc1_0.F3_Sc_b.
2144 Let a_5 = sc0_0.F3_Sc_b.
2145 Let a_6 = st_0.F2_St_tab.
2146 Let a_7 = a_6[3].
2147 Let x_3 = t[0].
2148 Let x_4 = s.F1_S_b.
2149 Let x_5 = s.F1_S_a.
2150 Let x_6 = t1_0[4].
2151 Assume {
2152 Type: IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\ is_uint8(tab_0[5]) /\
2153 is_sint16(x) /\ is_sint32(x_3) /\ is_sint32(t[1]) /\ is_sint32(x_6) /\
2154 is_sint32(x_5) /\ is_sint32(x_4) /\ is_sint32(x_2) /\ is_sint32(x_1) /\
2155 is_sint32(a_3[2]) /\ is_sint32(a_2) /\ is_sint32(a[1]) /\
2156 is_sint32(a[2]) /\ is_sint32(a_7) /\ is_sint32(a_6[5]).
2157 (* Heap *)
2158 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
2159 IsS1_S(s) /\ IsS2_St(st_0) /\ IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\
2160 IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsS3_Sc(sq0_0) /\ IsU4_U(u).
2161 (* Initializer *)
2162 Init: x_5 = 2.
2163 (* Initializer *)
2164 Init: x_4 = 0.
2165 (* Initializer *)
2166 Init: x_3 = 1.
2167 (* Initializer *)
2168 Init: forall i : Z. ((0 < i) -> ((i <= 1) -> (t[i] = 0))).
2169 (* Initializer *)
2170 Init: forall i : Z. ((0 <= i) -> ((i <= 3) -> (t1_0[i] = 1))).
2171 (* Initializer *)
2172 Init: forall i : Z. ((5 <= i) -> ((i <= 6) -> (t1_0[i] = 2))).
2173 (* Initializer *)
2174 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (t1_0[i] = 0))).
2175 (* Initializer *)
2176 Init: forall i : Z. ((7 <= i) -> ((i <= 9) -> (t1_0[i] = 0))).
2177 (* Initializer *)
2178 Init: a_6[0] = 1.
2179 (* Initializer *)
2180 Init: a_6[1] = 2.
2181 (* Initializer *)
2182 Init: a_6[2] = 3.
2183 (* Initializer *)
2184 Init: a_7 = 4.
2185 (* Initializer *)
2186 Init: forall i : Z. ((4 <= i) -> ((i <= 9) -> (a_6[i] = 0))).
2187 (* Initializer *)
2188 Init: (sc0_0.F3_Sc_a) = 1.
2189 (* Initializer *)
2190 Init: a_5[0] = 2.
2191 (* Initializer *)
2192 Init: a_5[1] = 3.
2193 (* Initializer *)
2194 Init: a_5[2] = 4.
2195 (* Initializer *)
2196 Init: (sc0_0.F3_Sc_c) = 5.
2197 (* Initializer *)
2198 Init: (sc1_0.F3_Sc_a) = 1.
2199 (* Initializer *)
2200 Init: a_4[0] = 2.
2201 (* Initializer *)
2202 Init: a_4[1] = 3.
2203 (* Initializer *)
2204 Init: a_4[2] = 4.
2205 (* Initializer *)
2206 Init: (sc1_0.F3_Sc_c) = 5.
2207 (* Initializer *)
2208 Init: (sc2_0.F3_Sc_a) = 1.
2209 (* Initializer *)
2210 Init: a_3[0] = 2.
2211 (* Initializer *)
2212 Init: a_3[1] = 3.
2213 (* Initializer *)
2214 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a_3[i] = 0))).
2215 (* Initializer *)
2216 Init: x_2 = 4.
2217 (* Initializer *)
2218 Init: (sc3_0.F3_Sc_a) = 1.
2219 (* Initializer *)
2220 Init: a_1[0] = 2.
2221 (* Initializer *)
2222 Init: a_1[1] = 3.
2223 (* Initializer *)
2224 Init: a_2 = 4.
2225 (* Initializer *)
2226 Init: x_1 = 0.
2227 (* Initializer *)
2228 Init: (sq0_0.F3_Sc_a) = 2.
2229 (* Initializer *)
2230 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (a[i] = 2))).
2231 (* Initializer *)
2232 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a[i] = 0))).
2233 (* Initializer *)
2234 Init: (sq0_0.F3_Sc_c) = 2.
2235 (* Initializer *)
2236 Init: forall i : Z. ((0 <= i) -> ((i <= 31) -> (tab_0[i] = 0))).
2237 (* Initializer *)
2238 Init: x = (-1).
2239 }
2240 Prove: x_6 = 0.
2241
2242 ------------------------------------------------------------
2243
2244 Goal Pre-condition 'qed_ok' in 'main':
2245 Let x = u.F4_U_a.
2246 Let a = sq0_0.F3_Sc_b.
2247 Let x_1 = sc3_0.F3_Sc_c.
2248 Let a_1 = sc3_0.F3_Sc_b.
2249 Let a_2 = a_1[2].
2250 Let x_2 = sc2_0.F3_Sc_c.
2251 Let a_3 = sc2_0.F3_Sc_b.
2252 Let a_4 = sc1_0.F3_Sc_b.
2253 Let a_5 = sc0_0.F3_Sc_b.
2254 Let a_6 = st_0.F2_St_tab.
2255 Let a_7 = a_6[3].
2256 Let x_3 = t[0].
2257 Let x_4 = s.F1_S_b.
2258 Let x_5 = s.F1_S_a.
2259 Assume {
2260 Type: IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\ is_uint8(tab_0[5]) /\
2261 is_sint16(x) /\ is_sint32(x_3) /\ is_sint32(t[1]) /\
2262 is_sint32(t1_0[4]) /\ is_sint32(x_5) /\ is_sint32(x_4) /\
2263 is_sint32(x_2) /\ is_sint32(x_1) /\ is_sint32(a_3[2]) /\
2264 is_sint32(a_2) /\ is_sint32(a[1]) /\ is_sint32(a[2]) /\
2265 is_sint32(a_7) /\ is_sint32(a_6[5]).
2266 (* Heap *)
2267 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
2268 IsS1_S(s) /\ IsS2_St(st_0) /\ IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\
2269 IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsS3_Sc(sq0_0) /\ IsU4_U(u).
2270 (* Goal *)
2271 When: (6 <= i) /\ (i <= 6).
2272 (* Initializer *)
2273 Init: x_5 = 2.
2274 (* Initializer *)
2275 Init: x_4 = 0.
2276 (* Initializer *)
2277 Init: x_3 = 1.
2278 (* Initializer *)
2279 Init: forall i_1 : Z. ((0 < i_1) -> ((i_1 <= 1) -> (t[i_1] = 0))).
2280 (* Initializer *)
2281 Init: forall i_1 : Z. ((0 <= i_1) -> ((i_1 <= 3) -> (t1_0[i_1] = 1))).
2282 (* Initializer *)
2283 Init: forall i_1 : Z. ((5 <= i_1) -> ((i_1 <= 6) -> (t1_0[i_1] = 2))).
2284 (* Initializer *)
2285 Init: forall i_1 : Z. ((4 <= i_1) -> ((i_1 <= 4) -> (t1_0[i_1] = 0))).
2286 (* Initializer *)
2287 Init: forall i_1 : Z. ((7 <= i_1) -> ((i_1 <= 9) -> (t1_0[i_1] = 0))).
2288 (* Initializer *)
2289 Init: a_6[0] = 1.
2290 (* Initializer *)
2291 Init: a_6[1] = 2.
2292 (* Initializer *)
2293 Init: a_6[2] = 3.
2294 (* Initializer *)
2295 Init: a_7 = 4.
2296 (* Initializer *)
2297 Init: forall i_1 : Z. ((4 <= i_1) -> ((i_1 <= 9) -> (a_6[i_1] = 0))).
2298 (* Initializer *)
2299 Init: (sc0_0.F3_Sc_a) = 1.
2300 (* Initializer *)
2301 Init: a_5[0] = 2.
2302 (* Initializer *)
2303 Init: a_5[1] = 3.
2304 (* Initializer *)
2305 Init: a_5[2] = 4.
2306 (* Initializer *)
2307 Init: (sc0_0.F3_Sc_c) = 5.
2308 (* Initializer *)
2309 Init: (sc1_0.F3_Sc_a) = 1.
2310 (* Initializer *)
2311 Init: a_4[0] = 2.
2312 (* Initializer *)
2313 Init: a_4[1] = 3.
2314 (* Initializer *)
2315 Init: a_4[2] = 4.
2316 (* Initializer *)
2317 Init: (sc1_0.F3_Sc_c) = 5.
2318 (* Initializer *)
2319 Init: (sc2_0.F3_Sc_a) = 1.
2320 (* Initializer *)
2321 Init: a_3[0] = 2.
2322 (* Initializer *)
2323 Init: a_3[1] = 3.
2324 (* Initializer *)
2325 Init: forall i_1 : Z. ((2 <= i_1) -> ((i_1 <= 2) -> (a_3[i_1] = 0))).
2326 (* Initializer *)
2327 Init: x_2 = 4.
2328 (* Initializer *)
2329 Init: (sc3_0.F3_Sc_a) = 1.
2330 (* Initializer *)
2331 Init: a_1[0] = 2.
2332 (* Initializer *)
2333 Init: a_1[1] = 3.
2334 (* Initializer *)
2335 Init: a_2 = 4.
2336 (* Initializer *)
2337 Init: x_1 = 0.
2338 (* Initializer *)
2339 Init: (sq0_0.F3_Sc_a) = 2.
2340 (* Initializer *)
2341 Init: forall i_1 : Z. ((0 <= i_1) -> ((i_1 <= 1) -> (a[i_1] = 2))).
2342 (* Initializer *)
2343 Init: forall i_1 : Z. ((2 <= i_1) -> ((i_1 <= 2) -> (a[i_1] = 0))).
2344 (* Initializer *)
2345 Init: (sq0_0.F3_Sc_c) = 2.
2346 (* Initializer *)
2347 Init: forall i_1 : Z. ((0 <= i_1) -> ((i_1 <= 31) -> (tab_0[i_1] = 0))).
2348 (* Initializer *)
2349 Init: x = (-1).
2350 }
2351 Prove: t1_0[i] = 2.
2352
2353 ------------------------------------------------------------
2354
2355 Goal Pre-condition 'qed_ok' in 'main':
2356 Let x = u.F4_U_a.
2357 Let a = sq0_0.F3_Sc_b.
2358 Let x_1 = sc3_0.F3_Sc_c.
2359 Let a_1 = sc3_0.F3_Sc_b.
2360 Let a_2 = a_1[2].
2361 Let x_2 = sc2_0.F3_Sc_c.
2362 Let a_3 = sc2_0.F3_Sc_b.
2363 Let a_4 = sc1_0.F3_Sc_b.
2364 Let a_5 = sc0_0.F3_Sc_b.
2365 Let a_6 = st_0.F2_St_tab.
2366 Let a_7 = a_6[3].
2367 Let x_3 = t[0].
2368 Let x_4 = s.F1_S_b.
2369 Let x_5 = s.F1_S_a.
2370 Assume {
2371 Type: IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\ is_uint8(tab_0[5]) /\
2372 is_sint16(x) /\ is_sint32(x_3) /\ is_sint32(t[1]) /\
2373 is_sint32(t1_0[4]) /\ is_sint32(x_5) /\ is_sint32(x_4) /\
2374 is_sint32(x_2) /\ is_sint32(x_1) /\ is_sint32(a_3[2]) /\
2375 is_sint32(a_2) /\ is_sint32(a[1]) /\ is_sint32(a[2]) /\
2376 is_sint32(a_7) /\ is_sint32(a_6[5]).
2377 (* Heap *)
2378 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
2379 IsS1_S(s) /\ IsS2_St(st_0) /\ IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\
2380 IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsS3_Sc(sq0_0) /\ IsU4_U(u).
2381 (* Goal *)
2382 When: (7 <= i) /\ (i <= 9).
2383 (* Initializer *)
2384 Init: x_5 = 2.
2385 (* Initializer *)
2386 Init: x_4 = 0.
2387 (* Initializer *)
2388 Init: x_3 = 1.
2389 (* Initializer *)
2390 Init: forall i_1 : Z. ((0 < i_1) -> ((i_1 <= 1) -> (t[i_1] = 0))).
2391 (* Initializer *)
2392 Init: forall i_1 : Z. ((0 <= i_1) -> ((i_1 <= 3) -> (t1_0[i_1] = 1))).
2393 (* Initializer *)
2394 Init: forall i_1 : Z. ((5 <= i_1) -> ((i_1 <= 6) -> (t1_0[i_1] = 2))).
2395 (* Initializer *)
2396 Init: forall i_1 : Z. ((4 <= i_1) -> ((i_1 <= 4) -> (t1_0[i_1] = 0))).
2397 (* Initializer *)
2398 Init: forall i_1 : Z. ((7 <= i_1) -> ((i_1 <= 9) -> (t1_0[i_1] = 0))).
2399 (* Initializer *)
2400 Init: a_6[0] = 1.
2401 (* Initializer *)
2402 Init: a_6[1] = 2.
2403 (* Initializer *)
2404 Init: a_6[2] = 3.
2405 (* Initializer *)
2406 Init: a_7 = 4.
2407 (* Initializer *)
2408 Init: forall i_1 : Z. ((4 <= i_1) -> ((i_1 <= 9) -> (a_6[i_1] = 0))).
2409 (* Initializer *)
2410 Init: (sc0_0.F3_Sc_a) = 1.
2411 (* Initializer *)
2412 Init: a_5[0] = 2.
2413 (* Initializer *)
2414 Init: a_5[1] = 3.
2415 (* Initializer *)
2416 Init: a_5[2] = 4.
2417 (* Initializer *)
2418 Init: (sc0_0.F3_Sc_c) = 5.
2419 (* Initializer *)
2420 Init: (sc1_0.F3_Sc_a) = 1.
2421 (* Initializer *)
2422 Init: a_4[0] = 2.
2423 (* Initializer *)
2424 Init: a_4[1] = 3.
2425 (* Initializer *)
2426 Init: a_4[2] = 4.
2427 (* Initializer *)
2428 Init: (sc1_0.F3_Sc_c) = 5.
2429 (* Initializer *)
2430 Init: (sc2_0.F3_Sc_a) = 1.
2431 (* Initializer *)
2432 Init: a_3[0] = 2.
2433 (* Initializer *)
2434 Init: a_3[1] = 3.
2435 (* Initializer *)
2436 Init: forall i_1 : Z. ((2 <= i_1) -> ((i_1 <= 2) -> (a_3[i_1] = 0))).
2437 (* Initializer *)
2438 Init: x_2 = 4.
2439 (* Initializer *)
2440 Init: (sc3_0.F3_Sc_a) = 1.
2441 (* Initializer *)
2442 Init: a_1[0] = 2.
2443 (* Initializer *)
2444 Init: a_1[1] = 3.
2445 (* Initializer *)
2446 Init: a_2 = 4.
2447 (* Initializer *)
2448 Init: x_1 = 0.
2449 (* Initializer *)
2450 Init: (sq0_0.F3_Sc_a) = 2.
2451 (* Initializer *)
2452 Init: forall i_1 : Z. ((0 <= i_1) -> ((i_1 <= 1) -> (a[i_1] = 2))).
2453 (* Initializer *)
2454 Init: forall i_1 : Z. ((2 <= i_1) -> ((i_1 <= 2) -> (a[i_1] = 0))).
2455 (* Initializer *)
2456 Init: (sq0_0.F3_Sc_c) = 2.
2457 (* Initializer *)
2458 Init: forall i_1 : Z. ((0 <= i_1) -> ((i_1 <= 31) -> (tab_0[i_1] = 0))).
2459 (* Initializer *)
2460 Init: x = (-1).
2461 }
2462 Prove: t1_0[i] = 0.
2463
2464 ------------------------------------------------------------
2465
2466 Goal Pre-condition 'qed_ok,direct_init_union' in 'main':
2467 Let x = u.F4_U_a.
2468 Let a = sq0_0.F3_Sc_b.
2469 Let x_1 = sc3_0.F3_Sc_c.
2470 Let a_1 = sc3_0.F3_Sc_b.
2471 Let a_2 = a_1[2].
2472 Let x_2 = sc2_0.F3_Sc_c.
2473 Let a_3 = sc2_0.F3_Sc_b.
2474 Let a_4 = sc1_0.F3_Sc_b.
2475 Let a_5 = sc0_0.F3_Sc_b.
2476 Let a_6 = st_0.F2_St_tab.
2477 Let a_7 = a_6[3].
2478 Let x_3 = t[0].
2479 Let x_4 = s.F1_S_b.
2480 Let x_5 = s.F1_S_a.
2481 Assume {
2482 Type: IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\ is_uint8(tab_0[5]) /\
2483 is_sint16(x) /\ is_sint32(x_3) /\ is_sint32(t[1]) /\
2484 is_sint32(t1_0[4]) /\ is_sint32(x_5) /\ is_sint32(x_4) /\
2485 is_sint32(x_2) /\ is_sint32(x_1) /\ is_sint32(a_3[2]) /\
2486 is_sint32(a_2) /\ is_sint32(a[1]) /\ is_sint32(a[2]) /\
2487 is_sint32(a_7) /\ is_sint32(a_6[5]).
2488 (* Heap *)
2489 Type: IsArray_sint32(t) /\ IsArray_sint32(t1_0) /\ IsArray_uint8(tab_0) /\
2490 IsS1_S(s) /\ IsS2_St(st_0) /\ IsS3_Sc(sc0_0) /\ IsS3_Sc(sc1_0) /\
2491 IsS3_Sc(sc2_0) /\ IsS3_Sc(sc3_0) /\ IsS3_Sc(sq0_0) /\ IsU4_U(u).
2492 (* Initializer *)
2493 Init: x_5 = 2.
2494 (* Initializer *)
2495 Init: x_4 = 0.
2496 (* Initializer *)
2497 Init: x_3 = 1.
2498 (* Initializer *)
2499 Init: forall i : Z. ((0 < i) -> ((i <= 1) -> (t[i] = 0))).
2500 (* Initializer *)
2501 Init: forall i : Z. ((0 <= i) -> ((i <= 3) -> (t1_0[i] = 1))).
2502 (* Initializer *)
2503 Init: forall i : Z. ((5 <= i) -> ((i <= 6) -> (t1_0[i] = 2))).
2504 (* Initializer *)
2505 Init: forall i : Z. ((4 <= i) -> ((i <= 4) -> (t1_0[i] = 0))).
2506 (* Initializer *)
2507 Init: forall i : Z. ((7 <= i) -> ((i <= 9) -> (t1_0[i] = 0))).
2508 (* Initializer *)
2509 Init: a_6[0] = 1.
2510 (* Initializer *)
2511 Init: a_6[1] = 2.
2512 (* Initializer *)
2513 Init: a_6[2] = 3.
2514 (* Initializer *)
2515 Init: a_7 = 4.
2516 (* Initializer *)
2517 Init: forall i : Z. ((4 <= i) -> ((i <= 9) -> (a_6[i] = 0))).
2518 (* Initializer *)
2519 Init: (sc0_0.F3_Sc_a) = 1.
2520 (* Initializer *)
2521 Init: a_5[0] = 2.
2522 (* Initializer *)
2523 Init: a_5[1] = 3.
2524 (* Initializer *)
2525 Init: a_5[2] = 4.
2526 (* Initializer *)
2527 Init: (sc0_0.F3_Sc_c) = 5.
2528 (* Initializer *)
2529 Init: (sc1_0.F3_Sc_a) = 1.
2530 (* Initializer *)
2531 Init: a_4[0] = 2.
2532 (* Initializer *)
2533 Init: a_4[1] = 3.
2534 (* Initializer *)
2535 Init: a_4[2] = 4.
2536 (* Initializer *)
2537 Init: (sc1_0.F3_Sc_c) = 5.
2538 (* Initializer *)
2539 Init: (sc2_0.F3_Sc_a) = 1.
2540 (* Initializer *)
2541 Init: a_3[0] = 2.
2542 (* Initializer *)
2543 Init: a_3[1] = 3.
2544 (* Initializer *)
2545 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a_3[i] = 0))).
2546 (* Initializer *)
2547 Init: x_2 = 4.
2548 (* Initializer *)
2549 Init: (sc3_0.F3_Sc_a) = 1.
2550 (* Initializer *)
2551 Init: a_1[0] = 2.
2552 (* Initializer *)
2553 Init: a_1[1] = 3.
2554 (* Initializer *)
2555 Init: a_2 = 4.
2556 (* Initializer *)
2557 Init: x_1 = 0.
2558 (* Initializer *)
2559 Init: (sq0_0.F3_Sc_a) = 2.
2560 (* Initializer *)
2561 Init: forall i : Z. ((0 <= i) -> ((i <= 1) -> (a[i] = 2))).
2562 (* Initializer *)
2563 Init: forall i : Z. ((2 <= i) -> ((i <= 2) -> (a[i] = 0))).
2564 (* Initializer *)
2565 Init: (sq0_0.F3_Sc_c) = 2.
2566 (* Initializer *)
2567 Init: forall i : Z. ((0 <= i) -> ((i <= 31) -> (tab_0[i] = 0))).
2568 (* Initializer *)
2569 Init: x = (-1).
2570 }
2571 Prove: x = (-1).
2572
2573 ------------------------------------------------------------