[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 22 from proof initialization (previous step)

⌊err⌋ ⊦ ⟨index_format#(maxino3, LEB_SIZE, maxino2; ; fi1, fi2, ginval3, gstore3, gstore4, nx1, maxino5, ginval4, syn1, err0)⟩ ( fi0 = fi1 ∧ fi4 = fi2 ∧ ginval1 = ginval3 ∧ gstore1 = gstore3 ∧ gstore2 = gstore4 ∧ nx0 = nx1 ∧ maxino0 = maxino5 ∧ ginval2 = ginval4 ∧ (syn0 ↔ syn1) ∧ err = err0)

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 23:
maxino0 = maxino4, maxino1 = LEB_SIZE, maxino2 = maxino3, ⌊err1⌋ ⊦ ⟨if maxino1 = LEB_SIZE then {fail_or_success#(; ; err); if err = ESUCCESS then maxino := maxino0, syn := true, ginval0 := ∅, nx := [], gstore0 := ∅, gstore := ∅, ginval := ∅, fi0 := ∅, fi := ∅ else maxino := ?, syn := ?, ginval0 := ?, nx := ?, gstore0 := ?, gstore := ?, ginval := ?, fi0 := ?, fi := ?} else abort⟩ ( fi3 = fi0 ∧ fi4 = fi ∧ ginval1 = ginval ∧ gstore1 = gstore0 ∧ gstore2 = gstore ∧ nx0 = nx ∧ maxino0 = maxino ∧ ginval2 = ginval0 ∧ (syn0 ↔ syn) ∧ err1 = err)

Rule argument

pos: right 1

Additional information

Used simplifier rules: index_format# (VOLSIZE, SIZE, PMAXINO0 ; ; PRI, PFI, PINVAL, PSTORE, PSTORE0, PNL, PMAXINO, P_OS, ISYNCED, ERR ) {if SIZE = LEB_SIZE then {fail_or_success#(; ; ERR); if ERR = ESUCCESS then PMAXINO := PMAXINO0, ISYNCED := true, P_OS := ∅, PNL := [], PSTORE := ∅, PSTORE0 := ∅, PINVAL := ∅, PRI := ∅, PFI := ∅ else PMAXINO := ?, ISYNCED := ?, P_OS := ?, PNL := ?, PSTORE := ?, PSTORE0 := ?, PINVAL := ?, PRI := ?, PFI := ?} else abort };