Debian Codegraph @

src/plugins/wp/tests/wp_acsl/oracle/reads.res.oracle

raw
1 # frama-c -wp [...]
2 [kernel] Parsing reads.i (no preprocessing)
3 [wp] Running WP plugin...
4 [wp] Warning: Missing RTE guards
5 ------------------------------------------------------------
6 Function f
7 ------------------------------------------------------------
8
9 Goal Post-condition 'qed_ok' in 'f':
10 Assume {
11 Type: is_sint32(x) /\ is_sint32(y).
12 (* Pre-condition *)
13 Have: P_Q(y, x).
14 (* Pre-condition *)
15 Have: (0 <= x) /\ (x <= 10).
16 (* Pre-condition *)
17 Have: (0 <= y) /\ (y <= 10).
18 }
19 Prove: P_Q(1 + y, 1 + x).
20
21 ------------------------------------------------------------
22 ------------------------------------------------------------
23 Function g
24 ------------------------------------------------------------
25
26 Goal Post-condition 'qed_ok' in 'g':
27 Let x = Mint_0[v].
28 Let x_1 = Mint_0[u].
29 Let m = Mint_0[u <- 1 + x_1].
30 Let x_2 = m[v].
31 Assume {
32 Type: is_sint32(x_1) /\ is_sint32(x) /\ is_sint32(x_2).
33 (* Heap *)
34 Type: (region(u.base) <= 0) /\ (region(v.base) <= 0).
35 (* Pre-condition *)
36 Have: P_P(Mint_0, u, v).
37 (* Pre-condition *)
38 Have: (0 <= x_1) /\ (x_1 <= 10).
39 (* Pre-condition *)
40 Have: (0 <= x) /\ (x <= 10).
41 }
42 Prove: P_P(m[v <- 1 + x_2], u, v).
43
44 ------------------------------------------------------------
45 ------------------------------------------------------------
46 Function modifies_x
47 ------------------------------------------------------------
48
49 Goal Post-condition 'qed_ok,F_OK' in 'modifies_x':
50 Prove: true.
51
52 ------------------------------------------------------------
53
54 Goal Post-condition 'qed_ko,G_KO' in 'modifies_x':
55 Assume {
56 Type: is_sint32(x).
57 (* Heap *)
58 Type: is_sint32(y).
59 (* Pre-condition 'H' *)
60 Have: P_f /\ P_g(x) /\ P_h(y, x) /\ P_w(y, x).
61 }
62 Prove: P_g(1 + x).
63
64 ------------------------------------------------------------
65
66 Goal Post-condition 'qed_ko,H_KO' in 'modifies_x':
67 Assume {
68 Type: is_sint32(x).
69 (* Heap *)
70 Type: is_sint32(y).
71 (* Pre-condition 'H' *)
72 Have: P_f /\ P_g(x) /\ P_h(y, x) /\ P_w(y, x).
73 }
74 Prove: P_h(y, 1 + x).
75
76 ------------------------------------------------------------
77
78 Goal Post-condition 'qed_ok,W_OK,todo' in 'modifies_x':
79 Assume {
80 Type: is_sint32(x).
81 (* Heap *)
82 Type: is_sint32(y).
83 (* Pre-condition 'H' *)
84 Have: P_f /\ P_g(x) /\ P_h(y, x) /\ P_w(y, x).
85 }
86 Prove: P_w(y, 1 + x).
87
88 ------------------------------------------------------------
89 ------------------------------------------------------------
90 Function modifies_y
91 ------------------------------------------------------------
92
93 Goal Post-condition 'qed_ok,F_OK' in 'modifies_y':
94 Prove: true.
95
96 ------------------------------------------------------------
97
98 Goal Post-condition 'qed_ok,G_OK' in 'modifies_y':
99 Prove: true.
100
101 ------------------------------------------------------------
102
103 Goal Post-condition 'qed_ko,H_KO' in 'modifies_y':
104 Assume {
105 Type: is_sint32(y).
106 (* Heap *)
107 Type: is_sint32(x).
108 (* Pre-condition 'H' *)
109 Have: P_f /\ P_g(x) /\ P_h(y, x) /\ P_w(y, x).
110 }
111 Prove: P_h(1 + y, x).
112
113 ------------------------------------------------------------
114
115 Goal Post-condition 'qed_ok,W_OK,todo' in 'modifies_y':
116 Assume {
117 Type: is_sint32(y).
118 (* Heap *)
119 Type: is_sint32(x).
120 (* Pre-condition 'H' *)
121 Have: P_f /\ P_g(x) /\ P_h(y, x) /\ P_w(y, x).
122 }
123 Prove: P_w(1 + y, x).
124
125 ------------------------------------------------------------