[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 13 from proof inv-recover (previous step)

m8 + # lpt0 = # avol1, avol1[0] = mapped(buf), avol1[m5] = mapped(buf0), avol1[m10] = mapped(buf1), avol = avol0, err = err0, disk-layout(mksb(adr0, m9, m10, m5, m6, m7, m8), # lpt0), ebm-vol-inv(avol1), is-encoded(log0, buf1), is-encoded(lpt0, lebs(avol1, m7, lptlebs(# lpt0, LEB_SIZE))), is-encoded(mksb(adr0, m9, m10, m5, m6, m7, m8), buf), is-encoded-pad(orphans0, m6, buf0), mapped-full?(avol1, m7, lptlebs(# lpt0, LEB_SIZE)), avol1 ⊆ avol0, m ≠ LEB_SIZE → # buf1 = m, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ [if err ≠ ESUCCESS then avol := ?] ( (err = ESUCCESS → ebm-vol-inv(avol)) → ⟪avol0 := avol; if err ≠ ESUCCESS then debug#("persistence-io: ubi recover failed") else let m = ? in {ebm_avol_get_leb_size#(avol0; ; m0); ebm_avol_get_page_size#(avol0; ; m1); ebm_avol_get_volume_size#(avol0; ; m); persistence_io_read_superblock#(m1, m0, avol0; sb; err); if err ≠ ESUCCESS then debug#("persistence-io: reading superblock failed"); if err = ESUCCESS then {persistence_io_read_log#(sb, m1, m0, avol0; logoff; log, err); if err ≠ ESUCCESS then debug#("persistence-io: reading log failed")}; if err = ESUCCESS then {persistence_io_read_orphans#(sb, avol0; orphans; err); if err ≠ ESUCCESS then debug#("persistence-io: reading orphans failed")}; if err = ESUCCESS then {m := m - sb.main; let buf = ? in {persistence_io_read_lebs#(sb.lpt, lptlebs(m, m0), m0, avol0; ; buf, err); if err = ESUCCESS then {lpt := mklparray(m); lpt := fill(lpt, mklp(0, 0, LP_FREE, 0)); persistence_io_decode_lpt#(buf; lpt, err)}; if err ≠ ESUCCESS then debug#("persistence-io: reading LPT failed")}}; if err = ESUCCESS then {logoff := m0; adr := sb.indexaddr; m2 := sb.maxino}}⟫ ( ( err = ESUCCESS → (∃ lpt1, log1, orphans1. disk-layout(sb, # lpt1) ∧ sb.main + # lpt1 = # avol0 ∧ avol0[0].mapped? ∧ is-encoded(sb, avol0[0].data) ∧ avol0[sb.orph].mapped? ∧ is-encoded-pad(orphans1, sb.orphsize, avol0[sb.orph].data) ∧ avol0[sb.log].mapped? ∧ (logoff ≠ LEB_SIZE → # avol0[sb.log].data = logoff) ∧ is-encoded(log1, avol0[sb.log].data) ∧ mapped-full?(avol0, sb.lpt, lptlebs(# lpt1, LEB_SIZE)) ∧ is-encoded(lpt1, lebs(avol0, sb.lpt, lptlebs(# lpt1, LEB_SIZE)))) ∧ m1 = EB_PAGE_SIZE ∧ m0 = LEB_SIZE ∧ ebm-vol-inv(avol0)) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ ( err = ESUCCESS → sb = mksb(adr0, m9, m10, m5, m6, m7, m8) ∧ # avol0 = # avol1 ∧ adr = adr0 ∧ m2 = m9 ∧ # lpt = # avol0 - m8 ∧ is-encoded(lpt, lebs(avol0, m7, lptlebs(# avol0 - m8, LEB_SIZE))) ∧ lebs(avol0, m7, lptlebs(# avol0 - m8, LEB_SIZE)) = lebs(avol1, m7, lptlebs(# avol0 - m8, LEB_SIZE)) ∧ is-encoded(log, avol0[m10].data) ∧ is-encoded-pad(orphans, m6, avol0[m5].data) ∧ avol0[m5] = avol1[m5] ∧ avol0[m10] = avol1[m10])))

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

pos: right 1

Additional information