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

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

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Proof step 7:
gstore[adr] = mkgnode(nd, m, boolvar, boolvar0), adr0 = adr, fi1 = fi, gstore1 = gstore, jro = jro0, remove-refsize0(gstore0) = gstore0, elems nx ∩ jro0 = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ jro0, jro1 < jmaxino, p_os < pmaxino, fi.inos < jmaxino, fi0.inos < pmaxino, inv(gstore \ jro0), inv(gstore0), key-cons(key, nd), refsize-cons(gstore, range fi), refsize-cons(gstore0, range fi0), ri-inj(fi), ri-inj(fi0), adr ∈ gstore, pmaxino ≤ jmaxino, fi.lebs ⊆ dom gstore, fi0.lebs ⊆ dom gstore0, jvalid ∧ nx ≠ [] → valid-journal-head(nx, gstore, jro0) ⊦ ⟪let jvalid = ?, adr = ? in {index_index_store#(key, adr0, fi0, jro, gstore, gstore0, nx, pmaxino, p_os, jvalid0; adr, jvalid, fi); let n = ? in {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#(adr0.lnum, fi, fi0, jro, gstore, gstore0, nx, pmaxino, p_os, jvalid0; ; n); index_set_gblock_refsize#(adr0.lnum, n + adr0.size, 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 ∧ (jvalid ∧ nx ≠ [] → valid-journal-head(nx, gstore, jro0)) ∧ fi1[key, adr].lebs ⊆ dom gstore ∧ refsize-cons(gstore, range fi1[key, adr]) ∧ inv(gstore \ jro0) ∧ dom gstore0 ∪ elems nx = dom gstore ∪ jro0 ∧ ri-inj(fi1[key, adr]) ∧ gstore =○refsize gstore1 ∧ fi = fi1[key, adr]), jmaxino = 0, pmaxino = 0, dups(nx), adr ∈ fi

Rule argument

Additional information

Used simplifier rules: ⊦ mkgnode(nd, m, boolvar, boolvar0).nd = nd; (s)