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

# lpt1 = # avol, # lpt2 = # avol, keyset(gch) = gc-heap(lpt2, log1), awbuf-inv(avol, bleb0), awbuf-inv(avol, nobuffer), bin-heap-inv(gch, lpt2), buf-ro-rw-mode(false, bleb0, lpt2, avol), bufs-log-only(bleb0, log1, lpt2), freelist-cons(lpt2, freelist), log-group-block(log1, lpt2), lpt-free-unref(lpt1), lpt-free-unref(lpt2), lpt-leb-size(lpt1), lpt-leb-size(lpt2), lpt-ram-flash(lpt2, lpt1, log1), synced(avol) ⊦ ⟪choose err0 with ⌊err0⌋ ∨ err0 = ESUCCESS in err := err0; lpt := lpt1; log := log1; isbuf := false; if err = ESUCCESS then {adr := adr0; m := m0; log := []; lpt := lpt2; ns := ns0} else isbuf := true; ns0 := ?; bleb := nobuffer; lpt1 := lpt; if err = ESUCCESS then {persistence_gc_heap_add_log#(; log1, lpt2, gch); persistence_cleanup_lpt#(adr, m, log, lpt1, ns, bleb, isbuf; lpt2, freelist, gch, avol)}⟫ ( lpt-free-unref(lpt2) ∧ lpt-free-unref(lpt1) ∧ freelist-cons(lpt2, freelist) ∧ log1 = log ∧ bin-heap-inv(gch, lpt2) ∧ keyset(gch) = gc-heap(lpt2, log) ∧ bufs-log-only(bleb, log, lpt2) ∧ # lpt2 = # avol ∧ ¬ dups(log) ∧ log-group-block(log, lpt2) ∧ buf-ro-rw-mode(isbuf, bleb, lpt2, avol) ∧ lpt-leb-size(lpt2) ∧ lpt-leb-size(lpt1) ∧ lpt-ram-flash(lpt2, lpt1, log) ∧ awbuf-inv(avol, bleb) ∧ # lpt1 = # avol ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → bleb = nobuffer) ∧ (err = ESUCCESS ↔ ¬ isbuf)), dups(log1)

Heuristic symbolic execution applied rule choose right

And obtained the following new goals

Rule argument

Additional information