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

# buf1 = EB_PAGE_SIZE, # lpt0 = # avol1, # avol0 = # avol1, avol0[m4] = mapped(buf2), adr = adr0, align↓(m2 + n3, EB_PAGE_SIZE) = n + m2, avol = avol1, bleb = buffered(m4), buf = buf3, lpt = lpt0, m0 = m3, n0 = n3, ns = ns0, plog = plog0, ¬ rofs, m4 < # avol1, m2 < EB_PAGE_SIZE, abs(avol1, buffered(m4), mkwbuf(buf1, # buf2, m2), avol0, false), awbuf-inv(avol1, buffered(m4)), ebm-vol-inv(avol0), is-aligned(# buf2, EB_PAGE_SIZE), is-aligned(n + m2, EB_PAGE_SIZE), # buf2 + n + m2 ≤ LEB_SIZE, n ≤ # buf3, # buf2 + m2 + n3 ≤ LEB_SIZE, EB_PAGE_SIZE ≤ m2 + n3, n3 ≤ # buf3, # avol1[m4].data + n3 ≤ LEB_SIZE, ⌊err0⌋ , ∀ n0. ¬ n0 < n + m2 ∨ ¬ is-aligned(n0, EB_PAGE_SIZE) ⊦ ⟨if bleb ≠ nobuffer ∧ # avol[bleb.leb].data + n0 ≤ LEB_SIZE ∧ n0 ≤ # buf then if rofs then err := EROFS else {fail_or_success#(; ; err); let m = bleb.leb in if err = ESUCCESS then avol[m] := mapped(avol[m].data + subarray(buf, 0, n0)) else { choose n with n ≠ 0 ∧ n < n0 ∧ is-aligned(# avol[m].data + n, EB_PAGE_SIZE) in avol[m] := mapped(avol[m].data + subarray(buf, 0, n)) ifnone skip or skip; rofs := true}} else abort⟩ (abs(avol, buffered(m4), mkwbuf(buf1, # buf2, m2), avol0, true) ∧ rofs ∧ err0 = err), n3 = 0

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Proof step 218:
# avol0 = # avol1, # lpt0 = # avol1, # buf1 = EB_PAGE_SIZE, avol0[m4] = mapped(buf2), adr = adr0, align↓(m2 + n3, EB_PAGE_SIZE) = n + m2, avol = avol1, bleb = buffered(m4), buf = buf3, lpt = lpt0, m0 = m3, n0 = n3, ns = ns0, plog = plog0, ¬ rofs, m2 < EB_PAGE_SIZE, m4 < # avol1, abs(avol1, buffered(m4), mkwbuf(buf1, # buf2, m2), avol0, false), awbuf-inv(avol1, buffered(m4)), ebm-vol-inv(avol0), is-aligned(n + m2, EB_PAGE_SIZE), is-aligned(# buf2, EB_PAGE_SIZE), # avol1[m4].data + n3 ≤ LEB_SIZE, n3 ≤ # buf3, EB_PAGE_SIZE ≤ m2 + n3, # buf2 + m2 + n3 ≤ LEB_SIZE, n ≤ # buf3, # buf2 + n + m2 ≤ LEB_SIZE, ⌊err0⌋ , ∀ n0. ¬ n0 < n + m2 ∨ ¬ is-aligned(n0, EB_PAGE_SIZE) ⊦ ⟨if rofs then err := EROFS else {fail_or_success#(; ; err); let m = bleb.leb in if err = ESUCCESS then avol[m] := mapped(avol[m].data + subarray(buf, 0, n0)) else { choose n with n ≠ 0 ∧ n < n0 ∧ is-aligned(# avol[m].data + n, EB_PAGE_SIZE) in avol[m] := mapped(avol[m].data + subarray(buf, 0, n)) ifnone skip or skip; rofs := true}}⟩ (abs(avol, buffered(m4), mkwbuf(buf1, # buf2, m2), avol0, true) ∧ rofs ∧ err0 = err), n3 = 0

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ buffered(m).leb = m; (s)% ⊦ m < n ↔ ¬ n ≤ m; (ss)% ⊦ m < n → (n ≤ m ↔ false); (s)%n < # avol ⊦ abs(avol, bleb, wbuf, avol0, rofs) ∧ avol0[n] = mapped(buf) → (avol[n].mapped? ↔ true); (ss)% ⊦ buffered(m).isbuf?; (s)% ⊦ nobuffer ≠ buffered(m); (s)