| 1 |
# frama-c -wp -wp-rte -wp-no-let [...] |
| 2 |
[kernel] Parsing struct_fields.i (no preprocessing) |
| 3 |
[wp] Running WP plugin... |
| 4 |
[rte:annot] annotating function foo |
| 5 |
[wp] 2 goals scheduled |
| 6 |
--------------------------------------------- |
| 7 |
--- Context 'typed_foo' Cluster 'Init_S1_X' |
| 8 |
--------------------------------------------- |
| 9 |
theory Init_S1_X |
| 10 |
(* use why3.BuiltIn.BuiltIn *) |
| 11 |
|
| 12 |
(* use bool.Bool *) |
| 13 |
|
| 14 |
(* use int.Int *) |
| 15 |
|
| 16 |
(* use int.ComputerDivision *) |
| 17 |
|
| 18 |
(* use real.RealInfix *) |
| 19 |
|
| 20 |
(* use frama_c_wp.qed.Qed *) |
| 21 |
|
| 22 |
(* use map.Map *) |
| 23 |
|
| 24 |
type Init_S1_X = |
| 25 |
| Init_S1_X1 (Init_F1_X_a:bool) (Init_F1_X_b:bool) (Init_F1_X_c:bool) |
| 26 |
end |
| 27 |
--------------------------------------------- |
| 28 |
--- Context 'typed_foo' Cluster 'S1_X' |
| 29 |
--------------------------------------------- |
| 30 |
theory S1_X |
| 31 |
(* use why3.BuiltIn.BuiltIn *) |
| 32 |
|
| 33 |
(* use bool.Bool *) |
| 34 |
|
| 35 |
(* use int.Int *) |
| 36 |
|
| 37 |
(* use int.ComputerDivision *) |
| 38 |
|
| 39 |
(* use real.RealInfix *) |
| 40 |
|
| 41 |
(* use frama_c_wp.qed.Qed *) |
| 42 |
|
| 43 |
(* use map.Map *) |
| 44 |
|
| 45 |
type S1_X = |
| 46 |
| S1_X1 (F1_X_a:int) (F1_X_b:int) (F1_X_c:int) |
| 47 |
|
| 48 |
(* use frama_c_wp.cint.Cint *) |
| 49 |
|
| 50 |
predicate IsS1_X (s:S1_X) = |
| 51 |
(is_sint8 (F1_X_a s) /\ is_sint16 (F1_X_b s)) /\ is_sint32 (F1_X_c s) |
| 52 |
end |
| 53 |
--------------------------------------------- |
| 54 |
--- Context 'typed_foo' Cluster 'Compound' |
| 55 |
--------------------------------------------- |
| 56 |
theory Compound |
| 57 |
(* use why3.BuiltIn.BuiltIn *) |
| 58 |
|
| 59 |
(* use bool.Bool *) |
| 60 |
|
| 61 |
(* use int.Int *) |
| 62 |
|
| 63 |
(* use int.ComputerDivision *) |
| 64 |
|
| 65 |
(* use real.RealInfix *) |
| 66 |
|
| 67 |
(* use frama_c_wp.qed.Qed *) |
| 68 |
|
| 69 |
(* use map.Map *) |
| 70 |
|
| 71 |
(* use frama_c_wp.memory.Memory *) |
| 72 |
|
| 73 |
function shiftfield_F1_X_a (p:addr) : addr = shift p 0 |
| 74 |
|
| 75 |
function shiftfield_F1_X_b (p:addr) : addr = shift p 1 |
| 76 |
|
| 77 |
function shiftfield_F1_X_c (p:addr) : addr = shift p 2 |
| 78 |
|
| 79 |
(* use S1_X *) |
| 80 |
|
| 81 |
function Load_S1_X (p:addr) (mchar:addr -> int) (mint:addr -> int) (mint1: |
| 82 |
addr -> int) : S1_X = |
| 83 |
S1_X1 (get mchar (shiftfield_F1_X_a p)) (get mint (shiftfield_F1_X_b p)) |
| 84 |
(get mint1 (shiftfield_F1_X_c p)) |
| 85 |
|
| 86 |
(* use Init_S1_X *) |
| 87 |
|
| 88 |
function Load_Init_S1_X (p:addr) (init:addr -> bool) : Init_S1_X = |
| 89 |
Init_S1_X1 (get init (shiftfield_F1_X_a p)) |
| 90 |
(get init (shiftfield_F1_X_b p)) (get init (shiftfield_F1_X_c p)) |
| 91 |
|
| 92 |
axiom Q_Load_S1_X_update_Mchar0 : |
| 93 |
forall mchar:addr -> int, mint:addr -> int, mint1:addr -> int, p:addr, q: |
| 94 |
addr, v:int [Load_S1_X p (set mchar q v) mint mint1]. |
| 95 |
separated p 3 q 1 -> |
| 96 |
Load_S1_X p (set mchar q v) mint mint1 = Load_S1_X p mchar mint mint1 |
| 97 |
|
| 98 |
axiom Q_Load_S1_X_eqmem_Mchar0 : |
| 99 |
forall mchar:addr -> int, mchar1:addr -> int, mint:addr -> int, mint1: |
| 100 |
addr -> int, n:int, p:addr, q:addr [Load_S1_X p mchar mint mint1, |
| 101 |
eqmem mchar mchar1 q n| Load_S1_X p mchar1 mint mint1, |
| 102 |
eqmem mchar mchar1 q n]. |
| 103 |
included p 3 q n -> |
| 104 |
eqmem mchar mchar1 q n -> |
| 105 |
Load_S1_X p mchar1 mint mint1 = Load_S1_X p mchar mint mint1 |
| 106 |
|
| 107 |
axiom Q_Load_S1_X_havoc_Mchar0 : |
| 108 |
forall mchar:addr -> int, mchar1:addr -> int, mint:addr -> int, mint1: |
| 109 |
addr -> int, n:int, p:addr, q:addr |
| 110 |
[Load_S1_X p (havoc mchar1 mchar q n) mint mint1]. |
| 111 |
separated p 3 q n -> |
| 112 |
Load_S1_X p (havoc mchar1 mchar q n) mint mint1 = |
| 113 |
Load_S1_X p mchar mint mint1 |
| 114 |
|
| 115 |
axiom Q_Load_S1_X_update_Mint1 : |
| 116 |
forall mchar:addr -> int, mint:addr -> int, mint1:addr -> int, p:addr, q: |
| 117 |
addr, v:int [Load_S1_X p mchar (set mint1 q v) mint]. |
| 118 |
separated p 3 q 1 -> |
| 119 |
Load_S1_X p mchar (set mint1 q v) mint = Load_S1_X p mchar mint1 mint |
| 120 |
|
| 121 |
axiom Q_Load_S1_X_eqmem_Mint1 : |
| 122 |
forall mchar:addr -> int, mint:addr -> int, mint1:addr -> int, mint2:addr |
| 123 |
-> int, n:int, p:addr, q:addr [Load_S1_X p mchar mint1 mint, |
| 124 |
eqmem mint1 mint2 q n| Load_S1_X p mchar mint2 mint, |
| 125 |
eqmem mint1 mint2 q n]. |
| 126 |
included p 3 q n -> |
| 127 |
eqmem mint1 mint2 q n -> |
| 128 |
Load_S1_X p mchar mint2 mint = Load_S1_X p mchar mint1 mint |
| 129 |
|
| 130 |
axiom Q_Load_S1_X_havoc_Mint1 : |
| 131 |
forall mchar:addr -> int, mint:addr -> int, mint1:addr -> int, mint2:addr |
| 132 |
-> int, n:int, p:addr, q:addr |
| 133 |
[Load_S1_X p mchar (havoc mint2 mint1 q n) mint]. |
| 134 |
separated p 3 q n -> |
| 135 |
Load_S1_X p mchar (havoc mint2 mint1 q n) mint = |
| 136 |
Load_S1_X p mchar mint1 mint |
| 137 |
|
| 138 |
axiom Q_Load_S1_X_update_Mint2 : |
| 139 |
forall mchar:addr -> int, mint:addr -> int, mint1:addr -> int, p:addr, q: |
| 140 |
addr, v:int [Load_S1_X p mchar mint (set mint1 q v)]. |
| 141 |
separated p 3 q 1 -> |
| 142 |
Load_S1_X p mchar mint (set mint1 q v) = Load_S1_X p mchar mint mint1 |
| 143 |
|
| 144 |
axiom Q_Load_S1_X_eqmem_Mint2 : |
| 145 |
forall mchar:addr -> int, mint:addr -> int, mint1:addr -> int, mint2:addr |
| 146 |
-> int, n:int, p:addr, q:addr [Load_S1_X p mchar mint mint1, |
| 147 |
eqmem mint1 mint2 q n| Load_S1_X p mchar mint mint2, |
| 148 |
eqmem mint1 mint2 q n]. |
| 149 |
included p 3 q n -> |
| 150 |
eqmem mint1 mint2 q n -> |
| 151 |
Load_S1_X p mchar mint mint2 = Load_S1_X p mchar mint mint1 |
| 152 |
|
| 153 |
axiom Q_Load_S1_X_havoc_Mint2 : |
| 154 |
forall mchar:addr -> int, mint:addr -> int, mint1:addr -> int, mint2:addr |
| 155 |
-> int, n:int, p:addr, q:addr |
| 156 |
[Load_S1_X p mchar mint (havoc mint2 mint1 q n)]. |
| 157 |
separated p 3 q n -> |
| 158 |
Load_S1_X p mchar mint (havoc mint2 mint1 q n) = |
| 159 |
Load_S1_X p mchar mint mint1 |
| 160 |
|
| 161 |
axiom Q_Load_Init_S1_X_update_Init0 : |
| 162 |
forall init:addr -> bool, p:addr, q:addr, v:bool |
| 163 |
[Load_Init_S1_X p (set init q v)]. |
| 164 |
separated p 3 q 1 -> |
| 165 |
Load_Init_S1_X p (set init q v) = Load_Init_S1_X p init |
| 166 |
|
| 167 |
axiom Q_Load_Init_S1_X_eqmem_Init0 : |
| 168 |
forall init:addr -> bool, init1:addr -> bool, n:int, p:addr, q:addr |
| 169 |
[Load_Init_S1_X p init, eqmem init init1 q n| Load_Init_S1_X p init1, |
| 170 |
eqmem init init1 q n]. |
| 171 |
included p 3 q n -> |
| 172 |
eqmem init init1 q n -> Load_Init_S1_X p init1 = Load_Init_S1_X p init |
| 173 |
|
| 174 |
axiom Q_Load_Init_S1_X_havoc_Init0 : |
| 175 |
forall init:addr -> bool, init1:addr -> bool, n:int, p:addr, q:addr |
| 176 |
[Load_Init_S1_X p (havoc init1 init q n)]. |
| 177 |
separated p 3 q n -> |
| 178 |
Load_Init_S1_X p (havoc init1 init q n) = Load_Init_S1_X p init |
| 179 |
end |
| 180 |
--------------------------------------------- |
| 181 |
--- Context 'typed_foo' Cluster 'Chunk' |
| 182 |
--------------------------------------------- |
| 183 |
theory Chunk |
| 184 |
(* use why3.BuiltIn.BuiltIn *) |
| 185 |
|
| 186 |
(* use bool.Bool *) |
| 187 |
|
| 188 |
(* use int.Int *) |
| 189 |
|
| 190 |
(* use int.ComputerDivision *) |
| 191 |
|
| 192 |
(* use real.RealInfix *) |
| 193 |
|
| 194 |
(* use frama_c_wp.qed.Qed *) |
| 195 |
|
| 196 |
(* use map.Map *) |
| 197 |
|
| 198 |
(* use frama_c_wp.memory.Memory *) |
| 199 |
|
| 200 |
(* use frama_c_wp.cint.Cint *) |
| 201 |
|
| 202 |
predicate is_sint8_chunk (m:addr -> int) = |
| 203 |
forall a:addr. is_sint8 (get m a) |
| 204 |
|
| 205 |
predicate is_sint16_chunk (m:addr -> int) = |
| 206 |
forall a:addr. is_sint16 (get m a) |
| 207 |
|
| 208 |
predicate is_sint32_chunk (m:addr -> int) = |
| 209 |
forall a:addr. is_sint32 (get m a) |
| 210 |
end |
| 211 |
[wp:print-generated] |
| 212 |
theory WP |
| 213 |
(* use why3.BuiltIn.BuiltIn *) |
| 214 |
|
| 215 |
(* use bool.Bool *) |
| 216 |
|
| 217 |
(* use int.Int *) |
| 218 |
|
| 219 |
(* use int.ComputerDivision *) |
| 220 |
|
| 221 |
(* use real.RealInfix *) |
| 222 |
|
| 223 |
(* use frama_c_wp.qed.Qed *) |
| 224 |
|
| 225 |
(* use map.Map *) |
| 226 |
|
| 227 |
(* use frama_c_wp.memory.Memory *) |
| 228 |
|
| 229 |
(* use Init_S1_X *) |
| 230 |
|
| 231 |
(* use Compound *) |
| 232 |
|
| 233 |
(* use Chunk *) |
| 234 |
|
| 235 |
goal wp_goal : |
| 236 |
forall t:addr -> bool, x:Init_S1_X, t1:int -> int, t2:addr -> int, t3: |
| 237 |
addr -> int, t4:addr -> int, a:addr. |
| 238 |
Load_Init_S1_X a t = x -> |
| 239 |
region (a.base) <= 0 -> |
| 240 |
is_sint16_chunk t3 -> |
| 241 |
is_sint32_chunk t4 -> |
| 242 |
is_sint8_chunk t2 -> |
| 243 |
linked t1 -> |
| 244 |
sconst t2 -> |
| 245 |
cinits t -> |
| 246 |
valid_rd t1 a 3 -> IsS1_X (Load_S1_X a t2 t3 t4) -> valid_rw t1 a 3 |
| 247 |
end |
| 248 |
[wp:print-generated] |
| 249 |
theory WP1 |
| 250 |
(* use why3.BuiltIn.BuiltIn *) |
| 251 |
|
| 252 |
(* use bool.Bool *) |
| 253 |
|
| 254 |
(* use int.Int *) |
| 255 |
|
| 256 |
(* use int.ComputerDivision *) |
| 257 |
|
| 258 |
(* use real.RealInfix *) |
| 259 |
|
| 260 |
(* use frama_c_wp.qed.Qed *) |
| 261 |
|
| 262 |
(* use map.Map *) |
| 263 |
|
| 264 |
(* use frama_c_wp.memory.Memory *) |
| 265 |
|
| 266 |
(* use S1_X *) |
| 267 |
|
| 268 |
(* use Chunk *) |
| 269 |
|
| 270 |
(* use Compound *) |
| 271 |
|
| 272 |
goal wp_goal : |
| 273 |
forall t:addr -> bool, t1:int -> int, t2:addr -> int, t3:addr -> int, t4: |
| 274 |
addr -> int, a:addr, x:S1_X. |
| 275 |
region (a.base) <= 0 -> |
| 276 |
IsS1_X x -> |
| 277 |
is_sint16_chunk t3 -> |
| 278 |
is_sint32_chunk t4 -> |
| 279 |
is_sint8_chunk t2 -> |
| 280 |
linked t1 -> |
| 281 |
sconst t2 -> |
| 282 |
cinits t -> IsS1_X (Load_S1_X a t2 t3 t4) -> valid_rd t1 a 3 |
| 283 |
end |
| 284 |
[wp] 2 goals generated |
| 285 |
------------------------------------------------------------ |
| 286 |
Function foo |
| 287 |
------------------------------------------------------------ |
| 288 |
|
| 289 |
Goal Assertion 'rte,mem_access' (file struct_fields.i, line 15): |
| 290 |
Assume { |
| 291 |
Type: IsS1_X(r) /\ is_sint16_chunk(Mint_0) /\ is_sint32_chunk(Mint_1) /\ |
| 292 |
is_sint8_chunk(Mchar_0) /\ |
| 293 |
IsS1_X(Load_S1_X(p, Mchar_0, Mint_0, Mint_1)). |
| 294 |
(* Heap *) |
| 295 |
Type: (region(p.base) <= 0) /\ linked(Malloc_0) /\ sconst(Mchar_0) /\ |
| 296 |
cinits(Init_0). |
| 297 |
Type: IsS1_X(r) /\ is_sint16_chunk(Mint_0) /\ is_sint32_chunk(Mint_1) /\ |
| 298 |
is_sint8_chunk(Mchar_0). |
| 299 |
Type: IsS1_X(r) /\ is_sint16_chunk(Mint_0) /\ is_sint32_chunk(Mint_1) /\ |
| 300 |
is_sint8_chunk(Mchar_0). |
| 301 |
} |
| 302 |
Prove: valid_rd(Malloc_0, p, 3). |
| 303 |
|
| 304 |
------------------------------------------------------------ |
| 305 |
|
| 306 |
Goal Assertion 'rte,mem_access' (file struct_fields.i, line 16): |
| 307 |
Let a = Load_S1_X(p, Mchar_0, Mint_0, Mint_1). |
| 308 |
Assume { |
| 309 |
Type: IsS1_X(r) /\ is_sint16_chunk(Mint_0) /\ is_sint32_chunk(Mint_1) /\ |
| 310 |
is_sint8_chunk(Mchar_0) /\ IsS1_X(a). |
| 311 |
(* Heap *) |
| 312 |
Type: (region(p.base) <= 0) /\ linked(Malloc_0) /\ sconst(Mchar_0) /\ |
| 313 |
cinits(Init_0). |
| 314 |
Type: IsS1_X(r) /\ is_sint16_chunk(Mint_0) /\ is_sint32_chunk(Mint_1) /\ |
| 315 |
is_sint8_chunk(Mchar_0). |
| 316 |
Type: IsS1_X(r) /\ is_sint16_chunk(Mint_0) /\ is_sint32_chunk(Mint_1) /\ |
| 317 |
is_sint8_chunk(Mchar_0). |
| 318 |
Type: IsS1_X(r) /\ is_sint16_chunk(Mint_0) /\ is_sint32_chunk(Mint_1) /\ |
| 319 |
is_sint8_chunk(Mchar_0). |
| 320 |
(* Assertion 'rte,mem_access' *) |
| 321 |
Have: valid_rd(Malloc_0, p, 3). |
| 322 |
(* Initializer *) |
| 323 |
Init: Load_Init_S1_X(p, Init_0) = Init_r_0. |
| 324 |
(* Initializer *) |
| 325 |
Init: a = r. |
| 326 |
} |
| 327 |
Prove: valid_rw(Malloc_0, p, 3). |
| 328 |
|
| 329 |
------------------------------------------------------------ |