[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 1 from proof DMSQInv-atDoDeq (conclusion) (back to tree)

DMSQInv(gs, lsf, pcf), gs.qrl ≠ [], some?(gs.vs[gs.qrl.head].deqID) ⊦ (pcf(gs.vs[gs.qrl.head].deqID.tid) = D20 ∧ lsf(gs.vs[gs.qrl.head].deqID.tid).success ∨ pcf(gs.vs[gs.qrl.head].deqID.tid) = D21) ∧ lsf(gs.vs[gs.qrl.head].deqID.tid).nxt = gs.qrl.head ∧ lsf(gs.vs[gs.qrl.head].deqID.tid).first = gs.orl.last ∧ gs.orl.last = gs.vhead

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof DMSQInv-atDoDeq (previous step) (back to tree)

gs.qrl ≠ [], DMSQInv(gs, lsf, pcf), some?(gs.vs[gs.qrl.head].deqID) ⊦ (pcf(gs.vs[gs.qrl.head].deqID.tid) = D20 ∧ lsf(gs.vs[gs.qrl.head].deqID.tid).success ∨ pcf(gs.vs[gs.qrl.head].deqID.tid) = D21) ∧ lsf(gs.vs[gs.qrl.head].deqID.tid).nxt = gs.qrl.head ∧ lsf(gs.vs[gs.qrl.head].deqID.tid).first = gs.orl.last ∧ gs.orl.last = gs.vhead

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkgs, seq:⊦ ( ( ( ( ( ( ( ( ( ( (ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), subst:[qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs] → [qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs]

Additional information

Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ((ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns); (elim) Used terms: qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs

Proof step 3 from proof DMSQInv-atDoDeq (previous step) (back to tree)

gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), qrl ≠ [], DMSQInv(gs, lsf, pcf), some?(vs[qrl.head].deqID) ⊦ (pcf(vs[qrl.head].deqID.tid) = D20 ∧ lsf(vs[qrl.head].deqID.tid).success ∨ pcf(vs[qrl.head].deqID.tid) = D21) ∧ lsf(vs[qrl.head].deqID.tid).nxt = qrl.head ∧ lsf(vs[qrl.head].deqID.tid).first = orl.last ∧ orl.last = vhead

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 4 from proof DMSQInv-atDoDeq (previous step) (back to tree)

qrl ≠ [], DMSQInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf, pcf), some?(vs[qrl.head].deqID) ⊦ (pcf(vs[qrl.head].deqID.tid) = D20 ∧ lsf(vs[qrl.head].deqID.tid).success ∨ pcf(vs[qrl.head].deqID.tid) = D21) ∧ lsf(vs[qrl.head].deqID.tid).nxt = qrl.head ∧ lsf(vs[qrl.head].deqID.tid).first = orl.last ∧ orl.last = vhead

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [qrl, vtail0, orl0]

Additional information

Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, tail

Proof step 5 from proof DMSQInv-atDoDeq (previous step) (back to tree)

qrl = vtail0 + orl0, qrl ≠ [], DMSQInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf, pcf), some?(vs[vtail0].deqID) ⊦ (pcf(vs[vtail0].deqID.tid) = D20 ∧ lsf(vs[vtail0].deqID.tid).success ∨ pcf(vs[vtail0].deqID.tid) = D21) ∧ lsf(vs[vtail0].deqID.tid).nxt = vtail0 ∧ lsf(vs[vtail0].deqID.tid).first = orl.last ∧ orl.last = vhead

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a + x = a ' + x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ' + x ≠ []; (s)

Proof step 6 from proof DMSQInv-atDoDeq (previous step) (back to tree)

DMSQInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns), lsf, pcf), some?(vs[vtail0].deqID) ⊦ (pcf(vs[vtail0].deqID.tid) = D20 ∧ lsf(vs[vtail0].deqID.tid).success ∨ pcf(vs[vtail0].deqID.tid) = D21) ∧ lsf(vs[vtail0].deqID.tid).nxt = vtail0 ∧ lsf(vs[vtail0].deqID.tid).first = orl.last ∧ orl.last = vhead

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: opttid, name:elim-Some, seq: ⊦ some?(opttid) → (tid = opttid.tid ↔ opttid = Some(tid)), subst:[opttid, tid] → [vs[vtail0].deqID, tid]

Additional information

Used simplifier rules: ⊦ some?(opttid) → (tid = opttid.tid ↔ opttid = Some(tid)); (elim) Used terms: vs[vtail0].deqID, tid

Proof step 7 from proof DMSQInv-atDoDeq (previous step) (back to tree)

vs[vtail0].deqID = Some(tid), DMSQInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns), lsf, pcf), some?(vs[vtail0].deqID) ⊦ (pcf(tid) = D20 ∧ lsf(tid).success ∨ pcf(tid) = D21) ∧ lsf(tid).nxt = vtail0 ∧ lsf(tid).first = orl.last ∧ orl.last = vhead

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(Some(tid)); (s)

Proof step 8 from proof DMSQInv-atDoDeq (previous step) (back to tree)

vs[vtail0].deqID = Some(tid), DMSQInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns), lsf, pcf) ⊦ (pcf(tid) = D20 ∧ lsf(tid).success ∨ pcf(tid) = D21) ∧ lsf(tid).nxt = vtail0 ∧ lsf(tid).first = orl.last ∧ orl.last = vhead

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkls, seq:⊦ ( ( ( ( ( ( ( ( ( ( (tid = ls.tid ∧ value = ls.value) ∧ optval = ls.optval) ∧ node = ls.node) ∧ nd = ls.nd) ∧ (success ↔ ls.success)) ∧ lst = ls.lst) ∧ nxt = ls.nxt) ∧ rvref = ls.rvref) ∧ optval0 = ls.optval0) ∧ first = ls.first) ∧ othertid = ls.othertid) ∧ addr = ls.addr ↔ ls = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), subst:[value, nxt, optval0, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval] → [value, nxt, optval0, node, nd, lsf(tid), addr, tid0, lst, first, rvref, othertid, success, optval]

Additional information

Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ( (tid = ls.tid ∧ value = ls.value) ∧ optval = ls.optval) ∧ node = ls.node) ∧ nd = ls.nd) ∧ (success ↔ ls.success)) ∧ lst = ls.lst) ∧ nxt = ls.nxt) ∧ rvref = ls.rvref) ∧ optval0 = ls.optval0) ∧ first = ls.first) ∧ othertid = ls.othertid) ∧ addr = ls.addr ↔ ls = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr); (elim) Used terms: value, nxt, optval, node, nd, lsf(tid), addr, tid0, lst, first, rvref, othertid, success, optval

Proof step 9 from proof DMSQInv-atDoDeq (previous step) (back to tree)

vs[vtail0].deqID = Some(tid), lsf(tid) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), DMSQInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns), lsf, pcf) ⊦ (pcf(tid) = D20 ∧ success ∨ pcf(tid) = D21) ∧ nxt = vtail0 ∧ first = orl.last ∧ orl.last = vhead

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQInv, seq:⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid))), subst:[gs, lsf, pcf] → [mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns), lsf, pcf], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns), lsf, pcf

Proof step 10 from proof DMSQInv-atDoDeq (previous step) (back to tree)

⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)))

A spec-lemma

Proof step 11 from proof DMSQInv-atDoDeq (previous step) (back to tree)

vs[vtail0].deqID = Some(tid), lsf(tid) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns)), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns), lsf(tid), pcf(tid)) ⊦ (pcf(tid) = D20 ∧ success ∨ pcf(tid) = D21) ∧ nxt = vtail0 ∧ first = orl.last ∧ orl.last = vhead

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null), subst:[gs] → [mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns)], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns)

Proof step 12 from proof DMSQInv-atDoDeq (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)

A spec-lemma

Proof step 13 from proof DMSQInv-atDoDeq (previous step) (back to tree)

vs[vtail0].deqID = Some(tid), dom mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vrvHp = dom mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).prvHp, lsf(tid) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).orl ≠ [], allocrv (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vretRefs, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vrvHp), allocrv (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).pretRefs, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).prvHp), listp ( mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).ps, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).owns), markedp (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).orl, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).ps), markedp (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).orl, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vs), nonullRetRefs ( mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vretRefs, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).pretRefs), rvownerok (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vretRefs, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vrvHp, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).rvowns), rvownerok (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).pretRefs, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).prvHp, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).rvowns), unmarkedp (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).ps), mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).phead ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).orl, ¬ dups ( mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).qrl), mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vhead ] .next ≠ null ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vhead ] .next ] .deqID ≠ None → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vretRefs (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vhead ] .next ] .deqID .tid)) = Claimed (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vhead ] .next ] .deqID .tid, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vhead ] .next ] .val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns), lsf(tid), pcf(tid)), mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).orl.last = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vhead ∧ ( mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).qrl ≠ [] → unmarkedp (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).qrl.tail, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vs)) ∨ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).orl.butlast ≠ [] ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).orl.butlast.last = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vhead ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).phead ≠ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).orl.last ∧ unmarkedp (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vs), mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vtail = ( mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).qrl ).last ∨ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vtail = ( mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).qrl.butlast ).last ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).qrl.last ] .deqID = None ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).vs [( mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns).qrl ).last ] .next = null ⊦ (pcf(tid) = D20 ∧ success ∨ pcf(tid) = D21) ∧ nxt = vtail0 ∧ first = orl.last ∧ orl.last = vhead

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ None ≠ Some(tid); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .rvowns = rvowns; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .phead = phead; (s) ⊦ (a ' + x).tail = x; (s) ⊦ a ' + x ≠ []; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .prvHp = vrvHp0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .pretRefs = vretRefs0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s)

Proof step 14 from proof DMSQInv-atDoDeq (previous step) (back to tree)

vs[vtail0].deqID = Some(tid), ps[vtail0].deqID = None, dom vrvHp = dom prvHp, lsf(tid) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, vs[orl.last].next ≠ null ∧ vs[vs[orl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.last].next].deqID.tid)) = Claimed(vs[vs[orl.last].next].deqID.tid, vs[vs[orl.last].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, orl.last, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns), lsf(tid), pcf(tid)), vtail = (vtail0 ' + orl0).last ∨ vtail = (orl + (vtail0 ' + orl0).butlast).last ∧ vs[(vtail0 ' + orl0).last].deqID = None ∧ vs[(vtail0 ' + orl0).last].next = null ⊦ (pcf(tid) = D20 ∧ success ∨ pcf(tid) = D21) ∧ nxt = vtail0 ∧ first = orl.last

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [orl, phead0, orl1]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, phead0, y

Proof step 15 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[vtail0].deqID = None, vs[vtail0].deqID = Some(tid), dom vrvHp = dom prvHp, lsf(tid) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), orl = orl1 + phead0 ', orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns), lsf(tid), pcf(tid)), vtail = (vtail0 ' + orl0).last ∨ vtail = (orl + (vtail0 ' + orl0).butlast).last ∧ vs[(vtail0 ' + orl0).last].deqID = None ∧ vs[(vtail0 ' + orl0).last].next = null ⊦ (pcf(tid) = D20 ∧ success ∨ pcf(tid) = D21) ∧ nxt = vtail0 ∧ first = phead0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 16 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[ps[phead0].next].deqID = None, vs[ps[phead0].next].deqID = Some(tid), dom vrvHp = dom prvHp, lsf(tid) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), ps[phead0].next ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ ps, phead ∈ vs, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[phead0].next ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ ps[phead0].next ∈ orl0, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, ps[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), vtail = (ps[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∧ vs[(ps[phead0].next ' + orl0).last].deqID = None ∧ vs[(ps[phead0].next ' + orl0).last].next = null, phead ∈ orl1 ∨ phead = phead0 ⊦ (pcf(tid) = D20 ∧ success ∨ pcf(tid) = D21) ∧ nxt = ps[phead0].next ∧ first = phead0

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-postfix, seq: ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []), subst:[ps, rl, owns, rl0, vs] → [ps, orl1, owns, phead0 ' + ps[phead0].next ' + orl0, vs]

Additional information

Used terms: ps, orl1, owns, phead0 ' + ps[phead0].next ' + orl0, vs

Proof step 17 from proof DMSQInv-atDoDeq (previous step) (back to tree)

⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])

A spec-lemma

Proof step 18 from proof DMSQInv-atDoDeq (previous step) (back to tree)

