[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 21 from proof refine-truncate (previous step)

jvalid ↔ jvalid3, fi = fi1, fo = p_os.keys, fs = nodes(gstore4 ↓, jro0), log = abs-log(nx, gstore4 ↓), remove-refsize0(gstore3) = gstore3, ri0 = ri, ro = jro1.keys, elems nx ∩ jro0 = ∅, dom gstore4 ∪ jro0 = dom gstore ∪ jro0, dom gstore3 ∪ elems nx = dom gstore ∪ jro0, p_os.keys.inodes?, jro1.keys.inodes?, ri.inos < jmaxino, jro1 < jmaxino, p_os < pmaxino, fi1.inos < pmaxino, gstore =○refsize gstore4, inv(gstore \ jro0), inv(gstore3), inv(gstore4 \ jro0), log-cons(abs-log(nx, gstore4 ↓), nodes(gstore4 ↓, jro0)), refsize-cons(gstore, range(ri \ datakeys(key, n, ri))), refsize-cons(gstore4, range ri), refsize-cons(gstore3, range fi1), ri-inj(ri \ datakeys(key, n, ri)), ri-inj(ri), ri-inj(fi1), pmaxino ≤ jmaxino, (ri \ datakeys(key, n, ri)).lebs ⊆ dom gstore, ri.lebs ⊆ dom gstore4, fi1.lebs ⊆ dom gstore3, jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore, jro0), jvalid3 → jvalid2, jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore4, jro0) ⊦ ⟨let ks = datakeys(key, n, ri) in ri := ri \ ks⟩ (ri0 \ datakeys(key, n, ri0) = ri ∧ (jvalid3 → jvalid2)), jmaxino = 0, pmaxino = 0, dups(nx)

Heuristic symbolic execution applied rule let right

And obtained the following new goals

Rule argument

Additional information