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

remove-refsize0(gstore1) = gstore1, elems nx ∩ jro = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro, pmaxino ≠ 0, p_os < pmaxino, fi2.inos < jmaxino, fi1.inos < pmaxino, inv(gstore2 \ jro), inv(gstore1), refsize-cons(gstore2, range fi2), refsize-cons(gstore1, range fi1), ri-cons(fi2, nodes(gstore2 ↓, jro)), ri-inj(fi2), ri-inj(fi1), pmaxino ≤ jmaxino, fi2.lebs ⊆ dom gstore2, fi1.lebs ⊆ dom gstore1, ¬ dups(nx), jvalid2 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro) ⊦ ⟪index_index_lookup#(key, fi2, fi1, jro, gstore2, gstore1, nx, pmaxino, p_os, jvalid0; jvalid, adr; err); if err = ESUCCESS ∧ jvalid then let gnd = ? in {index_read_gnd#(adr, fi2, fi1, jro, gstore2, gstore1, nx, pmaxino, p_os, jvalid0; gnd; err); if err = ESUCCESS then nd := gnd.nd}⟫ true

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 8:
fi = fi1, fi0 = fi2, gstore = gstore1, gstore0 = gstore2, remove-refsize0(gstore1) = gstore1, elems nx ∩ jro = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro, fi1.inos < pmaxino, fi2.inos < jmaxino, p_os < pmaxino, inv(gstore1), inv(gstore2 \ jro), refsize-cons(gstore1, range fi1), refsize-cons(gstore2, range fi2), ri-cons(fi2, nodes(gstore2 ↓, jro)), ri-inj(fi1), ri-inj(fi2), pmaxino ≤ jmaxino, fi1.lebs ⊆ dom gstore1, fi2.lebs ⊆ dom gstore2, jvalid2 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro) ⊦ ⟪fail_or_success#(; ; err); if err = ESUCCESS then {jvalid := key ∈ fi0; if jvalid then adr := fi0[key] else adr := ?} else jvalid := ?, adr := ?; if err = ESUCCESS ∧ jvalid then let gnd = ? in {index_read_gnd#(adr, fi2, fi1, jro, gstore2, gstore1, nx, pmaxino, p_os, jvalid0; gnd; err); if err = ESUCCESS then nd := gnd.nd}⟫ true, pmaxino = 0, dups(nx)

Rule argument

pos: right 1

Additional information

Used simplifier rules: index_index_lookup# (KEY, PRI, PFI, PINVAL, PSTORE, PSTORE0, PNL, PMAXINO, P_OS, ISYNCED ; EXISTS, ADR ; ERR ) {fail_or_success#(; ; ERR); if ERR = ESUCCESS then {EXISTS := KEY ∈ PRI; if EXISTS then ADR := PRI[KEY] else ADR := ?} else EXISTS := ?, ADR := ? };