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

# lpt2 = # avol, # lpt1 = # avol, keyset(gch) = gc-heap(lpt2, log0), remove-refsize0(gstore1) = gstore1, remove-refsize0(istore1) = istore1, dom remove-refsize0(gstore2) ∩ ginval = ∅, elems log0 ∩ ginval = ∅, dom gstore1 ∪ elems log0 = dom gstore2 ∪ ginval, ginval < # avol, abs-gstore(avol, lpt2, gstore2, ginval), abs-istore(avol, lpt2, istore2), awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt2), buf-ro-rw-mode(true, bleb, lpt2, avol), bufs-log-only(bleb, log0, lpt2), flash-lpt-cons(lpt1, istore1, gstore1), freelist-cons(lpt2, freelist), inv(gstore2 \ ginval), inv(gstore1), inv(istore2), inv(istore1), log-group-block(log0, lpt2), lpt-free-unref(lpt1), lpt-free-unref(lpt2), lpt-leb-size(lpt1), lpt-leb-size(lpt2), lpt-ram-flash(lpt2, lpt1, log0), synced(avol), istore1 ⊑ istore2 ⊦ ⟨choose err0 with ⌊err0⌋ ∨ err0 = ESUCCESS in err := err0; ns := ns4; maxino := m0; log := log0; adr := adr3; if err = ESUCCESS then {istore2 := remove-refsize0(istore2); istore1 := istore2; gstore2 := remove-refsize0(gstore2); gstore1 := gstore2; ginval := ∅; adr := adr0; ns := ns2; log := []; maxino := m; pstate := unbuffered} else pstate := readonly; ns0 := ?⟩ ( abs-istore(avol, lpt2, istore2) ∧ abs-gstore(avol, lpt2, gstore2, ginval) ∧ adr = adr3 ∧ maxino = m0 ∧ log = log0 ∧ ginval < # avol ∧ ns = ns4 ∧ flash-lpt-cons(lpt1, istore1, gstore1) ∧ pstate = readonly ∧ ns2 = ns0 ∧ EROFS = err), dups(log0)

Heuristic symbolic execution applied rule choose right

And obtained the following new goals

Rule argument

Additional information