Proof step 99 from proof inv-commit-rec-ind (previous step)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 100:

  # asar = (n1 + n0) + 1, # zbrar2 = BRANCH_SIZE, # asar0 = # asar, zh2[r1] = mkznode(r2, zbrar0, boolvar0, false, m4), istore[adr] = istore3[adr], zh0[r1] = mkznode(r3, zbrar1, boolvar2, true, m2), istore1[adr] = istore3[adr], zbrar2[n0] = mkzbranch(key, adr2, r1), remove-refsize0(istore0) = istore0, remove-refsize0(gstore1) = gstore1, alladrs0 ∩ (union(asar, 0, # asar) \ asar[n0]) = ∅, alladrs0 ∩ as0 = ∅, elems nx ∩ ginval1 = ∅, as ∩ as0 = ∅, union(asar, 0, # asar) ∩ as0 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ ginval1, (( btree(r0, r1, adr4, height1, false, key-range(zbrar2, n0, # asar, ri), nodes(istore3) | alladrs0, alladrs0, alladrs0, ok) * (λ n. ⌜zbrar2[n].branch?⌝ ∧ btree (r0, zbrar2[n].child, zbrar2[n].adr, height1, true, key-range(zbrar2, n, # asar, ri), nodes(istore) | union(asar, 0, # asar), asar[n], asar0[n], ok) )⊗_ (0, n0 ) * (λ n. ⌜zbrar2[n].branch?⌝ ∧ btree (r0, zbrar2[n].child, zbrar2[n].adr, height1, true, key-range(zbrar2, n, # asar, ri), nodes(istore) | union(asar, 0, # asar), asar[n], asar0[n], ok) )⊗_ (1 + n0, n1 ) * r0 => mkznode(rp, zbrar2, false, true, # asar) * P) )(zh2), n0 < # asar, n0 < BRANCH_SIZE, n0 + 1 < BRANCH_SIZE, # asar < BRANCH_SIZE, btree-sub-clean(r0, n0, zh0), disj(asar0, 0, # asar), disj(asar, 0, # asar), inv(istore3), inv(istore0), inv(istore1), inv(gstore1), inv(gstore2 \ ginval1), inv(istore), refsize-cons(istore1, as0 ∪ as), refsize-cons(istore, as0 ∪ union(asar, 0, # asar)), refsize-cons(istore3, (as0 ∪ (union(asar, 0, # asar) \ asar[n0])) ∪ alladrs0), sorted(zbrar2, 0, n1 + n0), adr ∈ istore3, r1 ∈ zh2, m ∈ istore, m3 ∈ istore, m ∈ istore1, r0 ∈ zh1, adr ∈ istore1, r1 ∈ zh0, adr ∈ istore, m ∈ istore3, m3 ∈ istore3, m1 ∈ istore3, adr4 ∈ alladrs0, adr4 ∈ istore3, adr ∈ alladrs0, union(asar, 0, # asar) ∩ dom nodes(istore1) ⊆ union(asar0, 0, # asar), as ⊆ union(asar0, 0, # asar), as ⊆ dom nodes(istore1), union(asar, 0, # asar) ∩ dom nodes(istore1) ⊆ as, alladrs0 ∩ dom nodes(istore) ⊆ asar[n0], alladrs0 ⊆ dom nodes(istore3), alladrs0 ∩ dom nodes(istore) ⊆ dom nodes(istore) ∩ union(asar, 0, # asar), alladrs0 ∩ dom nodes(istore) ⊆ asar0[n0], asar[n0] ⊆ dom nodes(istore), asar[n0] ⊆ dom nodes(istore) ∩ union(asar, 0, # asar), asar[n0] ⊆ asar0[n0], as0 ⊆ dom nodes(istore1), istore0 ⊑ istore3, istore ⊑ istore3, istore0 ⊑ istore, istore0 ⊑ istore1, istore1 ⊑ istore, istore1 ⊑ istore3, height1 = 0 → asar[n0] = ∅, height1 = 0 → alladrs0 = ∅ ++ adr4, ∀ n. n < # asar → asar0[n] ⊆ dom nodes(istore1), ∀ n. ¬ n1 + n0 < n → asar[n] ⊆ dom nodes(istore) ∩ union(asar, 0, # asar), ∀ n. ¬ n1 + n0 < n → asar[n] ⊆ union(asar0, 0, # asar) ++ adr, ∀ n. ¬ n1 + n0 < n → asar[n] ⊆ dom nodes(istore), ∀ n. ¬ n1 + n0 < n → asar[n] ⊆ dom nodes(istore1), ∀ n. n < # asar → asar[n] ⊆ union(asar0, 0, # asar) ++ adr, ∀ n. n < # asar → asar[n] ⊆ dom nodes(istore) ∩ union(asar, 0, # asar), ∀ height0, zh, r0, r, zbrar, boolvar, m0, adr0, adr1, istore1, istore, pstate, m, istore0, gstore0, nx, ginval, as, as0, gstore, rp, dirty, ri, alladrs, P, adr, ino, ns, err, bv. height0 < height1 +1 → zh[r0] = mkznode(r, zbrar, boolvar, true, m0) ∧ adr0 = adr1 ∧ istore1 = istore ∧ pstate = index(m) ∧ remove-refsize0(istore0) = istore0 ∧ remove-refsize0(gstore0) = gstore0 ∧ elems nx ∩ ginval = ∅ ∧ as ∩ as0 = ∅ ∧ dom gstore0 ∪ elems nx = dom gstore ∪ ginval ∧ ((btree(rp, r0, adr1, height0, dirty, ri, nodes(istore) | as, as, alladrs, ok) * P))(zh) ∧ inv(istore0) ∧ inv(istore) ∧ inv(gstore0) ∧ inv(gstore \ ginval) ∧ refsize-cons(istore, as0 ∪ as) ∧ m ∈ istore ∧ r0 ∈ zh ∧ as0 ⊆ dom nodes(istore) ∧ alladrs ⊆ dom nodes(istore) ∧ as ⊆ alladrs ∧ as ⊆ dom nodes(istore) ∧ istore0 ⊑ istore ∧ ¬ dups(nx) ∧ ¬ adr1 ∈ as ∧ (height0 = 0 → as = ∅) → ⟪btree_commit_rec#(r0, adr, istore0, ginval, gstore, gstore0, nx, ino, ns; adr1, err, zh, istore, pstate, bv)⟫ ( istore1 ⊑ istore ∧ (pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore) ∧ (pstate.index? → pstate.lnum ∈ istore) ∧ (pstate = unbuffered → bv) ∧ inv(istore) ∧ istore0 ⊑ istore ∧ r0 ∈ zh ∧ (err = ESUCCESS → ¬ zh[r0].dirty ∧ pstate.index?) ∧ (∃ as1, alladrs1. refsize-cons(istore, as0 ∪ as1) ∧ as1 ∩ dom nodes(istore1) ⊆ as ∧ as1 ∩ as0 = ∅ ∧ alladrs1 ⊆ alladrs ∪ as1 ∧ ((btree(rp, r0, (err = ESUCCESS ⊃ adr1;adr0), height0, err ≠ ESUCCESS, ri, nodes(istore) | as1, as1, alladrs1, ok) * P))(zh))) ⊦ # alladrs0 = 0, alladrs0 = ∅, dups(nx), adr2 ∈ asar[n0], adr ∈ union(asar, 0, # asar), adr ∈ as, adr ∈ union(asar0, 0, # asar)

