[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 18 from proof crash-neutral-add-gnds (previous step)

gstore[nx.last] = groupblock(gndx0, lax0, m), remove-refsize0(gstore0) = gstore0, elems nx ∩ ginval1 = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ ginval1, gndx ≠ [], nx ≠ [], inv(gstore \ ginval1), inv(gstore0), inv(groupblock(gndx0, lax0, m)), ri-inj(fi2), ri-inj(fi1), nx.last ∈ gstore, ¬ dups(nx) ⊦ ∃ lax, err0. (⌊err0⌋ ∨ err0 = ESUCCESS) ∧ ¬ dups(lax0 + lax) ∧ # lax ≤ # gndx ∧ inv-flashsize(prefixn(# lax, gndx), lax) ∧ (err0 = ESUCCESS ↔ # lax = # gndx) ∧ ⟨ax := lax.to-adr(nx.last), err := err0; gstore2 := gstore[nx.last, gstore[nx.last].gndlist:= (gndx0 + prefixn(# lax, gndx))]; gstore2[nx.last].ladrlist := gstore2[nx.last].ladrlist + lax; if err ≠ ESUCCESS then ax := ?; syn := ?⟩ (syn ∧ crash(gstore, gstore0, ginval1, nx) = crash(gstore2, gstore0, ginval1, nx))

User applied rule exists right

And obtained the following new goals

Proof step 19:
gstore[nx.last] = groupblock(gndx0, lax0, m), remove-refsize0(gstore0) = gstore0, elems nx ∩ ginval1 = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ ginval1, inv(groupblock(gndx0, lax0, m)), inv(gstore0), inv(gstore \ ginval1), ri-inj(fi1), ri-inj(fi2), nx.last ∈ gstore ⊦ (⌊EIO⌋ ∨ EIO = ESUCCESS) ∧ ¬ dups(lax0 + []) ∧ # [] ≤ # gndx ∧ inv-flashsize(prefixn(# [], gndx), []) ∧ (EIO = ESUCCESS ↔ # [] = # gndx) ∧ ⟨ax := ([]).to-adr(nx.last), err := EIO; gstore2 := gstore[nx.last, gstore[nx.last].gndlist:= (gndx0 + prefixn(# [], gndx))]; gstore2[nx.last].ladrlist := gstore2[nx.last].ladrlist + []; if err ≠ ESUCCESS then ax := ?; syn := ?⟩ (syn ∧ crash(gstore, gstore0, ginval1, nx) = crash(gstore2, gstore0, ginval1, nx)), gndx = [], nx = [], dups(nx)

Rule argument

pos: right 1 terms: [], EIO abort: F discard: T computed: F

Additional information

Used terms: [], EIO