vs[ps[phead0].next].deqID = Some(tid), ps[ps[phead0].next].deqID = None, dom vrvHp = dom prvHp, lsf(tid) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), ps[phead0].next ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[phead0].next ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ ps[phead0].next ∈ orl0, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), listp(orl1 + phead0 ' + ps[phead0].next ' + orl0, vs, ps, owns) → (listp(phead0 ' + ps[phead0].next ' + orl0, vs, ps, owns) ↔ phead0 ' + ps[phead0].next ' + orl0 ≠ []), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, ps[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), phead ∈ orl1 ∨ phead = phead0, vtail = (ps[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∧ vs[(ps[phead0].next ' + orl0).last].deqID = None ∧ vs[(ps[phead0].next ' + orl0).last].next = null ⊦ (pcf(tid) = D20 ∧ success ∨ pcf(tid) = D21) ∧ nxt = ps[phead0].next ∧ first = phead0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ Some(tid).tid = tid; (s) ⊦ None ≠ Some(tid); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ a ' + x ≠ []; (s)

Proof step 19 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = Some(tid), ps[vs[phead0].next].deqID = None, ps[phead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, lsf(tid) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(phead0) = None, vs[phead0].next ≠ phead0, phead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[phead0].next ' + orl0, vs, ps, owns), listp((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl1 + orl0), ¬ dups(orl1), ¬ dups(orl0), ¬ weak?(vs[phead0].deqID), ¬ vs[phead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vs[phead0].next ∈ orl1, vs[phead0].next ≠ null → rvowns(vretRefs(tid)) = Claimed(tid, vs[vs[phead0].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), phead ∈ orl1 ∨ phead = phead0, vtail = (vs[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (vs[phead0].next ' + orl0).butlast).last ∧ vs[(vs[phead0].next ' + orl0).last].deqID = None ∧ vs[(vs[phead0].next ' + orl0).last].next = null ⊦ (pcf(tid) = D20 ∧ success ∨ pcf(tid) = D21) ∧ nxt = vs[phead0].next ∧ first = phead0

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 36 terms: tid abort: F discard: F computed: F

Additional information

Used terms: tid

Proof step 20 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[vs[phead0].next].deqID = None, vs[vs[phead0].next].deqID = Some(tid), ps[phead0].deqID = vs[phead0].deqID, ps[phead0].next = vs[phead0].next, lsf(tid).tid = tid, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, lsf(tid) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(phead0) = None, vs[phead0].next ≠ phead0, phead0 ≠ null, DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, ps, owns), listp(vs[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl1 + orl0), ¬ dups(orl1), ¬ dups(orl0), ¬ weak?(vs[phead0].deqID), ¬ vs[phead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vs[phead0].next ∈ orl1, vs[phead0].next ≠ null → rvowns(vretRefs(tid)) = Claimed(tid, vs[vs[phead0].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), vtail = (vs[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (vs[phead0].next ' + orl0).butlast).last ∧ vs[(vs[phead0].next ' + orl0).last].deqID = None ∧ vs[(vs[phead0].next ' + orl0).last].next = null, phead ∈ orl1 ∨ phead = phead0 ⊦ (pcf(tid) = D20 ∧ success ∨ pcf(tid) = D21) ∧ nxt = vs[phead0].next ∧ first = phead0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s)

Proof step 21 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[vs[phead0].next].deqID = None, vs[vs[phead0].next].deqID = Some(tid0), ps[phead0].deqID = vs[phead0].deqID, ps[phead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, lsf(tid0) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(phead0) = None, vs[phead0].next ≠ phead0, phead0 ≠ null, DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), pcf(tid0)), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, ps, owns), listp(vs[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ weak?(vs[phead0].deqID), ¬ vs[phead0].next ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vs[phead0].next ∈ orl0, vs[phead0].next ≠ null → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead0].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), vtail = (vs[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (vs[phead0].next ' + orl0).butlast).last ∧ vs[(vs[phead0].next ' + orl0).last].deqID = None ∧ vs[(vs[phead0].next ' + orl0).last].next = null, phead ∈ orl1 ∨ phead = phead0 ⊦ (pcf(tid0) = D20 ∧ success ∨ pcf(tid0) = D21) ∧ nxt = vs[phead0].next ∧ first = phead0

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), mkls (tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), pcf(tid0)], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), mkls (tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), pcf(tid0)

Proof step 22 from proof DMSQInv-atDoDeq (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 23 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = Some(tid0), ps[vs[phead0].next].deqID = None, ps[phead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, lsf(tid0) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(phead0) = None, vs[phead0].next ≠ phead0, phead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[phead0].next ' + orl0, vs, ps, owns), listp((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ weak?(vs[phead0].deqID), ¬ vs[phead0].next ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vs[phead0].next ∈ orl0, vs[phead0].next ≠ null → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead0].next].val), pcf(tid0) = D3 → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).rvowns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).rvref) = Pending(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).rvref ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vrvHp ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).rvref ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).prvHp ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).rvref ≠ null, pcf(tid0) = D4 → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vretRefs (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).rvref ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).rvowns (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vretRefs (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid)) = Pending(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).rvref ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vrvHp ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).rvref ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).prvHp ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).rvref ≠ null, pcf(tid0) = D5 → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).rvowns (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vretRefs (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid)) = Pending(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid), pcf(tid0) = D6 → ( mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).success → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).optval = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vrvHp [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).rvref ] ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).optval = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).prvHp [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).rvref ]) ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).rvowns (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vretRefs (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid)) = ( mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).optval = Empty ∨ ¬ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).success ⊃ Pending(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) ;Claimed (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid, mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).optval.val) ), pcf(tid0) = D8 → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vtail ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl from mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first, pcf(tid0) = D9 → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vtail ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl from mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst, pcf(tid0) = D10 → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vtail ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl from mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ∧ ( mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ≠ null → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ] .next) ∧ ( mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ≠ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ≠ null ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ] .next), pcf(tid0) = D11 → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vtail ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl from mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl ∧ ( mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ≠ null → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ] .next) ∧ ( mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ≠ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ≠ null ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ] .next), pcf(tid0) = D12 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl ∧ ( mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ≠ null → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ] .next), pcf(tid0) = D13 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = null, pcf(tid0) = D14 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vrvHp [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).rvref ] = Empty ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = null, pcf(tid0) = D15 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vrvHp [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).rvref ] = Empty ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).prvHp [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).rvref ] = Empty, pcf(tid0) = D16 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ] .next ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ≠ null, pcf(tid0) = D17 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ] .next ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ] .next ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ≠ null, pcf(tid0) = D18 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ≠ null ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ] .next, pcf(tid0) = D19 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ≠ null ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ] .next ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).optval = Val (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ] .val), pcf(tid0) = D20 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ≠ null ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ] .next ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).optval = Val (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ] .val) ∧ ( mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl.head ] .deqID = Some(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vhead = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).success) ∧ (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).success ⊃ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ] .deqID = Some(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).rvowns (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vretRefs (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid)) = Claimed (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid, mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).optval.val) ∧ ( mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ] .deqID = None → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vhead = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first) ∧ noid (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl, mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs) ; mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ] .deqID ≠ None ∧ noid (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl, mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs) ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).rvowns (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vretRefs (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid)) = Pending(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) ), pcf(tid0) = D21 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ≠ null ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ] .next ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ] .deqID = Some(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) ∧ ( mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ] .deqID = None → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vhead = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first) ∧ noid (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl, mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs) ∧ ( mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl.head ] .deqID = Some(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vhead = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first), pcf(tid0) = D22 → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ] .deqID ≠ None ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ≠ null ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ] .next, pcf(tid0) = D23 → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ] .deqID ≠ None ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ≠ null ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ] .next ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).optval = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vrvHp [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).rvref ], pcf(tid0) = D24 → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ] .deqID ≠ None ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ≠ null ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ] .next ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).optval = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vrvHp [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).rvref ] ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).optval = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).prvHp [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).rvref ], pcf(tid0) = D25 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ≠ null ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ] .next ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ] .deqID ≠ None ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).optval = Val (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ] .val) ∧ ( mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vhead = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).rvowns (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vretRefs (( mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps ⊕ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs )[mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ] .deqID .tid)) = Claimed (( mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps ⊕ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs )[mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ] .deqID .tid, mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).optval.val)), pcf(tid0) = D26 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ≠ null ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ] .next ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ] .deqID ≠ None ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ] .deqID = Some(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).othertid) ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).optval = Val (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ] .val) ∧ ( mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vhead = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).rvowns (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vretRefs (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).othertid)) = Claimed (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).othertid, mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).optval.val)), pcf(tid0) = D27 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ≠ null ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ] .next ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ] .deqID = Some(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).othertid) ∧ ( mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vhead = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).rvowns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).addr) = Claimed (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).othertid, mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).optval.val)), pcf(tid0) = D28 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ≠ null ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ] .next ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ] .deqID = Some(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).othertid) ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).rvowns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).addr) = Claimed (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).othertid, mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).optval.val), pcf(tid0) = D29 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ] .deqID ≠ None ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ≠ null ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ] .next ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).rvowns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).addr) = Claimed (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).othertid, mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).optval.val), pcf(tid0) = D30 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ] .deqID ≠ None ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ≠ null ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ] .next ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).rvowns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).addr) = Claimed (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).othertid, mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).optval.val), pcf(tid0) = D31 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ] .deqID ≠ None ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ≠ null ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ] .next, pcf(tid0) = D34 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).optval = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vrvHp [mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vretRefs (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) ] ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).optval = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).prvHp [mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).pretRefs (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) ] ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vretRefs (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).pretRefs (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vretRefs (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vretRefs (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) ≠ null ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).rvowns (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vretRefs (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid)) = (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).optval = Empty ⊃ Pending(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) ;Claimed (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid, mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).optval.val) ), pcf(tid0) = E2 → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).owns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node) = Some(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid), pcf(tid0) = E3 → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).owns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node) = Some(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid), pcf(tid0) = E5 → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).owns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node) = Some(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid), pcf(tid0) = E6 → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).owns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node) = Some(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ] .next = null → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vtail), pcf(tid0) = E7 → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).owns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node) = Some(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl ∧ ( mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ≠ null → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ] .next) ∧ ( mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ] .next = null → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vtail = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst), pcf(tid0) = E8 → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).owns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node) = Some(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl ∧ ( mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ≠ null → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ] .next) ∧ ( mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ] .next = null → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vtail = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst), pcf(tid0) = E9 → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).owns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node) = Some(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = null ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ] .next = null → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vtail = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst), pcf(tid0) = E10 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).success → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ] .next = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ≠ null ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ] .val = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).value ∧ ( mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vtail ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ] .next = null ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).owns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node) = Weak(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) ∨ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ] .next = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node), pcf(tid0) = E11 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).success ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ] .next = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ≠ null ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ] .val = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).value ∧ ( mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vtail ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ] .next = null ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).owns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node) = Weak(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) ∨ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ] .next = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node), pcf(tid0) = E12 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).success ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ] .next = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ] .next = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ≠ null, pcf(tid0) = E13 → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).owns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node) = Some(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid), pcf(tid0) = E14 → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).owns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node) = Some(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ] .next ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ≠ null, pcf(tid0) = E15 → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).owns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node) = Some(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ] .next ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ] .next ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ≠ null, pcf(tid0) = E16 → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).owns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node) = Some(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid), pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ≠ null ∧ ¬ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl ∧ ¬ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl, pcf(tid0) = E4 ∨ pcf(tid0) = E10 → ¬ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).success → ¬ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl ∧ ¬ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ≠ null ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).owns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node) = Some(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ] = mk(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).value, None, null) ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ] = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ], pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ] = mk(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).value, None, null), pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ] = mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node ], pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 → ¬ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).success ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).rvowns (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vretRefs (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid)) = Pending(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid), pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 → ¬ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).success ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).rvowns (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vretRefs (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid)) = Pending(mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid), pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → ¬ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).success, pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D20 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vhead ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl from mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first, pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D20 ∨ pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first ≠ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vtail ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl from mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst, pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D20 ∨ pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl from mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first, pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D20 ∨ pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vretRefs (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).rvref ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).pretRefs (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).rvref ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).rvref ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vrvHp ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).rvref ≠ null, pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).success ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vretRefs (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vretRefs (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid) ≠ null ∧ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).rvowns (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vretRefs (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid)) = Claimed (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid, mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).optval.val) ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).optval = Val (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ] .val), pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 → mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).addr ∈ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vrvHp ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).addr ≠ null ∧ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).optval = Val (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt ] .val), pcf(tid0) = idle ∨ pcf(tid0) = ready ∨ pcf(tid0) = E1 ∨ pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E4 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E10 ∨ pcf(tid0) = E11 ∨ pcf(tid0) = E12 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 ∨ pcf(tid0) = E17 ∨ pcf(tid0) = D1 ∨ pcf(tid0) = D2 ∨ pcf(tid0) = D3 ∨ pcf(tid0) = D4 ∨ pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 ∨ pcf(tid0) = D34 → nextnottid (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vhead, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs), pcf(tid0) = D20 ∨ pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vhead ≠ mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first → nextnottid (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vhead, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs), pcf(tid0) = crashed ∨ pcf(tid0) = idle ∨ pcf(tid0) = ready ∨ pcf(tid0) = E1 ∨ pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E4 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E10 ∨ pcf(tid0) = E11 ∨ pcf(tid0) = E12 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 ∨ pcf(tid0) = E17 ∨ pcf(tid0) = D1 ∨ pcf(tid0) = D2 ∨ pcf(tid0) = D3 ∨ pcf(tid0) = D4 ∨ pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 ∨ pcf(tid0) = D34 → noid (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vhead, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs), pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 → noid (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl, mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).first, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs), pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → noid (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).orl + mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).qrl, mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).nxt, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs), pcf(tid0) = crashed ∨ pcf(tid0) = idle ∨ pcf(tid0) = ready ∨ pcf(tid0) = D1 ∨ pcf(tid0) = D2 ∨ pcf(tid0) = D3 ∨ pcf(tid0) = D4 ∨ pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D20 ∨ pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 ∨ pcf(tid0) = D34 ∨ pcf(tid0) = E1 ∨ pcf(tid0) = E12 ∨ pcf(tid0) = E17 → noowns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).owns), pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → oneowns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid, mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).owns, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps), pcf(tid0) = E10 → (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).success ⊃ ( mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ] .next ≠ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ] .next ⊃ oneweakowns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid, mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).owns, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps) ;noowns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).owns) ) ;oneowns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid, mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).owns, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps) ), pcf(tid0) = E11 → ( mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ] .next ≠ mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs [mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).lst ] .next ⊃ oneweakowns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid, mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).owns, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps) ;noowns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).owns) ), pcf(tid0) = E4 → (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).success ⊃ noowns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).owns) ;oneowns (mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).tid, mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr).node, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).owns, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).vs, mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns).ps) ), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), phead ∈ orl1 ∨ phead = phead0, vtail = (vs[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (vs[phead0].next ' + orl0).butlast).last ∧ vs[(vs[phead0].next ' + orl0).last].deqID = None ∧ vs[(vs[phead0].next ' + orl0).last].next = null ⊦ (pcf(tid0) = D20 ∧ success ∨ pcf(tid0) = D21) ∧ nxt = vs[phead0].next ∧ first = phead0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .rvref = rvref; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .prvHp = vrvHp0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .rvowns = rvowns; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .first = node2; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ Val(val).val = val; (s) ⊦ (a ' + x).head = a; (s) ⊦ a ' + x ≠ []; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .othertid = tid0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .addr = rvref0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .pretRefs = vretRefs0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s)

Proof step 24 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[vs[phead0].next].deqID = None, vs[vs[phead0].next].deqID = Some(tid0), ps[phead0].deqID = vs[phead0].deqID, ps[phead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, lsf(tid0) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(phead0) = None, vs[phead0].next ≠ phead0, phead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, ps, owns), listp(vs[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ weak?(vs[phead0].deqID), ¬ vs[phead0].next ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vs[phead0].next ∈ orl0, vs[phead0].next ≠ null → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead0].next].val), pcf(tid0) = E4 → (success ⊃ noowns(tid0, owns);oneowns(tid0, node, owns, vs, ps)), pcf(tid0) = E11 → (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid0, node, owns, vs, ps);noowns(tid0, owns)), pcf(tid0) = E10 → (success ⊃ (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid0, node, owns, vs, ps);noowns(tid0, owns));oneowns(tid0, node, owns, vs, ps)), pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → oneowns(tid0, node, owns, vs, ps), pcf(tid0) = crashed ∨ pcf(tid0) = idle ∨ pcf(tid0) = ready ∨ pcf(tid0) = D1 ∨ pcf(tid0) = D2 ∨ pcf(tid0) = D3 ∨ pcf(tid0) = D4 ∨ pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D20 ∨ pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 ∨ pcf(tid0) = D34 ∨ pcf(tid0) = E1 ∨ pcf(tid0) = E12 ∨ pcf(tid0) = E17 → noowns(tid0, owns), pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, nxt, vs), pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, first, vs), pcf(tid0) = crashed ∨ pcf(tid0) = idle ∨ pcf(tid0) = ready ∨ pcf(tid0) = E1 ∨ pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E4 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E10 ∨ pcf(tid0) = E11 ∨ pcf(tid0) = E12 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 ∨ pcf(tid0) = E17 ∨ pcf(tid0) = D1 ∨ pcf(tid0) = D2 ∨ pcf(tid0) = D3 ∨ pcf(tid0) = D4 ∨ pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 ∨ pcf(tid0) = D34 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, phead0, vs), pcf(tid0) = D20 ∨ pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → phead0 ≠ first → nextnottid(tid0, phead0, vs), pcf(tid0) = idle ∨ pcf(tid0) = ready ∨ pcf(tid0) = E1 ∨ pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E4 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E10 ∨ pcf(tid0) = E11 ∨ pcf(tid0) = E12 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 ∨ pcf(tid0) = E17 ∨ pcf(tid0) = D1 ∨ pcf(tid0) = D2 ∨ pcf(tid0) = D3 ∨ pcf(tid0) = D4 ∨ pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 ∨ pcf(tid0) = D34 → nextnottid(tid0, phead0, vs), pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[nxt].val), pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → success ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null ∧ rvowns(vretRefs(tid0)) = Claimed(tid0, vs[nxt].val) ∧ optval = Val(vs[nxt].val), pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D20 ∨ pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 → vretRefs(tid0) = rvref ∧ pretRefs(tid0) = vretRefs(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null, pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D20 ∨ pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 → lst ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from first, pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D20 ∨ pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 → first ≠ lst ∧ vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst, pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D20 → (first ∈ orl1 ∨ first = phead0) ∧ phead0 ∈ orl1 + phead0 ' from first, pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → ¬ success, pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 → ¬ success ∧ rvowns(vretRefs(tid0)) = Pending(tid0), pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 → ¬ success ∧ rvowns(vretRefs(tid0)) = Pending(tid0), pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → ps[node] = vs[node], pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → vs[node] = mk(value, None, null), pcf(tid0) = E4 ∨ pcf(tid0) = E10 → ¬ success → ¬ node ∈ orl1 ∧ node ≠ phead0 ∧ node ≠ vs[phead0].next ∧ ¬ node ∈ orl0 ∧ node ≠ null ∧ node ∈ ps ∧ node ∈ vs ∧ owns(node) = Some(tid0) ∧ vs[node] = mk(value, None, null) ∧ ps[node] = vs[node], pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → node ∈ ps ∧ node ∈ vs ∧ node ≠ null ∧ ¬ node ∈ orl1 ∧ node ≠ phead0 ∧ node ≠ vs[phead0].next ∧ ¬ node ∈ orl0, pcf(tid0) = E16 → owns(node) = Some(tid0), pcf(tid0) = E15 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = vs[lst].next ∧ vs[lst].next = ps[lst].next ∧ vs[lst].next ≠ null, pcf(tid0) = E14 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = vs[lst].next ∧ vs[lst].next ≠ null, pcf(tid0) = E13 → owns(node) = Some(tid0), pcf(tid0) = E12 → success ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (vs[lst].next ∈ orl1 ∨ vs[lst].next = phead0 ∨ vs[lst].next = vs[phead0].next ∨ vs[lst].next ∈ orl0) ∧ vs[lst].next = node ∧ ps[lst].next = vs[lst].next ∧ vs[lst].next ∈ ps ∧ vs[lst].next ∈ vs ∧ vs[lst].next ≠ null, pcf(tid0) = E11 → success ∧ vs[lst].next = node ∧ vs[lst].next ≠ null ∧ vs[vs[lst].next].val = value ∧ ( lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid0) ∨ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ ps[lst].next = vs[lst].next), pcf(tid0) = E10 → success → vs[lst].next = node ∧ vs[lst].next ≠ null ∧ vs[vs[lst].next].val = value ∧ ( lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid0) ∨ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ ps[lst].next = vs[lst].next), pcf(tid0) = E9 → owns(node) = Some(tid0) ∧ nxt = null ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (vs[lst].next = null → vtail = lst), pcf(tid0) = E8 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst), pcf(tid0) = E7 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst), pcf(tid0) = E6 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (ps[lst].next = null → lst = vtail), pcf(tid0) = E5 → owns(node) = Some(tid0), pcf(tid0) = E3 → owns(node) = Some(tid0), pcf(tid0) = E2 → owns(node) = Some(tid0), pcf(tid0) = D34 → optval = vrvHp[vretRefs(tid0)] ∧ vrvHp[vretRefs(tid0)] = prvHp[pretRefs(tid0)] ∧ vretRefs(tid0) = pretRefs(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null ∧ rvowns(vretRefs(tid0)) = (vrvHp[vretRefs(tid0)] = Empty ⊃ Pending(tid0);Claimed(tid0, vrvHp[vretRefs(tid0)].val)), pcf(tid0) = D31 → (first ∈ orl1 ∨ first = phead0) ∧ ps[ps[first].next].deqID ≠ None ∧ ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D30 → (first ∈ orl1 ∨ first = phead0) ∧ ps[ps[first].next].deqID ≠ None ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ rvowns(addr) = Claimed(othertid, optval.val), pcf(tid0) = D29 → (first ∈ orl1 ∨ first = phead0) ∧ ps[ps[first].next].deqID ≠ None ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ rvowns(addr) = Claimed(othertid, optval.val), pcf(tid0) = D28 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID = Some(othertid) ∧ rvowns(addr) = Claimed(othertid, optval.val), pcf(tid0) = D27 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID = Some(othertid) ∧ (phead0 = first → rvowns(addr) = Claimed(othertid, optval.val)), pcf(tid0) = D26 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID ≠ None ∧ vs[ps[first].next].deqID = Some(othertid) ∧ optval = Val(vs[ps[first].next].val) ∧ (phead0 = first → rvowns(vretRefs(othertid)) = Claimed(othertid, vs[ps[first].next].val)), pcf(tid0) = D25 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID ≠ None ∧ optval = Val(vs[ps[first].next].val) ∧ (phead0 = first → rvowns(vretRefs((ps ⊕ vs)[ps[first].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[first].next].deqID.tid, vs[ps[first].next].val)), pcf(tid0) = D24 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pcf(tid0) = D23 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = vrvHp[rvref], pcf(tid0) = D22 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D21 → ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID = Some(tid0) ∧ noid(tid0, (orl1 + first ') + vs[first].next ' + orl0, ps[first].next, vs) ∧ phead0 = first, pcf(tid0) = D20 → ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = Val(vs[ps[first].next].val) ∧ phead0 = first ∧ success ∧ vs[ps[first].next].deqID = Some(tid0) ∧ rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[first].next].val) ∧ noid(tid0, (orl1 + first ') + vs[first].next ' + orl0, ps[first].next, vs), pcf(tid0) = D19 → ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = Val(vs[ps[first].next].val), pcf(tid0) = D18 → ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D17 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = ps[lst].next ∧ ps[lst].next = vs[lst].next ∧ ps[lst].next ≠ null, pcf(tid0) = D16 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = vs[lst].next ∧ vs[lst].next ≠ null, pcf(tid0) = D15 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pcf(tid0) = D14 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ vrvHp[rvref] = Empty ∧ nxt = null, pcf(tid0) = D13 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = null, pcf(tid0) = D12 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[lst].next), pcf(tid0) = D11 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[first].next) ∧ (first ≠ lst → ps[first].next ≠ null ∧ nxt = ps[first].next), pcf(tid0) = D10 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst ∧ (nxt ≠ null → nxt = vs[first].next) ∧ (first ≠ lst → ps[first].next ≠ null ∧ nxt = ps[first].next), pcf(tid0) = D9 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst, pcf(tid0) = D8 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from first, pcf(tid0) = D6 → (success → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid0)) = (optval = Empty ∨ ¬ success ⊃ Pending(tid0);Claimed(tid0, optval.val)), pcf(tid0) = D5 → rvowns(vretRefs(tid0)) = Pending(tid0), pcf(tid0) = D4 → vretRefs(tid0) = rvref ∧ rvowns(vretRefs(tid0)) = Pending(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ∈ prvHp ∧ vretRefs(tid0) ≠ null, pcf(tid0) = D3 → rvowns(rvref) = Pending(tid0) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), vtail = (vs[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (vs[phead0].next ' + orl0).butlast).last ∧ vs[(vs[phead0].next ' + orl0).last].deqID = None ∧ vs[(vs[phead0].next ' + orl0).last].next = null, phead ∈ orl1 ∨ phead = phead0 ⊦ (pcf(tid0) = D20 ∧ success ∨ pcf(tid0) = D21) ∧ nxt = vs[phead0].next ∧ first = phead0

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: pcf(tid0) = D20

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used formulas: pcf(tid0) = D20

