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

gstore2[n1] = groupblock(gndx, lax, 0), remove-refsize0(gstore1) = gstore1, elems nx ∩ jro0 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro0, jmaxino ≠ 0, pmaxino ≠ 0, jro1 < jmaxino, p_os < pmaxino, fi2.inos < jmaxino, fi1.inos < pmaxino, inv(gstore2 \ jro0), inv(gstore1), refsize-cons(gstore2, range fi2), refsize-cons(gstore1, range fi1), ri-cons(fi2, nodes(gstore2 ↓, jro0)), ri-inj(fi2), ri-inj(fi1), n1 ∈ gstore2, n1 ∈ gstore1, pmaxino ≤ jmaxino, fi2.lebs ⊆ dom gstore2, fi1.lebs ⊆ dom gstore1, ¬ dups(nx), ¬ n1 ∈ nx, jvalid4 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro0) ⊦ ⟪index_deallocate_gnd#(n1, fi2, fi1, gstore1, nx, pmaxino, p_os, true; jro0, gstore2; err0)⟫ ( (jvalid4 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro0)) ∧ fi2.lebs ⊆ dom gstore2 ∧ refsize-cons(gstore2, range fi2) ∧ inv(gstore2 \ jro0) ∧ elems nx ∩ jro0 = ∅ ∧ dom gstore1 ∪ elems nx = dom gstore2 ∪ jro0)

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 181:
jvalid ↔ true, gstore2[n1] = groupblock(gndx, lax, 0), fi = fi1, fi0 = fi2, gstore = gstore2, gstore0 = gstore1, jro = jro0, n = n1, remove-refsize0(gstore1) = gstore1, elems nx ∩ jro0 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro0, fi1.inos < pmaxino, fi2.inos < jmaxino, p_os < pmaxino, jro1 < jmaxino, inv(gstore1), inv(gstore2 \ jro0), refsize-cons(gstore1, range fi1), refsize-cons(gstore2, range fi2), ri-cons(fi2, nodes(gstore2 ↓, jro0)), ri-inj(fi1), ri-inj(fi2), n1 ∈ gstore1, n1 ∈ gstore2, pmaxino ≤ jmaxino, fi1.lebs ⊆ dom gstore1, fi2.lebs ⊆ dom gstore2, jvalid4 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro0) ⊦ ⟪if jvalid ∧ n ∈ gstore ∧ ¬ n ∈ nx then {fail_or_success#(; ; err); if err = ESUCCESS then gstore := gstore -- n, jro := jro ++ n} else abort⟫ ( (jvalid4 ∧ nx ≠ [] → valid-journal-head(nx, gstore, jro)) ∧ fi2.lebs ⊆ dom gstore ∧ refsize-cons(gstore, range fi2) ∧ inv(gstore \ jro) ∧ elems nx ∩ jro = ∅ ∧ dom gstore1 ∪ elems nx = dom gstore ∪ jro), jmaxino = 0, pmaxino = 0, dups(nx), n1 ∈ nx

Rule argument

pos: right 1

Additional information

Used simplifier rules: index_deallocate_gnd# (N, PRI, PFI, PSTORE0, PNL, PMAXINO, P_OS, ISYNCED ; PINVAL, PSTORE ; ERR ) {if ISYNCED ∧ N ∈ PSTORE ∧ ¬ N ∈ PNL then {fail_or_success#(; ; ERR); if ERR = ESUCCESS then PSTORE := PSTORE -- N, PINVAL := PINVAL ++ N} else abort };