[Imprint][Data Privacy Statement][E-Mail]

View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 35 from proof refine-map (previous step)

⟨if avols[v][vtblpnum0].mapped? then choose n with n < n0 ∧ is-aligned(n, EB_PAGE_SIZE) in if n ≠ 0 then avols[v][vtblpnum0] := mapped(subarray(avols[v][vtblpnum0].data, 0, vtblpnum) + subarray(buf, n1, n) + mkempbuf(LEB_SIZE - vtblpnum - n), vtblpnum + n) ifnone skip else if n0 ≠ 0 then avols[v][vtblpnum0] := unmapped⟩ (avols = avols0 ∧ err2 = err1), ⟨fail_or_success#(; ; err)⟩ (err = err2), # apebs = # wlar, vols[v][vtblpnum2] = unmapped, buf = mkbuf(0), n0 = 0, n1 = 0, vtblpnum = 0, vtblpnum0 = vtblpnum2, vtblpnum2 < # vols[v], vtblpnum2 < # avols[v], abs(avols, apebs, vols, q), abs(avols0, apebs0, vols0, q0), bflipset-cons(bflipset, wlar), ebm-cons(avols), ubi-io-inv(apebs), unique-sqns(apebs), valid-ebatbl(apebs, wlar, vols, vtblpnum3), valid-eraseq(apebs, q), valid-eraseq(wlar, q), valid-eraseq(q), valid-global-sqn(apebs, sqnum), valid-vtbl(apebs, vols, wlar, vtblpnum3), valid-wl(apebs, wlar), v ∈ vols, v ∈ avols ⊦ ∃ err0. (⌊err0⌋ ∨ err0 = ESUCCESS) ∧ ⟨err := err0; if err = ESUCCESS then avols[v][vtblpnum2] := mapped(emptyleb, 0)⟩ (abs(avols, apebs0, vols0, q0) ∧ err1 = err), err2 = ESUCCESS, avols[v][vtblpnum2].mapped?, VTBL_VOLID ∈ vols

Heuristic symbolic execution applied rule if negative left

And obtained the following new goals

Proof step 36:
⟨if n0 ≠ 0 then avols[v][vtblpnum0] := unmapped⟩ (avols = avols0 ∧ err2 = err1), ⟨fail_or_success#(; ; err)⟩ (err = err2), # apebs = # wlar, vols[v][vtblpnum2] = unmapped, buf = mkbuf(0), n0 = 0, n1 = 0, vtblpnum = 0, vtblpnum0 = vtblpnum2, vtblpnum2 < # avols[v], vtblpnum2 < # vols[v], abs(avols0, apebs0, vols0, q0), abs(avols, apebs, vols, q), bflipset-cons(bflipset, wlar), ebm-cons(avols), ubi-io-inv(apebs), unique-sqns(apebs), valid-ebatbl(apebs, wlar, vols, vtblpnum3), valid-eraseq(q), valid-eraseq(wlar, q), valid-eraseq(apebs, q), valid-global-sqn(apebs, sqnum), valid-vtbl(apebs, vols, wlar, vtblpnum3), valid-wl(apebs, wlar), v ∈ avols, v ∈ vols ⊦ ∃ err0. (⌊err0⌋ ∨ err0 = ESUCCESS) ∧ ⟨err := err0; if err = ESUCCESS then avols[v][vtblpnum2] := mapped(emptyleb, 0)⟩ (abs(avols, apebs0, vols0, q0) ∧ err1 = err), err2 = ESUCCESS, avols[v][vtblpnum2].mapped?, VTBL_VOLID ∈ vols

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ v ∈ vols ∧ m < # vols[v] ∧ abs(avols, apebs, vols, q) → m < # avols[v]; (ss)% ⊦ v ∈ vols ∧ abs(avols, apebs, vols, q) → v ∈ avols; (ss)