[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 21 from proof refine-deallocate-gnd (previous step)

remove-refsize0(gstore2) = gstore2, remove-refsize0(istore1) = istore1, elems nx0 ∩ ginval3 = ∅, dom gstore2 ∪ elems nx0 = dom gstore3 ∪ ginval3, btree-inv(rp, adr, istore2, istore1, zh, fi2, fi1), inv(gstore3 \ ginval3), inv(gstore2), inv(istore2), inv(istore1), ri-inj(fi2), ri-inj(fi1), n ∈ gstore3, n ∈ gstore2, istore1 ⊑ istore2, pstate.journal? → nx0 ≠ [] ∧ pstate.lnum = nx0.last ∧ pstate.lnum ∈ gstore3, pstate.index? → pstate.lnum ∈ istore2 ⊦ ⟨choose err0 with ⌊err0⌋ ∨ err0 = ESUCCESS in err := err0; gstore := gstore3; ginval := ginval3; if err = ESUCCESS then gstore := gstore -- n, ginval := ginval ++ n⟩ (ginval = ginval3 ++ n ∧ gstore = gstore3 -- n ∧ ESUCCESS = err), dups(nx0), n ∈ nx0

Heuristic symbolic execution applied rule choose right

And obtained the following new goals

Proof step 22:
remove-refsize0(istore1) = istore1, remove-refsize0(gstore2) = gstore2, elems nx0 ∩ ginval3 = ∅, dom gstore2 ∪ elems nx0 = dom gstore3 ∪ ginval3, btree-inv(rp, adr, istore2, istore1, zh, fi2, fi1), inv(istore1), inv(istore2), inv(gstore2), inv(gstore3 \ ginval3), ri-inj(fi1), ri-inj(fi2), n ∈ gstore2, n ∈ gstore3, istore1 ⊑ istore2, pstate.index? → pstate.lnum ∈ istore2, pstate.journal? → nx0 ≠ [] ∧ pstate.lnum = nx0.last ∧ pstate.lnum ∈ gstore3 ⊦ ∃ err0. (⌊err0⌋ ∨ err0 = ESUCCESS) ∧ ⟨err := err0; gstore := gstore3; ginval := ginval3; if err = ESUCCESS then gstore := gstore -- n, ginval := ginval ++ n⟩ (ginval = ginval3 ++ n ∧ gstore = gstore3 -- n ∧ ESUCCESS = err), dups(nx0), n ∈ nx0

Proof step 21 from proof refine-deallocate-gnd (previous step)

Heuristic symbolic execution applied rule choose right

And obtained the following new goals

Rule argument

Additional information