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

err = err1, remove-refsize0(istore1) = istore1, remove-refsize0(gstore2) = gstore2, elems nx0 ∩ ginval0 = ∅, dom gstore2 ∪ elems nx0 = dom gstore0 ∪ ginval0, btree-inv(rp, adr1, istore2, istore1, zh, fi2, fi1), inv(istore1), inv(istore2), inv(gstore2), inv(gstore0 \ ginval0), ri-inj(fi1), ri-inj(fi2), @(m, m0, m1) ∈ gstore0, istore1 ⊑ istore2, ⌊err1⌋ , pstate = unbuffered → syn0, pstate.index? → pstate.lnum ∈ istore2, pstate.journal? → nx0 ≠ [] ∧ pstate.lnum = nx0.last ∧ pstate.lnum ∈ gstore0 ⊦ ⟨if err = ESUCCESS then gnd := gstore0[@(m, m0, m1)] else gnd := ?⟩ (gnd1 = gnd ∧ err1 = err), dups(nx0), m ∈ ginval0

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Proof step 40:
err = err1, remove-refsize0(gstore2) = gstore2, remove-refsize0(istore1) = istore1, elems nx0 ∩ ginval0 = ∅, dom gstore2 ∪ elems nx0 = dom gstore0 ∪ ginval0, btree-inv(rp, adr1, istore2, istore1, zh, fi2, fi1), inv(gstore0 \ ginval0), inv(gstore2), inv(istore2), inv(istore1), ri-inj(fi2), ri-inj(fi1), @(m, m0, m1) ∈ gstore0, istore1 ⊑ istore2, ⌊err1⌋ , pstate.journal? → nx0 ≠ [] ∧ pstate.lnum = nx0.last ∧ pstate.lnum ∈ gstore0, pstate.index? → pstate.lnum ∈ istore2, pstate = unbuffered → syn0 ⊦ ⟨gnd := ?⟩ (gnd1 = gnd ∧ err1 = err), dups(nx0), m ∈ ginval0

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ ⌊err⌋ → err ≠ ESUCCESS; (s)