[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 6 from proof crash-neutral-allocate-ind (previous step)

remove-refsize0(istore0) = istore0, remove-refsize0(gstore1) = gstore1, elems nx ∩ ginval1 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ ginval1, inv(istore0), inv(istore), inv(gstore1), inv(gstore2 \ ginval1), istore0 ⊑ istore, ¬ dups(nx), pstate.index? → pstate.lnum ∈ istore, pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore2 ⊦ ⟨fail_or_success#(; ; err); istore1 := remove-refsize0(crash(istore, istore0)); if err = ESUCCESS then choose n with ¬ n ∈ istore in istore[n] := indexblock([], [], 0), pstate := index(n)⟩ (istore1 = remove-refsize0(crash(istore, istore0)))

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 7:
remove-refsize0(gstore1) = gstore1, remove-refsize0(istore0) = istore0, elems nx ∩ ginval1 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ ginval1, inv(gstore2 \ ginval1), inv(gstore1), inv(istore), inv(istore0), istore0 ⊑ istore, pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore2, pstate.index? → pstate.lnum ∈ istore ⊦ ⟨choose err0 with ⌊err0⌋ ∨ err0 = ESUCCESS in err := err0; istore1 := remove-refsize0(crash(istore, istore0)); if err = ESUCCESS then choose n with ¬ n ∈ istore in istore[n] := indexblock([], [], 0), pstate := index(n)⟩ (istore1 = remove-refsize0(crash(istore, istore0))), dups(nx)

Rule argument

pos: right 1

Additional information

Used simplifier rules: fail_or_success#(; ; ERR) {choose ERR0 with ⌊ERR0⌋ ∨ ERR0 = ESUCCESS in ERR := ERR0};