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

remove-refsize0(gstore1) = gstore1, elems nx ∩ jro = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro, pmaxino ≠ 0, 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-inj(fi1), ri-inj(fi2), @(m, m0, m1) ∈ gstore2, pmaxino ≤ jmaxino, fi1.lebs ⊆ dom gstore1, fi2.lebs ⊆ dom gstore2, ¬ dups(nx), ¬ m ∈ jro, jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro) ⊦ ⟪fail_or_success#(; ; err); if err = ESUCCESS then gnd := gstore2[@(m, m0, m1)] else gnd := ?; if err = ESUCCESS then nd := gnd.nd⟫ true

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 13:
remove-refsize0(gstore1) = gstore1, elems nx ∩ jro = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro, 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-inj(fi2), ri-inj(fi1), @(m, m0, m1) ∈ gstore2, pmaxino ≤ jmaxino, fi2.lebs ⊆ dom gstore2, fi1.lebs ⊆ dom gstore1, jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro) ⊦ ⟪choose err0 with ⌊err0⌋ ∨ err0 = ESUCCESS in err := err0; if err = ESUCCESS then gnd := gstore2[@(m, m0, m1)] else gnd := ?; if err = ESUCCESS then nd := gnd.nd⟫ true, pmaxino = 0, dups(nx), m ∈ jro

Rule argument

pos: right 1

Additional information

Used simplifier rules: fail_or_success#(; ; ERR) {choose ERR0 with ⌊ERR0⌋ ∨ ERR0 = ESUCCESS in ERR := ERR0};