[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 25 from proof prepost-add-log-leb (previous step)

# buf3 = EB_PAGE_SIZE, m5 + # lpt = # avol, avol[m2] = mapped(buf0), avol[0] = mapped(buf2), avol[m6] = mapped(buf1), avol0 = avol, buf = buf3, m = # buf1, m0 = m6, n0 = EB_PAGE_SIZE, n1 = 0, m6 < # avol, disk-layout(mksb(adr, m7, m6, m2, m3, m4, m5), # lpt), ebm-vol-inv(avol), is-encoded(rnode(m8), buf3), is-encoded(mksb(adr, m7, m6, m2, m3, m4, m5), buf2), is-encoded(lpt, lebs(avol, m4, lptlebs(# lpt, LEB_SIZE))), is-encoded(log, buf1), is-encoded-pad(orphans, m3, buf0), mapped-full?(avol, m4, lptlebs(# lpt, LEB_SIZE)), # buf1 + EB_PAGE_SIZE ≤ LEB_SIZE ⊦ [if m0 < # avol ∧ avol[m0].mapped? ∧ # avol[m0].data ≤ m ∧ is-aligned(m, EB_PAGE_SIZE) ∧ is-aligned(n0, EB_PAGE_SIZE) ∧ m + n0 ≤ LEB_SIZE ∧ n1 + n0 ≤ # buf then {fail_or_success#(; ; err); if err = ESUCCESS then if n0 ≠ 0 then avol[m0] := mapped(avol[m0].data + mkempbuf(m - # avol[m0].data) + subarray(buf, n1, n0)) else choose n with n < n0 ∧ is-aligned(n, EB_PAGE_SIZE) in if n ≠ 0 then avol[m0] := mapped(avol[m0].data + mkempbuf(m - # avol[m0].data) + subarray(buf, n1, n)) ifnone skip} else abort] ( ebm-vol-inv(avol) → ⟪logoff := # buf1; if err = ESUCCESS then logoff := logoff + EB_PAGE_SIZE else {logoff := LEB_SIZE; debug#("persistence-io: failed to add LEB " + m8.toString + " to log")}⟫ ( (err = ESUCCESS ∨ ⌊err⌋ ) ∧ subarray(avol, m5, # lpt) = subarray(avol0, m5, # lpt) ∧ ( err = ESUCCESS → m5 + # lpt = # avol ∧ avol[0].mapped? ∧ is-encoded(mksb(adr, m7, m6, m2, m3, m4, m5), avol[0].data) ∧ avol[m2].mapped? ∧ is-encoded-pad(orphans, m3, avol[m2].data) ∧ avol[m6].mapped? ∧ (logoff ≠ LEB_SIZE → # avol[m6].data = logoff) ∧ is-encoded(log + m8 ', avol[m6].data) ∧ mapped-full?(avol, m4, lptlebs(# lpt, LEB_SIZE)) ∧ is-encoded(lpt, lebs(avol, m4, lptlebs(# lpt, LEB_SIZE)))) ∧ ( err ≠ ESUCCESS → m5 + # lpt = # avol ∧ avol[0].mapped? ∧ is-encoded(mksb(adr, m7, m6, m2, m3, m4, m5), avol[0].data) ∧ avol[m2].mapped? ∧ is-encoded-pad(orphans, m3, avol[m2].data) ∧ avol[m6].mapped? ∧ (logoff ≠ LEB_SIZE → # avol[m6].data = logoff) ∧ is-encoded(log, avol[m6].data) ∧ mapped-full?(avol, m4, lptlebs(# lpt, LEB_SIZE)) ∧ is-encoded(lpt, lebs(avol, m4, lptlebs(# lpt, LEB_SIZE)))))), # buf1 = LEB_SIZE

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ mapped(buf).mapped?; (s)% ⊦ mapped(buf).data = buf; (s)% ⊦ m ≤ m; (s)% ⊦ is-encoded(nx, buf) → is-aligned(# buf, EB_PAGE_SIZE); (s)% ⊦ EB_PAGE_SIZE ≠ 0; (s)%n ≠ 0 ⊦ is-aligned(n, n); (s)% ⊦ n + 0 = n; (s)%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic%c: ⊦ m + n = n + m; from specification nat-basic