[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 9 from proof crash-neutral-commit (previous step)

remove-refsize0(gstore3) = gstore3, remove-refsize0(istore3) = istore3, dom remove-refsize0(gstore4) ∩ ginval6 = ∅, elems nx ∩ ginval6 = ∅, dom gstore3 ∪ elems nx = dom gstore4 ∪ ginval6, inv(gstore4 \ ginval6), inv(gstore3), inv(istore4), inv(istore3), istore3 ⊑ istore4, ¬ dups(nx), pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore4, pstate.index? → pstate.lnum ∈ istore4 ⊦ ∃ err0. (⌊err0⌋ ∨ err0 = ESUCCESS) ∧ ⟨err := err0; nx0 := nx; maxino := maxino3; istore0 := istore4; istore := istore3; gstore1 := crash(gstore4, gstore3, ginval6, nx); gstore0 := gstore4; gstore := gstore3; ginval0 := ginval6; ginval := ginval2; adr := adr3; if err = ESUCCESS then {istore0 := remove-refsize0(istore0); istore := istore0; gstore0 := remove-refsize0(gstore0); gstore := gstore0; ginval0 := ∅; adr := adr0; ginval := ginval1; nx := []; maxino := maxino0; pstate := unbuffered} else pstate := readonly; ginval1 := ?⟩ ( adr3 = adr ∧ remove-refsize0(crash(istore4, istore)) = remove-refsize0(crash(istore0, istore)) ∧ istore3 = istore ∧ ginval6 = ginval0 ∧ gstore1 = crash(gstore0, gstore, ginval0, nx) ∧ gstore3 = gstore ∧ nx0 = nx ∧ maxino3 = maxino ∧ ginval2 = ginval)

Heuristic use patterns applied rule exists right

And obtained the following new goals

Proof step 10:
remove-refsize0(istore3) = istore3, remove-refsize0(gstore3) = gstore3, elems nx ∩ ginval6 = ∅, dom remove-refsize0(gstore4) ∩ ginval6 = ∅, dom gstore3 ∪ elems nx = dom gstore4 ∪ ginval6, inv(istore3), inv(istore4), inv(gstore3), inv(gstore4 \ ginval6), istore3 ⊑ istore4, pstate.index? → pstate.lnum ∈ istore4, pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore4 ⊦ (⌊EIO⌋ ∨ EIO = ESUCCESS) ∧ ⟨err := EIO; nx0 := nx; maxino := maxino3; istore0 := istore4; istore := istore3; gstore1 := crash(gstore4, gstore3, ginval6, nx); gstore0 := gstore4; gstore := gstore3; ginval0 := ginval6; ginval := ginval2; adr := adr3; if err = ESUCCESS then {istore0 := remove-refsize0(istore0); istore := istore0; gstore0 := remove-refsize0(gstore0); gstore := gstore0; ginval0 := ∅; adr := adr0; ginval := ginval1; nx := []; maxino := maxino0; pstate := unbuffered} else pstate := readonly; ginval1 := ?⟩ ( adr3 = adr ∧ remove-refsize0(crash(istore4, istore)) = remove-refsize0(crash(istore0, istore)) ∧ istore3 = istore ∧ ginval6 = ginval0 ∧ gstore1 = crash(gstore0, gstore, ginval0, nx) ∧ gstore3 = gstore ∧ nx0 = nx ∧ maxino3 = maxino ∧ ginval2 = ginval), dups(nx)

Rule argument

pos: right 1 terms: EIO abort: T discard: T computed: F

Additional information

Used terms: EIO