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

# lpt1 = # avol0, # lpt3 = # avol0, adr = adr2, err = err0, keyset(gch1) = gc-heap(lpt1, log2), log = log2, log0 = log1, lpt = lpt3, m = m4, m0 = m1, ns = ns2, awbuf-inv(avol0, bleb1), bin-heap-inv(gch1, lpt1), buf-ro-rw-mode(isbuf1, bleb1, lpt1, avol0), bufs-log-only(bleb1, log2, lpt1), freelist-cons(lpt1, log5), log-group-block(log2, lpt1), lpt-free-unref(lpt1), lpt-free-unref(lpt3), lpt-leb-size(lpt1), lpt-leb-size(lpt3), lpt-ram-flash(lpt1, lpt3, log2), synced(avol0), avol ↓ avol0, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ [if err = ESUCCESS then bleb := nobuffer, isbuf := false, adr0 := adr, m0 := m, log0 := log, lpt0 := lpt, ns0 := ns else avol := ?, bleb := ?, isbuf := ?, adr := ?, m := ?, log := ?, lpt := ?, adr0 := ?, m0 := ?, log0 := ?, lpt0 := ?, ns0 := ?, ns := ?] ( (err = ESUCCESS → synced(avol) ∧ awbuf-inv(avol, bleb) ∧ # lpt = # avol) → ⟪log3 := log0; if err ≠ ESUCCESS then debug#("persistence: wbuf recover failed") else {awbuf_get_leb_size#(adr, m, log, avol, lpt, ns, bleb, isbuf; ; m2); let log1 = log3 in persistence_replay_log#(m2; log1, lpt0); persistence_replay_lpt#(log3, m2, adr, m, log, lpt, ns, bleb, isbuf; lpt0, avol); persistence_create_freelist#(lpt0; freelist); persistence_create_gcheap#(log3; lpt0, gch)}⟫ ( ( err = ESUCCESS → synced(avol) ∧ lpt-free-unref(lpt0) ∧ lpt-free-unref(lpt) ∧ freelist-cons(lpt0, freelist) ∧ log3 = log ∧ bin-heap-inv(gch, lpt0) ∧ keyset(gch) = gc-heap(lpt0, log) ∧ bufs-log-only(bleb, log, lpt0) ∧ # lpt0 = # avol ∧ ¬ dups(log) ∧ log-group-block(log, lpt0) ∧ buf-ro-rw-mode(isbuf, bleb, lpt0, avol) ∧ lpt-leb-size(lpt0) ∧ lpt-leb-size(lpt) ∧ lpt-ram-flash(lpt0, lpt, log) ∧ m2 = LEB_SIZE ∧ awbuf-inv(avol, bleb) ∧ # lpt = # avol) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ ( err = ESUCCESS → # avol = # avol0 ∧ adr0 = adr2 ∧ adr = adr2 ∧ m0 = m4 ∧ m = m4 ∧ log0 = log2 ∧ log = log2 ∧ ns0 = ns2 ∧ ns = ns2 ∧ lpt = lpt3 ∧ bleb = nobuffer ∧ id-idx(replay-lpt(replay-log(lpt3, log2), log2, # avol0), lpt0)))), dups(log2)

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

pos: right 1

Additional information