[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 inv-allocate-gnd (previous step)

remove-refsize0(gstore0) = gstore0, elems nx ∩ ginval = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ ginval, inv(gstore \ ginval), inv(gstore0), ri-inj(fi2), ri-inj(fi1), ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪if err0 = ESUCCESS then choose n with ¬ n ∈ gstore in gstore[n] := groupblock([], [], 0), nx := nx + n, ginval := ginval -- n⟫ (inv(gstore \ ginval) ∧ elems nx ∩ ginval = ∅ ∧ ¬ dups(nx) ∧ dom gstore0 ∪ elems nx = dom gstore ∪ ginval), dups(nx)

Heuristic conditional right split applied rule if right

And obtained the following new goals

Proof step 10:
err0 = ESUCCESS, remove-refsize0(gstore0) = gstore0, elems nx ∩ ginval = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ ginval, inv(gstore0), inv(gstore \ ginval), ri-inj(fi1), ri-inj(fi2), ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪choose n with ¬ n ∈ gstore in gstore[n] := groupblock([], [], 0), nx := nx + n, ginval := ginval -- n⟫ (inv(gstore \ ginval) ∧ elems nx ∩ ginval = ∅ ∧ ¬ dups(nx) ∧ dom gstore0 ∪ elems nx = dom gstore ∪ ginval), dups(nx)
Proof step 16:
remove-refsize0(gstore0) = gstore0, elems nx ∩ ginval = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ ginval, inv(gstore0), inv(gstore \ ginval), ri-inj(fi1), ri-inj(fi2), ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪skip⟫ (inv(gstore \ ginval) ∧ elems nx ∩ ginval = ∅ ∧ ¬ dups(nx) ∧ dom gstore0 ∪ elems nx = dom gstore ∪ ginval), err0 = ESUCCESS, dups(nx)

Rule argument

pos: right 1

Proof step 9 from proof inv-allocate-gnd (previous step)

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

Additional information