Proof step 274 from proof inv-commit (previous step)

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

• Proof step 275:

  syn1 ↔ true, zh0[rp] = mkznode(r0, zbrar0, boolvar0, false, m4), zh[rp] = mkznode(r, zbrar, boolvar, true, m), istore0[m0] = indexblock(indx, lax, m3), adr0 = adr, err1 = err, ginval0 = ginval4, gstore = gstore1, gstore0 = gstore2, istore = istore1, remove-refsize0(gstore) = gstore, remove-refsize0(istore) = istore, remove-refsize0(gstore1) = gstore1, remove-refsize0(istore1) = istore1, elems nx ∩ ginval0 = ∅, dom remove-refsize0(gstore2) ∩ ginval4 = ∅, elems nx ∩ ginval4 = ∅, dom gstore ∪ elems nx = dom gstore0 ∪ ginval0, dom gstore1 ∪ elems nx = dom gstore2 ∪ ginval4, btree-inv(rp, adr, istore0[m0, indexblock(indx, lax, m3 - m2)], istore1, zh0[rp, mkznode(r0, zbrar0, boolvar0, true, m4)], ri, fi), btree-inv(rp, @(m0, m1, m2), istore0, istore0, zh0, ri, ri), btree-inv(rp, adr, istore3, istore1, zh, ri, fi), btree-inv(rp, adr, istore3[n, indexblock([], [], 0)], istore1, zh, ri, fi), inv(gstore0 \ ginval0), inv(gstore), inv(istore), inv(istore0), inv(gstore2 \ ginval4), inv(gstore1), inv(istore3), inv(istore1), inv(istore3[n, indexblock([], [], 0)]), rp ∈ zh, istore ⊑ istore0, istore3[n, indexblock([], [], 0)] ⊑ istore0, istore1 ⊑ istore3, istore1 ⊑ istore3[n, indexblock([], [], 0)], istore1 ⊑ istore0, readonly.journal? → nx ≠ [] ∧ readonly.lnum = nx.last ∧ readonly.lnum ∈ gstore0, readonly.index? → readonly.lnum ∈ istore0, pstate1.journal? → nx ≠ [] ∧ pstate1.lnum = nx.last ∧ pstate1.lnum ∈ gstore2, pstate1.index? → pstate1.lnum ∈ istore0, ⌊err⌋ ∨ err = ESUCCESS ⊦ ⟪pstate0 := readonly, maxino2 := maxino, gstore1 := gstore, gstore2 := gstore0, ginval4 := ginval0, istore1 := istore; if err1 = ESUCCESS then adr := @(m0, m1, m2) else if true then {zh0[rp].dirty := true; let maxino = 0 in {apersistence_get_iblock_refsize# (m0, adr0, istore0, istore1, ginval4, gstore2, gstore1, nx, maxino2, ginval, pstate0, syn1; ; maxino); apersistence_set_iblock_refsize# (m0, maxino - m2, adr0, istore1, ginval4, gstore2, gstore1, nx, maxino2, ginval, pstate0, syn1; istore0)}}⟫ ( (∃ ri, fi. btree-inv(rp, adr0, istore0, istore1, zh0, ri, fi)) ∧ inv(istore0) ∧ istore1 ⊑ istore0 ∧ (pstate0.journal? → nx ≠ [] ∧ pstate0.lnum = nx.last ∧ pstate0.lnum ∈ gstore2) ∧ (pstate0.index? → pstate0.lnum ∈ istore0) ∧ (pstate0 = unbuffered → syn1)), err1 = ESUCCESS, pstate1 = readonly, pstate1 = unbuffered, dups(nx), n ∈ istore3

Rule argument

Additional information