| ⊦ ls.tid ≠ tid0 ∧ ( ( 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) ∧ ( 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)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D4, a) ∧ pcstepf(gs, ls, D4, a) = D5 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D4, a).orl) ∧ gstepf(gs, ls, D4, a).vtail ∈ gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl from gs.vtail ∧ gstepf(gs, ls, D4, a).phead ∈ gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl from gs.phead ∧ gstepf(gs, ls, D4, a).vhead ∈ gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).ps, gstepf(gs, ls, D4, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D4, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D4, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D4, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D4, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D4, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D4, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D4, a).vhead, gstepf(gs, ls, D4, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D4, a).owns) |
gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, D4, a) = D5, gs.orl ≠ [], ls.rvref ≠ null, ls.tid ≠ tid0, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), pre(gs, ls, D4, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.rvref ∈ gs.vrvHp, ls.rvref ∈ gs.prvHp, gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), 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 ⊦ (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D4, a).orl) ∧ gstepf(gs, ls, D4, a).vtail ∈ gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl from gs.vtail ∧ gstepf(gs, ls, D4, a).phead ∈ gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl from gs.phead ∧ gstepf(gs, ls, D4, a).vhead ∈ gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).ps, gstepf(gs, ls, D4, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D4, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D4, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D4, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D4, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D4, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D4, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D4, a).vhead, gstepf(gs, ls, D4, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D4, a).owns)
| gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, D4, a) = D5, gs.orl ≠ [], ls.rvref ≠ null, ls.tid ≠ tid0, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), pre(gs, ls, D4, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.rvref ∈ gs.vrvHp, ls.rvref ∈ gs.prvHp, gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), 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 ⊦ (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D4, a).orl) ∧ gstepf(gs, ls, D4, a).vtail ∈ gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl from gs.vtail ∧ gstepf(gs, ls, D4, a).phead ∈ gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl from gs.phead ∧ gstepf(gs, ls, D4, a).vhead ∈ gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).ps, gstepf(gs, ls, D4, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D4, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D4, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D4, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D4, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D4, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D4, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D4, a).vhead, gstepf(gs, ls, D4, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D4, a).owns) |
gs.rvowns(ls.rvref) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], ls.rvref ≠ null, ls.tid ≠ tid0, allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ls.rvref ∈ gs.prvHp, ls.rvref ∈ gs.vrvHp, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), 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.qrl.last].next = null ⊦ gs.vtail ∈ gs.orl + gs.qrl from gs.vtail ∧ gs.vhead ∈ gs.orl + gs.qrl from gs.vhead
Used simplifier rules: ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ ownsRely(tid, owns, owns); (s) ⊦ (gs.pretRefs:= vretRefs0).owns = gs.owns; (s) ⊦ gstepf(gs, ls, D4, τ) = gs.pretRefs:= gs.pretRefs(ls.tid; gs.vretRefs(ls.tid)); (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.pretRefs:= vretRefs0).vs = gs.vs; (s) ⊦ (gs.pretRefs:= vretRefs0).vhead = gs.vhead; (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ (gs.pretRefs:= vretRefs0).qrl = gs.qrl; (s) ⊦ (gs.pretRefs:= vretRefs0).orl = gs.orl; (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ (gs.pretRefs:= vretRefs0).prvHp = gs.prvHp; (s) ⊦ (gs.pretRefs:= vretRefs0).vrvHp = gs.vrvHp; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ (gs.pretRefs:= vretRefs0).vretRefs = gs.vretRefs; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.pretRefs:= vretRefs0).rvowns = gs.rvowns; (s) ⊦ (gs.pretRefs:= vretRefs0).pretRefs = vretRefs0; (s) ⊦ equalowns(vs, ps, owns, tid, vs, ps, owns); (s) ⊦ (gs.pretRefs:= vretRefs0).ps = gs.ps; (s) ⊦ equalrl(rl, vs, ps, vs, ps); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ∈ rl → r ∈ rl from r; (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ (gs.pretRefs:= vretRefs0).phead = gs.phead; (s) ⊦ (gs.pretRefs:= vretRefs0).vtail = gs.vtail; (s) ⊦ x = x + y ↔ y = []; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) 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 ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ pre(gs, ls, D4, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D4, a) = D5; (s)
| gs.rvowns(ls.rvref) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], ls.rvref ≠ null, ls.tid ≠ tid0, allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ls.rvref ∈ gs.prvHp, ls.rvref ∈ gs.vrvHp, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), 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.qrl.last].next = null ⊦ gs.vtail ∈ gs.orl + gs.qrl from gs.vtail ∧ gs.vhead ∈ gs.orl + gs.qrl from gs.vhead |
dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.rvref ≠ null, ls.tid ≠ tid0, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, ls.rvref ∈ vrvHp, ls.rvref ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead
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
| dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.rvref ≠ null, ls.tid ≠ tid0, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, ls.rvref ∈ vrvHp, ls.rvref ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead |
dom vrvHp = dom prvHp, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.rvref ≠ null, ls.tid ≠ tid0, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, ls.rvref ∈ prvHp, ls.rvref ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead
Used simplifier rules: 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
| dom vrvHp = dom prvHp, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.rvref ≠ null, ls.tid ≠ tid0, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, ls.rvref ∈ prvHp, ls.rvref ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead |
dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), rvowns(rvref) = Pending(tid), vretRefs(tid) = rvref, orl ≠ [], rvref ≠ null, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, rvref ∈ vrvHp, rvref ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead
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, ls, addr, tid, lst, first, rvref, othertid, success, optval
| dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), rvowns(rvref) = Pending(tid), vretRefs(tid) = rvref, orl ≠ [], rvref ≠ null, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, rvref ∈ vrvHp, rvref ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead |
dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead
| dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead |
⊦ r ∈ rl → r ∈ rl from r
dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vtail ∈ orl + qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead
dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, vtail ∈ orl + qrl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ true ∧ vhead ∈ orl + qrl from vhead
Used terms: vtail, orl + qrl
| ⊦ r ∈ rl → r ∈ rl from r |
| dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vtail ∈ orl + qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead |
dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vtail ∈ orl, ¬ vtail ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: ⊦ ¬ a ∈ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ rl → rl from r = []; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vtail ∈ orl, ¬ vtail ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), vtail = (orl + qrl).last, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vtail ∈ orl, ¬ vtail ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), vtail = (orl + qrl.butlast).last, orl ≠ [], qrl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vtail ∈ orl, ¬ vtail ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
| dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), vtail = (orl + qrl).last, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vtail ∈ orl, ¬ vtail ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl).last ∈ orl, ¬ (orl + qrl).last ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
| dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl).last ∈ orl, ¬ (orl + qrl).last ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: orl, qrl
| ⊦ y ≠ [] → (x + y).last = y.last |
| vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), vtail = (orl + qrl.butlast).last, orl ≠ [], qrl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vtail ∈ orl, ¬ vtail ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], qrl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl.butlast).last ∈ orl, ¬ (orl + qrl.butlast).last ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
| vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], qrl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl.butlast).last ∈ orl, ¬ (orl + qrl.butlast).last ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, qrl = phead0 + orl0, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], qrl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl.butlast).last ∈ orl, ¬ (orl + qrl.butlast).last ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, tail
| vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, qrl = phead0 + orl0, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], qrl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl.butlast).last ∈ orl, ¬ (orl + qrl.butlast).last ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), (orl + (phead0 ' + orl0).butlast).last ≠ phead0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used simplifier rules: 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] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ' + x ≠ []; (s)
| vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), (orl + (phead0 ' + orl0).butlast).last ≠ phead0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, orl = orl1 + vhead0 ', rvowns(vretRefs(tid)) = Pending(tid), (orl + (phead0 ' + orl0).butlast).last ≠ phead0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(orl0, vs) ∨ orl1 ≠ [] ∧ orl1.last = vhead ∧ phead ≠ vhead0 ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, vhead0, y
| ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, orl = orl1 + vhead0 ', rvowns(vretRefs(tid)) = Pending(tid), (orl + (phead0 ' + orl0).butlast).last ≠ phead0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(orl0, vs) ∨ orl1 ≠ [] ∧ orl1.last = vhead ∧ phead ≠ vhead0 ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
ps[ps[vhead0].next].deqID = None, vs[(ps[vhead0].next ' + orl0).last].deqID = None, vs[(ps[vhead0].next ' + orl0).last].next = null, dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), (vhead0 ' + (ps[vhead0].next ' + orl0).butlast).last ≠ vhead0, (vhead0 ' + (ps[vhead0].next ' + orl0).butlast).last ≠ ps[vhead0].next, ps[vhead0].next ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + vhead0 ') + ps[vhead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nextnottid(tid, vhead, vs), noid(tid, (orl1 + vhead0 ') + ps[vhead0].next ' + orl0, vhead, vs), nonullRetRefs((orl1 + vhead0 ') + ps[vhead0].next ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ (vhead0 ' + (ps[vhead0].next ' + orl0).butlast).last ∈ orl0, ¬ (vhead0 ' + (ps[vhead0].next ' + orl0).butlast).last ∈ orl1, ¬ ps[vhead0].next ∈ orl0, ¬ ps[vhead0].next ∈ orl1, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl1 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(orl0, vs) ∨ orl1 ≠ [] ∧ orl1.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl0, vs) ⊦
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)
| ps[ps[vhead0].next].deqID = None, vs[(ps[vhead0].next ' + orl0).last].deqID = None, vs[(ps[vhead0].next ' + orl0).last].next = null, dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), (vhead0 ' + (ps[vhead0].next ' + orl0).butlast).last ≠ vhead0, (vhead0 ' + (ps[vhead0].next ' + orl0).butlast).last ≠ ps[vhead0].next, ps[vhead0].next ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + vhead0 ') + ps[vhead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nextnottid(tid, vhead, vs), noid(tid, (orl1 + vhead0 ') + ps[vhead0].next ' + orl0, vhead, vs), nonullRetRefs((orl1 + vhead0 ') + ps[vhead0].next ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ (vhead0 ' + (ps[vhead0].next ' + orl0).butlast).last ∈ orl0, ¬ (vhead0 ' + (ps[vhead0].next ' + orl0).butlast).last ∈ orl1, ¬ ps[vhead0].next ∈ orl0, ¬ ps[vhead0].next ∈ orl1, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl1 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(orl0, vs) ∨ orl1 ≠ [] ∧ orl1.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
⊦ y ≠ [] → (x + y).butlast = x + y.butlast
vs[(ps[vhead0].next ' + orl0).last].deqID = None, ps[ps[vhead0].next].deqID = None, vs[(ps[vhead0].next ' + orl0).last].next = null, dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), (vhead0 ' + ps[vhead0].next ' + orl0.butlast).last ≠ vhead0, (vhead0 ' + ps[vhead0].next ' + orl0.butlast).last ≠ ps[vhead0].next, ps[vhead0].next ≠ vhead0, orl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + vhead0 ') + ps[vhead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nextnottid(tid, vhead, vs), noid(tid, (orl1 + vhead0 ') + ps[vhead0].next ' + orl0, vhead, vs), nonullRetRefs((orl1 + vhead0 ') + ps[vhead0].next ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(orl0, ps), vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ (vhead0 ' + ps[vhead0].next ' + orl0.butlast).last ∈ orl0, ¬ (vhead0 ' + ps[vhead0].next ' + orl0.butlast).last ∈ orl1, ¬ ps[vhead0].next ∈ orl0, ¬ ps[vhead0].next ∈ orl1, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(orl0, vs) ∨ orl1 ≠ [] ∧ orl1.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl0, vs), phead ∈ orl1 ∨ phead = vhead0 ⊦
Used simplifier rules: ⊦ a '.butlast = []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: ps[vhead0].next ', orl0
| ⊦ y ≠ [] → (x + y).butlast = x + y.butlast |
| vs[(ps[vhead0].next ' + orl0).last].deqID = None, ps[ps[vhead0].next].deqID = None, vs[(ps[vhead0].next ' + orl0).last].next = null, dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), (vhead0 ' + ps[vhead0].next ' + orl0.butlast).last ≠ vhead0, (vhead0 ' + ps[vhead0].next ' + orl0.butlast).last ≠ ps[vhead0].next, ps[vhead0].next ≠ vhead0, orl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + vhead0 ') + ps[vhead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nextnottid(tid, vhead, vs), noid(tid, (orl1 + vhead0 ') + ps[vhead0].next ' + orl0, vhead, vs), nonullRetRefs((orl1 + vhead0 ') + ps[vhead0].next ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(orl0, ps), vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ (vhead0 ' + ps[vhead0].next ' + orl0.butlast).last ∈ orl0, ¬ (vhead0 ' + ps[vhead0].next ' + orl0.butlast).last ∈ orl1, ¬ ps[vhead0].next ∈ orl0, ¬ ps[vhead0].next ∈ orl1, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(orl0, vs) ∨ orl1 ≠ [] ∧ orl1.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl0, vs), phead ∈ orl1 ∨ phead = vhead0 ⊦ |
ps[ps[vhead0].next].deqID = None, vs[orl0.last].deqID = None, vs[orl0.last].next = null, dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), (ps[vhead0].next ' + orl0.butlast).last ≠ vhead0, (ps[vhead0].next ' + orl0.butlast).last ≠ ps[vhead0].next, ps[vhead0].next ≠ vhead0, orl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + vhead0 ') + ps[vhead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nextnottid(tid, vhead, vs), noid(tid, (orl1 + vhead0 ') + ps[vhead0].next ' + orl0, vhead, vs), nonullRetRefs((orl1 + vhead0 ') + ps[vhead0].next ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[vhead0].next ∈ orl0, ¬ ps[vhead0].next ∈ orl1, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ (ps[vhead0].next ' + orl0.butlast).last ∈ orl0, ¬ (ps[vhead0].next ' + orl0.butlast).last ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl1 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(orl0, vs) ∨ orl1 ≠ [] ∧ orl1.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s)
| ps[ps[vhead0].next].deqID = None, vs[orl0.last].deqID = None, vs[orl0.last].next = null, dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), (ps[vhead0].next ' + orl0.butlast).last ≠ vhead0, (ps[vhead0].next ' + orl0.butlast).last ≠ ps[vhead0].next, ps[vhead0].next ≠ vhead0, orl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + vhead0 ') + ps[vhead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nextnottid(tid, vhead, vs), noid(tid, (orl1 + vhead0 ') + ps[vhead0].next ' + orl0, vhead, vs), nonullRetRefs((orl1 + vhead0 ') + ps[vhead0].next ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[vhead0].next ∈ orl0, ¬ ps[vhead0].next ∈ orl1, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ (ps[vhead0].next ' + orl0.butlast).last ∈ orl0, ¬ (ps[vhead0].next ' + orl0.butlast).last ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl1 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(orl0, vs) ∨ orl1 ≠ [] ∧ orl1.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
vs[phead0].deqID = None, ps[ps[vhead0].next].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl0 = orl + phead0 ', rvowns(vretRefs(tid)) = Pending(tid), (ps[vhead0].next ' + orl).last ≠ vhead0, (ps[vhead0].next ' + orl).last ≠ ps[vhead0].next, ps[vhead0].next ≠ vhead0, orl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + vhead0 ') + ps[vhead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nextnottid(tid, vhead, vs), noid(tid, (orl1 + vhead0 ') + ps[vhead0].next ' + orl0, vhead, vs), nonullRetRefs((orl1 + vhead0 ') + ps[vhead0].next ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(orl0, ps), vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[vhead0].next ∈ orl0, ¬ ps[vhead0].next ∈ orl1, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ (ps[vhead0].next ' + orl).last ∈ orl0, ¬ (ps[vhead0].next ' + orl).last ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(orl0, vs) ∨ orl1 ≠ [] ∧ orl1.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl0, vs), phead ∈ orl1 ∨ phead = vhead0 ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, phead0, y
| vs[phead0].deqID = None, ps[ps[vhead0].next].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl0 = orl + phead0 ', rvowns(vretRefs(tid)) = Pending(tid), (ps[vhead0].next ' + orl).last ≠ vhead0, (ps[vhead0].next ' + orl).last ≠ ps[vhead0].next, ps[vhead0].next ≠ vhead0, orl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + vhead0 ') + ps[vhead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nextnottid(tid, vhead, vs), noid(tid, (orl1 + vhead0 ') + ps[vhead0].next ' + orl0, vhead, vs), nonullRetRefs((orl1 + vhead0 ') + ps[vhead0].next ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(orl0, ps), vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[vhead0].next ∈ orl0, ¬ ps[vhead0].next ∈ orl1, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ (ps[vhead0].next ' + orl).last ∈ orl0, ¬ (ps[vhead0].next ' + orl).last ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(orl0, vs) ∨ orl1 ≠ [] ∧ orl1.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl0, vs), phead ∈ orl1 ∨ phead = vhead0 ⊦ |
ps[ps[vhead0].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), (ps[vhead0].next ' + orl).last ≠ vhead0, (ps[vhead0].next ' + orl).last ≠ ps[vhead0].next, (ps[vhead0].next ' + orl).last ≠ phead0, ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, tid ≠ tid0, vhead0 ≠ phead0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + vhead0 ') + ps[vhead0].next ' + orl + phead0 ', vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nextnottid(tid, vhead, vs), noid(tid, (orl1 + vhead0 ') + ps[vhead0].next ' + orl + phead0 ', vhead, vs), nonullRetRefs((orl1 + vhead0 ') + ps[vhead0].next ' + orl + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(orl, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, ¬ dups(orl1 + orl), ¬ dups(orl1), ¬ dups(orl), ¬ (ps[vhead0].next ' + orl).last ∈ orl1, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ ps[vhead0].next ∈ orl, ¬ ps[vhead0].next ∈ orl1, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ (ps[vhead0].next ' + orl).last ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl1 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(orl, vs) ∨ orl1 ≠ [] ∧ orl1.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl, vs) ⊦
Used simplifier rules: 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] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| ps[ps[vhead0].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), (ps[vhead0].next ' + orl).last ≠ vhead0, (ps[vhead0].next ' + orl).last ≠ ps[vhead0].next, (ps[vhead0].next ' + orl).last ≠ phead0, ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, tid ≠ tid0, vhead0 ≠ phead0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + vhead0 ') + ps[vhead0].next ' + orl + phead0 ', vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nextnottid(tid, vhead, vs), noid(tid, (orl1 + vhead0 ') + ps[vhead0].next ' + orl + phead0 ', vhead, vs), nonullRetRefs((orl1 + vhead0 ') + ps[vhead0].next ' + orl + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(orl, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, ¬ dups(orl1 + orl), ¬ dups(orl1), ¬ dups(orl), ¬ (ps[vhead0].next ' + orl).last ∈ orl1, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ ps[vhead0].next ∈ orl, ¬ ps[vhead0].next ∈ orl1, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ (ps[vhead0].next ' + orl).last ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl1 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(orl, vs) ∨ orl1 ≠ [] ∧ orl1.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl, vs) ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: ps[vhead0].next ', orl
| ⊦ y ≠ [] → (x + y).last = y.last |
| dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, vtail ∈ orl + qrl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ true ∧ vhead ∈ orl + qrl from vhead |
dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail ∈ orl ∨ vtail ∈ qrl ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail ∈ orl ∨ vtail ∈ qrl ⊦ |
⊦ r ∈ rl → r ∈ rl from r
dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl, ¬ vhead ∈ orl + qrl from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail ∈ orl ∨ vtail ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used terms: vhead, orl + qrl
| ⊦ r ∈ rl → r ∈ rl from r |
| dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl, ¬ vhead ∈ orl + qrl from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail ∈ orl ∨ vtail ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail ∈ orl ∨ vtail ∈ qrl ⊦
Used simplifier rules: ⊦ ¬ a ∈ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ rl → rl from r = []; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail ∈ orl ∨ vtail ∈ qrl ⊦ |
orl.butlast.last = vhead, dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl.butlast ≠ [], orl ≠ [], phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail ∈ orl ∨ vtail ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s)
| orl.butlast.last = vhead, dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl.butlast ≠ [], orl ≠ [], phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail ∈ orl ∨ vtail ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], orl ≠ orl.head ', phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, orl.butlast.last, vs), noid(tid, orl + qrl, orl.butlast.last, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, vs), unmarkedp(qrl, ps), phead ∈ orl, vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ orl.butlast.last ∈ orl, ¬ orl.butlast.last ∈ qrl, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail ∈ orl ∨ vtail ∈ qrl ⊦
Used simplifier rules: ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss)
| dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], orl ≠ orl.head ', phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, orl.butlast.last, vs), noid(tid, orl + qrl, orl.butlast.last, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, vs), unmarkedp(qrl, ps), phead ∈ orl, vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ orl.butlast.last ∈ orl, ¬ orl.butlast.last ∈ qrl, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail ∈ orl ∨ vtail ∈ qrl ⊦ |
dom vrvHp = dom prvHp, orl = vtail0 + qrl0, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], orl ≠ vtail0 ', phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, orl.butlast.last, vs), noid(tid, orl + qrl, orl.butlast.last, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ orl.butlast.last ∈ orl, ¬ orl.butlast.last ∈ qrl, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val), vtail ∈ orl ∨ vtail ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: orl, head, tail
| dom vrvHp = dom prvHp, orl = vtail0 + qrl0, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], orl ≠ vtail0 ', phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, orl.butlast.last, vs), noid(tid, orl + qrl, orl.butlast.last, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ orl.butlast.last ∈ orl, ¬ orl.butlast.last ∈ qrl, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val), vtail ∈ orl ∨ vtail ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), (vtail0 ' + qrl0.butlast).last ≠ vtail0, phead ≠ qrl0.last, qrl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((vtail0 ' + qrl0) + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, (vtail0 ' + qrl0.butlast).last, vs), noid(tid, (vtail0 ' + qrl0) + qrl, (vtail0 ' + qrl0.butlast).last, vs), nonullRetRefs((vtail0 ' + qrl0) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ (vtail0 ' + qrl0.butlast).last ∈ qrl0, ¬ (vtail0 ' + qrl0.butlast).last ∈ qrl, vs[(vtail0 ' + qrl0.butlast).last].next ≠ null ∧ vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID.tid, vs[vs[(vtail0 ' + qrl0.butlast).last].next].val), phead = vtail0 ∨ phead ∈ qrl0, vtail = (qrl0 + qrl).last ∨ qrl ≠ [] ∧ vtail = (qrl0 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail = vtail0 ∨ vtail ∈ qrl0 ∨ vtail ∈ qrl ⊦
Used simplifier rules: 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] ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ a ' + x ≠ []; (s)
| dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), (vtail0 ' + qrl0.butlast).last ≠ vtail0, phead ≠ qrl0.last, qrl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((vtail0 ' + qrl0) + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, (vtail0 ' + qrl0.butlast).last, vs), noid(tid, (vtail0 ' + qrl0) + qrl, (vtail0 ' + qrl0.butlast).last, vs), nonullRetRefs((vtail0 ' + qrl0) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ (vtail0 ' + qrl0.butlast).last ∈ qrl0, ¬ (vtail0 ' + qrl0.butlast).last ∈ qrl, vs[(vtail0 ' + qrl0.butlast).last].next ≠ null ∧ vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID.tid, vs[vs[(vtail0 ' + qrl0.butlast).last].next].val), phead = vtail0 ∨ phead ∈ qrl0, vtail = (qrl0 + qrl).last ∨ qrl ≠ [] ∧ vtail = (qrl0 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail = vtail0 ∨ vtail ∈ qrl0 ∨ vtail ∈ qrl ⊦ |
dom vrvHp = dom prvHp, qrl = [], rvowns(vretRefs(tid)) = Pending(tid), (vtail0 ' + qrl0.butlast).last ≠ vtail0, phead ≠ qrl0.last, qrl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((vtail0 ' + qrl0) + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, (vtail0 ' + qrl0.butlast).last, vs), noid(tid, (vtail0 ' + qrl0) + qrl, (vtail0 ' + qrl0.butlast).last, vs), nonullRetRefs((vtail0 ' + qrl0) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ (vtail0 ' + qrl0.butlast).last ∈ qrl0, ¬ (vtail0 ' + qrl0.butlast).last ∈ qrl, vs[(vtail0 ' + qrl0.butlast).last].next ≠ null ∧ vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID.tid, vs[vs[(vtail0 ' + qrl0.butlast).last].next].val), vtail = vtail0 ∨ vtail ∈ qrl0 ∨ vtail ∈ qrl, vtail = (qrl0 + qrl).last ∨ qrl ≠ [] ∧ vtail = (qrl0 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead = vtail0 ∨ phead ∈ qrl0 ⊦
dom vrvHp = dom prvHp, qrl = qrl1 + phead0 ', rvowns(vretRefs(tid)) = Pending(tid), (vtail0 ' + qrl0.butlast).last ≠ vtail0, phead ≠ qrl0.last, qrl ≠ [], qrl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((vtail0 ' + qrl0) + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, (vtail0 ' + qrl0.butlast).last, vs), noid(tid, (vtail0 ' + qrl0) + qrl, (vtail0 ' + qrl0.butlast).last, vs), nonullRetRefs((vtail0 ' + qrl0) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ (vtail0 ' + qrl0.butlast).last ∈ qrl0, ¬ (vtail0 ' + qrl0.butlast).last ∈ qrl, vs[(vtail0 ' + qrl0.butlast).last].next ≠ null ∧ vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID.tid, vs[vs[(vtail0 ' + qrl0.butlast).last].next].val), vtail = vtail0 ∨ vtail ∈ qrl0 ∨ vtail ∈ qrl, vtail = (qrl0 + qrl).last ∨ qrl ≠ [] ∧ vtail = (qrl0 + qrl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, phead = vtail0 ∨ phead ∈ qrl0 ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl, phead0, y
| dom vrvHp = dom prvHp, qrl = [], rvowns(vretRefs(tid)) = Pending(tid), (vtail0 ' + qrl0.butlast).last ≠ vtail0, phead ≠ qrl0.last, qrl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((vtail0 ' + qrl0) + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, (vtail0 ' + qrl0.butlast).last, vs), noid(tid, (vtail0 ' + qrl0) + qrl, (vtail0 ' + qrl0.butlast).last, vs), nonullRetRefs((vtail0 ' + qrl0) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ (vtail0 ' + qrl0.butlast).last ∈ qrl0, ¬ (vtail0 ' + qrl0.butlast).last ∈ qrl, vs[(vtail0 ' + qrl0.butlast).last].next ≠ null ∧ vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID.tid, vs[vs[(vtail0 ' + qrl0.butlast).last].next].val), vtail = vtail0 ∨ vtail ∈ qrl0 ∨ vtail ∈ qrl, vtail = (qrl0 + qrl).last ∨ qrl ≠ [] ∧ vtail = (qrl0 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead = vtail0 ∨ phead ∈ qrl0 ⊦ |
dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), (vtail0 ' + qrl0.butlast).last ≠ vtail0, phead ≠ qrl0.last, qrl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vtail0 ' + qrl0, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, (vtail0 ' + qrl0.butlast).last, vs), noid(tid, vtail0 ' + qrl0, (vtail0 ' + qrl0.butlast).last, vs), nonullRetRefs(vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, ¬ dups(qrl0), ¬ (vtail0 ' + qrl0.butlast).last ∈ qrl0, ¬ vtail0 ∈ qrl0, vs[(vtail0 ' + qrl0.butlast).last].next ≠ null ∧ vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID.tid, vs[vs[(vtail0 ' + qrl0.butlast).last].next].val), phead = vtail0 ∨ phead ∈ qrl0 ⊦
Used simplifier rules: ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ unmarkedp([], vs); (s)
| dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), (vtail0 ' + qrl0.butlast).last ≠ vtail0, phead ≠ qrl0.last, qrl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vtail0 ' + qrl0, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, (vtail0 ' + qrl0.butlast).last, vs), noid(tid, vtail0 ' + qrl0, (vtail0 ' + qrl0.butlast).last, vs), nonullRetRefs(vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, ¬ dups(qrl0), ¬ (vtail0 ' + qrl0.butlast).last ∈ qrl0, ¬ vtail0 ∈ qrl0, vs[(vtail0 ' + qrl0.butlast).last].next ≠ null ∧ vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID.tid, vs[vs[(vtail0 ' + qrl0.butlast).last].next].val), phead = vtail0 ∨ phead ∈ qrl0 ⊦ |
dom vrvHp = dom prvHp, qrl0 = qrl + phead0 ', rvowns(vretRefs(tid)) = Pending(tid), (vtail0 ' + qrl).last ≠ vtail0, phead ≠ phead0, qrl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vtail0 ' + qrl0, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, (vtail0 ' + qrl).last, vs), noid(tid, vtail0 ' + qrl0, (vtail0 ' + qrl).last, vs), nonullRetRefs(vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0), ¬ (vtail0 ' + qrl).last ∈ qrl0, ¬ vtail0 ∈ qrl0, vs[(vtail0 ' + qrl).last].next ≠ null ∧ vs[vs[(vtail0 ' + qrl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vtail0 ' + qrl).last].next].deqID.tid)) = Claimed(vs[vs[(vtail0 ' + qrl).last].next].deqID.tid, vs[vs[(vtail0 ' + qrl).last].next].val), phead = vtail0 ∨ phead ∈ qrl0 ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl0, phead0, y
| dom vrvHp = dom prvHp, qrl0 = qrl + phead0 ', rvowns(vretRefs(tid)) = Pending(tid), (vtail0 ' + qrl).last ≠ vtail0, phead ≠ phead0, qrl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vtail0 ' + qrl0, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, (vtail0 ' + qrl).last, vs), noid(tid, vtail0 ' + qrl0, (vtail0 ' + qrl).last, vs), nonullRetRefs(vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0), ¬ (vtail0 ' + qrl).last ∈ qrl0, ¬ vtail0 ∈ qrl0, vs[(vtail0 ' + qrl).last].next ≠ null ∧ vs[vs[(vtail0 ' + qrl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vtail0 ' + qrl).last].next].deqID.tid)) = Claimed(vs[vs[(vtail0 ' + qrl).last].next].deqID.tid, vs[vs[(vtail0 ' + qrl).last].next].val), phead = vtail0 ∨ phead ∈ qrl0 ⊦ |
dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), (vtail0 ' + qrl).last ≠ vtail0, (vtail0 ' + qrl).last ≠ phead0, phead ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vtail0 ' + qrl + phead0 ', vs, ps, owns), markedp(qrl, ps), markedp(qrl, vs), nextnottid(tid, (vtail0 ' + qrl).last, vs), noid(tid, vtail0 ' + qrl + phead0 ', (vtail0 ' + qrl).last, vs), nonullRetRefs(vtail0 ' + qrl + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), some?(ps[phead0].deqID), some?(vs[phead0].deqID), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, ¬ dups(qrl), ¬ phead0 ∈ qrl, ¬ (vtail0 ' + qrl).last ∈ qrl, ¬ vtail0 ∈ qrl, vs[(vtail0 ' + qrl).last].next ≠ null ∧ vs[vs[(vtail0 ' + qrl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vtail0 ' + qrl).last].next].deqID.tid)) = Claimed(vs[vs[(vtail0 ' + qrl).last].next].deqID.tid, vs[vs[(vtail0 ' + qrl).last].next].val), phead = vtail0 ∨ phead ∈ qrl ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), (vtail0 ' + qrl).last ≠ vtail0, (vtail0 ' + qrl).last ≠ phead0, phead ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vtail0 ' + qrl + phead0 ', vs, ps, owns), markedp(qrl, ps), markedp(qrl, vs), nextnottid(tid, (vtail0 ' + qrl).last, vs), noid(tid, vtail0 ' + qrl + phead0 ', (vtail0 ' + qrl).last, vs), nonullRetRefs(vtail0 ' + qrl + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), some?(ps[phead0].deqID), some?(vs[phead0].deqID), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, ¬ dups(qrl), ¬ phead0 ∈ qrl, ¬ (vtail0 ' + qrl).last ∈ qrl, ¬ vtail0 ∈ qrl, vs[(vtail0 ' + qrl).last].next ≠ null ∧ vs[vs[(vtail0 ' + qrl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vtail0 ' + qrl).last].next].deqID.tid)) = Claimed(vs[vs[(vtail0 ' + qrl).last].next].deqID.tid, vs[vs[(vtail0 ' + qrl).last].next].val), phead = vtail0 ∨ phead ∈ qrl ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: vtail0 ', qrl
| ⊦ y ≠ [] → (x + y).last = y.last |
| dom vrvHp = dom prvHp, qrl = qrl1 + phead0 ', rvowns(vretRefs(tid)) = Pending(tid), (vtail0 ' + qrl0.butlast).last ≠ vtail0, phead ≠ qrl0.last, qrl ≠ [], qrl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((vtail0 ' + qrl0) + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, (vtail0 ' + qrl0.butlast).last, vs), noid(tid, (vtail0 ' + qrl0) + qrl, (vtail0 ' + qrl0.butlast).last, vs), nonullRetRefs((vtail0 ' + qrl0) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ (vtail0 ' + qrl0.butlast).last ∈ qrl0, ¬ (vtail0 ' + qrl0.butlast).last ∈ qrl, vs[(vtail0 ' + qrl0.butlast).last].next ≠ null ∧ vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID.tid, vs[vs[(vtail0 ' + qrl0.butlast).last].next].val), vtail = vtail0 ∨ vtail ∈ qrl0 ∨ vtail ∈ qrl, vtail = (qrl0 + qrl).last ∨ qrl ≠ [] ∧ vtail = (qrl0 + qrl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, phead = vtail0 ∨ phead ∈ qrl0 ⊦ |
vs[phead0].deqID = None, ps[phead0].deqID = None, dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), (vtail0 ' + qrl0.butlast).last ≠ vtail0, (vtail0 ' + qrl0.butlast).last ≠ phead0, phead ≠ qrl0.last, qrl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((vtail0 ' + qrl0) + qrl1 + phead0 ', vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, (vtail0 ' + qrl0.butlast).last, vs), noid(tid, (vtail0 ' + qrl0) + qrl1 + phead0 ', (vtail0 ' + qrl0.butlast).last, vs), nonullRetRefs((vtail0 ' + qrl0) + qrl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl1, vs), unmarkedp(qrl1, ps), vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl1), ¬ dups(qrl0), ¬ dups(qrl1), ¬ phead0 ∈ qrl0, ¬ phead0 ∈ qrl1, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl1, ¬ (vtail0 ' + qrl0.butlast).last ∈ qrl0, ¬ (vtail0 ' + qrl0.butlast).last ∈ qrl1, vs[(vtail0 ' + qrl0.butlast).last].next ≠ null ∧ vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID.tid, vs[vs[(vtail0 ' + qrl0.butlast).last].next].val), phead = vtail0 ∨ phead ∈ qrl0, vtail = phead0 ∨ vtail = (qrl0 + qrl1).last ∧ vs[phead0].next = null, vtail = vtail0 ∨ vtail ∈ qrl0 ∨ vtail ∈ qrl1 ∨ vtail = phead0 ⊦
Used simplifier rules: 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] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ x + a ' ≠ []; (s) ⊦ (x + a ').last = a; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s)
| vs[phead0].deqID = None, ps[phead0].deqID = None, dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), (vtail0 ' + qrl0.butlast).last ≠ vtail0, (vtail0 ' + qrl0.butlast).last ≠ phead0, phead ≠ qrl0.last, qrl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((vtail0 ' + qrl0) + qrl1 + phead0 ', vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, (vtail0 ' + qrl0.butlast).last, vs), noid(tid, (vtail0 ' + qrl0) + qrl1 + phead0 ', (vtail0 ' + qrl0.butlast).last, vs), nonullRetRefs((vtail0 ' + qrl0) + qrl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl1, vs), unmarkedp(qrl1, ps), vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl1), ¬ dups(qrl0), ¬ dups(qrl1), ¬ phead0 ∈ qrl0, ¬ phead0 ∈ qrl1, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl1, ¬ (vtail0 ' + qrl0.butlast).last ∈ qrl0, ¬ (vtail0 ' + qrl0.butlast).last ∈ qrl1, vs[(vtail0 ' + qrl0.butlast).last].next ≠ null ∧ vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID.tid, vs[vs[(vtail0 ' + qrl0.butlast).last].next].val), phead = vtail0 ∨ phead ∈ qrl0, vtail = phead0 ∨ vtail = (qrl0 + qrl1).last ∧ vs[phead0].next = null, vtail = vtail0 ∨ vtail ∈ qrl0 ∨ vtail ∈ qrl1 ∨ vtail = phead0 ⊦ |
ps[phead0].deqID = None, vs[phead0].deqID = None, dom vrvHp = dom prvHp, qrl0 = qrl + vtail1 ', rvowns(vretRefs(tid)) = Pending(tid), (vtail0 ' + qrl).last ≠ vtail0, (vtail0 ' + qrl).last ≠ phead0, phead ≠ vtail1, qrl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((vtail0 ' + qrl0) + qrl1 + phead0 ', vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, (vtail0 ' + qrl).last, vs), noid(tid, (vtail0 ' + qrl0) + qrl1 + phead0 ', (vtail0 ' + qrl).last, vs), nonullRetRefs((vtail0 ' + qrl0) + qrl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl1, ps), unmarkedp(qrl1, vs), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, ¬ dups(qrl0 + qrl1), ¬ dups(qrl0), ¬ dups(qrl1), ¬ phead0 ∈ qrl0, ¬ phead0 ∈ qrl1, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl1, ¬ (vtail0 ' + qrl).last ∈ qrl0, ¬ (vtail0 ' + qrl).last ∈ qrl1, vs[(vtail0 ' + qrl).last].next ≠ null ∧ vs[vs[(vtail0 ' + qrl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vtail0 ' + qrl).last].next].deqID.tid)) = Claimed(vs[vs[(vtail0 ' + qrl).last].next].deqID.tid, vs[vs[(vtail0 ' + qrl).last].next].val), vtail = vtail0 ∨ vtail ∈ qrl0 ∨ vtail ∈ qrl1 ∨ vtail = phead0, vtail = phead0 ∨ vtail = (qrl0 + qrl1).last ∧ vs[phead0].next = null, phead = vtail0 ∨ phead ∈ qrl0 ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl0, vtail1, y
| ps[phead0].deqID = None, vs[phead0].deqID = None, dom vrvHp = dom prvHp, qrl0 = qrl + vtail1 ', rvowns(vretRefs(tid)) = Pending(tid), (vtail0 ' + qrl).last ≠ vtail0, (vtail0 ' + qrl).last ≠ phead0, phead ≠ vtail1, qrl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((vtail0 ' + qrl0) + qrl1 + phead0 ', vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, (vtail0 ' + qrl).last, vs), noid(tid, (vtail0 ' + qrl0) + qrl1 + phead0 ', (vtail0 ' + qrl).last, vs), nonullRetRefs((vtail0 ' + qrl0) + qrl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl1, ps), unmarkedp(qrl1, vs), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, ¬ dups(qrl0 + qrl1), ¬ dups(qrl0), ¬ dups(qrl1), ¬ phead0 ∈ qrl0, ¬ phead0 ∈ qrl1, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl1, ¬ (vtail0 ' + qrl).last ∈ qrl0, ¬ (vtail0 ' + qrl).last ∈ qrl1, vs[(vtail0 ' + qrl).last].next ≠ null ∧ vs[vs[(vtail0 ' + qrl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vtail0 ' + qrl).last].next].deqID.tid)) = Claimed(vs[vs[(vtail0 ' + qrl).last].next].deqID.tid, vs[vs[(vtail0 ' + qrl).last].next].val), vtail = vtail0 ∨ vtail ∈ qrl0 ∨ vtail ∈ qrl1 ∨ vtail = phead0, vtail = phead0 ∨ vtail = (qrl0 + qrl1).last ∧ vs[phead0].next = null, phead = vtail0 ∨ phead ∈ qrl0 ⊦ |
vs[phead0].deqID = None, ps[phead0].deqID = None, dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), (vtail0 ' + qrl).last ≠ vtail0, (vtail0 ' + qrl).last ≠ phead0, (vtail0 ' + qrl).last ≠ vtail1, phead ≠ vtail1, phead0 ≠ vtail1, tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, vtail0 ≠ vtail1, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((vtail0 ' + qrl + vtail1 ') + qrl1 + phead0 ', vs, ps, owns), markedp(qrl, vs), markedp(qrl, ps), nextnottid(tid, (vtail0 ' + qrl).last, vs), noid(tid, (vtail0 ' + qrl + vtail1 ') + qrl1 + phead0 ', (vtail0 ' + qrl).last, vs), nonullRetRefs((vtail0 ' + qrl + vtail1 ') + qrl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), some?(vs[vtail1].deqID), some?(ps[vtail1].deqID), unmarkedp(qrl1, vs), unmarkedp(qrl1, ps), vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(qrl + qrl1), ¬ dups(qrl), ¬ dups(qrl1), ¬ (vtail0 ' + qrl).last ∈ qrl1, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ qrl1, ¬ phead0 ∈ qrl, ¬ phead0 ∈ qrl1, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl1, ¬ (vtail0 ' + qrl).last ∈ qrl, vs[(vtail0 ' + qrl).last].next ≠ null ∧ vs[vs[(vtail0 ' + qrl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vtail0 ' + qrl).last].next].deqID.tid)) = Claimed(vs[vs[(vtail0 ' + qrl).last].next].deqID.tid, vs[vs[(vtail0 ' + qrl).last].next].val), phead = vtail0 ∨ phead ∈ qrl, vtail = phead0 ∨ vtail = (vtail1 ' + qrl1).last ∧ vs[phead0].next = null, vtail = vtail0 ∨ vtail ∈ qrl ∨ vtail = vtail1 ∨ vtail ∈ qrl1 ∨ vtail = phead0 ⊦
Used simplifier rules: 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] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (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)
| vs[phead0].deqID = None, ps[phead0].deqID = None, dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), (vtail0 ' + qrl).last ≠ vtail0, (vtail0 ' + qrl).last ≠ phead0, (vtail0 ' + qrl).last ≠ vtail1, phead ≠ vtail1, phead0 ≠ vtail1, tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, vtail0 ≠ vtail1, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((vtail0 ' + qrl + vtail1 ') + qrl1 + phead0 ', vs, ps, owns), markedp(qrl, vs), markedp(qrl, ps), nextnottid(tid, (vtail0 ' + qrl).last, vs), noid(tid, (vtail0 ' + qrl + vtail1 ') + qrl1 + phead0 ', (vtail0 ' + qrl).last, vs), nonullRetRefs((vtail0 ' + qrl + vtail1 ') + qrl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), some?(vs[vtail1].deqID), some?(ps[vtail1].deqID), unmarkedp(qrl1, vs), unmarkedp(qrl1, ps), vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(qrl + qrl1), ¬ dups(qrl), ¬ dups(qrl1), ¬ (vtail0 ' + qrl).last ∈ qrl1, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ qrl1, ¬ phead0 ∈ qrl, ¬ phead0 ∈ qrl1, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl1, ¬ (vtail0 ' + qrl).last ∈ qrl, vs[(vtail0 ' + qrl).last].next ≠ null ∧ vs[vs[(vtail0 ' + qrl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vtail0 ' + qrl).last].next].deqID.tid)) = Claimed(vs[vs[(vtail0 ' + qrl).last].next].deqID.tid, vs[vs[(vtail0 ' + qrl).last].next].val), phead = vtail0 ∨ phead ∈ qrl, vtail = phead0 ∨ vtail = (vtail1 ' + qrl1).last ∧ vs[phead0].next = null, vtail = vtail0 ∨ vtail ∈ qrl ∨ vtail = vtail1 ∨ vtail ∈ qrl1 ∨ vtail = phead0 ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: vtail0 ', qrl
| ⊦ y ≠ [] → (x + y).last = y.last |
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.