[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 20 from proof recovery (previous step)

fi = fi0, ginval = ginval2, ginval0 = ginval3, gstore = gstore1, gstore0 = crash(gstore4, gstore1, ginval3, nx1), gstore3 = crash(gstore4, gstore1, ginval3, nx1), maxino = maxino1, nx = nx1, remove-refsize0(istore1) = istore1, remove-refsize0(gstore1) = gstore1, syn, elems nx1 ∩ ginval3 = ∅, dom gstore1 ∪ elems nx1 = dom gstore4 ∪ ginval3, btree-inv(rp1, adr2, istore2, istore1, zh, ri, fi3), btree-inv(rp1, adr2, istore2, istore1, zh, fi1, fi0), inv(crash(gstore4, gstore1, ginval3, nx1) \ ginval3), inv(istore1), inv(istore2), inv(gstore1), inv(gstore4 \ ginval3), ri-inj(fi0), ri-inj(fi1), istore1 ⊑ istore2, ¬ dups(nx1), pstate1.index? → pstate1.lnum ∈ istore2, pstate1.journal? → nx1 ≠ [] ∧ pstate1.lnum = nx1.last ∧ pstate1.lnum ∈ gstore4 ⊦ ⟨index+persistence_recover#(; maxino3, nx3, ginval6, fi0, fi, ginval3, gstore3, gstore1, nx1, maxino1, ginval2, syn; err0)⟩ ( ginval3 = ginval0 ∧ gstore3 = gstore0 ∧ gstore1 = gstore ∧ nx1 = nx3 ∧ maxino1 = maxino3 ∧ ginval2 = ginval6 ∧ btree-inv(null, adr2, remove-refsize0(crash(istore2, istore1)), istore1, zh0, fi0, fi) ∧ syn ∧ maxino = maxino3 ∧ nx = nx3 ∧ ginval = ginval6 ∧ ESUCCESS = err0)

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 21:
fi = fi0, ginval = ginval2, ginval0 = ginval3, ginval1 = ginval6, ginval4 = ginval3, ginval5 = ginval2, gstore = gstore1, gstore0 = gstore3, gstore2 = crash(gstore4, gstore1, ginval3, nx1), gstore3 = crash(gstore4, gstore1, ginval3, nx1), gstore5 = gstore1, maxino = maxino1, maxino0 = maxino3, maxino2 = maxino1, nx = nx1, nx0 = nx3, nx2 = nx1, remove-refsize0(gstore1) = gstore1, remove-refsize0(istore1) = istore1, syn, elems nx1 ∩ ginval3 = ∅, dom gstore1 ∪ elems nx1 = dom gstore4 ∪ ginval3, btree-inv(rp1, adr2, istore2, istore1, zh, fi1, fi0), btree-inv(rp1, adr2, istore2, istore1, zh, ri, fi3), inv(gstore4 \ ginval3), inv(gstore1), inv(istore2), inv(istore1), inv(crash(gstore4, gstore1, ginval3, nx1) \ ginval3), ri-inj(fi1), ri-inj(fi0), istore1 ⊑ istore2, pstate1.journal? → nx1 ≠ [] ∧ pstate1.lnum = nx1.last ∧ pstate1.lnum ∈ gstore4, pstate1.index? → pstate1.lnum ∈ istore2 ⊦ ⟨fail_or_success#(; ; err); if err = ESUCCESS then maxino0 := maxino, syn := true, nx0 := nx, ginval1 := ginval, fi0 := fi else ginval0 := ?, syn := ?, gstore0 := ?, gstore := ?, nx := ?, maxino := ?, ginval := ?, maxino0 := ?, nx0 := ?, ginval1 := ?, fi0 := ?, fi := ?⟩ ( ginval0 = ginval4 ∧ gstore0 = gstore2 ∧ gstore = gstore5 ∧ nx = nx0 ∧ maxino = maxino0 ∧ ginval = ginval1 ∧ btree-inv(null, adr2, remove-refsize0(crash(istore2, istore1)), istore1, zh0, fi0, fi) ∧ syn ∧ maxino2 = maxino0 ∧ nx2 = nx0 ∧ ginval5 = ginval1 ∧ ESUCCESS = err), dups(nx1)

Rule argument

pos: right 1

Additional information

Used simplifier rules: index+persistence_recover# (; PMAXINO0, PNL0, P_OS0, PRI, PFI, PINVAL, PSTORE, PSTORE0, PNL, PMAXINO, P_OS, ISYNCED ; ERR ) {fail_or_success#(; ; ERR); if ERR = ESUCCESS then PMAXINO0 := PMAXINO, ISYNCED := true, PNL0 := PNL, P_OS0 := P_OS, PRI := PFI else PINVAL := ?, ISYNCED := ?, PSTORE := ?, PSTORE0 := ?, PNL := ?, PMAXINO := ?, P_OS := ?, PMAXINO0 := ?, PNL0 := ?, P_OS0 := ?, PRI := ?, PFI := ? };