[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 375 from proof refine-write (previous step)

# apebs = # wlar, vols[v][vtblpnum3] = ⌜n4⌝ , avols0[v][vtblpnum3] = mapped(buf2, m), wlar[n4] = wl-entry(m1, used), apebs[n4] = mkpeb(aehdr, avhdr, buf2, m0, false), err = err2, aehdr.valid?, avhdr.valid?, vtblpnum3 < # vols[v], n4 < # wlar, vtblpnum3 < # avols0[v], abs(avols0, apebs, vols, q), abs(avols0, apebs0, vols0, q0), bflipset-cons(bflipset, wlar), ebm-cons(avols0), is-aligned(vtblpnum5, EB_PAGE_SIZE), is-aligned(n0, EB_PAGE_SIZE), ubi-io-inv(apebs), ubi-io-peb-inv(mkpeb(aehdr, avhdr, buf2, m0, false)), unique-sqns(apebs), valid-ebatbl(apebs, wlar, vols, vtblpnum4), valid-eraseq(q), valid-eraseq(wlar, q), valid-eraseq(apebs, q), valid-global-sqn(apebs, sqnum), valid-vtbl(apebs, vols, wlar, vtblpnum4), valid-wl(apebs, wlar), v ∈ vols, v ∈ avols0, n3 + n0 ≤ # buf0, m ≤ LEB_SIZE, m0 ≤ LEB_SIZE, n0 + n3 ≤ # buf0, m ≤ vtblpnum5, m0 ≤ vtblpnum5, vtblpnum5 + n0 ≤ LEB_SIZE, vtblpnum5 ≤ LEB_SIZE, ⌊err3⌋ , ⌊err2⌋ ⊦ ⟨if avols0[v][vtblpnum3].mapped? then choose n1 with n1 < n0 ∧ is-aligned(n1, EB_PAGE_SIZE) in if n1 ≠ 0 then avols0[v][vtblpnum3] := mapped (subarray(avols0[v][vtblpnum3].data, 0, vtblpnum5) + subarray(buf0, n3, n1) + mkempbuf(LEB_SIZE - vtblpnum5 - n1), vtblpnum5 + n1) ifnone skip else if n0 ≠ 0 then avols0[v][vtblpnum3] := unmapped⟩ (abs(avols0, apebs0, vols0, q0) ∧ err2 = err), n0 = 0, vtblpnum4 = n4, VTBL_VOLID ∈ vols

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Proof step 376:
# apebs = # wlar, apebs[n4] = mkpeb(aehdr, avhdr, buf2, m0, false), wlar[n4] = wl-entry(m1, used), avols0[v][vtblpnum3] = mapped(buf2, m), vols[v][vtblpnum3] = ⌜n4⌝ , err = err2, avhdr.valid?, aehdr.valid?, vtblpnum3 < # avols0[v], n4 < # wlar, vtblpnum3 < # vols[v], abs(avols0, apebs0, vols0, q0), abs(avols0, apebs, vols, q), bflipset-cons(bflipset, wlar), ebm-cons(avols0), is-aligned(n0, EB_PAGE_SIZE), is-aligned(vtblpnum5, EB_PAGE_SIZE), ubi-io-inv(apebs), ubi-io-peb-inv(mkpeb(aehdr, avhdr, buf2, m0, false)), unique-sqns(apebs), valid-ebatbl(apebs, wlar, vols, vtblpnum4), valid-eraseq(apebs, q), valid-eraseq(wlar, q), valid-eraseq(q), valid-global-sqn(apebs, sqnum), valid-vtbl(apebs, vols, wlar, vtblpnum4), valid-wl(apebs, wlar), v ∈ avols0, v ∈ vols, vtblpnum5 ≤ LEB_SIZE, vtblpnum5 + n0 ≤ LEB_SIZE, m0 ≤ vtblpnum5, m ≤ vtblpnum5, n0 + n3 ≤ # buf0, m0 ≤ LEB_SIZE, m ≤ LEB_SIZE, n3 + n0 ≤ # buf0, ⌊err2⌋ , ⌊err3⌋ ⊦ ⟨choose n1 with n1 < n0 ∧ is-aligned(n1, EB_PAGE_SIZE) in if n1 ≠ 0 then avols0[v][vtblpnum3] := mapped(subarray(avols0[v][vtblpnum3].data, 0, vtblpnum5) + subarray(buf0, n3, n1) + mkempbuf(LEB_SIZE - vtblpnum5 - n1), vtblpnum5 + n1) ifnone skip⟩ (abs(avols0, apebs0, vols0, q0) ∧ err2 = err), n0 = 0, vtblpnum4 = n4, VTBL_VOLID ∈ vols

Rule argument

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)% ⊦ mapped(buf, m).mapped?; (s)