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

# gndx0 = # lax0, # lax = # gndx, gstore3[nx0.last] = groupblock(gndx0, lax0, m), gstore3[nx0.last, gstore3[nx0.last].gndlist:= (gndx0 + gndx)][nx0.last] = groupblock(gndx1, lax1, m0), abs-log(nx0, gstore3 ↓) = abs-log(nx1, gstore2 ↓), nodes(gstore3 ↓, jro0) = nodes(gstore2 ↓, jro1), remove-refsize0(gstore0) = gstore0, elems nx1 ∩ jro1 = ∅, (nx0.toSet \ nx1.toSet) ∩ dom gstore2 = ∅, elems nx0 ∩ jro0 = ∅, dom gstore0 ∪ elems nx1 = dom gstore2 ∪ jro1, dom gstore0 ∪ elems nx0 = dom gstore3 ∪ jro0, p_os < pmaxino, fi2.inos < jmaxino1, fi1.inos < pmaxino, inv(groupblock(gndx0 + gndx, lax0 + lax, m)), inv(gstore0), inv(gstore2 \ jro1), inv(gstore3 \ jro0), inv(groupblock(gndx0, lax0, m)), inv-flashsize(gndx, lax), refsize-cons(gstore2, range fi2), refsize-cons(gstore0, range fi1), refsize-cons(gstore3, range fi2), ri-inj(fi2), ri-inj(fi1), transaction(ndx, gndx), valid-journal-head(nx0, gstore3, jro0), nx0.last ∈ gstore3, pmaxino ≤ jmaxino1, fi2.lebs ⊆ dom gstore3, fi2.lebs ⊆ dom gstore2, fi1.lebs ⊆ dom gstore0, dom gstore2 ⊆ dom gstore3, jvalid4 ∧ nx1 ≠ [] → valid-journal-head(nx1, gstore2, jro1) ⊦ ⟪index_sync# (fi2, fi1, jro0, gstore3[nx0.last, gstore3[nx0.last, gstore3[nx0.last].gndlist:= (gndx0 + gndx)][nx0.last].ladrlist:= (lax1 + lax)], gstore0, nx0, pmaxino, p_os ; ; jvalid, err0)⟫ ( valid-journal-head(nx0, gstore3[nx0.last, (gstore3[nx0.last].gndlist:= (gndx0 + gndx)).ladrlist:= (lax0 + lax)], jro0) ∧ refsize-cons(gstore3[nx0.last, (gstore3[nx0.last].gndlist:= (gndx0 + gndx)).ladrlist:= (lax0 + lax)], range fi2) ∧ nodes-cons(lax.to-adr(nx0.last), ndx, gstore3[nx0.last, (gstore3[nx0.last].gndlist:= (gndx0 + gndx)).ladrlist:= (lax0 + lax)], jro0) ∧ abs-log(nx0.butlast, gstore3 ↓) + ((gstore3[nx0.last].gndlist:= (gndx0 + gndx)).ladrlist:= (lax0 + lax))↓.ladrlist.to-adr(nx0.last) = abs-log(nx1, gstore2 ↓) + lax.to-adr(nx0.last) ∧ nodes(gstore3 ↓[nx0.last, ((gstore3[nx0.last].gndlist:= (gndx0 + gndx)).ladrlist:= (lax0 + lax))↓], jro0) = nodes(gstore2 ↓, jro1)[lax.to-adr(nx0.last), ndx] ∧ new(lax.to-adr(nx0.last), nodes(gstore2 ↓, jro1))), nx0 = [], pmaxino = 0, dups(lax), dups(nx1), dups(nx0)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 61:
# lax = # gndx, # gndx0 = # lax1, gstore3[nx0.last] = groupblock(gndx0, lax1, m), abs-log(nx0, gstore3 ↓) = abs-log(nx1, gstore2 ↓), nodes(gstore3 ↓, jro0) = nodes(gstore2 ↓, jro1), remove-refsize0(gstore0) = gstore0, elems nx0 ∩ jro0 = ∅, (nx0.toSet \ nx1.toSet) ∩ dom gstore2 = ∅, elems nx1 ∩ jro1 = ∅, dom gstore0 ∪ elems nx0 = dom gstore3 ∪ jro0, dom gstore0 ∪ elems nx1 = dom gstore2 ∪ jro1, nx0 ≠ [], pmaxino ≠ 0, fi1.inos < pmaxino, fi2.inos < jmaxino1, p_os < pmaxino, inv(groupblock(gndx0, lax1, m)), inv(gstore3 \ jro0), inv(gstore2 \ jro1), inv(gstore0), inv(groupblock(gndx0 + gndx, lax1 + lax, m)), inv-flashsize(gndx, lax), refsize-cons(gstore3, range fi2), refsize-cons(gstore0, range fi1), refsize-cons(gstore2, range fi2), ri-inj(fi1), ri-inj(fi2), transaction(ndx, gndx), valid-journal-head(nx0, gstore3, jro0), nx0.last ∈ gstore3, pmaxino ≤ jmaxino1, dom gstore2 ⊆ dom gstore3, fi1.lebs ⊆ dom gstore0, fi2.lebs ⊆ dom gstore2, fi2.lebs ⊆ dom gstore3, ¬ dups(nx0), ¬ dups(nx1), ¬ dups(lax), jvalid4 ∧ nx1 ≠ [] → valid-journal-head(nx1, gstore2, jro1) ⊦ ⟪index_sync# (fi2, fi1, jro0, gstore3[nx0.last, gstore3[nx0.last, gstore3[nx0.last].gndlist:= (gndx0 + gndx)][nx0.last].ladrlist:= (lax1 + lax)], gstore0, nx0, pmaxino, p_os ; ; jvalid, err0)⟫ ( valid-journal-head(nx0, gstore3[nx0.last, (gstore3[nx0.last].gndlist:= (gndx0 + gndx)).ladrlist:= (lax1 + lax)], jro0) ∧ refsize-cons(gstore3[nx0.last, (gstore3[nx0.last].gndlist:= (gndx0 + gndx)).ladrlist:= (lax1 + lax)], range fi2) ∧ nodes-cons(lax.to-adr(nx0.last), ndx, gstore3[nx0.last, (gstore3[nx0.last].gndlist:= (gndx0 + gndx)).ladrlist:= (lax1 + lax)], jro0) ∧ abs-log(nx0.butlast, gstore3 ↓) + ((gstore3[nx0.last].gndlist:= (gndx0 + gndx)).ladrlist:= (lax1 + lax))↓.ladrlist.to-adr(nx0.last) = abs-log(nx1, gstore2 ↓) + lax.to-adr(nx0.last) ∧ nodes(gstore3 ↓[nx0.last, ((gstore3[nx0.last].gndlist:= (gndx0 + gndx)).ladrlist:= (lax1 + lax))↓], jro0) = nodes(gstore2 ↓, jro1)[lax.to-adr(nx0.last), ndx] ∧ new(lax.to-adr(nx0.last), nodes(gstore2 ↓, jro1)))

Rule argument

Additional information

Used simplifier rules: lf-inv-append-sizes: ⊦ # gndx1 = # lax1 ∧ inv(groupblock(gndx0 + gndx1, lax0 + lax1, m)) → # gndx0 = # lax0;%a: ⊦ (lax + lax0) + lax1 = lax + lax0 + lax1; from specification list[laddress-list]%a: ⊦ (gndx + gndx0) + gndx1 = gndx + gndx0 + gndx1; from specification list[group-store]%⊦ groupblock(gndx, lax, m) = groupblock(gndx0, lax0, m0) ↔ gndx = gndx0 ∧ lax = lax0 ∧ m = m0; (ws)%⊦ groupblock(gndx, lax, m).gndlist:= gndx0 = groupblock(gndx0, lax, m); (s)% ⊦ gstore[n, gblock][n] = gblock; (s)