[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 initialization (previous step)

adr0 = @(0, 0, 0), lpt0 = fill(mklparray(m3), mklp(0, 0, LP_FREE, 0)), m0 = m6, m1 = LEB_SIZE, m2 = m3 ⊦ [if # lpt0 = m2 ∧ m1 = LEB_SIZE then {fail_or_success#(; ; err); if err = ESUCCESS then {avol := fill(mkavolume(m2), unmapped); adr := adr0; m := m0; log := []; lpt := lpt0; ns := ∅; bleb := nobuffer; isbuf := false} else avol := ?, bleb := ?, isbuf := ?, adr := ?, m := ?, log := ?, lpt := ?, ns := ?} else abort] ( (err = ESUCCESS → synced(avol) ∧ awbuf-inv(avol, bleb) ∧ # lpt = # avol) → ⟪lpt0 := fill(mklparray(m3), mklp(0, 0, LP_FREE, 0)); log0 := log, m0 := m, adr0 := adr; if err ≠ ESUCCESS then debug#("persistence: wbuf format failed") else {awbuf_get_leb_size#(adr0, m0, log0, avol, lpt, ns, bleb, isbuf; ; m); log1 := []; persistence_create_freelist#(lpt0; freelist); gc_heap_empty#(; gch)}⟫ ( ( err = ESUCCESS → ⟨apersistence_format# (m3, LEB_SIZE, m6; ; adr1, istore1, istore2, ginval, gstore1, gstore2, log2, maxino, ns2, pstate0, isbuf1, err0)⟩ ( abs-istore(avol, lpt0, istore1) ∧ abs-gstore(avol, lpt0, gstore1, ginval) ∧ adr1 = adr0 ∧ maxino = m0 ∧ log2 = log1 ∧ ginval < # lpt0 ∧ ns2 = ns ∧ flash-lpt-cons(lpt, istore2, gstore2) ∧ (isbuf1 → synced(avol)) ∧ (pstate0 = unbuffered → bleb = nobuffer) ∧ (pstate0 = readonly ↔ isbuf) ∧ (pstate0 ≠ unbuffered ∧ pstate0 ≠ readonly → bleb = buffered(pstate0.lnum)) ∧ ESUCCESS = err0)) ∧ ( err ≠ ESUCCESS → (∀ adr, istore, istore0, ns, gstore, gstore0, log, m, ns0, pstate, isbuf. ⟨apersistence_format# (m3, LEB_SIZE, m6; ; adr1, istore1, istore2, ginval, gstore1, gstore2, log2, maxino, ns2, pstate0, isbuf1, err0)⟩ ( adr = adr1 ∧ istore = istore1 ∧ istore0 = istore2 ∧ ns = ginval ∧ gstore = gstore1 ∧ gstore0 = gstore2 ∧ log = log2 ∧ m = maxino ∧ ns0 = ns2 ∧ pstate = pstate0 ∧ (isbuf ↔ isbuf1) ∧ err = err0)))))

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Proof step 13:
adr0 = @(0, 0, 0), lpt0 = fill(mklparray(m3), mklp(0, 0, LP_FREE, 0)), m0 = m6, m1 = LEB_SIZE, m2 = m3 ⊦ [fail_or_success#(; ; err); if err = ESUCCESS then {avol := fill(mkavolume(m2), unmapped); adr := adr0; m := m0; log := []; lpt := lpt0; ns := ∅; bleb := nobuffer; isbuf := false} else avol := ?, bleb := ?, isbuf := ?, adr := ?, m := ?, log := ?, lpt := ?, ns := ?] ( (err = ESUCCESS → synced(avol) ∧ awbuf-inv(avol, bleb) ∧ # lpt = # avol) → ⟪lpt0 := fill(mklparray(m3), mklp(0, 0, LP_FREE, 0)); log0 := log, m0 := m, adr0 := adr; if err ≠ ESUCCESS then debug#("persistence: wbuf format failed") else {awbuf_get_leb_size#(adr0, m0, log0, avol, lpt, ns, bleb, isbuf; ; m); log1 := []; persistence_create_freelist#(lpt0; freelist); gc_heap_empty#(; gch)}⟫ ( ( err = ESUCCESS → ⟨apersistence_format# (m3, LEB_SIZE, m6; ; adr1, istore1, istore2, ginval, gstore1, gstore2, log2, maxino, ns2, pstate0, isbuf1, err0)⟩ ( abs-istore(avol, lpt0, istore1) ∧ abs-gstore(avol, lpt0, gstore1, ginval) ∧ adr1 = adr0 ∧ maxino = m0 ∧ log2 = log1 ∧ ginval < # lpt0 ∧ ns2 = ns ∧ flash-lpt-cons(lpt, istore2, gstore2) ∧ (isbuf1 → synced(avol)) ∧ (pstate0 = unbuffered → bleb = nobuffer) ∧ (pstate0 = readonly ↔ isbuf) ∧ (pstate0 ≠ unbuffered ∧ pstate0 ≠ readonly → bleb = buffered(pstate0.lnum)) ∧ ESUCCESS = err0)) ∧ ( err ≠ ESUCCESS → (∀ adr, istore, istore0, ns, gstore, gstore0, log, m, ns0, pstate, isbuf. ⟨apersistence_format# (m3, LEB_SIZE, m6; ; adr1, istore1, istore2, ginval, gstore1, gstore2, log2, maxino, ns2, pstate0, isbuf1, err0)⟩ ( adr = adr1 ∧ istore = istore1 ∧ istore0 = istore2 ∧ ns = ginval ∧ gstore = gstore1 ∧ gstore0 = gstore2 ∧ log = log2 ∧ m = maxino ∧ ns0 = ns2 ∧ pstate = pstate0 ∧ (isbuf ↔ isbuf1) ∧ err = err0)))))

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ # fill(lpt, lp) = # lpt; (s)% ⊦ # mklparray(n) = n; (s)