Proof step 25 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = Some(tid0), ps[vs[phead0].next].deqID = None, ps[phead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, lsf(tid0) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(phead0) = None, vs[phead0].next ≠ phead0, pcf(tid0) ≠ D20, phead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[phead0].next ' + orl0, vs, ps, owns), listp((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ weak?(vs[phead0].deqID), ¬ vs[phead0].next ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vs[phead0].next ∈ orl0, pcf(tid0) = D3 → rvowns(rvref) = Pending(tid0) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pcf(tid0) = D4 → vretRefs(tid0) = rvref ∧ rvowns(vretRefs(tid0)) = Pending(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ∈ prvHp ∧ vretRefs(tid0) ≠ null, pcf(tid0) = D5 → rvowns(vretRefs(tid0)) = Pending(tid0), pcf(tid0) = D6 → (success → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid0)) = (optval = Empty ∨ ¬ success ⊃ Pending(tid0);Claimed(tid0, optval.val)), pcf(tid0) = D8 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from first, pcf(tid0) = D9 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst, pcf(tid0) = D10 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst ∧ (nxt ≠ null → nxt = vs[first].next) ∧ (first ≠ lst → ps[first].next ≠ null ∧ nxt = ps[first].next), pcf(tid0) = D11 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[first].next) ∧ (first ≠ lst → ps[first].next ≠ null ∧ nxt = ps[first].next), pcf(tid0) = D12 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[lst].next), pcf(tid0) = D13 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = null, pcf(tid0) = D14 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ vrvHp[rvref] = Empty ∧ nxt = null, pcf(tid0) = D15 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pcf(tid0) = D16 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = vs[lst].next ∧ vs[lst].next ≠ null, pcf(tid0) = D17 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = ps[lst].next ∧ ps[lst].next = vs[lst].next ∧ ps[lst].next ≠ null, pcf(tid0) = D18 → ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D19 → ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = Val(vs[ps[first].next].val), pcf(tid0) = D20 → ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = Val(vs[ps[first].next].val) ∧ phead0 = first ∧ success ∧ vs[ps[first].next].deqID = Some(tid0) ∧ rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[first].next].val) ∧ noid(tid0, (orl1 + first ') + vs[first].next ' + orl0, ps[first].next, vs), pcf(tid0) = D21 → ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID = Some(tid0) ∧ noid(tid0, (orl1 + first ') + vs[first].next ' + orl0, ps[first].next, vs) ∧ phead0 = first, pcf(tid0) = D22 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D23 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = vrvHp[rvref], pcf(tid0) = D24 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pcf(tid0) = D25 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID ≠ None ∧ optval = Val(vs[ps[first].next].val) ∧ (phead0 = first → rvowns(vretRefs((ps ⊕ vs)[ps[first].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[first].next].deqID.tid, vs[ps[first].next].val)), pcf(tid0) = D26 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID ≠ None ∧ vs[ps[first].next].deqID = Some(othertid) ∧ optval = Val(vs[ps[first].next].val) ∧ (phead0 = first → rvowns(vretRefs(othertid)) = Claimed(othertid, vs[ps[first].next].val)), pcf(tid0) = D27 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID = Some(othertid) ∧ (phead0 = first → rvowns(addr) = Claimed(othertid, optval.val)), pcf(tid0) = D28 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID = Some(othertid) ∧ rvowns(addr) = Claimed(othertid, optval.val), pcf(tid0) = D29 → (first ∈ orl1 ∨ first = phead0) ∧ ps[ps[first].next].deqID ≠ None ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ rvowns(addr) = Claimed(othertid, optval.val), pcf(tid0) = D30 → (first ∈ orl1 ∨ first = phead0) ∧ ps[ps[first].next].deqID ≠ None ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ rvowns(addr) = Claimed(othertid, optval.val), pcf(tid0) = D31 → (first ∈ orl1 ∨ first = phead0) ∧ ps[ps[first].next].deqID ≠ None ∧ ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D34 → optval = vrvHp[vretRefs(tid0)] ∧ vrvHp[vretRefs(tid0)] = prvHp[pretRefs(tid0)] ∧ vretRefs(tid0) = pretRefs(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null ∧ rvowns(vretRefs(tid0)) = (vrvHp[vretRefs(tid0)] = Empty ⊃ Pending(tid0);Claimed(tid0, vrvHp[vretRefs(tid0)].val)), pcf(tid0) = E2 → owns(node) = Some(tid0), pcf(tid0) = E3 → owns(node) = Some(tid0), pcf(tid0) = E5 → owns(node) = Some(tid0), pcf(tid0) = E6 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (ps[lst].next = null → lst = vtail), pcf(tid0) = E7 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst), pcf(tid0) = E8 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst), pcf(tid0) = E9 → owns(node) = Some(tid0) ∧ nxt = null ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (vs[lst].next = null → vtail = lst), pcf(tid0) = E10 → success → vs[lst].next = node ∧ vs[lst].next ≠ null ∧ vs[vs[lst].next].val = value ∧ ( lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid0) ∨ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ ps[lst].next = vs[lst].next), pcf(tid0) = E11 → success ∧ vs[lst].next = node ∧ vs[lst].next ≠ null ∧ vs[vs[lst].next].val = value ∧ ( lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid0) ∨ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ ps[lst].next = vs[lst].next), pcf(tid0) = E12 → success ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (vs[lst].next ∈ orl1 ∨ vs[lst].next = phead0 ∨ vs[lst].next = vs[phead0].next ∨ vs[lst].next ∈ orl0) ∧ vs[lst].next = node ∧ ps[lst].next = vs[lst].next ∧ vs[lst].next ∈ ps ∧ vs[lst].next ∈ vs ∧ vs[lst].next ≠ null, pcf(tid0) = E13 → owns(node) = Some(tid0), pcf(tid0) = E14 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = vs[lst].next ∧ vs[lst].next ≠ null, pcf(tid0) = E15 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = vs[lst].next ∧ vs[lst].next = ps[lst].next ∧ vs[lst].next ≠ null, pcf(tid0) = E16 → owns(node) = Some(tid0), pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → node ∈ ps ∧ node ∈ vs ∧ node ≠ null ∧ ¬ node ∈ orl1 ∧ node ≠ phead0 ∧ node ≠ vs[phead0].next ∧ ¬ node ∈ orl0, pcf(tid0) = E4 ∨ pcf(tid0) = E10 → ¬ success → ¬ node ∈ orl1 ∧ node ≠ phead0 ∧ node ≠ vs[phead0].next ∧ ¬ node ∈ orl0 ∧ node ≠ null ∧ node ∈ ps ∧ node ∈ vs ∧ owns(node) = Some(tid0) ∧ vs[node] = mk(value, None, null) ∧ ps[node] = vs[node], pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → vs[node] = mk(value, None, null), pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → ps[node] = vs[node], pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 → ¬ success ∧ rvowns(vretRefs(tid0)) = Pending(tid0), pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 → ¬ success ∧ rvowns(vretRefs(tid0)) = Pending(tid0), pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → ¬ success, pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D20 → (first ∈ orl1 ∨ first = phead0) ∧ phead0 ∈ orl1 + phead0 ' from first, pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D20 ∨ pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 → first ≠ lst ∧ vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst, pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D20 ∨ pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 → lst ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from first, pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D20 ∨ pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 → vretRefs(tid0) = rvref ∧ pretRefs(tid0) = vretRefs(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null, pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → success ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null ∧ rvowns(vretRefs(tid0)) = Claimed(tid0, vs[nxt].val) ∧ optval = Val(vs[nxt].val), pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[nxt].val), pcf(tid0) = idle ∨ pcf(tid0) = ready ∨ pcf(tid0) = E1 ∨ pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E4 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E10 ∨ pcf(tid0) = E11 ∨ pcf(tid0) = E12 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 ∨ pcf(tid0) = E17 ∨ pcf(tid0) = D1 ∨ pcf(tid0) = D2 ∨ pcf(tid0) = D3 ∨ pcf(tid0) = D4 ∨ pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 ∨ pcf(tid0) = D34 → nextnottid(tid0, phead0, vs), pcf(tid0) = D20 ∨ pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → phead0 ≠ first → nextnottid(tid0, phead0, vs), pcf(tid0) = crashed ∨ pcf(tid0) = idle ∨ pcf(tid0) = ready ∨ pcf(tid0) = E1 ∨ pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E4 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E10 ∨ pcf(tid0) = E11 ∨ pcf(tid0) = E12 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 ∨ pcf(tid0) = E17 ∨ pcf(tid0) = D1 ∨ pcf(tid0) = D2 ∨ pcf(tid0) = D3 ∨ pcf(tid0) = D4 ∨ pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 ∨ pcf(tid0) = D34 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, phead0, vs), pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, first, vs), pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, nxt, vs), pcf(tid0) = crashed ∨ pcf(tid0) = idle ∨ pcf(tid0) = ready ∨ pcf(tid0) = D1 ∨ pcf(tid0) = D2 ∨ pcf(tid0) = D3 ∨ pcf(tid0) = D4 ∨ pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D20 ∨ pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 ∨ pcf(tid0) = D34 ∨ pcf(tid0) = E1 ∨ pcf(tid0) = E12 ∨ pcf(tid0) = E17 → noowns(tid0, owns), pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → oneowns(tid0, node, owns, vs, ps), pcf(tid0) = E10 → (success ⊃ (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid0, node, owns, vs, ps);noowns(tid0, owns));oneowns(tid0, node, owns, vs, ps)), pcf(tid0) = E11 → (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid0, node, owns, vs, ps);noowns(tid0, owns)), pcf(tid0) = E4 → (success ⊃ noowns(tid0, owns);oneowns(tid0, node, owns, vs, ps)), vs[phead0].next ≠ null → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead0].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), phead ∈ orl1 ∨ phead = phead0, vtail = (vs[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (vs[phead0].next ' + orl0).butlast).last ∧ vs[(vs[phead0].next ' + orl0).last].deqID = None ∧ vs[(vs[phead0].next ' + orl0).last].next = null ⊦ (pcf(tid0) = D20 ∧ success ∨ pcf(tid0) = D21) ∧ nxt = vs[phead0].next ∧ first = phead0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 26 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[vs[phead0].next].deqID = None, vs[vs[phead0].next].deqID = Some(tid0), ps[phead0].deqID = vs[phead0].deqID, ps[phead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, lsf(tid0) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(phead0) = None, vs[phead0].next ≠ phead0, pcf(tid0) ≠ D20, phead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, ps, owns), listp(vs[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ weak?(vs[phead0].deqID), ¬ vs[phead0].next ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vs[phead0].next ∈ orl0, vs[phead0].next ≠ null → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead0].next].val), pcf(tid0) = E4 → (success ⊃ noowns(tid0, owns);oneowns(tid0, node, owns, vs, ps)), pcf(tid0) = E11 → (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid0, node, owns, vs, ps);noowns(tid0, owns)), pcf(tid0) = E10 → (success ⊃ (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid0, node, owns, vs, ps);noowns(tid0, owns));oneowns(tid0, node, owns, vs, ps)), pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → oneowns(tid0, node, owns, vs, ps), pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, nxt, vs), pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, first, vs), pcf(tid0) = crashed ∨ pcf(tid0) = idle ∨ pcf(tid0) = ready ∨ pcf(tid0) = E1 ∨ pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E4 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E10 ∨ pcf(tid0) = E11 ∨ pcf(tid0) = E12 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 ∨ pcf(tid0) = E17 ∨ pcf(tid0) = D1 ∨ pcf(tid0) = D2 ∨ pcf(tid0) = D3 ∨ pcf(tid0) = D4 ∨ pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 ∨ pcf(tid0) = D34 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, phead0, vs), pcf(tid0) = idle ∨ pcf(tid0) = ready ∨ pcf(tid0) = E1 ∨ pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E4 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E10 ∨ pcf(tid0) = E11 ∨ pcf(tid0) = E12 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 ∨ pcf(tid0) = E17 ∨ pcf(tid0) = D1 ∨ pcf(tid0) = D2 ∨ pcf(tid0) = D3 ∨ pcf(tid0) = D4 ∨ pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 ∨ pcf(tid0) = D34 → nextnottid(tid0, phead0, vs), pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[nxt].val), pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → success ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null ∧ rvowns(vretRefs(tid0)) = Claimed(tid0, vs[nxt].val) ∧ optval = Val(vs[nxt].val), pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → ¬ success, pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 → ¬ success ∧ rvowns(vretRefs(tid0)) = Pending(tid0), pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 → ¬ success ∧ rvowns(vretRefs(tid0)) = Pending(tid0), pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → ps[node] = vs[node], pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → vs[node] = mk(value, None, null), pcf(tid0) = E4 ∨ pcf(tid0) = E10 → ¬ success → ¬ node ∈ orl1 ∧ node ≠ phead0 ∧ node ≠ vs[phead0].next ∧ ¬ node ∈ orl0 ∧ node ≠ null ∧ node ∈ ps ∧ node ∈ vs ∧ owns(node) = Some(tid0) ∧ vs[node] = mk(value, None, null) ∧ ps[node] = vs[node], pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → node ∈ ps ∧ node ∈ vs ∧ node ≠ null ∧ ¬ node ∈ orl1 ∧ node ≠ phead0 ∧ node ≠ vs[phead0].next ∧ ¬ node ∈ orl0, pcf(tid0) = E16 → owns(node) = Some(tid0), pcf(tid0) = E15 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = vs[lst].next ∧ vs[lst].next = ps[lst].next ∧ vs[lst].next ≠ null, pcf(tid0) = E14 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = vs[lst].next ∧ vs[lst].next ≠ null, pcf(tid0) = E13 → owns(node) = Some(tid0), pcf(tid0) = E12 → success ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (vs[lst].next ∈ orl1 ∨ vs[lst].next = phead0 ∨ vs[lst].next = vs[phead0].next ∨ vs[lst].next ∈ orl0) ∧ vs[lst].next = node ∧ ps[lst].next = vs[lst].next ∧ vs[lst].next ∈ ps ∧ vs[lst].next ∈ vs ∧ vs[lst].next ≠ null, pcf(tid0) = E11 → success ∧ vs[lst].next = node ∧ vs[lst].next ≠ null ∧ vs[vs[lst].next].val = value ∧ ( lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid0) ∨ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ ps[lst].next = vs[lst].next), pcf(tid0) = E10 → success → vs[lst].next = node ∧ vs[lst].next ≠ null ∧ vs[vs[lst].next].val = value ∧ ( lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid0) ∨ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ ps[lst].next = vs[lst].next), pcf(tid0) = E9 → owns(node) = Some(tid0) ∧ nxt = null ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (vs[lst].next = null → vtail = lst), pcf(tid0) = E8 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst), pcf(tid0) = E7 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst), pcf(tid0) = E6 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (ps[lst].next = null → lst = vtail), pcf(tid0) = E5 → owns(node) = Some(tid0), pcf(tid0) = E3 → owns(node) = Some(tid0), pcf(tid0) = E2 → owns(node) = Some(tid0), pcf(tid0) = D34 → optval = vrvHp[vretRefs(tid0)] ∧ vrvHp[vretRefs(tid0)] = prvHp[pretRefs(tid0)] ∧ vretRefs(tid0) = pretRefs(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null ∧ rvowns(vretRefs(tid0)) = (vrvHp[vretRefs(tid0)] = Empty ⊃ Pending(tid0);Claimed(tid0, vrvHp[vretRefs(tid0)].val)), pcf(tid0) = D31 → (first ∈ orl1 ∨ first = phead0) ∧ ps[ps[first].next].deqID ≠ None ∧ ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D30 → (first ∈ orl1 ∨ first = phead0) ∧ ps[ps[first].next].deqID ≠ None ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ rvowns(addr) = Claimed(othertid, optval.val), pcf(tid0) = D29 → (first ∈ orl1 ∨ first = phead0) ∧ ps[ps[first].next].deqID ≠ None ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ rvowns(addr) = Claimed(othertid, optval.val), pcf(tid0) = D28 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID = Some(othertid) ∧ rvowns(addr) = Claimed(othertid, optval.val), pcf(tid0) = D27 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID = Some(othertid) ∧ (phead0 = first → rvowns(addr) = Claimed(othertid, optval.val)), pcf(tid0) = D26 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID ≠ None ∧ vs[ps[first].next].deqID = Some(othertid) ∧ optval = Val(vs[ps[first].next].val) ∧ (phead0 = first → rvowns(vretRefs(othertid)) = Claimed(othertid, vs[ps[first].next].val)), pcf(tid0) = D25 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID ≠ None ∧ optval = Val(vs[ps[first].next].val) ∧ (phead0 = first → rvowns(vretRefs((ps ⊕ vs)[ps[first].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[first].next].deqID.tid, vs[ps[first].next].val)), pcf(tid0) = D24 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pcf(tid0) = D23 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = vrvHp[rvref], pcf(tid0) = D22 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D21 → ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID = Some(tid0) ∧ noid(tid0, (orl1 + first ') + vs[first].next ' + orl0, ps[first].next, vs) ∧ phead0 = first, pcf(tid0) = D19 → ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = Val(vs[ps[first].next].val), pcf(tid0) = D18 → ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D17 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = ps[lst].next ∧ ps[lst].next = vs[lst].next ∧ ps[lst].next ≠ null, pcf(tid0) = D16 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = vs[lst].next ∧ vs[lst].next ≠ null, pcf(tid0) = D15 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pcf(tid0) = D14 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ vrvHp[rvref] = Empty ∧ nxt = null, pcf(tid0) = D13 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = null, pcf(tid0) = D12 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[lst].next), pcf(tid0) = D11 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[first].next) ∧ (first ≠ lst → ps[first].next ≠ null ∧ nxt = ps[first].next), pcf(tid0) = D10 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst ∧ (nxt ≠ null → nxt = vs[first].next) ∧ (first ≠ lst → ps[first].next ≠ null ∧ nxt = ps[first].next), pcf(tid0) = D9 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst, pcf(tid0) = D8 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from first, pcf(tid0) = D6 → (success → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid0)) = (optval = Empty ∨ ¬ success ⊃ Pending(tid0);Claimed(tid0, optval.val)), pcf(tid0) = D5 → rvowns(vretRefs(tid0)) = Pending(tid0), pcf(tid0) = D4 → vretRefs(tid0) = rvref ∧ rvowns(vretRefs(tid0)) = Pending(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ∈ prvHp ∧ vretRefs(tid0) ≠ null, pcf(tid0) = D3 → rvowns(rvref) = Pending(tid0) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pcf(tid0) = crashed ∨ pcf(tid0) = idle ∨ pcf(tid0) = ready ∨ pcf(tid0) = D1 ∨ pcf(tid0) = D2 ∨ pcf(tid0) = D3 ∨ pcf(tid0) = D4 ∨ pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 ∨ pcf(tid0) = D34 ∨ pcf(tid0) = E1 ∨ pcf(tid0) = E12 ∨ pcf(tid0) = E17 → noowns(tid0, owns), pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → phead0 ≠ first → nextnottid(tid0, phead0, vs), pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 → vretRefs(tid0) = rvref ∧ pretRefs(tid0) = vretRefs(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null, pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 → lst ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from first, pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 → first ≠ lst ∧ vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst, pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 → (first ∈ orl1 ∨ first = phead0) ∧ phead0 ∈ orl1 + phead0 ' from first, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), vtail = (vs[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (vs[phead0].next ' + orl0).butlast).last ∧ vs[(vs[phead0].next ' + orl0).last].deqID = None ∧ vs[(vs[phead0].next ' + orl0).last].next = null, phead ∈ orl1 ∨ phead = phead0 ⊦ pcf(tid0) = D21 ∧ nxt = vs[phead0].next ∧ first = phead0

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: pcf(tid0) = D21

Additional information

Used formulas: pcf(tid0) = D21

Proof step 27 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = Some(tid0), ps[vs[phead0].next].deqID = None, ps[phead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, lsf(tid0) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(phead0) = None, vs[phead0].next ≠ phead0, pcf(tid0) ≠ D21, pcf(tid0) ≠ D20, phead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[phead0].next ' + orl0, vs, ps, owns), listp((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ weak?(vs[phead0].deqID), ¬ vs[phead0].next ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vs[phead0].next ∈ orl0, pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 → (first ∈ orl1 ∨ first = phead0) ∧ phead0 ∈ orl1 + phead0 ' from first, pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 → first ≠ lst ∧ vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst, pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 → lst ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from first, pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 → vretRefs(tid0) = rvref ∧ pretRefs(tid0) = vretRefs(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null, pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → phead0 ≠ first → nextnottid(tid0, phead0, vs), pcf(tid0) = crashed ∨ pcf(tid0) = idle ∨ pcf(tid0) = ready ∨ pcf(tid0) = D1 ∨ pcf(tid0) = D2 ∨ pcf(tid0) = D3 ∨ pcf(tid0) = D4 ∨ pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 ∨ pcf(tid0) = D34 ∨ pcf(tid0) = E1 ∨ pcf(tid0) = E12 ∨ pcf(tid0) = E17 → noowns(tid0, owns), pcf(tid0) = D3 → rvowns(rvref) = Pending(tid0) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pcf(tid0) = D4 → vretRefs(tid0) = rvref ∧ rvowns(vretRefs(tid0)) = Pending(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ∈ prvHp ∧ vretRefs(tid0) ≠ null, pcf(tid0) = D5 → rvowns(vretRefs(tid0)) = Pending(tid0), pcf(tid0) = D6 → (success → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid0)) = (optval = Empty ∨ ¬ success ⊃ Pending(tid0);Claimed(tid0, optval.val)), pcf(tid0) = D8 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from first, pcf(tid0) = D9 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst, pcf(tid0) = D10 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst ∧ (nxt ≠ null → nxt = vs[first].next) ∧ (first ≠ lst → ps[first].next ≠ null ∧ nxt = ps[first].next), pcf(tid0) = D11 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[first].next) ∧ (first ≠ lst → ps[first].next ≠ null ∧ nxt = ps[first].next), pcf(tid0) = D12 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[lst].next), pcf(tid0) = D13 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = null, pcf(tid0) = D14 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ vrvHp[rvref] = Empty ∧ nxt = null, pcf(tid0) = D15 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pcf(tid0) = D16 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = vs[lst].next ∧ vs[lst].next ≠ null, pcf(tid0) = D17 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = ps[lst].next ∧ ps[lst].next = vs[lst].next ∧ ps[lst].next ≠ null, pcf(tid0) = D18 → ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D19 → ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = Val(vs[ps[first].next].val), pcf(tid0) = D21 → ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID = Some(tid0) ∧ noid(tid0, (orl1 + first ') + vs[first].next ' + orl0, ps[first].next, vs) ∧ phead0 = first, pcf(tid0) = D22 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D23 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = vrvHp[rvref], pcf(tid0) = D24 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pcf(tid0) = D25 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID ≠ None ∧ optval = Val(vs[ps[first].next].val) ∧ (phead0 = first → rvowns(vretRefs((ps ⊕ vs)[ps[first].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[first].next].deqID.tid, vs[ps[first].next].val)), pcf(tid0) = D26 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID ≠ None ∧ vs[ps[first].next].deqID = Some(othertid) ∧ optval = Val(vs[ps[first].next].val) ∧ (phead0 = first → rvowns(vretRefs(othertid)) = Claimed(othertid, vs[ps[first].next].val)), pcf(tid0) = D27 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID = Some(othertid) ∧ (phead0 = first → rvowns(addr) = Claimed(othertid, optval.val)), pcf(tid0) = D28 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID = Some(othertid) ∧ rvowns(addr) = Claimed(othertid, optval.val), pcf(tid0) = D29 → (first ∈ orl1 ∨ first = phead0) ∧ ps[ps[first].next].deqID ≠ None ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ rvowns(addr) = Claimed(othertid, optval.val), pcf(tid0) = D30 → (first ∈ orl1 ∨ first = phead0) ∧ ps[ps[first].next].deqID ≠ None ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ rvowns(addr) = Claimed(othertid, optval.val), pcf(tid0) = D31 → (first ∈ orl1 ∨ first = phead0) ∧ ps[ps[first].next].deqID ≠ None ∧ ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D34 → optval = vrvHp[vretRefs(tid0)] ∧ vrvHp[vretRefs(tid0)] = prvHp[pretRefs(tid0)] ∧ vretRefs(tid0) = pretRefs(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null ∧ rvowns(vretRefs(tid0)) = (vrvHp[vretRefs(tid0)] = Empty ⊃ Pending(tid0);Claimed(tid0, vrvHp[vretRefs(tid0)].val)), pcf(tid0) = E2 → owns(node) = Some(tid0), pcf(tid0) = E3 → owns(node) = Some(tid0), pcf(tid0) = E5 → owns(node) = Some(tid0), pcf(tid0) = E6 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (ps[lst].next = null → lst = vtail), pcf(tid0) = E7 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst), pcf(tid0) = E8 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst), pcf(tid0) = E9 → owns(node) = Some(tid0) ∧ nxt = null ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (vs[lst].next = null → vtail = lst), pcf(tid0) = E10 → success → vs[lst].next = node ∧ vs[lst].next ≠ null ∧ vs[vs[lst].next].val = value ∧ ( lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid0) ∨ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ ps[lst].next = vs[lst].next), pcf(tid0) = E11 → success ∧ vs[lst].next = node ∧ vs[lst].next ≠ null ∧ vs[vs[lst].next].val = value ∧ ( lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid0) ∨ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ ps[lst].next = vs[lst].next), pcf(tid0) = E12 → success ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (vs[lst].next ∈ orl1 ∨ vs[lst].next = phead0 ∨ vs[lst].next = vs[phead0].next ∨ vs[lst].next ∈ orl0) ∧ vs[lst].next = node ∧ ps[lst].next = vs[lst].next ∧ vs[lst].next ∈ ps ∧ vs[lst].next ∈ vs ∧ vs[lst].next ≠ null, pcf(tid0) = E13 → owns(node) = Some(tid0), pcf(tid0) = E14 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = vs[lst].next ∧ vs[lst].next ≠ null, pcf(tid0) = E15 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = vs[lst].next ∧ vs[lst].next = ps[lst].next ∧ vs[lst].next ≠ null, pcf(tid0) = E16 → owns(node) = Some(tid0), pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → node ∈ ps ∧ node ∈ vs ∧ node ≠ null ∧ ¬ node ∈ orl1 ∧ node ≠ phead0 ∧ node ≠ vs[phead0].next ∧ ¬ node ∈ orl0, pcf(tid0) = E4 ∨ pcf(tid0) = E10 → ¬ success → ¬ node ∈ orl1 ∧ node ≠ phead0 ∧ node ≠ vs[phead0].next ∧ ¬ node ∈ orl0 ∧ node ≠ null ∧ node ∈ ps ∧ node ∈ vs ∧ owns(node) = Some(tid0) ∧ vs[node] = mk(value, None, null) ∧ ps[node] = vs[node], pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → vs[node] = mk(value, None, null), pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → ps[node] = vs[node], pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 → ¬ success ∧ rvowns(vretRefs(tid0)) = Pending(tid0), pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 → ¬ success ∧ rvowns(vretRefs(tid0)) = Pending(tid0), pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → ¬ success, pcf(tid0) = D21 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → success ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null ∧ rvowns(vretRefs(tid0)) = Claimed(tid0, vs[nxt].val) ∧ optval = Val(vs[nxt].val), pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[nxt].val), pcf(tid0) = idle ∨ pcf(tid0) = ready ∨ pcf(tid0) = E1 ∨ pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E4 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E10 ∨ pcf(tid0) = E11 ∨ pcf(tid0) = E12 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 ∨ pcf(tid0) = E17 ∨ pcf(tid0) = D1 ∨ pcf(tid0) = D2 ∨ pcf(tid0) = D3 ∨ pcf(tid0) = D4 ∨ pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 ∨ pcf(tid0) = D34 → nextnottid(tid0, phead0, vs), pcf(tid0) = crashed ∨ pcf(tid0) = idle ∨ pcf(tid0) = ready ∨ pcf(tid0) = E1 ∨ pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E4 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E10 ∨ pcf(tid0) = E11 ∨ pcf(tid0) = E12 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 ∨ pcf(tid0) = E17 ∨ pcf(tid0) = D1 ∨ pcf(tid0) = D2 ∨ pcf(tid0) = D3 ∨ pcf(tid0) = D4 ∨ pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 ∨ pcf(tid0) = D34 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, phead0, vs), pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, first, vs), pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, nxt, vs), pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → oneowns(tid0, node, owns, vs, ps), pcf(tid0) = E10 → (success ⊃ (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid0, node, owns, vs, ps);noowns(tid0, owns));oneowns(tid0, node, owns, vs, ps)), pcf(tid0) = E11 → (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid0, node, owns, vs, ps);noowns(tid0, owns)), pcf(tid0) = E4 → (success ⊃ noowns(tid0, owns);oneowns(tid0, node, owns, vs, ps)), vs[phead0].next ≠ null → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead0].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), phead ∈ orl1 ∨ phead = phead0, vtail = (vs[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (vs[phead0].next ' + orl0).butlast).last ∧ vs[(vs[phead0].next ' + orl0).last].deqID = None ∧ vs[(vs[phead0].next ' + orl0).last].next = null ⊦ pcf(tid0) = D21 ∧ nxt = vs[phead0].next ∧ first = phead0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 28 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[vs[phead0].next].deqID = None, vs[vs[phead0].next].deqID = Some(tid0), ps[phead0].deqID = vs[phead0].deqID, ps[phead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, lsf(tid0) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(phead0) = None, vs[phead0].next ≠ phead0, pcf(tid0) ≠ D21, pcf(tid0) ≠ D20, phead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, ps, owns), listp(vs[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ weak?(vs[phead0].deqID), ¬ vs[phead0].next ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vs[phead0].next ∈ orl0, vs[phead0].next ≠ null → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead0].next].val), pcf(tid0) = E4 → (success ⊃ noowns(tid0, owns);oneowns(tid0, node, owns, vs, ps)), pcf(tid0) = E11 → (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid0, node, owns, vs, ps);noowns(tid0, owns)), pcf(tid0) = E10 → (success ⊃ (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid0, node, owns, vs, ps);noowns(tid0, owns));oneowns(tid0, node, owns, vs, ps)), pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → oneowns(tid0, node, owns, vs, ps), pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, nxt, vs), pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, first, vs), pcf(tid0) = crashed ∨ pcf(tid0) = idle ∨ pcf(tid0) = ready ∨ pcf(tid0) = E1 ∨ pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E4 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E10 ∨ pcf(tid0) = E11 ∨ pcf(tid0) = E12 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 ∨ pcf(tid0) = E17 ∨ pcf(tid0) = D1 ∨ pcf(tid0) = D2 ∨ pcf(tid0) = D3 ∨ pcf(tid0) = D4 ∨ pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 ∨ pcf(tid0) = D34 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, phead0, vs), pcf(tid0) = idle ∨ pcf(tid0) = ready ∨ pcf(tid0) = E1 ∨ pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E4 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E10 ∨ pcf(tid0) = E11 ∨ pcf(tid0) = E12 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 ∨ pcf(tid0) = E17 ∨ pcf(tid0) = D1 ∨ pcf(tid0) = D2 ∨ pcf(tid0) = D3 ∨ pcf(tid0) = D4 ∨ pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 ∨ pcf(tid0) = D34 → nextnottid(tid0, phead0, vs), pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[nxt].val), pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → ¬ success, pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 → ¬ success ∧ rvowns(vretRefs(tid0)) = Pending(tid0), pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 → ¬ success ∧ rvowns(vretRefs(tid0)) = Pending(tid0), pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → ps[node] = vs[node], pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → vs[node] = mk(value, None, null), pcf(tid0) = E4 ∨ pcf(tid0) = E10 → ¬ success → ¬ node ∈ orl1 ∧ node ≠ phead0 ∧ node ≠ vs[phead0].next ∧ ¬ node ∈ orl0 ∧ node ≠ null ∧ node ∈ ps ∧ node ∈ vs ∧ owns(node) = Some(tid0) ∧ vs[node] = mk(value, None, null) ∧ ps[node] = vs[node], pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → node ∈ ps ∧ node ∈ vs ∧ node ≠ null ∧ ¬ node ∈ orl1 ∧ node ≠ phead0 ∧ node ≠ vs[phead0].next ∧ ¬ node ∈ orl0, pcf(tid0) = E16 → owns(node) = Some(tid0), pcf(tid0) = E15 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = vs[lst].next ∧ vs[lst].next = ps[lst].next ∧ vs[lst].next ≠ null, pcf(tid0) = E14 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = vs[lst].next ∧ vs[lst].next ≠ null, pcf(tid0) = E13 → owns(node) = Some(tid0), pcf(tid0) = E12 → success ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (vs[lst].next ∈ orl1 ∨ vs[lst].next = phead0 ∨ vs[lst].next = vs[phead0].next ∨ vs[lst].next ∈ orl0) ∧ vs[lst].next = node ∧ ps[lst].next = vs[lst].next ∧ vs[lst].next ∈ ps ∧ vs[lst].next ∈ vs ∧ vs[lst].next ≠ null, pcf(tid0) = E11 → success ∧ vs[lst].next = node ∧ vs[lst].next ≠ null ∧ vs[vs[lst].next].val = value ∧ ( lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid0) ∨ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ ps[lst].next = vs[lst].next), pcf(tid0) = E10 → success → vs[lst].next = node ∧ vs[lst].next ≠ null ∧ vs[vs[lst].next].val = value ∧ ( lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid0) ∨ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ ps[lst].next = vs[lst].next), pcf(tid0) = E9 → owns(node) = Some(tid0) ∧ nxt = null ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (vs[lst].next = null → vtail = lst), pcf(tid0) = E8 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst), pcf(tid0) = E7 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst), pcf(tid0) = E6 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (ps[lst].next = null → lst = vtail), pcf(tid0) = E5 → owns(node) = Some(tid0), pcf(tid0) = E3 → owns(node) = Some(tid0), pcf(tid0) = E2 → owns(node) = Some(tid0), pcf(tid0) = D34 → optval = vrvHp[vretRefs(tid0)] ∧ vrvHp[vretRefs(tid0)] = prvHp[pretRefs(tid0)] ∧ vretRefs(tid0) = pretRefs(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null ∧ rvowns(vretRefs(tid0)) = (vrvHp[vretRefs(tid0)] = Empty ⊃ Pending(tid0);Claimed(tid0, vrvHp[vretRefs(tid0)].val)), pcf(tid0) = D31 → (first ∈ orl1 ∨ first = phead0) ∧ ps[ps[first].next].deqID ≠ None ∧ ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D30 → (first ∈ orl1 ∨ first = phead0) ∧ ps[ps[first].next].deqID ≠ None ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ rvowns(addr) = Claimed(othertid, optval.val), pcf(tid0) = D29 → (first ∈ orl1 ∨ first = phead0) ∧ ps[ps[first].next].deqID ≠ None ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ rvowns(addr) = Claimed(othertid, optval.val), pcf(tid0) = D28 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID = Some(othertid) ∧ rvowns(addr) = Claimed(othertid, optval.val), pcf(tid0) = D27 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID = Some(othertid) ∧ (phead0 = first → rvowns(addr) = Claimed(othertid, optval.val)), pcf(tid0) = D26 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID ≠ None ∧ vs[ps[first].next].deqID = Some(othertid) ∧ optval = Val(vs[ps[first].next].val) ∧ (phead0 = first → rvowns(vretRefs(othertid)) = Claimed(othertid, vs[ps[first].next].val)), pcf(tid0) = D25 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID ≠ None ∧ optval = Val(vs[ps[first].next].val) ∧ (phead0 = first → rvowns(vretRefs((ps ⊕ vs)[ps[first].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[first].next].deqID.tid, vs[ps[first].next].val)), pcf(tid0) = D24 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pcf(tid0) = D23 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = vrvHp[rvref], pcf(tid0) = D22 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D19 → ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = Val(vs[ps[first].next].val), pcf(tid0) = D18 → ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D17 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = ps[lst].next ∧ ps[lst].next = vs[lst].next ∧ ps[lst].next ≠ null, pcf(tid0) = D16 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = vs[lst].next ∧ vs[lst].next ≠ null, pcf(tid0) = D15 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pcf(tid0) = D14 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ vrvHp[rvref] = Empty ∧ nxt = null, pcf(tid0) = D13 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = null, pcf(tid0) = D12 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[lst].next), pcf(tid0) = D11 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[first].next) ∧ (first ≠ lst → ps[first].next ≠ null ∧ nxt = ps[first].next), pcf(tid0) = D10 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst ∧ (nxt ≠ null → nxt = vs[first].next) ∧ (first ≠ lst → ps[first].next ≠ null ∧ nxt = ps[first].next), pcf(tid0) = D9 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst, pcf(tid0) = D8 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from first, pcf(tid0) = D6 → (success → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid0)) = (optval = Empty ∨ ¬ success ⊃ Pending(tid0);Claimed(tid0, optval.val)), pcf(tid0) = D5 → rvowns(vretRefs(tid0)) = Pending(tid0), pcf(tid0) = D4 → vretRefs(tid0) = rvref ∧ rvowns(vretRefs(tid0)) = Pending(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ∈ prvHp ∧ vretRefs(tid0) ≠ null, pcf(tid0) = D3 → rvowns(rvref) = Pending(tid0) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 → (first ∈ orl1 ∨ first = phead0) ∧ phead0 ∈ orl1 + phead0 ' from first, pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → success ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null ∧ rvowns(vretRefs(tid0)) = Claimed(tid0, vs[nxt].val) ∧ optval = Val(vs[nxt].val), pcf(tid0) = crashed ∨ pcf(tid0) = idle ∨ pcf(tid0) = ready ∨ pcf(tid0) = D1 ∨ pcf(tid0) = D2 ∨ pcf(tid0) = D3 ∨ pcf(tid0) = D4 ∨ pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 ∨ pcf(tid0) = D34 ∨ pcf(tid0) = E1 ∨ pcf(tid0) = E12 ∨ pcf(tid0) = E17 → noowns(tid0, owns), pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → phead0 ≠ first → nextnottid(tid0, phead0, vs), pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 → vretRefs(tid0) = rvref ∧ pretRefs(tid0) = vretRefs(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null, pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 → lst ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from first, pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 → first ≠ lst ∧ vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), vtail = (vs[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (vs[phead0].next ' + orl0).butlast).last ∧ vs[(vs[phead0].next ' + orl0).last].deqID = None ∧ vs[(vs[phead0].next ' + orl0).last].next = null, phead ∈ orl1 ∨ phead = phead0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:nextnottid-def, seq:⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid), subst:[tid, vhead, vs] → [tid0, phead0, vs], <all paths>

Additional information

Used terms: tid0, phead0, vs

Proof step 29 from proof DMSQInv-atDoDeq (previous step) (back to tree)

⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid)

A spec-lemma

Proof step 30 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = Some(tid0), ps[vs[phead0].next].deqID = None, ps[phead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, lsf(tid0) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(phead0) = None, vs[phead0].next ≠ phead0, pcf(tid0) ≠ D21, pcf(tid0) ≠ D20, phead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[phead0].next ' + orl0, vs, ps, owns), listp((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ weak?(vs[phead0].deqID), ¬ vs[phead0].next ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vs[phead0].next ∈ orl0, pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 → first ≠ lst ∧ vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst, pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 → lst ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from first, pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 → vretRefs(tid0) = rvref ∧ pretRefs(tid0) = vretRefs(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null, pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → phead0 ≠ first → vs[phead0].next ≠ null → vs[vs[phead0].next].deqID ≠ Some(tid0), pcf(tid0) = crashed ∨ pcf(tid0) = idle ∨ pcf(tid0) = ready ∨ pcf(tid0) = D1 ∨ pcf(tid0) = D2 ∨ pcf(tid0) = D3 ∨ pcf(tid0) = D4 ∨ pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 ∨ pcf(tid0) = D34 ∨ pcf(tid0) = E1 ∨ pcf(tid0) = E12 ∨ pcf(tid0) = E17 → noowns(tid0, owns), pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → success ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null ∧ rvowns(vretRefs(tid0)) = Claimed(tid0, vs[nxt].val) ∧ optval = Val(vs[nxt].val), pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 → (first ∈ orl1 ∨ first = phead0) ∧ phead0 ∈ orl1 + phead0 ' from first, pcf(tid0) = D3 → rvowns(rvref) = Pending(tid0) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pcf(tid0) = D4 → vretRefs(tid0) = rvref ∧ rvowns(vretRefs(tid0)) = Pending(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ∈ prvHp ∧ vretRefs(tid0) ≠ null, pcf(tid0) = D5 → rvowns(vretRefs(tid0)) = Pending(tid0), pcf(tid0) = D6 → (success → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid0)) = (optval = Empty ∨ ¬ success ⊃ Pending(tid0);Claimed(tid0, optval.val)), pcf(tid0) = D8 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from first, pcf(tid0) = D9 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst, pcf(tid0) = D10 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst ∧ (nxt ≠ null → nxt = vs[first].next) ∧ (first ≠ lst → ps[first].next ≠ null ∧ nxt = ps[first].next), pcf(tid0) = D11 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[first].next) ∧ (first ≠ lst → ps[first].next ≠ null ∧ nxt = ps[first].next), pcf(tid0) = D12 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[lst].next), pcf(tid0) = D13 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = null, pcf(tid0) = D14 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ vrvHp[rvref] = Empty ∧ nxt = null, pcf(tid0) = D15 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pcf(tid0) = D16 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = vs[lst].next ∧ vs[lst].next ≠ null, pcf(tid0) = D17 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = ps[lst].next ∧ ps[lst].next = vs[lst].next ∧ ps[lst].next ≠ null, pcf(tid0) = D18 → ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D19 → ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = Val(vs[ps[first].next].val), pcf(tid0) = D22 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D23 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = vrvHp[rvref], pcf(tid0) = D24 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pcf(tid0) = D25 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID ≠ None ∧ optval = Val(vs[ps[first].next].val) ∧ (phead0 = first → rvowns(vretRefs((ps ⊕ vs)[ps[first].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[first].next].deqID.tid, vs[ps[first].next].val)), pcf(tid0) = D26 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID ≠ None ∧ vs[ps[first].next].deqID = Some(othertid) ∧ optval = Val(vs[ps[first].next].val) ∧ (phead0 = first → rvowns(vretRefs(othertid)) = Claimed(othertid, vs[ps[first].next].val)), pcf(tid0) = D27 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID = Some(othertid) ∧ (phead0 = first → rvowns(addr) = Claimed(othertid, optval.val)), pcf(tid0) = D28 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID = Some(othertid) ∧ rvowns(addr) = Claimed(othertid, optval.val), pcf(tid0) = D29 → (first ∈ orl1 ∨ first = phead0) ∧ ps[ps[first].next].deqID ≠ None ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ rvowns(addr) = Claimed(othertid, optval.val), pcf(tid0) = D30 → (first ∈ orl1 ∨ first = phead0) ∧ ps[ps[first].next].deqID ≠ None ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ rvowns(addr) = Claimed(othertid, optval.val), pcf(tid0) = D31 → (first ∈ orl1 ∨ first = phead0) ∧ ps[ps[first].next].deqID ≠ None ∧ ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D34 → optval = vrvHp[vretRefs(tid0)] ∧ vrvHp[vretRefs(tid0)] = prvHp[pretRefs(tid0)] ∧ vretRefs(tid0) = pretRefs(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null ∧ rvowns(vretRefs(tid0)) = (vrvHp[vretRefs(tid0)] = Empty ⊃ Pending(tid0);Claimed(tid0, vrvHp[vretRefs(tid0)].val)), pcf(tid0) = E2 → owns(node) = Some(tid0), pcf(tid0) = E3 → owns(node) = Some(tid0), pcf(tid0) = E5 → owns(node) = Some(tid0), pcf(tid0) = E6 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (ps[lst].next = null → lst = vtail), pcf(tid0) = E7 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst), pcf(tid0) = E8 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst), pcf(tid0) = E9 → owns(node) = Some(tid0) ∧ nxt = null ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (vs[lst].next = null → vtail = lst), pcf(tid0) = E10 → success → vs[lst].next = node ∧ vs[lst].next ≠ null ∧ vs[vs[lst].next].val = value ∧ ( lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid0) ∨ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ ps[lst].next = vs[lst].next), pcf(tid0) = E11 → success ∧ vs[lst].next = node ∧ vs[lst].next ≠ null ∧ vs[vs[lst].next].val = value ∧ ( lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid0) ∨ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ ps[lst].next = vs[lst].next), pcf(tid0) = E12 → success ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (vs[lst].next ∈ orl1 ∨ vs[lst].next = phead0 ∨ vs[lst].next = vs[phead0].next ∨ vs[lst].next ∈ orl0) ∧ vs[lst].next = node ∧ ps[lst].next = vs[lst].next ∧ vs[lst].next ∈ ps ∧ vs[lst].next ∈ vs ∧ vs[lst].next ≠ null, pcf(tid0) = E13 → owns(node) = Some(tid0), pcf(tid0) = E14 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = vs[lst].next ∧ vs[lst].next ≠ null, pcf(tid0) = E15 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = vs[lst].next ∧ vs[lst].next = ps[lst].next ∧ vs[lst].next ≠ null, pcf(tid0) = E16 → owns(node) = Some(tid0), pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → node ∈ ps ∧ node ∈ vs ∧ node ≠ null ∧ ¬ node ∈ orl1 ∧ node ≠ phead0 ∧ node ≠ vs[phead0].next ∧ ¬ node ∈ orl0, pcf(tid0) = E4 ∨ pcf(tid0) = E10 → ¬ success → ¬ node ∈ orl1 ∧ node ≠ phead0 ∧ node ≠ vs[phead0].next ∧ ¬ node ∈ orl0 ∧ node ≠ null ∧ node ∈ ps ∧ node ∈ vs ∧ owns(node) = Some(tid0) ∧ vs[node] = mk(value, None, null) ∧ ps[node] = vs[node], pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → vs[node] = mk(value, None, null), pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → ps[node] = vs[node], pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 → ¬ success ∧ rvowns(vretRefs(tid0)) = Pending(tid0), pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 → ¬ success ∧ rvowns(vretRefs(tid0)) = Pending(tid0), pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → ¬ success, pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[nxt].val), pcf(tid0) = idle ∨ pcf(tid0) = ready ∨ pcf(tid0) = E1 ∨ pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E4 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E10 ∨ pcf(tid0) = E11 ∨ pcf(tid0) = E12 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 ∨ pcf(tid0) = E17 ∨ pcf(tid0) = D1 ∨ pcf(tid0) = D2 ∨ pcf(tid0) = D3 ∨ pcf(tid0) = D4 ∨ pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 ∨ pcf(tid0) = D34 → vs[phead0].next ≠ null → vs[vs[phead0].next].deqID ≠ Some(tid0), pcf(tid0) = crashed ∨ pcf(tid0) = idle ∨ pcf(tid0) = ready ∨ pcf(tid0) = E1 ∨ pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E4 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E10 ∨ pcf(tid0) = E11 ∨ pcf(tid0) = E12 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 ∨ pcf(tid0) = E17 ∨ pcf(tid0) = D1 ∨ pcf(tid0) = D2 ∨ pcf(tid0) = D3 ∨ pcf(tid0) = D4 ∨ pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 ∨ pcf(tid0) = D34 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, phead0, vs), pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, first, vs), pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, nxt, vs), pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → oneowns(tid0, node, owns, vs, ps), pcf(tid0) = E10 → (success ⊃ (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid0, node, owns, vs, ps);noowns(tid0, owns));oneowns(tid0, node, owns, vs, ps)), pcf(tid0) = E11 → (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid0, node, owns, vs, ps);noowns(tid0, owns)), pcf(tid0) = E4 → (success ⊃ noowns(tid0, owns);oneowns(tid0, node, owns, vs, ps)), vs[phead0].next ≠ null → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead0].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), phead ∈ orl1 ∨ phead = phead0, vtail = (vs[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (vs[phead0].next ' + orl0).butlast).last ∧ vs[(vs[phead0].next ' + orl0).last].deqID = None ∧ vs[(vs[phead0].next ' + orl0).last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 31 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[vs[phead0].next].deqID = None, vs[vs[phead0].next].deqID = Some(tid0), ps[phead0].deqID = vs[phead0].deqID, ps[phead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, lsf(tid0) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(phead0) = None, vs[phead0].next ≠ phead0, pcf(tid0) ≠ D21, pcf(tid0) ≠ D20, phead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, ps, owns), listp(vs[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ weak?(vs[phead0].deqID), ¬ vs[phead0].next ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vs[phead0].next ∈ orl0, vs[phead0].next ≠ null → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead0].next].val), pcf(tid0) = E4 → (success ⊃ noowns(tid0, owns);oneowns(tid0, node, owns, vs, ps)), pcf(tid0) = E11 → (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid0, node, owns, vs, ps);noowns(tid0, owns)), pcf(tid0) = E10 → (success ⊃ (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid0, node, owns, vs, ps);noowns(tid0, owns));oneowns(tid0, node, owns, vs, ps)), pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → oneowns(tid0, node, owns, vs, ps), pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, nxt, vs), pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, first, vs), pcf(tid0) = crashed ∨ pcf(tid0) = idle ∨ pcf(tid0) = ready ∨ pcf(tid0) = E1 ∨ pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E4 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E10 ∨ pcf(tid0) = E11 ∨ pcf(tid0) = E12 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 ∨ pcf(tid0) = E17 ∨ pcf(tid0) = D1 ∨ pcf(tid0) = D2 ∨ pcf(tid0) = D3 ∨ pcf(tid0) = D4 ∨ pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 ∨ pcf(tid0) = D34 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, phead0, vs), pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[nxt].val), pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → ¬ success, pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 → ¬ success ∧ rvowns(vretRefs(tid0)) = Pending(tid0), pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 → ¬ success ∧ rvowns(vretRefs(tid0)) = Pending(tid0), pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → ps[node] = vs[node], pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → vs[node] = mk(value, None, null), pcf(tid0) = E4 ∨ pcf(tid0) = E10 → ¬ success → ¬ node ∈ orl1 ∧ node ≠ phead0 ∧ node ≠ vs[phead0].next ∧ ¬ node ∈ orl0 ∧ node ≠ null ∧ node ∈ ps ∧ node ∈ vs ∧ owns(node) = Some(tid0) ∧ vs[node] = mk(value, None, null) ∧ ps[node] = vs[node], pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → node ∈ ps ∧ node ∈ vs ∧ node ≠ null ∧ ¬ node ∈ orl1 ∧ node ≠ phead0 ∧ node ≠ vs[phead0].next ∧ ¬ node ∈ orl0, pcf(tid0) = E16 → owns(node) = Some(tid0), pcf(tid0) = E15 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = vs[lst].next ∧ vs[lst].next = ps[lst].next ∧ vs[lst].next ≠ null, pcf(tid0) = E14 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = vs[lst].next ∧ vs[lst].next ≠ null, pcf(tid0) = E13 → owns(node) = Some(tid0), pcf(tid0) = E12 → success ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (vs[lst].next ∈ orl1 ∨ vs[lst].next = phead0 ∨ vs[lst].next = vs[phead0].next ∨ vs[lst].next ∈ orl0) ∧ vs[lst].next = node ∧ ps[lst].next = vs[lst].next ∧ vs[lst].next ∈ ps ∧ vs[lst].next ∈ vs ∧ vs[lst].next ≠ null, pcf(tid0) = E11 → success ∧ vs[lst].next = node ∧ vs[lst].next ≠ null ∧ vs[vs[lst].next].val = value ∧ ( lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid0) ∨ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ ps[lst].next = vs[lst].next), pcf(tid0) = E10 → success → vs[lst].next = node ∧ vs[lst].next ≠ null ∧ vs[vs[lst].next].val = value ∧ ( lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid0) ∨ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ ps[lst].next = vs[lst].next), pcf(tid0) = E9 → owns(node) = Some(tid0) ∧ nxt = null ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (vs[lst].next = null → vtail = lst), pcf(tid0) = E8 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst), pcf(tid0) = E7 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst), pcf(tid0) = E6 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (ps[lst].next = null → lst = vtail), pcf(tid0) = E5 → owns(node) = Some(tid0), pcf(tid0) = E3 → owns(node) = Some(tid0), pcf(tid0) = E2 → owns(node) = Some(tid0), pcf(tid0) = D34 → optval = vrvHp[vretRefs(tid0)] ∧ vrvHp[vretRefs(tid0)] = prvHp[pretRefs(tid0)] ∧ vretRefs(tid0) = pretRefs(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null ∧ rvowns(vretRefs(tid0)) = (vrvHp[vretRefs(tid0)] = Empty ⊃ Pending(tid0);Claimed(tid0, vrvHp[vretRefs(tid0)].val)), pcf(tid0) = D31 → (first ∈ orl1 ∨ first = phead0) ∧ ps[ps[first].next].deqID ≠ None ∧ ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D30 → (first ∈ orl1 ∨ first = phead0) ∧ ps[ps[first].next].deqID ≠ None ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ rvowns(addr) = Claimed(othertid, optval.val), pcf(tid0) = D29 → (first ∈ orl1 ∨ first = phead0) ∧ ps[ps[first].next].deqID ≠ None ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ rvowns(addr) = Claimed(othertid, optval.val), pcf(tid0) = D28 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID = Some(othertid) ∧ rvowns(addr) = Claimed(othertid, optval.val), pcf(tid0) = D27 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID = Some(othertid) ∧ (phead0 = first → rvowns(addr) = Claimed(othertid, optval.val)), pcf(tid0) = D26 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID ≠ None ∧ vs[ps[first].next].deqID = Some(othertid) ∧ optval = Val(vs[ps[first].next].val) ∧ (phead0 = first → rvowns(vretRefs(othertid)) = Claimed(othertid, vs[ps[first].next].val)), pcf(tid0) = D25 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID ≠ None ∧ optval = Val(vs[ps[first].next].val) ∧ (phead0 = first → rvowns(vretRefs((ps ⊕ vs)[ps[first].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[first].next].deqID.tid, vs[ps[first].next].val)), pcf(tid0) = D24 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pcf(tid0) = D23 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = vrvHp[rvref], pcf(tid0) = D22 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D19 → ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = Val(vs[ps[first].next].val), pcf(tid0) = D18 → ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D17 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = ps[lst].next ∧ ps[lst].next = vs[lst].next ∧ ps[lst].next ≠ null, pcf(tid0) = D16 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = vs[lst].next ∧ vs[lst].next ≠ null, pcf(tid0) = D15 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pcf(tid0) = D14 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ vrvHp[rvref] = Empty ∧ nxt = null, pcf(tid0) = D13 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = null, pcf(tid0) = D12 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[lst].next), pcf(tid0) = D11 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[first].next) ∧ (first ≠ lst → ps[first].next ≠ null ∧ nxt = ps[first].next), pcf(tid0) = D10 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst ∧ (nxt ≠ null → nxt = vs[first].next) ∧ (first ≠ lst → ps[first].next ≠ null ∧ nxt = ps[first].next), pcf(tid0) = D9 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst, pcf(tid0) = D8 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from first, pcf(tid0) = D6 → (success → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid0)) = (optval = Empty ∨ ¬ success ⊃ Pending(tid0);Claimed(tid0, optval.val)), pcf(tid0) = D5 → rvowns(vretRefs(tid0)) = Pending(tid0), pcf(tid0) = D4 → vretRefs(tid0) = rvref ∧ rvowns(vretRefs(tid0)) = Pending(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ∈ prvHp ∧ vretRefs(tid0) ≠ null, pcf(tid0) = D3 → rvowns(rvref) = Pending(tid0) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 → (first ∈ orl1 ∨ first = phead0) ∧ phead0 ∈ orl1 + phead0 ' from first, pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → success ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null ∧ rvowns(vretRefs(tid0)) = Claimed(tid0, vs[nxt].val) ∧ optval = Val(vs[nxt].val), pcf(tid0) = crashed ∨ pcf(tid0) = idle ∨ pcf(tid0) = ready ∨ pcf(tid0) = D1 ∨ pcf(tid0) = D2 ∨ pcf(tid0) = D3 ∨ pcf(tid0) = D4 ∨ pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 ∨ pcf(tid0) = D34 ∨ pcf(tid0) = E1 ∨ pcf(tid0) = E12 ∨ pcf(tid0) = E17 → noowns(tid0, owns), pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 → vretRefs(tid0) = rvref ∧ pretRefs(tid0) = vretRefs(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null, pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 → lst ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from first, pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 → first ≠ lst ∧ vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst, pcf(tid0) = idle ∨ pcf(tid0) = ready ∨ pcf(tid0) = E1 ∨ pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E4 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E10 ∨ pcf(tid0) = E11 ∨ pcf(tid0) = E12 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 ∨ pcf(tid0) = E17 ∨ pcf(tid0) = D1 ∨ pcf(tid0) = D2 ∨ pcf(tid0) = D3 ∨ pcf(tid0) = D4 ∨ pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 ∨ pcf(tid0) = D34 → vs[phead0].next = null, pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → phead0 ≠ first → vs[phead0].next = null, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), vtail = (vs[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (vs[phead0].next ' + orl0).butlast).last ∧ vs[(vs[phead0].next ' + orl0).last].deqID = None ∧ vs[(vs[phead0].next ' + orl0).last].next = null, phead ∈ orl1 ∨ phead = phead0 ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 100

Additional information

Used simplifier rules: listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ ¬ listp(null ' + rl0, vs, ps, owns); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 32 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = Some(tid0), ps[vs[phead0].next].deqID = None, ps[phead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, lsf(tid0) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(phead0) = None, vs[phead0].next ≠ phead0, pcf(tid0) ≠ idle, pcf(tid0) ≠ ready, pcf(tid0) ≠ E1, pcf(tid0) ≠ E2, pcf(tid0) ≠ E3, pcf(tid0) ≠ E4, pcf(tid0) ≠ E5, pcf(tid0) ≠ E6, pcf(tid0) ≠ E7, pcf(tid0) ≠ E8, pcf(tid0) ≠ E9, pcf(tid0) ≠ E10, pcf(tid0) ≠ E11, pcf(tid0) ≠ E12, pcf(tid0) ≠ E13, pcf(tid0) ≠ E14, pcf(tid0) ≠ E15, pcf(tid0) ≠ E16, pcf(tid0) ≠ E17, pcf(tid0) ≠ D1, pcf(tid0) ≠ D2, pcf(tid0) ≠ D3, pcf(tid0) ≠ D4, pcf(tid0) ≠ D5, pcf(tid0) ≠ D6, pcf(tid0) ≠ D7, pcf(tid0) ≠ D8, pcf(tid0) ≠ D9, pcf(tid0) ≠ D10, pcf(tid0) ≠ D11, pcf(tid0) ≠ D12, pcf(tid0) ≠ D13, pcf(tid0) ≠ D14, pcf(tid0) ≠ D15, pcf(tid0) ≠ D16, pcf(tid0) ≠ D17, pcf(tid0) ≠ D18, pcf(tid0) ≠ D19, pcf(tid0) ≠ D25, pcf(tid0) ≠ D26, pcf(tid0) ≠ D27, pcf(tid0) ≠ D28, pcf(tid0) ≠ D29, pcf(tid0) ≠ D30, pcf(tid0) ≠ D31, pcf(tid0) ≠ D32, pcf(tid0) ≠ D33, pcf(tid0) ≠ D34, pcf(tid0) ≠ D21, pcf(tid0) ≠ D20, phead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[phead0].next ' + orl0, vs, ps, owns), listp((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ weak?(vs[phead0].deqID), ¬ vs[phead0].next ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vs[phead0].next ∈ orl0, pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → phead0 ≠ first → vs[phead0].next = null, pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 → first ≠ lst ∧ vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst, pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 → lst ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from first, pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 → vretRefs(tid0) = rvref ∧ pretRefs(tid0) = vretRefs(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null, pcf(tid0) = crashed ∨ pcf(tid0) = idle ∨ pcf(tid0) = ready ∨ pcf(tid0) = D1 ∨ pcf(tid0) = D2 ∨ pcf(tid0) = D3 ∨ pcf(tid0) = D4 ∨ pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 ∨ pcf(tid0) = D34 ∨ pcf(tid0) = E1 ∨ pcf(tid0) = E12 ∨ pcf(tid0) = E17 → noowns(tid0, owns), pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → success ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null ∧ rvowns(vretRefs(tid0)) = Claimed(tid0, vs[nxt].val) ∧ optval = Val(vs[nxt].val), pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 → (first ∈ orl1 ∨ first = phead0) ∧ phead0 ∈ orl1 + phead0 ' from first, pcf(tid0) = D3 → rvowns(rvref) = Pending(tid0) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pcf(tid0) = D4 → vretRefs(tid0) = rvref ∧ rvowns(vretRefs(tid0)) = Pending(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ∈ prvHp ∧ vretRefs(tid0) ≠ null, pcf(tid0) = D5 → rvowns(vretRefs(tid0)) = Pending(tid0), pcf(tid0) = D6 → (success → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid0)) = (optval = Empty ∨ ¬ success ⊃ Pending(tid0);Claimed(tid0, optval.val)), pcf(tid0) = D8 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from first, pcf(tid0) = D9 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst, pcf(tid0) = D10 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst ∧ (nxt ≠ null → nxt = vs[first].next) ∧ (first ≠ lst → ps[first].next ≠ null ∧ nxt = ps[first].next), pcf(tid0) = D11 → vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[first].next) ∧ (first ≠ lst → ps[first].next ≠ null ∧ nxt = ps[first].next), pcf(tid0) = D12 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[lst].next), pcf(tid0) = D13 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = null, pcf(tid0) = D14 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ vrvHp[rvref] = Empty ∧ nxt = null, pcf(tid0) = D15 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pcf(tid0) = D16 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = vs[lst].next ∧ vs[lst].next ≠ null, pcf(tid0) = D17 → (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = ps[lst].next ∧ ps[lst].next = vs[lst].next ∧ ps[lst].next ≠ null, pcf(tid0) = D18 → ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D19 → ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = Val(vs[ps[first].next].val), pcf(tid0) = D22 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D23 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = vrvHp[rvref], pcf(tid0) = D24 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pcf(tid0) = D25 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID ≠ None ∧ optval = Val(vs[ps[first].next].val) ∧ (phead0 = first → rvowns(vretRefs((ps ⊕ vs)[ps[first].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[first].next].deqID.tid, vs[ps[first].next].val)), pcf(tid0) = D26 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID ≠ None ∧ vs[ps[first].next].deqID = Some(othertid) ∧ optval = Val(vs[ps[first].next].val) ∧ (phead0 = first → rvowns(vretRefs(othertid)) = Claimed(othertid, vs[ps[first].next].val)), pcf(tid0) = D27 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID = Some(othertid) ∧ (phead0 = first → rvowns(addr) = Claimed(othertid, optval.val)), pcf(tid0) = D28 → (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ vs[ps[first].next].deqID = Some(othertid) ∧ rvowns(addr) = Claimed(othertid, optval.val), pcf(tid0) = D29 → (first ∈ orl1 ∨ first = phead0) ∧ ps[ps[first].next].deqID ≠ None ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ rvowns(addr) = Claimed(othertid, optval.val), pcf(tid0) = D30 → (first ∈ orl1 ∨ first = phead0) ∧ ps[ps[first].next].deqID ≠ None ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ rvowns(addr) = Claimed(othertid, optval.val), pcf(tid0) = D31 → (first ∈ orl1 ∨ first = phead0) ∧ ps[ps[first].next].deqID ≠ None ∧ ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D34 → optval = vrvHp[vretRefs(tid0)] ∧ vrvHp[vretRefs(tid0)] = prvHp[pretRefs(tid0)] ∧ vretRefs(tid0) = pretRefs(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null ∧ rvowns(vretRefs(tid0)) = (vrvHp[vretRefs(tid0)] = Empty ⊃ Pending(tid0);Claimed(tid0, vrvHp[vretRefs(tid0)].val)), pcf(tid0) = E2 → owns(node) = Some(tid0), pcf(tid0) = E3 → owns(node) = Some(tid0), pcf(tid0) = E5 → owns(node) = Some(tid0), pcf(tid0) = E6 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (ps[lst].next = null → lst = vtail), pcf(tid0) = E7 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst), pcf(tid0) = E8 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (nxt ≠ null → nxt = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst), pcf(tid0) = E9 → owns(node) = Some(tid0) ∧ nxt = null ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (vs[lst].next = null → vtail = lst), pcf(tid0) = E10 → success → vs[lst].next = node ∧ vs[lst].next ≠ null ∧ vs[vs[lst].next].val = value ∧ ( lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid0) ∨ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ ps[lst].next = vs[lst].next), pcf(tid0) = E11 → success ∧ vs[lst].next = node ∧ vs[lst].next ≠ null ∧ vs[vs[lst].next].val = value ∧ ( lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid0) ∨ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ ps[lst].next = vs[lst].next), pcf(tid0) = E12 → success ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ (vs[lst].next ∈ orl1 ∨ vs[lst].next = phead0 ∨ vs[lst].next = vs[phead0].next ∨ vs[lst].next ∈ orl0) ∧ vs[lst].next = node ∧ ps[lst].next = vs[lst].next ∧ vs[lst].next ∈ ps ∧ vs[lst].next ∈ vs ∧ vs[lst].next ≠ null, pcf(tid0) = E13 → owns(node) = Some(tid0), pcf(tid0) = E14 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = vs[lst].next ∧ vs[lst].next ≠ null, pcf(tid0) = E15 → owns(node) = Some(tid0) ∧ (lst ∈ orl1 ∨ lst = phead0 ∨ lst = vs[phead0].next ∨ lst ∈ orl0) ∧ nxt = vs[lst].next ∧ vs[lst].next = ps[lst].next ∧ vs[lst].next ≠ null, pcf(tid0) = E16 → owns(node) = Some(tid0), pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → node ∈ ps ∧ node ∈ vs ∧ node ≠ null ∧ ¬ node ∈ orl1 ∧ node ≠ phead0 ∧ node ≠ vs[phead0].next ∧ ¬ node ∈ orl0, pcf(tid0) = E4 ∨ pcf(tid0) = E10 → ¬ success → ¬ node ∈ orl1 ∧ node ≠ phead0 ∧ node ≠ vs[phead0].next ∧ ¬ node ∈ orl0 ∧ node ≠ null ∧ node ∈ ps ∧ node ∈ vs ∧ owns(node) = Some(tid0) ∧ vs[node] = mk(value, None, null) ∧ ps[node] = vs[node], pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → vs[node] = mk(value, None, null), pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → ps[node] = vs[node], pcf(tid0) = D7 ∨ pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 → ¬ success ∧ rvowns(vretRefs(tid0)) = Pending(tid0), pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 → ¬ success ∧ rvowns(vretRefs(tid0)) = Pending(tid0), pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → ¬ success, pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[nxt].val), pcf(tid0) = crashed ∨ pcf(tid0) = idle ∨ pcf(tid0) = ready ∨ pcf(tid0) = E1 ∨ pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E4 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E10 ∨ pcf(tid0) = E11 ∨ pcf(tid0) = E12 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 ∨ pcf(tid0) = E17 ∨ pcf(tid0) = D1 ∨ pcf(tid0) = D2 ∨ pcf(tid0) = D3 ∨ pcf(tid0) = D4 ∨ pcf(tid0) = D5 ∨ pcf(tid0) = D6 ∨ pcf(tid0) = D7 ∨ pcf(tid0) = D16 ∨ pcf(tid0) = D17 ∨ pcf(tid0) = D25 ∨ pcf(tid0) = D26 ∨ pcf(tid0) = D27 ∨ pcf(tid0) = D28 ∨ pcf(tid0) = D29 ∨ pcf(tid0) = D30 ∨ pcf(tid0) = D31 ∨ pcf(tid0) = D32 ∨ pcf(tid0) = D33 ∨ pcf(tid0) = D34 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, phead0, vs), pcf(tid0) = D8 ∨ pcf(tid0) = D9 ∨ pcf(tid0) = D10 ∨ pcf(tid0) = D11 ∨ pcf(tid0) = D12 ∨ pcf(tid0) = D13 ∨ pcf(tid0) = D14 ∨ pcf(tid0) = D15 ∨ pcf(tid0) = D18 ∨ pcf(tid0) = D19 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, first, vs), pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, nxt, vs), pcf(tid0) = E2 ∨ pcf(tid0) = E3 ∨ pcf(tid0) = E5 ∨ pcf(tid0) = E6 ∨ pcf(tid0) = E7 ∨ pcf(tid0) = E8 ∨ pcf(tid0) = E9 ∨ pcf(tid0) = E13 ∨ pcf(tid0) = E14 ∨ pcf(tid0) = E15 ∨ pcf(tid0) = E16 → oneowns(tid0, node, owns, vs, ps), pcf(tid0) = E10 → (success ⊃ (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid0, node, owns, vs, ps);noowns(tid0, owns));oneowns(tid0, node, owns, vs, ps)), pcf(tid0) = E11 → (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid0, node, owns, vs, ps);noowns(tid0, owns)), pcf(tid0) = E4 → (success ⊃ noowns(tid0, owns);oneowns(tid0, node, owns, vs, ps)), vs[phead0].next ≠ null → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead0].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), phead ∈ orl1 ∨ phead = phead0, vtail = (vs[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (vs[phead0].next ' + orl0).butlast).last ∧ vs[(vs[phead0].next ' + orl0).last].deqID = None ∧ vs[(vs[phead0].next ' + orl0).last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 33 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[vs[phead0].next].deqID = None, vs[vs[phead0].next].deqID = Some(tid0), ps[phead0].deqID = vs[phead0].deqID, ps[phead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, lsf(tid0) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(phead0) = None, vs[phead0].next ≠ phead0, pcf(tid0) ≠ idle, pcf(tid0) ≠ ready, pcf(tid0) ≠ E1, pcf(tid0) ≠ E2, pcf(tid0) ≠ E3, pcf(tid0) ≠ E4, pcf(tid0) ≠ E5, pcf(tid0) ≠ E6, pcf(tid0) ≠ E7, pcf(tid0) ≠ E8, pcf(tid0) ≠ E9, pcf(tid0) ≠ E10, pcf(tid0) ≠ E11, pcf(tid0) ≠ E12, pcf(tid0) ≠ E13, pcf(tid0) ≠ E14, pcf(tid0) ≠ E15, pcf(tid0) ≠ E16, pcf(tid0) ≠ E17, pcf(tid0) ≠ D1, pcf(tid0) ≠ D2, pcf(tid0) ≠ D3, pcf(tid0) ≠ D4, pcf(tid0) ≠ D5, pcf(tid0) ≠ D6, pcf(tid0) ≠ D7, pcf(tid0) ≠ D8, pcf(tid0) ≠ D9, pcf(tid0) ≠ D10, pcf(tid0) ≠ D11, pcf(tid0) ≠ D12, pcf(tid0) ≠ D13, pcf(tid0) ≠ D14, pcf(tid0) ≠ D15, pcf(tid0) ≠ D16, pcf(tid0) ≠ D17, pcf(tid0) ≠ D18, pcf(tid0) ≠ D19, pcf(tid0) ≠ D25, pcf(tid0) ≠ D26, pcf(tid0) ≠ D27, pcf(tid0) ≠ D28, pcf(tid0) ≠ D29, pcf(tid0) ≠ D30, pcf(tid0) ≠ D31, pcf(tid0) ≠ D32, pcf(tid0) ≠ D33, pcf(tid0) ≠ D34, pcf(tid0) ≠ D21, pcf(tid0) ≠ D20, phead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, ps, owns), listp(vs[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ weak?(vs[phead0].deqID), ¬ vs[phead0].next ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vs[phead0].next ∈ orl0, vs[phead0].next ≠ null → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead0].next].val), pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, nxt, vs), pcf(tid0) = D24 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pcf(tid0) = D23 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = vrvHp[rvref], pcf(tid0) = D22 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → success ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null ∧ rvowns(vretRefs(tid0)) = Claimed(tid0, vs[nxt].val) ∧ optval = Val(vs[nxt].val), pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → phead0 ≠ first → vs[phead0].next = null, pcf(tid0) = crashed → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, phead0, vs), pcf(tid0) = crashed ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → noowns(tid0, owns), pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → vretRefs(tid0) = rvref ∧ pretRefs(tid0) = vretRefs(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null, pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → lst ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from first, pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → first ≠ lst ∧ vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), vtail = (vs[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (vs[phead0].next ' + orl0).butlast).last ∧ vs[(vs[phead0].next ' + orl0).last].deqID = None ∧ vs[(vs[phead0].next ' + orl0).last].next = null, phead ∈ orl1 ∨ phead = phead0 ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24

Additional information

Used formulas: pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24

Proof step 34 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = Some(tid0), ps[vs[phead0].next].deqID = None, ps[phead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, lsf(tid0) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(phead0) = None, vs[phead0].next ≠ phead0, pcf(tid0) ≠ idle, pcf(tid0) ≠ ready, pcf(tid0) ≠ E1, pcf(tid0) ≠ E2, pcf(tid0) ≠ E3, pcf(tid0) ≠ E4, pcf(tid0) ≠ E5, pcf(tid0) ≠ E6, pcf(tid0) ≠ E7, pcf(tid0) ≠ E8, pcf(tid0) ≠ E9, pcf(tid0) ≠ E10, pcf(tid0) ≠ E11, pcf(tid0) ≠ E12, pcf(tid0) ≠ E13, pcf(tid0) ≠ E14, pcf(tid0) ≠ E15, pcf(tid0) ≠ E16, pcf(tid0) ≠ E17, pcf(tid0) ≠ D1, pcf(tid0) ≠ D2, pcf(tid0) ≠ D3, pcf(tid0) ≠ D4, pcf(tid0) ≠ D5, pcf(tid0) ≠ D6, pcf(tid0) ≠ D7, pcf(tid0) ≠ D8, pcf(tid0) ≠ D9, pcf(tid0) ≠ D10, pcf(tid0) ≠ D11, pcf(tid0) ≠ D12, pcf(tid0) ≠ D13, pcf(tid0) ≠ D14, pcf(tid0) ≠ D15, pcf(tid0) ≠ D16, pcf(tid0) ≠ D17, pcf(tid0) ≠ D18, pcf(tid0) ≠ D19, pcf(tid0) ≠ D25, pcf(tid0) ≠ D26, pcf(tid0) ≠ D27, pcf(tid0) ≠ D28, pcf(tid0) ≠ D29, pcf(tid0) ≠ D30, pcf(tid0) ≠ D31, pcf(tid0) ≠ D32, pcf(tid0) ≠ D33, pcf(tid0) ≠ D34, pcf(tid0) ≠ D21, pcf(tid0) ≠ D20, phead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[phead0].next ' + orl0, vs, ps, owns), listp((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ weak?(vs[phead0].deqID), ¬ vs[phead0].next ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vs[phead0].next ∈ orl0, pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → first ≠ lst ∧ vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst, pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → lst ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from first, pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → vretRefs(tid0) = rvref ∧ pretRefs(tid0) = vretRefs(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null, pcf(tid0) = crashed ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → noowns(tid0, owns), pcf(tid0) = crashed → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, phead0, vs), pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → phead0 ≠ first → vs[phead0].next = null, pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → success ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null ∧ rvowns(vretRefs(tid0)) = Claimed(tid0, vs[nxt].val) ∧ optval = Val(vs[nxt].val), pcf(tid0) = D22 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D23 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = vrvHp[rvref], pcf(tid0) = D24 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, nxt, vs), vs[phead0].next ≠ null → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead0].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), phead ∈ orl1 ∨ phead = phead0, vtail = (vs[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (vs[phead0].next ' + orl0).butlast).last ∧ vs[(vs[phead0].next ' + orl0).last].deqID = None ∧ vs[(vs[phead0].next ' + orl0).last].next = null, pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 35 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = Some(tid0), ps[vs[phead0].next].deqID = None, ps[phead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, lsf(tid0) = mkls(tid0, value, Val(vs[nxt].val), node, nd, true, lst, nxt, vretRefs(tid0), optval0, first, othertid, addr), owns(phead0) = None, pretRefs(tid0) = vretRefs(tid0), rvowns(vretRefs(tid0)) = Claimed(tid0, vs[nxt].val), vs[phead0].next ≠ phead0, first ≠ lst, pcf(tid0) ≠ D20, pcf(tid0) ≠ D21, pcf(tid0) ≠ D34, pcf(tid0) ≠ D33, pcf(tid0) ≠ D32, pcf(tid0) ≠ D31, pcf(tid0) ≠ D30, pcf(tid0) ≠ D29, pcf(tid0) ≠ D28, pcf(tid0) ≠ D27, pcf(tid0) ≠ D26, pcf(tid0) ≠ D25, pcf(tid0) ≠ D19, pcf(tid0) ≠ D18, pcf(tid0) ≠ D17, pcf(tid0) ≠ D16, pcf(tid0) ≠ D15, pcf(tid0) ≠ D14, pcf(tid0) ≠ D13, pcf(tid0) ≠ D12, pcf(tid0) ≠ D11, pcf(tid0) ≠ D10, pcf(tid0) ≠ D9, pcf(tid0) ≠ D8, pcf(tid0) ≠ D7, pcf(tid0) ≠ D6, pcf(tid0) ≠ D5, pcf(tid0) ≠ D4, pcf(tid0) ≠ D3, pcf(tid0) ≠ D2, pcf(tid0) ≠ D1, pcf(tid0) ≠ E17, pcf(tid0) ≠ E16, pcf(tid0) ≠ E15, pcf(tid0) ≠ E14, pcf(tid0) ≠ E13, pcf(tid0) ≠ E12, pcf(tid0) ≠ E11, pcf(tid0) ≠ E10, pcf(tid0) ≠ E9, pcf(tid0) ≠ E8, pcf(tid0) ≠ E7, pcf(tid0) ≠ E6, pcf(tid0) ≠ E5, pcf(tid0) ≠ E4, pcf(tid0) ≠ E3, pcf(tid0) ≠ E2, pcf(tid0) ≠ E1, pcf(tid0) ≠ ready, pcf(tid0) ≠ idle, phead0 ≠ null, vretRefs(tid0) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[phead0].next ' + orl0, vs, ps, owns), listp((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, nxt, vs), nonullRetRefs((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst, lst ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from first, vretRefs(tid0) ∈ vrvHp, phead0 ∈ ps, phead0 ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl1 + orl0), ¬ dups(orl1), ¬ dups(orl0), ¬ weak?(vs[phead0].deqID), ¬ vs[phead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vs[phead0].next ∈ orl1, pcf(tid0) = crashed ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → noowns(tid0, owns), pcf(tid0) = crashed → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, phead0, vs), phead0 ≠ first → vs[phead0].next = null, pcf(tid0) = D22 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next, vs[phead0].next ≠ null → Claimed(tid0, vs[nxt].val) = Claimed(tid0, vs[vs[phead0].next].val), pcf(tid0) = D23 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ Val(vs[ps[first].next].val) = vrvHp[vretRefs(tid0)], pcf(tid0) = D24 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ Val(vs[ps[first].next].val) = vrvHp[vretRefs(tid0)] ∧ vrvHp[vretRefs(tid0)] = prvHp[vretRefs(tid0)], ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), phead ∈ orl1 ∨ phead = phead0, vtail = (vs[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (vs[phead0].next ' + orl0).butlast).last ∧ vs[(vs[phead0].next ' + orl0).last].deqID = None ∧ vs[(vs[phead0].next ' + orl0).last].next = null, pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next

Additional information

Used formulas: ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next

Proof step 36 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[vs[phead0].next].deqID = None, vs[vs[phead0].next].deqID = Some(tid0), ps[phead0].deqID = vs[phead0].deqID, ps[phead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, lsf(tid0) = mkls(tid0, value, Val(vs[nxt].val), node, nd, true, lst, nxt, vretRefs(tid0), optval0, first, othertid, addr), nxt = ps[first].next, owns(phead0) = None, pretRefs(tid0) = vretRefs(tid0), rvowns(vretRefs(tid0)) = Claimed(tid0, vs[nxt].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, vs[phead0].next ≠ phead0, first ≠ lst, pcf(tid0) ≠ D20, pcf(tid0) ≠ D21, pcf(tid0) ≠ D34, pcf(tid0) ≠ D33, pcf(tid0) ≠ D32, pcf(tid0) ≠ D31, pcf(tid0) ≠ D30, pcf(tid0) ≠ D29, pcf(tid0) ≠ D28, pcf(tid0) ≠ D27, pcf(tid0) ≠ D26, pcf(tid0) ≠ D25, pcf(tid0) ≠ D19, pcf(tid0) ≠ D18, pcf(tid0) ≠ D17, pcf(tid0) ≠ D16, pcf(tid0) ≠ D15, pcf(tid0) ≠ D14, pcf(tid0) ≠ D13, pcf(tid0) ≠ D12, pcf(tid0) ≠ D11, pcf(tid0) ≠ D10, pcf(tid0) ≠ D9, pcf(tid0) ≠ D8, pcf(tid0) ≠ D7, pcf(tid0) ≠ D6, pcf(tid0) ≠ D5, pcf(tid0) ≠ D4, pcf(tid0) ≠ D3, pcf(tid0) ≠ D2, pcf(tid0) ≠ D1, pcf(tid0) ≠ E17, pcf(tid0) ≠ E16, pcf(tid0) ≠ E15, pcf(tid0) ≠ E14, pcf(tid0) ≠ E13, pcf(tid0) ≠ E12, pcf(tid0) ≠ E11, pcf(tid0) ≠ E10, pcf(tid0) ≠ E9, pcf(tid0) ≠ E8, pcf(tid0) ≠ E7, pcf(tid0) ≠ E6, pcf(tid0) ≠ E5, pcf(tid0) ≠ E4, pcf(tid0) ≠ E3, pcf(tid0) ≠ E2, pcf(tid0) ≠ E1, pcf(tid0) ≠ ready, pcf(tid0) ≠ idle, phead0 ≠ null, vretRefs(tid0) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, ps, owns), listp(vs[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, nxt, vs), nonullRetRefs((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, vretRefs(tid0) ∈ vrvHp, lst ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from first, vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst, ¬ dups(orl1 + orl0), ¬ dups(orl1), ¬ dups(orl0), ¬ weak?(vs[phead0].deqID), ¬ vs[phead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vs[phead0].next ∈ orl1, pcf(tid0) = D24 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ Val(vs[ps[first].next].val) = vrvHp[vretRefs(tid0)] ∧ vrvHp[vretRefs(tid0)] = prvHp[vretRefs(tid0)], pcf(tid0) = D23 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ Val(vs[ps[first].next].val) = vrvHp[vretRefs(tid0)], vs[phead0].next ≠ null → Claimed(tid0, vs[nxt].val) = Claimed(tid0, vs[vs[phead0].next].val), pcf(tid0) = D22 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next, phead0 ≠ first → vs[phead0].next = null, pcf(tid0) = crashed → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, phead0, vs), pcf(tid0) = crashed ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → noowns(tid0, owns), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24, vtail = (vs[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (vs[phead0].next ' + orl0).butlast).last ∧ vs[(vs[phead0].next ' + orl0).last].deqID = None ∧ vs[(vs[phead0].next ' + orl0).last].next = null, phead ∈ orl1 ∨ phead = phead0, first ∈ orl1 ∨ first = phead0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 37 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = Some(tid0), ps[vs[phead0].next].deqID = None, ps[phead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, lsf(tid0) = mkls(tid0, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid0), optval0, first, othertid, addr), owns(phead0) = None, pretRefs(tid0) = vretRefs(tid0), rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, vs[phead0].next ≠ phead0, first ≠ lst, pcf(tid0) ≠ D20, pcf(tid0) ≠ D21, pcf(tid0) ≠ D34, pcf(tid0) ≠ D33, pcf(tid0) ≠ D32, pcf(tid0) ≠ D31, pcf(tid0) ≠ D30, pcf(tid0) ≠ D29, pcf(tid0) ≠ D28, pcf(tid0) ≠ D27, pcf(tid0) ≠ D26, pcf(tid0) ≠ D25, pcf(tid0) ≠ D19, pcf(tid0) ≠ D18, pcf(tid0) ≠ D17, pcf(tid0) ≠ D16, pcf(tid0) ≠ D15, pcf(tid0) ≠ D14, pcf(tid0) ≠ D13, pcf(tid0) ≠ D12, pcf(tid0) ≠ D11, pcf(tid0) ≠ D10, pcf(tid0) ≠ D9, pcf(tid0) ≠ D8, pcf(tid0) ≠ D7, pcf(tid0) ≠ D6, pcf(tid0) ≠ D5, pcf(tid0) ≠ D4, pcf(tid0) ≠ D3, pcf(tid0) ≠ D2, pcf(tid0) ≠ D1, pcf(tid0) ≠ E17, pcf(tid0) ≠ E16, pcf(tid0) ≠ E15, pcf(tid0) ≠ E14, pcf(tid0) ≠ E13, pcf(tid0) ≠ E12, pcf(tid0) ≠ E11, pcf(tid0) ≠ E10, pcf(tid0) ≠ E9, pcf(tid0) ≠ E8, pcf(tid0) ≠ E7, pcf(tid0) ≠ E6, pcf(tid0) ≠ E5, pcf(tid0) ≠ E4, pcf(tid0) ≠ E3, pcf(tid0) ≠ E2, pcf(tid0) ≠ E1, pcf(tid0) ≠ ready, pcf(tid0) ≠ idle, phead0 ≠ null, vretRefs(tid0) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[phead0].next ' + orl0, vs, ps, owns), listp((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, ps[first].next, vs), nonullRetRefs((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst, lst ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from first, vretRefs(tid0) ∈ vrvHp, phead0 ∈ ps, phead0 ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl1 + orl0), ¬ dups(orl1), ¬ dups(orl0), ¬ weak?(vs[phead0].deqID), ¬ vs[phead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vs[phead0].next ∈ orl1, pcf(tid0) = crashed ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → noowns(tid0, owns), pcf(tid0) = crashed → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, phead0, vs), phead0 ≠ first → vs[phead0].next = null, vs[phead0].next ≠ null → Claimed(tid0, vs[ps[first].next].val) = Claimed(tid0, vs[vs[phead0].next].val), pcf(tid0) = D23 → Val(vs[ps[first].next].val) = vrvHp[vretRefs(tid0)], pcf(tid0) = D24 → Val(vs[ps[first].next].val) = vrvHp[vretRefs(tid0)] ∧ vrvHp[vretRefs(tid0)] = prvHp[vretRefs(tid0)], ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), first ∈ orl1 ∨ first = phead0, phead ∈ orl1 ∨ phead = phead0, vtail = (vs[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (vs[phead0].next ' + orl0).butlast).last ∧ vs[(vs[phead0].next ' + orl0).last].deqID = None ∧ vs[(vs[phead0].next ' + orl0).last].next = null, pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 ⊦

User applied rule cut formula

And closed the goal!

Rule argument

fma: first = phead0

Additional information

Used simplifier rules: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ ¬ listp(rl + null ' + rl0, vs, ps, owns); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) Used formulas: first = phead0

Proof step 38 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[vs[phead0].next].deqID = None, vs[vs[phead0].next].deqID = Some(tid0), ps[phead0].deqID = vs[phead0].deqID, ps[phead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, lsf(tid0) = mkls(tid0, value, Val(vs[nxt].val), node, nd, true, lst, nxt, vretRefs(tid0), optval0, first, othertid, addr), owns(phead0) = None, pretRefs(tid0) = vretRefs(tid0), rvowns(vretRefs(tid0)) = Claimed(tid0, vs[nxt].val), vs[phead0].next ≠ phead0, first ≠ lst, pcf(tid0) ≠ D20, pcf(tid0) ≠ D21, pcf(tid0) ≠ D34, pcf(tid0) ≠ D33, pcf(tid0) ≠ D32, pcf(tid0) ≠ D31, pcf(tid0) ≠ D30, pcf(tid0) ≠ D29, pcf(tid0) ≠ D28, pcf(tid0) ≠ D27, pcf(tid0) ≠ D26, pcf(tid0) ≠ D25, pcf(tid0) ≠ D19, pcf(tid0) ≠ D18, pcf(tid0) ≠ D17, pcf(tid0) ≠ D16, pcf(tid0) ≠ D15, pcf(tid0) ≠ D14, pcf(tid0) ≠ D13, pcf(tid0) ≠ D12, pcf(tid0) ≠ D11, pcf(tid0) ≠ D10, pcf(tid0) ≠ D9, pcf(tid0) ≠ D8, pcf(tid0) ≠ D7, pcf(tid0) ≠ D6, pcf(tid0) ≠ D5, pcf(tid0) ≠ D4, pcf(tid0) ≠ D3, pcf(tid0) ≠ D2, pcf(tid0) ≠ D1, pcf(tid0) ≠ E17, pcf(tid0) ≠ E16, pcf(tid0) ≠ E15, pcf(tid0) ≠ E14, pcf(tid0) ≠ E13, pcf(tid0) ≠ E12, pcf(tid0) ≠ E11, pcf(tid0) ≠ E10, pcf(tid0) ≠ E9, pcf(tid0) ≠ E8, pcf(tid0) ≠ E7, pcf(tid0) ≠ E6, pcf(tid0) ≠ E5, pcf(tid0) ≠ E4, pcf(tid0) ≠ E3, pcf(tid0) ≠ E2, pcf(tid0) ≠ E1, pcf(tid0) ≠ ready, pcf(tid0) ≠ idle, phead0 ≠ null, vretRefs(tid0) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, ps, owns), listp(vs[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, nxt, vs), nonullRetRefs((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, vretRefs(tid0) ∈ vrvHp, lst ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from first, vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst, ¬ dups(orl1 + orl0), ¬ dups(orl1), ¬ dups(orl0), ¬ weak?(vs[phead0].deqID), ¬ vs[phead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vs[phead0].next ∈ orl1, pcf(tid0) = D24 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ Val(vs[ps[first].next].val) = vrvHp[vretRefs(tid0)] ∧ vrvHp[vretRefs(tid0)] = prvHp[vretRefs(tid0)], pcf(tid0) = D23 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ Val(vs[ps[first].next].val) = vrvHp[vretRefs(tid0)], vs[phead0].next ≠ null → Claimed(tid0, vs[nxt].val) = Claimed(tid0, vs[vs[phead0].next].val), pcf(tid0) = D22 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next, phead0 ≠ first → vs[phead0].next = null, pcf(tid0) = crashed → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, phead0, vs), pcf(tid0) = crashed ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → noowns(tid0, owns), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24, vtail = (vs[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (vs[phead0].next ' + orl0).butlast).last ∧ vs[(vs[phead0].next ' + orl0).last].deqID = None ∧ vs[(vs[phead0].next ' + orl0).last].next = null, phead ∈ orl1 ∨ phead = phead0 ⊦ ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 39 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = Some(tid0), ps[vs[phead0].next].deqID = None, ps[phead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, lsf(tid0) = mkls(tid0, value, Val(vs[nxt].val), node, nd, true, lst, nxt, vretRefs(tid0), optval0, first, othertid, addr), owns(phead0) = None, pretRefs(tid0) = vretRefs(tid0), rvowns(vretRefs(tid0)) = Claimed(tid0, vs[nxt].val), vs[phead0].next ≠ phead0, first ≠ lst, pcf(tid0) ≠ D20, pcf(tid0) ≠ D21, pcf(tid0) ≠ D34, pcf(tid0) ≠ D33, pcf(tid0) ≠ D32, pcf(tid0) ≠ D31, pcf(tid0) ≠ D30, pcf(tid0) ≠ D29, pcf(tid0) ≠ D28, pcf(tid0) ≠ D27, pcf(tid0) ≠ D26, pcf(tid0) ≠ D25, pcf(tid0) ≠ D19, pcf(tid0) ≠ D18, pcf(tid0) ≠ D17, pcf(tid0) ≠ D16, pcf(tid0) ≠ D15, pcf(tid0) ≠ D14, pcf(tid0) ≠ D13, pcf(tid0) ≠ D12, pcf(tid0) ≠ D11, pcf(tid0) ≠ D10, pcf(tid0) ≠ D9, pcf(tid0) ≠ D8, pcf(tid0) ≠ D7, pcf(tid0) ≠ D6, pcf(tid0) ≠ D5, pcf(tid0) ≠ D4, pcf(tid0) ≠ D3, pcf(tid0) ≠ D2, pcf(tid0) ≠ D1, pcf(tid0) ≠ E17, pcf(tid0) ≠ E16, pcf(tid0) ≠ E15, pcf(tid0) ≠ E14, pcf(tid0) ≠ E13, pcf(tid0) ≠ E12, pcf(tid0) ≠ E11, pcf(tid0) ≠ E10, pcf(tid0) ≠ E9, pcf(tid0) ≠ E8, pcf(tid0) ≠ E7, pcf(tid0) ≠ E6, pcf(tid0) ≠ E5, pcf(tid0) ≠ E4, pcf(tid0) ≠ E3, pcf(tid0) ≠ E2, pcf(tid0) ≠ E1, pcf(tid0) ≠ ready, pcf(tid0) ≠ idle, pcf(tid0) ≠ D22, phead0 ≠ null, vretRefs(tid0) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[phead0].next ' + orl0, vs, ps, owns), listp((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, nxt, vs), nonullRetRefs((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst, lst ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from first, vretRefs(tid0) ∈ vrvHp, phead0 ∈ ps, phead0 ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl1 + orl0), ¬ dups(orl1), ¬ dups(orl0), ¬ weak?(vs[phead0].deqID), ¬ vs[phead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vs[phead0].next ∈ orl1, vs[phead0].next ≠ null → Claimed(tid0, vs[nxt].val) = Claimed(tid0, vs[vs[phead0].next].val), pcf(tid0) = D23 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ Val(vs[ps[first].next].val) = vrvHp[vretRefs(tid0)], pcf(tid0) = D24 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ Val(vs[ps[first].next].val) = vrvHp[vretRefs(tid0)] ∧ vrvHp[vretRefs(tid0)] = prvHp[vretRefs(tid0)], pcf(tid0) = crashed → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, phead0, vs), phead0 ≠ first → vs[phead0].next = null, pcf(tid0) = crashed ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → noowns(tid0, owns), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), phead ∈ orl1 ∨ phead = phead0, vtail = (vs[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (vs[phead0].next ' + orl0).butlast).last ∧ vs[(vs[phead0].next ' + orl0).last].deqID = None ∧ vs[(vs[phead0].next ' + orl0).last].next = null, pcf(tid0) = D23 ∨ pcf(tid0) = D24 ⊦ ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 103

Additional information

Proof step 40 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = Some(tid0), ps[vs[phead0].next].deqID = None, ps[phead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, lsf(tid0) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(phead0) = None, vs[phead0].next ≠ phead0, pcf(tid0) ≠ D22, pcf(tid0) ≠ D23, pcf(tid0) ≠ D24, pcf(tid0) ≠ idle, pcf(tid0) ≠ ready, pcf(tid0) ≠ E1, pcf(tid0) ≠ E2, pcf(tid0) ≠ E3, pcf(tid0) ≠ E4, pcf(tid0) ≠ E5, pcf(tid0) ≠ E6, pcf(tid0) ≠ E7, pcf(tid0) ≠ E8, pcf(tid0) ≠ E9, pcf(tid0) ≠ E10, pcf(tid0) ≠ E11, pcf(tid0) ≠ E12, pcf(tid0) ≠ E13, pcf(tid0) ≠ E14, pcf(tid0) ≠ E15, pcf(tid0) ≠ E16, pcf(tid0) ≠ E17, pcf(tid0) ≠ D1, pcf(tid0) ≠ D2, pcf(tid0) ≠ D3, pcf(tid0) ≠ D4, pcf(tid0) ≠ D5, pcf(tid0) ≠ D6, pcf(tid0) ≠ D7, pcf(tid0) ≠ D8, pcf(tid0) ≠ D9, pcf(tid0) ≠ D10, pcf(tid0) ≠ D11, pcf(tid0) ≠ D12, pcf(tid0) ≠ D13, pcf(tid0) ≠ D14, pcf(tid0) ≠ D15, pcf(tid0) ≠ D16, pcf(tid0) ≠ D17, pcf(tid0) ≠ D18, pcf(tid0) ≠ D19, pcf(tid0) ≠ D25, pcf(tid0) ≠ D26, pcf(tid0) ≠ D27, pcf(tid0) ≠ D28, pcf(tid0) ≠ D29, pcf(tid0) ≠ D30, pcf(tid0) ≠ D31, pcf(tid0) ≠ D32, pcf(tid0) ≠ D33, pcf(tid0) ≠ D34, pcf(tid0) ≠ D21, pcf(tid0) ≠ D20, phead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[phead0].next ' + orl0, vs, ps, owns), listp((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ weak?(vs[phead0].deqID), ¬ vs[phead0].next ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vs[phead0].next ∈ orl0, pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → first ≠ lst ∧ vtail ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from lst, pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → lst ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from first, pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → vretRefs(tid0) = rvref ∧ pretRefs(tid0) = vretRefs(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null, pcf(tid0) = crashed ∨ pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → noowns(tid0, owns), pcf(tid0) = crashed → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, phead0, vs), pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → phead0 ≠ first → vs[phead0].next = null, pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → success ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null ∧ rvowns(vretRefs(tid0)) = Claimed(tid0, vs[nxt].val) ∧ optval = Val(vs[nxt].val), pcf(tid0) = D22 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next, pcf(tid0) = D23 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = vrvHp[rvref], pcf(tid0) = D24 → ps[ps[first].next].deqID ≠ None ∧ (first ∈ orl1 ∨ first = phead0) ∧ ps[first].next ≠ null ∧ nxt = ps[first].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pcf(tid0) = D22 ∨ pcf(tid0) = D23 ∨ pcf(tid0) = D24 → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, nxt, vs), vs[phead0].next ≠ null → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead0].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), phead ∈ orl1 ∨ phead = phead0, vtail = (vs[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (vs[phead0].next ' + orl0).butlast).last ∧ vs[(vs[phead0].next ' + orl0).last].deqID = None ∧ vs[(vs[phead0].next ' + orl0).last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 41 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[vs[phead0].next].deqID = None, vs[vs[phead0].next].deqID = Some(tid0), ps[phead0].deqID = vs[phead0].deqID, ps[phead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, lsf(tid0) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(phead0) = None, vs[phead0].next ≠ phead0, pcf(tid0) ≠ D22, pcf(tid0) ≠ D23, pcf(tid0) ≠ D24, pcf(tid0) ≠ idle, pcf(tid0) ≠ ready, pcf(tid0) ≠ E1, pcf(tid0) ≠ E2, pcf(tid0) ≠ E3, pcf(tid0) ≠ E4, pcf(tid0) ≠ E5, pcf(tid0) ≠ E6, pcf(tid0) ≠ E7, pcf(tid0) ≠ E8, pcf(tid0) ≠ E9, pcf(tid0) ≠ E10, pcf(tid0) ≠ E11, pcf(tid0) ≠ E12, pcf(tid0) ≠ E13, pcf(tid0) ≠ E14, pcf(tid0) ≠ E15, pcf(tid0) ≠ E16, pcf(tid0) ≠ E17, pcf(tid0) ≠ D1, pcf(tid0) ≠ D2, pcf(tid0) ≠ D3, pcf(tid0) ≠ D4, pcf(tid0) ≠ D5, pcf(tid0) ≠ D6, pcf(tid0) ≠ D7, pcf(tid0) ≠ D8, pcf(tid0) ≠ D9, pcf(tid0) ≠ D10, pcf(tid0) ≠ D11, pcf(tid0) ≠ D12, pcf(tid0) ≠ D13, pcf(tid0) ≠ D14, pcf(tid0) ≠ D15, pcf(tid0) ≠ D16, pcf(tid0) ≠ D17, pcf(tid0) ≠ D18, pcf(tid0) ≠ D19, pcf(tid0) ≠ D25, pcf(tid0) ≠ D26, pcf(tid0) ≠ D27, pcf(tid0) ≠ D28, pcf(tid0) ≠ D29, pcf(tid0) ≠ D30, pcf(tid0) ≠ D31, pcf(tid0) ≠ D32, pcf(tid0) ≠ D33, pcf(tid0) ≠ D34, pcf(tid0) ≠ D21, pcf(tid0) ≠ D20, phead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, ps, owns), listp(vs[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ weak?(vs[phead0].deqID), ¬ vs[phead0].next ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vs[phead0].next ∈ orl0, vs[phead0].next ≠ null → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead0].next].val), pcf(tid0) = crashed → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, phead0, vs), pcf(tid0) = crashed → noowns(tid0, owns), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), vtail = (vs[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (vs[phead0].next ' + orl0).butlast).last ∧ vs[(vs[phead0].next ' + orl0).last].deqID = None ∧ vs[(vs[phead0].next ' + orl0).last].next = null, phead ∈ orl1 ∨ phead = phead0 ⊦

User applied rule structural induction

And obtained the following new goals

Rule argument

term: pcf(tid0)

Additional information

Used simplifier rules: DMSQPC freely generated by D1, D2, D3, D4, D5, D6, D7, D8, D9, D10, D11, D12, D13, D14, D15, D16, D17, D18, D19, D20, D21, D22, D23, D24, D25, D26, D27, D28, D29, D30, D31, D32, D33, D34, E1, E2, E3, E4, E5, E6, E7, E8, E9, E10, E11, E12, E13, E14, E15, E16, E17, crashed, idle, ready ;;

Proof step 42 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = Some(tid0), ps[vs[phead0].next].deqID = None, ps[phead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, crashed = pcf(tid0), dom vrvHp = dom prvHp, lsf(tid0) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(phead0) = None, vs[phead0].next ≠ phead0, pcf(tid0) ≠ D22, pcf(tid0) ≠ D23, pcf(tid0) ≠ D24, pcf(tid0) ≠ idle, pcf(tid0) ≠ ready, pcf(tid0) ≠ E1, pcf(tid0) ≠ E2, pcf(tid0) ≠ E3, pcf(tid0) ≠ E4, pcf(tid0) ≠ E5, pcf(tid0) ≠ E6, pcf(tid0) ≠ E7, pcf(tid0) ≠ E8, pcf(tid0) ≠ E9, pcf(tid0) ≠ E10, pcf(tid0) ≠ E11, pcf(tid0) ≠ E12, pcf(tid0) ≠ E13, pcf(tid0) ≠ E14, pcf(tid0) ≠ E15, pcf(tid0) ≠ E16, pcf(tid0) ≠ E17, pcf(tid0) ≠ D1, pcf(tid0) ≠ D2, pcf(tid0) ≠ D3, pcf(tid0) ≠ D4, pcf(tid0) ≠ D5, pcf(tid0) ≠ D6, pcf(tid0) ≠ D7, pcf(tid0) ≠ D8, pcf(tid0) ≠ D9, pcf(tid0) ≠ D10, pcf(tid0) ≠ D11, pcf(tid0) ≠ D12, pcf(tid0) ≠ D13, pcf(tid0) ≠ D14, pcf(tid0) ≠ D15, pcf(tid0) ≠ D16, pcf(tid0) ≠ D17, pcf(tid0) ≠ D18, pcf(tid0) ≠ D19, pcf(tid0) ≠ D25, pcf(tid0) ≠ D26, pcf(tid0) ≠ D27, pcf(tid0) ≠ D28, pcf(tid0) ≠ D29, pcf(tid0) ≠ D30, pcf(tid0) ≠ D31, pcf(tid0) ≠ D32, pcf(tid0) ≠ D33, pcf(tid0) ≠ D34, pcf(tid0) ≠ D21, pcf(tid0) ≠ D20, phead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[phead0].next ' + orl0, vs, ps, owns), listp((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ weak?(vs[phead0].deqID), ¬ vs[phead0].next ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vs[phead0].next ∈ orl0, pcf(tid0) = crashed → noowns(tid0, owns), pcf(tid0) = crashed → noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, phead0, vs), vs[phead0].next ≠ null → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead0].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), phead ∈ orl1 ∨ phead = phead0, vtail = (vs[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (vs[phead0].next ' + orl0).butlast).last ∧ vs[(vs[phead0].next ' + orl0).last].deqID = None ∧ vs[(vs[phead0].next ' + orl0).last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D22 ≠ crashed; (s) ⊦ D23 ≠ crashed; (s) ⊦ D24 ≠ crashed; (s) ⊦ crashed ≠ idle; (s) ⊦ crashed ≠ ready; (s) ⊦ E1 ≠ crashed; (s) ⊦ E2 ≠ crashed; (s) ⊦ E3 ≠ crashed; (s) ⊦ E4 ≠ crashed; (s) ⊦ E5 ≠ crashed; (s) ⊦ E6 ≠ crashed; (s) ⊦ E7 ≠ crashed; (s) ⊦ E8 ≠ crashed; (s) ⊦ E9 ≠ crashed; (s) ⊦ E10 ≠ crashed; (s) ⊦ E11 ≠ crashed; (s) ⊦ E12 ≠ crashed; (s) ⊦ E13 ≠ crashed; (s) ⊦ E14 ≠ crashed; (s) ⊦ E15 ≠ crashed; (s) ⊦ E16 ≠ crashed; (s) ⊦ E17 ≠ crashed; (s) ⊦ D1 ≠ crashed; (s) ⊦ D2 ≠ crashed; (s) ⊦ D3 ≠ crashed; (s) ⊦ D4 ≠ crashed; (s) ⊦ D5 ≠ crashed; (s) ⊦ D6 ≠ crashed; (s) ⊦ D7 ≠ crashed; (s) ⊦ D8 ≠ crashed; (s) ⊦ D9 ≠ crashed; (s) ⊦ D10 ≠ crashed; (s) ⊦ D11 ≠ crashed; (s) ⊦ D12 ≠ crashed; (s) ⊦ D13 ≠ crashed; (s) ⊦ D14 ≠ crashed; (s) ⊦ D15 ≠ crashed; (s) ⊦ D16 ≠ crashed; (s) ⊦ D17 ≠ crashed; (s) ⊦ D18 ≠ crashed; (s) ⊦ D19 ≠ crashed; (s) ⊦ D25 ≠ crashed; (s) ⊦ D26 ≠ crashed; (s) ⊦ D27 ≠ crashed; (s) ⊦ D28 ≠ crashed; (s) ⊦ D29 ≠ crashed; (s) ⊦ D30 ≠ crashed; (s) ⊦ D31 ≠ crashed; (s) ⊦ D32 ≠ crashed; (s) ⊦ D33 ≠ crashed; (s) ⊦ D34 ≠ crashed; (s) ⊦ D21 ≠ crashed; (s) ⊦ D20 ≠ crashed; (s)

Proof step 43 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = Some(tid0), ps[vs[phead0].next].deqID = None, ps[phead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, crashed = pcf(tid0), dom vrvHp = dom prvHp, lsf(tid0) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(phead0) = None, vs[phead0].next ≠ phead0, phead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[phead0].next ' + orl0, vs, ps, owns), listp((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), noid(tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, phead0, vs), nonullRetRefs((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, vretRefs, pretRefs), noowns(tid0, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl1 + orl0), ¬ dups(orl1), ¬ dups(orl0), ¬ weak?(vs[phead0].deqID), ¬ vs[phead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vs[phead0].next ∈ orl1, vs[phead0].next ≠ null → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead0].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), phead ∈ orl1 ∨ phead = phead0, vtail = (vs[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (vs[phead0].next ' + orl0).butlast).last ∧ vs[(vs[phead0].next ' + orl0).last].deqID = None ∧ vs[(vs[phead0].next ' + orl0).last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:noid-def, seq:⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)), subst:[tid, rl, r, vs] → [tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, phead0, vs], <all paths>

Additional information

Used terms: tid0, (orl1 + phead0 ') + vs[phead0].next ' + orl0, phead0, vs

Proof step 44 from proof DMSQInv-atDoDeq (previous step) (back to tree)

⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid))

A spec-lemma

Proof step 45 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[vs[phead0].next].deqID = None, vs[vs[phead0].next].deqID = Some(tid0), ps[phead0].deqID = vs[phead0].deqID, ps[phead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, crashed = pcf(tid0), dom vrvHp = dom prvHp, lsf(tid0) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(phead0) = None, vs[phead0].next ≠ phead0, phead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, ps, owns), listp(vs[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, vretRefs, pretRefs), noowns(tid0, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl1 + orl0), ¬ dups(orl1), ¬ dups(orl0), ¬ weak?(vs[phead0].deqID), ¬ vs[phead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vs[phead0].next ∈ orl1, vs[phead0].next ≠ null → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead0].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), ∀ r0. r0 ≠ phead0 ∧ r0 ∈ (orl1 + phead0 ') + vs[phead0].next ' + orl0 from phead0 → vs[r0].deqID ≠ Some(tid0), vtail = (vs[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (vs[phead0].next ' + orl0).butlast).last ∧ vs[(vs[phead0].next ' + orl0).last].deqID = None ∧ vs[(vs[phead0].next ' + orl0).last].next = null, phead ∈ orl1 ∨ phead = phead0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)

Proof step 46 from proof DMSQInv-atDoDeq (previous step) (back to tree)

ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = Some(tid0), ps[vs[phead0].next].deqID = None, ps[phead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, crashed = pcf(tid0), dom vrvHp = dom prvHp, lsf(tid0) = mkls(tid0, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(phead0) = None, vs[phead0].next ≠ phead0, phead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[phead0].next ' + orl0, vs, ps, owns), listp((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + vs[phead0].next ' + orl0, vs, vretRefs, pretRefs), noowns(tid0, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl1 + orl0), ¬ dups(orl1), ¬ dups(orl0), ¬ weak?(vs[phead0].deqID), ¬ vs[phead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vs[phead0].next ∈ orl1, vs[phead0].next ≠ null → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead0].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv (mkgs(ps, vs, phead, phead0, vtail, vretRefs, pretRefs, vrvHp, prvHp, vs[phead0].next ' + orl0, orl1 + phead0 ', owns, rvowns), lsf(tid), pcf(tid)), ∀ r0. r0 ≠ phead0 ∧ (r0 = vs[phead0].next ∨ r0 ∈ orl0) → vs[r0].deqID ≠ Some(tid0), phead ∈ orl1 ∨ phead = phead0, vtail = (vs[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (vs[phead0].next ' + orl0).butlast).last ∧ vs[(vs[phead0].next ' + orl0).last].deqID = None ∧ vs[(vs[phead0].next ' + orl0).last].next = null ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 39 terms: vs[phead0].next abort: F discard: F computed: T

Additional information

Used terms: vs[phead0].next

Proof Tree for DMSQInv-atDoDeq (View conclusion)

The following image shows the proof tree of sequent calculus. The proved goal is at the bottom. You can click on the nodes to view additional rules. See here for details on colors in a proof tree.

the proof tree