Rule argument

Additional information

Used simplifier rules: ⊦ as ⊆ as0 → as ⊆ as0 ++ adr; (s)%sub-trans: ⊦ as ⊆ as0 ∧ as0 ⊆ as1 → as ⊆ as1; (forward) from specification set-basic[node-store]% ⊦ ¬ adr ∈ as → (adr ∈ as ++ adr0 ↔ adr = adr0); (s)% ⊦ adr ∈ nodes(istore) ↔ adr ∈ istore; (s)% ⊦ adr ∈ dom iast ↔ adr ∈ iast; (s)% ⊦ n + 0 = n; (s)% ⊦ 0 ≤ m; (s)%⊦ union(asar, n, m) ⊆ as ↔ (∀ n0. n ≤ n0 ∧ n0 < n + m → asar[n0] ⊆ as); (s)% ⊦ as ++ adr ⊆ as0 ↔ as ⊆ as0 ∧ adr ∈ as0; (ws)% ⊦ ¬ adr ∈ as → (as ⊆ as0 ++ adr ↔ as ⊆ as0); (s)%c: ⊦ m + n = n + m; from specification nat-basic%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic% ⊦ m + 1 ≠ 0; (s)% ⊦ ¬ adr ∈ as → #(as ++ adr) = # as + 1; (s)% ⊦ ∅ ≠ as ++ adr; (s)