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

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

• Proof step 104:

  istore2[m0] = indexblock(indx, lax, m3), zh[rp] = mkznode(r, zbrar, boolvar, true, m), zh0[rp] = mkznode(r0, zbrar0, boolvar0, false, m4), err1 = ESUCCESS, err1 = err, ginval0 = ginval4, gstore = gstore1, gstore0 = gstore2, istore = istore1, istore0 = remove-refsize0(istore2), remove-refsize0(istore1) = istore1, remove-refsize0(gstore1) = gstore1, dom remove-refsize0(gstore2) ∩ ginval4 = ∅, elems nx ∩ ginval4 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ ginval4, btree-inv(rp, adr, istore3[n, indexblock([], [], 0)], istore1, zh, ri, fi), btree-inv(rp, adr, istore3, istore1, zh, ri, fi), btree-inv(rp, @(m0, m1, m2), istore2, istore2, zh0, ri, ri), btree-inv(rp, adr, istore2[m0, indexblock(indx, lax, m3 - m2)], istore1, zh0[rp, mkznode(r0, zbrar0, boolvar0, true, m4)], ri, fi), inv(istore3[n, indexblock([], [], 0)]), inv(istore1), inv(istore3), inv(gstore1), inv(gstore2 \ ginval4), inv(istore2), rp ∈ zh, istore1 ⊑ istore2, istore1 ⊑ istore3[n, indexblock([], [], 0)], istore1 ⊑ istore3, istore3[n, indexblock([], [], 0)] ⊑ istore2, ⌊err⌋ ∨ err = ESUCCESS ⊦ [ginval0 := ∅; adr := @(m0, m1, m2); ginval := ginval1; nx := []; maxino := maxino0; pstate := unbuffered; ginval1 := ?] ( inv(remove-refsize0(gstore0) \ ginval0) ∧ inv(remove-refsize0(gstore0)) ∧ elems nx ∩ ginval0 = ∅ ∧ ¬ dups(nx) ∧ dom remove-refsize0(gstore0) ∪ elems nx = dom remove-refsize0(gstore0) ∪ ginval0 ∧ remove-refsize0(remove-refsize0(gstore0)) = remove-refsize0(gstore0) ∧ inv(istore0) ∧ inv(istore0) ∧ istore0 ⊑ istore0 ∧ remove-refsize0(istore0) = istore0 ∧ (pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ remove-refsize0(gstore0)) ∧ (pstate.index? → pstate.lnum ∈ istore0) → ⟪adr0 := adr; maxino2 := maxino, gstore1 := remove-refsize0(gstore0), gstore2 := remove-refsize0(gstore0), ginval4 := ginval0, istore1 := istore0; 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, pstate, true; ; maxino); apersistence_set_iblock_refsize# (m0, maxino - m2, adr0, istore1, ginval4, gstore2, gstore1, nx, maxino2, ginval, pstate, true; istore0)}}⟫ ( (∃ ri, fi. btree-inv(rp, adr0, istore0, istore1, zh0, ri, fi)) ∧ inv(istore0) ∧ istore1 ⊑ istore0 ∧ (pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore2) ∧ (pstate.index? → pstate.lnum ∈ istore0))), dups(nx), n ∈ istore3

Rule argument

Additional information