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

gstore[@(m0, m1, m2)] = mkgnode(nd, m, boolvar, boolvar0), fi1 = fi, remove-refsize0(gstore0) = gstore0, elems nx ∩ jro0 = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ jro0, jmaxino ≠ 0, pmaxino ≠ 0, fi0.inos < pmaxino, fi.inos < jmaxino, p_os < pmaxino, jro1 < jmaxino, inv(gstore0), inv(gstore \ jro0), key-cons(key, nd), refsize-cons(gstore0, range fi0), refsize-cons(gstore, range fi), ri-inj(fi), ri-inj(fi0), @(m0, m1, m2) ∈ gstore, pmaxino ≤ jmaxino, fi0.lebs ⊆ dom gstore0, fi.lebs ⊆ dom gstore, ¬ dups(nx), ¬ @(m0, m1, m2) ∈ fi, jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore, jro0) ⊦ [index_index_store#(key, @(m0, m1, m2), fi0, jro0, gstore, gstore0, nx, pmaxino, p_os, jvalid0; adr, jvalid, fi)] ( ri-inj(fi) → ⟪let n = ? in {jro := jro0; gstore1 := gstore; if jvalid then {index_get_gblock_refsize#(adr.lnum, fi, fi0, jro, gstore, gstore0, nx, pmaxino, p_os, jvalid0; ; n); index_set_gblock_refsize#(adr.lnum, n - adr.size, fi, fi0, jro, gstore0, nx, pmaxino, p_os, jvalid0; gstore)}; index_get_gblock_refsize#(m0, fi, fi0, jro, gstore, gstore0, nx, pmaxino, p_os, jvalid0; ; n); index_set_gblock_refsize#(m0, n + m2, fi, fi0, jro, gstore0, nx, pmaxino, p_os, jvalid0; gstore)}; jmaxino := max(key.ino + 1, jmaxino)⟫ ( jro1 < jmaxino ∧ pmaxino ≤ jmaxino ∧ fi1.inos ∪ (key.inode? ⊃ ∅ ++ key.ino;∅) < jmaxino ∧ jmaxino ≠ 0 ∧ (jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore, jro0)) ∧ fi1[key, @(m0, m1, m2)].lebs ⊆ dom gstore ∧ refsize-cons(gstore, range fi1[key, @(m0, m1, m2)]) ∧ inv(gstore \ jro0) ∧ dom gstore0 ∪ elems nx = dom gstore ∪ jro0 ∧ gstore =○refsize gstore1 ∧ fi = fi1[key, @(m0, m1, m2)]))

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 15:
gstore3[@(m0, m1, m2)] = mkgnode(nd, m, boolvar, boolvar0), adr0 = @(m0, m1, m2), fi1 = fi, gstore = gstore2, gstore0 = gstore3, jro = jro0, remove-refsize0(gstore2) = gstore2, elems nx ∩ jro0 = ∅, dom gstore2 ∪ elems nx = dom gstore3 ∪ jro0, jro1 < jmaxino, p_os < pmaxino, fi.inos < jmaxino, fi0.inos < pmaxino, inv(gstore3 \ jro0), inv(gstore2), key-cons(key, nd), refsize-cons(gstore3, range fi), refsize-cons(gstore2, range fi0), ri-inj(fi0), ri-inj(fi), @(m0, m1, m2) ∈ gstore3, pmaxino ≤ jmaxino, fi.lebs ⊆ dom gstore3, fi0.lebs ⊆ dom gstore2, jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore3, jro0) ⊦ [if ¬ adr0 ∈ fi ∧ adr0 ∈ gstore0 ∧ key-cons(key, gstore0[adr0].nd) then {jvalid := key ∈ fi; if jvalid then adr := fi[key] else adr := ?; fi[key] := adr0} else abort] ( ri-inj(fi) → ⟪let n = ? in {jro := jro0; gstore1 := gstore3; if jvalid then {index_get_gblock_refsize#(adr.lnum, fi, fi0, jro, gstore3, gstore2, nx, pmaxino, p_os, jvalid0; ; n); index_set_gblock_refsize#(adr.lnum, n - adr.size, fi, fi0, jro, gstore2, nx, pmaxino, p_os, jvalid0; gstore3)}; index_get_gblock_refsize#(m0, fi, fi0, jro, gstore3, gstore2, nx, pmaxino, p_os, jvalid0; ; n); index_set_gblock_refsize#(m0, n + m2, fi, fi0, jro, gstore2, nx, pmaxino, p_os, jvalid0; gstore3)}; jmaxino := max(key.ino + 1, jmaxino)⟫ ( jro1 < jmaxino ∧ pmaxino ≤ jmaxino ∧ fi1.inos ∪ (key.inode? ⊃ ∅ ++ key.ino;∅) < jmaxino ∧ jmaxino ≠ 0 ∧ (jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore3, jro0)) ∧ fi1[key, @(m0, m1, m2)].lebs ⊆ dom gstore3 ∧ refsize-cons(gstore3, range fi1[key, @(m0, m1, m2)]) ∧ inv(gstore3 \ jro0) ∧ dom gstore2 ∪ elems nx = dom gstore3 ∪ jro0 ∧ gstore3 =○refsize gstore1 ∧ fi = fi1[key, @(m0, m1, m2)])), jmaxino = 0, pmaxino = 0, dups(nx), @(m0, m1, m2) ∈ fi

Rule argument

pos: right 1

Additional information

Used simplifier rules: index_index_store# (KEY, ADR, PFI, PINVAL, PSTORE, PSTORE0, PNL, PMAXINO, P_OS, ISYNCED ; OLDADR, EXISTS, PRI ) {if ¬ ADR ∈ PRI ∧ ADR ∈ PSTORE ∧ key-cons(KEY, PSTORE[ADR].nd) then {EXISTS := KEY ∈ PRI; if EXISTS then OLDADR := PRI[KEY] else OLDADR := ?; PRI[KEY] := ADR} else abort };