[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 8 from proof inv-store (previous step)

syn0 ↔ syn2, syn ↔ syn1, gstore2[adr2] = mkgnode(nd, m, boolvar, boolvar0), adr = adr1, adr0 = adr2, ginval = ginval1, ginval0 = ginval2, gstore = gstore1, gstore0 = gstore2, remove-refsize0(gstore1) = gstore1, elems nx ∩ ginval2 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ ginval2, inv(gstore1), inv(gstore2 \ ginval2), key-cons(key, nd), ri-inj(fi0), ri-inj(fi), adr2 ∈ gstore2 ⊦ ⟪if key ∈ fi then adr := fi[key] else adr := ?; fi[key] := adr0⟫ ri-inj(fi), dups(nx), adr2 ∈ fi

Heuristic conditional right split applied rule if right

And obtained the following new goals

Proof step 9:
syn ↔ syn1, syn0 ↔ syn2, gstore2[adr2] = mkgnode(nd, m, boolvar, boolvar0), adr = adr1, adr0 = adr2, ginval = ginval1, ginval0 = ginval2, gstore = gstore1, gstore0 = gstore2, remove-refsize0(gstore1) = gstore1, elems nx ∩ ginval2 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ ginval2, inv(gstore2 \ ginval2), inv(gstore1), key-cons(key, nd), ri-inj(fi), ri-inj(fi0), key ∈ fi, adr2 ∈ gstore2 ⊦ ⟪adr := fi[key]; fi[key] := adr0⟫ ri-inj(fi), dups(nx), adr2 ∈ fi
Proof step 11:
syn ↔ syn1, syn0 ↔ syn2, gstore2[adr2] = mkgnode(nd, m, boolvar, boolvar0), adr = adr1, adr0 = adr2, ginval = ginval1, ginval0 = ginval2, gstore = gstore1, gstore0 = gstore2, remove-refsize0(gstore1) = gstore1, elems nx ∩ ginval2 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ ginval2, inv(gstore2 \ ginval2), inv(gstore1), key-cons(key, nd), ri-inj(fi), ri-inj(fi0), adr2 ∈ gstore2 ⊦ ⟪adr := ?; fi[key] := adr0⟫ ri-inj(fi), dups(nx), adr2 ∈ fi, key ∈ fi

Proof step 8 from proof inv-store (previous step)

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

Additional information