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

remove-refsize0(gstore1) = gstore1, elems nx ∩ ginval1 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ ginval1, inv(gstore2 \ ginval1), inv(gstore1), ri-inj(fi2), ri-inj(fi1) ⊦ ⟨if EIO = ESUCCESS then strings := dentries(key, fi2) else strings := ?⟩ true, dups(nx)

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Proof step 12:
remove-refsize0(gstore1) = gstore1, elems nx ∩ ginval1 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ ginval1, inv(gstore1), inv(gstore2 \ ginval1), ri-inj(fi1), ri-inj(fi2) ⊦ ⟨strings := ?⟩ true, dups(nx)

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ ESUCCESS ≠ EIO; (s)