| ⊦ ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ 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)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ 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, D16, a) ∧ pcstepf(gs, ls, D16, a) = D17 → ( lstepf(gs, ls, D16, a).lst ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl ∧ lstepf(gs, ls, D16, a).nxt = gstepf(gs, ls, D16, a).ps[lstepf(gs, ls, D16, a).lst].next ∧ lstepf(gs, ls, D16, a).nxt = gstepf(gs, ls, D16, a).vs[lstepf(gs, ls, D16, a).lst].next ∧ lstepf(gs, ls, D16, a).nxt ≠ null) ∧ ( listp (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).ps, gstepf(gs, ls, D16, a).owns) ∧ ¬ dups(gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl) ∧ markedp(gstepf(gs, ls, D16, a).orl, gstepf(gs, ls, D16, a).ps) ∧ markedp(gstepf(gs, ls, D16, a).orl, gstepf(gs, ls, D16, a).vs) ∧ unmarkedp(gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).ps) ∧ gstepf(gs, ls, D16, a).orl ≠ [] ∧ gstepf(gs, ls, D16, a).phead ∈ gstepf(gs, ls, D16, a).orl ∧ rvownerok(gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).vrvHp, gstepf(gs, ls, D16, a).rvowns) ∧ allocrv(gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D16, a).pretRefs, gstepf(gs, ls, D16, a).prvHp, gstepf(gs, ls, D16, a).rvowns) ∧ allocrv(gstepf(gs, ls, D16, a).pretRefs, gstepf(gs, ls, D16, a).prvHp) ∧ dom gstepf(gs, ls, D16, a).vrvHp = dom gstepf(gs, ls, D16, a).prvHp ∧ ( gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next ≠ null ∧ gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D16, a).rvowns (gstepf(gs, ls, D16, a).vretRefs(gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].deqID.tid, gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D16, a).orl.last = gstepf(gs, ls, D16, a).vhead ∧ (gstepf(gs, ls, D16, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D16, a).qrl.tail, gstepf(gs, ls, D16, a).vs)) ∨ gstepf(gs, ls, D16, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D16, a).orl.butlast.last = gstepf(gs, ls, D16, a).vhead ∧ gstepf(gs, ls, D16, a).phead ≠ gstepf(gs, ls, D16, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs)) ∧ ( gstepf(gs, ls, D16, a).vtail = (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl).last ∨ gstepf(gs, ls, D16, a).qrl ≠ [] ∧ gstepf(gs, ls, D16, a).vtail = (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl.butlast).last ∧ gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D16, a).vs[(gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D16, a).success ∧ gstepf(gs, ls, D16, a).rvowns(gstepf(gs, ls, D16, a).vretRefs(lstepf(gs, ls, D16, a).tid)) = Pending(lstepf(gs, ls, D16, a).tid)) ∧ ( gstepf(gs, ls, D16, a).vretRefs(lstepf(gs, ls, D16, a).tid) = lstepf(gs, ls, D16, a).rvref ∧ gstepf(gs, ls, D16, a).pretRefs(lstepf(gs, ls, D16, a).tid) = lstepf(gs, ls, D16, a).rvref ∧ lstepf(gs, ls, D16, a).rvref ∈ gstepf(gs, ls, D16, a).vrvHp ∧ lstepf(gs, ls, D16, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D16, a).tid, gstepf(gs, ls, D16, a).vhead, gstepf(gs, ls, D16, a).vs) ∧ noid (lstepf(gs, ls, D16, a).tid, gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vhead, gstepf(gs, ls, D16, a).vs) ∧ noowns(lstepf(gs, ls, D16, a).tid, gstepf(gs, ls, D16, a).owns) |
ls.nxt = gs.vs[ls.lst].next, gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, D16, a) = D17, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, 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, D16, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.lst ∈ gs.orl + gs.qrl, gs.phead ∈ gs.orl, ls.rvref ∈ gs.vrvHp, ¬ ls.success, ¬ 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 ⊦ ( lstepf(gs, ls, D16, a).lst ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl ∧ lstepf(gs, ls, D16, a).nxt = gstepf(gs, ls, D16, a).ps[lstepf(gs, ls, D16, a).lst].next ∧ lstepf(gs, ls, D16, a).nxt = gstepf(gs, ls, D16, a).vs[lstepf(gs, ls, D16, a).lst].next ∧ lstepf(gs, ls, D16, a).nxt ≠ null) ∧ ( listp (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).ps, gstepf(gs, ls, D16, a).owns) ∧ ¬ dups(gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl) ∧ markedp(gstepf(gs, ls, D16, a).orl, gstepf(gs, ls, D16, a).ps) ∧ markedp(gstepf(gs, ls, D16, a).orl, gstepf(gs, ls, D16, a).vs) ∧ unmarkedp(gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).ps) ∧ gstepf(gs, ls, D16, a).orl ≠ [] ∧ gstepf(gs, ls, D16, a).phead ∈ gstepf(gs, ls, D16, a).orl ∧ rvownerok(gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).vrvHp, gstepf(gs, ls, D16, a).rvowns) ∧ allocrv(gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D16, a).pretRefs, gstepf(gs, ls, D16, a).prvHp, gstepf(gs, ls, D16, a).rvowns) ∧ allocrv(gstepf(gs, ls, D16, a).pretRefs, gstepf(gs, ls, D16, a).prvHp) ∧ dom gstepf(gs, ls, D16, a).vrvHp = dom gstepf(gs, ls, D16, a).prvHp ∧ ( gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next ≠ null ∧ gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D16, a).rvowns (gstepf(gs, ls, D16, a).vretRefs(gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].deqID.tid, gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D16, a).orl.last = gstepf(gs, ls, D16, a).vhead ∧ (gstepf(gs, ls, D16, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D16, a).qrl.tail, gstepf(gs, ls, D16, a).vs)) ∨ gstepf(gs, ls, D16, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D16, a).orl.butlast.last = gstepf(gs, ls, D16, a).vhead ∧ gstepf(gs, ls, D16, a).phead ≠ gstepf(gs, ls, D16, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs)) ∧ ( gstepf(gs, ls, D16, a).vtail = (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl).last ∨ gstepf(gs, ls, D16, a).qrl ≠ [] ∧ gstepf(gs, ls, D16, a).vtail = (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl.butlast).last ∧ gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D16, a).vs[(gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D16, a).success ∧ gstepf(gs, ls, D16, a).rvowns(gstepf(gs, ls, D16, a).vretRefs(lstepf(gs, ls, D16, a).tid)) = Pending(lstepf(gs, ls, D16, a).tid)) ∧ ( gstepf(gs, ls, D16, a).vretRefs(lstepf(gs, ls, D16, a).tid) = lstepf(gs, ls, D16, a).rvref ∧ gstepf(gs, ls, D16, a).pretRefs(lstepf(gs, ls, D16, a).tid) = lstepf(gs, ls, D16, a).rvref ∧ lstepf(gs, ls, D16, a).rvref ∈ gstepf(gs, ls, D16, a).vrvHp ∧ lstepf(gs, ls, D16, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D16, a).tid, gstepf(gs, ls, D16, a).vhead, gstepf(gs, ls, D16, a).vs) ∧ noid(lstepf(gs, ls, D16, a).tid, gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vhead, gstepf(gs, ls, D16, a).vs) ∧ noowns(lstepf(gs, ls, D16, a).tid, gstepf(gs, ls, D16, a).owns)
| ls.nxt = gs.vs[ls.lst].next, gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, D16, a) = D17, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, 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, D16, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.lst ∈ gs.orl + gs.qrl, gs.phead ∈ gs.orl, ls.rvref ∈ gs.vrvHp, ¬ ls.success, ¬ 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 ⊦ ( lstepf(gs, ls, D16, a).lst ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl ∧ lstepf(gs, ls, D16, a).nxt = gstepf(gs, ls, D16, a).ps[lstepf(gs, ls, D16, a).lst].next ∧ lstepf(gs, ls, D16, a).nxt = gstepf(gs, ls, D16, a).vs[lstepf(gs, ls, D16, a).lst].next ∧ lstepf(gs, ls, D16, a).nxt ≠ null) ∧ ( listp (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).ps, gstepf(gs, ls, D16, a).owns) ∧ ¬ dups(gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl) ∧ markedp(gstepf(gs, ls, D16, a).orl, gstepf(gs, ls, D16, a).ps) ∧ markedp(gstepf(gs, ls, D16, a).orl, gstepf(gs, ls, D16, a).vs) ∧ unmarkedp(gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).ps) ∧ gstepf(gs, ls, D16, a).orl ≠ [] ∧ gstepf(gs, ls, D16, a).phead ∈ gstepf(gs, ls, D16, a).orl ∧ rvownerok(gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).vrvHp, gstepf(gs, ls, D16, a).rvowns) ∧ allocrv(gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D16, a).pretRefs, gstepf(gs, ls, D16, a).prvHp, gstepf(gs, ls, D16, a).rvowns) ∧ allocrv(gstepf(gs, ls, D16, a).pretRefs, gstepf(gs, ls, D16, a).prvHp) ∧ dom gstepf(gs, ls, D16, a).vrvHp = dom gstepf(gs, ls, D16, a).prvHp ∧ ( gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next ≠ null ∧ gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D16, a).rvowns (gstepf(gs, ls, D16, a).vretRefs(gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].deqID.tid, gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D16, a).orl.last = gstepf(gs, ls, D16, a).vhead ∧ (gstepf(gs, ls, D16, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D16, a).qrl.tail, gstepf(gs, ls, D16, a).vs)) ∨ gstepf(gs, ls, D16, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D16, a).orl.butlast.last = gstepf(gs, ls, D16, a).vhead ∧ gstepf(gs, ls, D16, a).phead ≠ gstepf(gs, ls, D16, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs)) ∧ ( gstepf(gs, ls, D16, a).vtail = (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl).last ∨ gstepf(gs, ls, D16, a).qrl ≠ [] ∧ gstepf(gs, ls, D16, a).vtail = (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl.butlast).last ∧ gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D16, a).vs[(gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D16, a).success ∧ gstepf(gs, ls, D16, a).rvowns(gstepf(gs, ls, D16, a).vretRefs(lstepf(gs, ls, D16, a).tid)) = Pending(lstepf(gs, ls, D16, a).tid)) ∧ ( gstepf(gs, ls, D16, a).vretRefs(lstepf(gs, ls, D16, a).tid) = lstepf(gs, ls, D16, a).rvref ∧ gstepf(gs, ls, D16, a).pretRefs(lstepf(gs, ls, D16, a).tid) = lstepf(gs, ls, D16, a).rvref ∧ lstepf(gs, ls, D16, a).rvref ∈ gstepf(gs, ls, D16, a).vrvHp ∧ lstepf(gs, ls, D16, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D16, a).tid, gstepf(gs, ls, D16, a).vhead, gstepf(gs, ls, D16, a).vs) ∧ noid(lstepf(gs, ls, D16, a).tid, gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vhead, gstepf(gs, ls, D16, a).vs) ∧ noowns(lstepf(gs, ls, D16, a).tid, gstepf(gs, ls, D16, a).owns) |
ls.nxt = gs.vs[ls.lst].next, gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(ls.rvref) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, 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), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.ps, gs.phead ∈ gs.vs, gs.phead ∈ gs.orl, ls.rvref ∈ gs.vrvHp, ¬ ls.success, ¬ dups(gs.qrl), ¬ dups(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.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, ls.lst ∈ gs.orl ∨ ls.lst ∈ gs.qrl, 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) ⊦ (ls.lst ∈ gs.orl ∨ ls.lst ∈ (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl)) ∧ listp (gs.orl + (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl), gs.vs, gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.nxt], (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.owns(ls.nxt; None);gs.owns)) ∧ ¬ dups(gs.orl + (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl)) ∧ markedp(gs.orl, gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.nxt]) ∧ unmarkedp((ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl), gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.nxt]) ∧ nonullRetRefs(gs.orl + (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl), gs.vs, gs.vretRefs, gs.pretRefs) ∧ ( gs.orl.last = gs.vhead ∧ ( (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl) ≠ [] → unmarkedp((ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl).tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp((ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl), gs.vs)) ∧ ( gs.vtail = (gs.orl + (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl)).last ∨ (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl) ≠ [] ∧ gs.vtail = (gs.orl + (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl).butlast).last ∧ gs.vs[(ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl).last].deqID = None ∧ gs.vs[(ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl).last].next = null) ∧ noid(ls.tid, gs.orl + (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl), gs.vhead, gs.vs) ∧ noowns(ls.tid, (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.owns(ls.nxt; None);gs.owns))
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 ⊦ (gs.owns:= owns).owns = owns; (s) ⊦ x + a = x + a '; (s) ⊦ gstepf(gs, ls, D16, a) = ( ( gs .ps:= gs.ps [ls.lst, gs.ps[ls.lst].next:= gs.vs[ls.lst].next ]) .qrl:= (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt;gs.qrl)) .owns:= (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.owns(ls.nxt; None);gs.owns); (s) ⊦ lstepf(gs, ls, D16, a) = ls; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.owns:= owns).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.owns:= owns).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ (gs.owns:= owns).qrl = gs.qrl; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.owns:= owns).orl = gs.orl; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.owns:= owns).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.owns:= owns).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.owns:= owns).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.owns:= owns).rvowns = gs.rvowns; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.owns:= owns).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.owns:= owns).phead = gs.phead; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.owns:= owns).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.owns:= owns).ps = gs.ps; (s) ⊦ (nd.next:= nxt).next = nxt; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ pre(gs, ls, D16, a) ↔ a = (ls.lst = (gs.orl + gs.qrl).last ⊃ doEnq(gs.owns(ls.nxt).tid);τ); (s) ⊦ pcstepf(gs, ls, D16, a) = D17; (s)
| ls.nxt = gs.vs[ls.lst].next, gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(ls.rvref) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, 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), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.ps, gs.phead ∈ gs.vs, gs.phead ∈ gs.orl, ls.rvref ∈ gs.vrvHp, ¬ ls.success, ¬ dups(gs.qrl), ¬ dups(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.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, ls.lst ∈ gs.orl ∨ ls.lst ∈ gs.qrl, 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) ⊦ (ls.lst ∈ gs.orl ∨ ls.lst ∈ (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl)) ∧ listp (gs.orl + (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl), gs.vs, gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.nxt], (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.owns(ls.nxt; None);gs.owns)) ∧ ¬ dups(gs.orl + (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl)) ∧ markedp(gs.orl, gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.nxt]) ∧ unmarkedp((ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl), gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.nxt]) ∧ nonullRetRefs(gs.orl + (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl), gs.vs, gs.vretRefs, gs.pretRefs) ∧ ( gs.orl.last = gs.vhead ∧ ( (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl) ≠ [] → unmarkedp((ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl).tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp((ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl), gs.vs)) ∧ ( gs.vtail = (gs.orl + (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl)).last ∨ (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl) ≠ [] ∧ gs.vtail = (gs.orl + (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl).butlast).last ∧ gs.vs[(ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl).last].deqID = None ∧ gs.vs[(ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl).last].next = null) ∧ noid(ls.tid, gs.orl + (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl), gs.vhead, gs.vs) ∧ noowns(ls.tid, (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.owns(ls.nxt; None);gs.owns)) |
ls.nxt = vs[ls.lst].next, dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.nxt ≠ null, ls.rvref ≠ null, 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), ls.rvref ∈ vrvHp, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(qrl), ¬ dups(orl), ¬ dups(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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), ls.lst ∈ orl ∨ ls.lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (ls.lst ∈ orl ∨ ls.lst ∈ (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl)) ∧ listp (orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vs, ps[ls.lst, ps[ls.lst].next:= ls.nxt], (ls.lst = (orl + qrl).last ⊃ owns(ls.nxt; None);owns)) ∧ ¬ dups(orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl)) ∧ markedp(orl, ps[ls.lst, ps[ls.lst].next:= ls.nxt]) ∧ unmarkedp((ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), ps[ls.lst, ps[ls.lst].next:= ls.nxt]) ∧ nonullRetRefs(orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ ((ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl) ≠ [] → unmarkedp((ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl).tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vs)) ∧ ( vtail = (orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl)).last ∨ (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl) ≠ [] ∧ vtail = (orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl).butlast).last ∧ vs[(ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl).last].deqID = None ∧ vs[(ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl).last].next = null) ∧ noid(ls.tid, orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vhead, vs) ∧ noowns(ls.tid, (ls.lst = (orl + qrl).last ⊃ owns(ls.nxt; None);owns))
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
| ls.nxt = vs[ls.lst].next, dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.nxt ≠ null, ls.rvref ≠ null, 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), ls.rvref ∈ vrvHp, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(qrl), ¬ dups(orl), ¬ dups(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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), ls.lst ∈ orl ∨ ls.lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (ls.lst ∈ orl ∨ ls.lst ∈ (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl)) ∧ listp (orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vs, ps[ls.lst, ps[ls.lst].next:= ls.nxt], (ls.lst = (orl + qrl).last ⊃ owns(ls.nxt; None);owns)) ∧ ¬ dups(orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl)) ∧ markedp(orl, ps[ls.lst, ps[ls.lst].next:= ls.nxt]) ∧ unmarkedp((ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), ps[ls.lst, ps[ls.lst].next:= ls.nxt]) ∧ nonullRetRefs(orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ ((ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl) ≠ [] → unmarkedp((ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl).tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vs)) ∧ ( vtail = (orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl)).last ∨ (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl) ≠ [] ∧ vtail = (orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl).butlast).last ∧ vs[(ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl).last].deqID = None ∧ vs[(ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl).last].next = null) ∧ noid(ls.tid, orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vhead, vs) ∧ noowns(ls.tid, (ls.lst = (orl + qrl).last ⊃ owns(ls.nxt; None);owns)) |
ls.nxt = vs[ls.lst].next, dom vrvHp = dom prvHp, pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.nxt ≠ null, ls.rvref ≠ null, 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 ∈ orl, ls.rvref ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ 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, ls.lst ∈ orl ∨ ls.lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (ls.lst ∈ orl ∨ ls.lst ∈ (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl)) ∧ listp (orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vs, ps[ls.lst, ps[ls.lst].next:= ls.nxt], (ls.lst = (orl + qrl).last ⊃ owns(ls.nxt; None);owns)) ∧ ¬ dups(orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl)) ∧ markedp(orl, ps[ls.lst, ps[ls.lst].next:= ls.nxt]) ∧ unmarkedp((ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), ps[ls.lst, ps[ls.lst].next:= ls.nxt]) ∧ nonullRetRefs(orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ ((ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl) ≠ [] → unmarkedp((ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl).tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vs)) ∧ ( vtail = (orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl)).last ∨ (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl) ≠ [] ∧ vtail = (orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl).butlast).last ∧ vs[(ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl).last].deqID = None ∧ vs[(ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl).last].next = null) ∧ noid(ls.tid, orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vhead, vs) ∧ noowns(ls.tid, (ls.lst = (orl + qrl).last ⊃ owns(ls.nxt; None);owns))
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
| ls.nxt = vs[ls.lst].next, dom vrvHp = dom prvHp, pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.nxt ≠ null, ls.rvref ≠ null, 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 ∈ orl, ls.rvref ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ 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, ls.lst ∈ orl ∨ ls.lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (ls.lst ∈ orl ∨ ls.lst ∈ (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl)) ∧ listp (orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vs, ps[ls.lst, ps[ls.lst].next:= ls.nxt], (ls.lst = (orl + qrl).last ⊃ owns(ls.nxt; None);owns)) ∧ ¬ dups(orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl)) ∧ markedp(orl, ps[ls.lst, ps[ls.lst].next:= ls.nxt]) ∧ unmarkedp((ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), ps[ls.lst, ps[ls.lst].next:= ls.nxt]) ∧ nonullRetRefs(orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ ((ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl) ≠ [] → unmarkedp((ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl).tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vs)) ∧ ( vtail = (orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl)).last ∨ (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl) ≠ [] ∧ vtail = (orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl).butlast).last ∧ vs[(ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl).last].deqID = None ∧ vs[(ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl).last].next = null) ∧ noid(ls.tid, orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vhead, vs) ∧ noowns(ls.tid, (ls.lst = (orl + qrl).last ⊃ owns(ls.nxt; None);owns)) |
dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), nxt = vs[lst].next, pretRefs(tid) = rvref, rvowns(rvref) = Pending(tid), ¬ success, vretRefs(tid) = rvref, nxt ≠ null, orl ≠ [], rvref ≠ 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 ∈ ps, phead ∈ vs, rvref ∈ vrvHp, 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (lst ∈ orl ∨ lst ∈ (lst = (orl + qrl).last ⊃ qrl + nxt ';qrl)) ∧ listp(orl + (lst = (orl + qrl).last ⊃ qrl + nxt ';qrl), vs, ps[lst, ps[lst].next:= nxt], (lst = (orl + qrl).last ⊃ owns(nxt; None);owns)) ∧ ¬ dups(orl + (lst = (orl + qrl).last ⊃ qrl + nxt ';qrl)) ∧ markedp(orl, ps[lst, ps[lst].next:= nxt]) ∧ unmarkedp((lst = (orl + qrl).last ⊃ qrl + nxt ';qrl), ps[lst, ps[lst].next:= nxt]) ∧ nonullRetRefs(orl + (lst = (orl + qrl).last ⊃ qrl + nxt ';qrl), vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ ((lst = (orl + qrl).last ⊃ qrl + nxt ';qrl) ≠ [] → unmarkedp((lst = (orl + qrl).last ⊃ qrl + nxt ';qrl).tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((lst = (orl + qrl).last ⊃ qrl + nxt ';qrl), vs)) ∧ ( vtail = (orl + (lst = (orl + qrl).last ⊃ qrl + nxt ';qrl)).last ∨ (lst = (orl + qrl).last ⊃ qrl + nxt ';qrl) ≠ [] ∧ vtail = (orl + (lst = (orl + qrl).last ⊃ qrl + nxt ';qrl).butlast).last ∧ vs[(lst = (orl + qrl).last ⊃ qrl + nxt ';qrl).last].deqID = None ∧ vs[(lst = (orl + qrl).last ⊃ qrl + nxt ';qrl).last].next = null) ∧ noid(tid, orl + (lst = (orl + qrl).last ⊃ qrl + nxt ';qrl), vhead, vs) ∧ noowns(tid, (lst = (orl + qrl).last ⊃ owns(nxt; None);owns))
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), nxt = vs[lst].next, pretRefs(tid) = rvref, rvowns(rvref) = Pending(tid), ¬ success, vretRefs(tid) = rvref, nxt ≠ null, orl ≠ [], rvref ≠ 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 ∈ ps, phead ∈ vs, rvref ∈ vrvHp, 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (lst ∈ orl ∨ lst ∈ (lst = (orl + qrl).last ⊃ qrl + nxt ';qrl)) ∧ listp(orl + (lst = (orl + qrl).last ⊃ qrl + nxt ';qrl), vs, ps[lst, ps[lst].next:= nxt], (lst = (orl + qrl).last ⊃ owns(nxt; None);owns)) ∧ ¬ dups(orl + (lst = (orl + qrl).last ⊃ qrl + nxt ';qrl)) ∧ markedp(orl, ps[lst, ps[lst].next:= nxt]) ∧ unmarkedp((lst = (orl + qrl).last ⊃ qrl + nxt ';qrl), ps[lst, ps[lst].next:= nxt]) ∧ nonullRetRefs(orl + (lst = (orl + qrl).last ⊃ qrl + nxt ';qrl), vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ ((lst = (orl + qrl).last ⊃ qrl + nxt ';qrl) ≠ [] → unmarkedp((lst = (orl + qrl).last ⊃ qrl + nxt ';qrl).tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((lst = (orl + qrl).last ⊃ qrl + nxt ';qrl), vs)) ∧ ( vtail = (orl + (lst = (orl + qrl).last ⊃ qrl + nxt ';qrl)).last ∨ (lst = (orl + qrl).last ⊃ qrl + nxt ';qrl) ≠ [] ∧ vtail = (orl + (lst = (orl + qrl).last ⊃ qrl + nxt ';qrl).butlast).last ∧ vs[(lst = (orl + qrl).last ⊃ qrl + nxt ';qrl).last].deqID = None ∧ vs[(lst = (orl + qrl).last ⊃ qrl + nxt ';qrl).last].next = null) ∧ noid(tid, orl + (lst = (orl + qrl).last ⊃ qrl + nxt ';qrl), vhead, vs) ∧ noowns(tid, (lst = (orl + qrl).last ⊃ owns(nxt; None);owns)) |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, orl ≠ [], 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 ∈ orl, 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (lst ∈ orl ∨ lst ∈ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ listp (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs, ps[lst, ps[lst].next:= vs[lst].next], (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)) ∧ ¬ dups(orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), ps[lst, ps[lst].next:= vs[lst].next]) ∧ nonullRetRefs(orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ ( (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ≠ [] → unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs)) ∧ ( vtail = (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)).last ∨ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ≠ [] ∧ vtail = (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).butlast).last ∧ vs[(lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).last].deqID = None ∧ vs[(lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).last].next = null) ∧ noid(tid, orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vhead, vs) ∧ noowns(tid, (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns))
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, orl ≠ [], 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 ∈ orl, 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (lst ∈ orl ∨ lst ∈ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ listp (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs, ps[lst, ps[lst].next:= vs[lst].next], (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)) ∧ ¬ dups(orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), ps[lst, ps[lst].next:= vs[lst].next]) ∧ nonullRetRefs(orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ ( (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ≠ [] → unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs)) ∧ ( vtail = (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)).last ∨ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ≠ [] ∧ vtail = (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).butlast).last ∧ vs[(lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).last].deqID = None ∧ vs[(lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).last].next = null) ∧ noid(tid, orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vhead, vs) ∧ noowns(tid, (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)) |
dom vrvHp = dom prvHp, lst = (orl + qrl).last, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, orl ≠ [], 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 ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (lst ∈ orl ∨ lst ∈ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ listp (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs, ps[lst, ps[lst].next:= vs[lst].next], (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)) ∧ ¬ dups(orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), ps[lst, ps[lst].next:= vs[lst].next]) ∧ nonullRetRefs(orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ ( (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ≠ [] → unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs)) ∧ ( vtail = (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)).last ∨ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ≠ [] ∧ vtail = (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).butlast).last ∧ vs[(lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).last].deqID = None ∧ vs[(lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).last].next = null) ∧ noid(tid, orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vhead, vs) ∧ noowns(tid, (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns))
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, orl ≠ [], 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 ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (lst ∈ orl ∨ lst ∈ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ listp (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs, ps[lst, ps[lst].next:= vs[lst].next], (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)) ∧ ¬ dups(orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), ps[lst, ps[lst].next:= vs[lst].next]) ∧ nonullRetRefs(orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ ( (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ≠ [] → unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs)) ∧ ( vtail = (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)).last ∨ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ≠ [] ∧ vtail = (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).butlast).last ∧ vs[(lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).last].deqID = None ∧ vs[(lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).last].next = null) ∧ noid(tid, orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vhead, vs) ∧ noowns(tid, (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns))
Used formulas: lst = (orl + qrl).last
| dom vrvHp = dom prvHp, lst = (orl + qrl).last, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, orl ≠ [], 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 ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (lst ∈ orl ∨ lst ∈ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ listp (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs, ps[lst, ps[lst].next:= vs[lst].next], (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)) ∧ ¬ dups(orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), ps[lst, ps[lst].next:= vs[lst].next]) ∧ nonullRetRefs(orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ ( (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ≠ [] → unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs)) ∧ ( vtail = (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)).last ∨ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ≠ [] ∧ vtail = (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).butlast).last ∧ vs[(lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).last].deqID = None ∧ vs[(lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).last].next = null) ∧ noid(tid, orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vhead, vs) ∧ noowns(tid, (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)) |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ 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 + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ((orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ∨ (orl + qrl).last = vs[(orl + qrl).last].next) ∧ listp (orl + qrl + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][vs[(orl + qrl).last].next].deqID = None ∧ nonullRetRefs(orl + qrl + vs[(orl + qrl).last].next ', vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp((qrl + vs[(orl + qrl).last].next ').tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ (vtail = vs[(orl + qrl).last].next ∨ vtail = (orl + qrl).last) ∧ noid(tid, orl + qrl + vs[(orl + qrl).last].next ', vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl).last].next; None))
Used simplifier rules: listp-nextoflast: ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next)); (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (x + a ').last = a; (s) ⊦ (x + a ').butlast = x; (s) ⊦ x + a ' ≠ []; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ a ∈ b ' ↔ a = b; (s)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ 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 + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ((orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ∨ (orl + qrl).last = vs[(orl + qrl).last].next) ∧ listp (orl + qrl + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][vs[(orl + qrl).last].next].deqID = None ∧ nonullRetRefs(orl + qrl + vs[(orl + qrl).last].next ', vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp((qrl + vs[(orl + qrl).last].next ').tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ (vtail = vs[(orl + qrl).last].next ∨ vtail = (orl + qrl).last) ∧ noid(tid, orl + qrl + vs[(orl + qrl).last].next ', vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl).last].next; None)) |
qrl + vs[(orl + qrl).last].next ' = vtail0 + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), qrl + vs[(orl + qrl).last].next ' ≠ [], vs[(orl + qrl).last].next ≠ null, orl ≠ [], 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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ((orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ∨ (orl + qrl).last = vs[(orl + qrl).last].next) ∧ listp (orl + qrl + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][vs[(orl + qrl).last].next].deqID = None ∧ nonullRetRefs(orl + qrl + vs[(orl + qrl).last].next ', vs, vretRefs, pretRefs) ∧ (orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ (vtail = vs[(orl + qrl).last].next ∨ vtail = (orl + qrl).last) ∧ noid(tid, orl + qrl + vs[(orl + qrl).last].next ', vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl).last].next; None))
Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ x + [] = x; (s) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl + vs[(orl + qrl).last].next ', vtail0, y
| qrl + vs[(orl + qrl).last].next ' = vtail0 + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), qrl + vs[(orl + qrl).last].next ' ≠ [], vs[(orl + qrl).last].next ≠ null, orl ≠ [], 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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ((orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ∨ (orl + qrl).last = vs[(orl + qrl).last].next) ∧ listp (orl + qrl + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][vs[(orl + qrl).last].next].deqID = None ∧ nonullRetRefs(orl + qrl + vs[(orl + qrl).last].next ', vs, vretRefs, pretRefs) ∧ (orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ (vtail = vs[(orl + qrl).last].next ∨ vtail = (orl + qrl).last) ∧ noid(tid, orl + qrl + vs[(orl + qrl).last].next ', vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl).last].next; None)) |
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], 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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ ((orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ∨ (orl + qrl).last = vs[(orl + qrl).last].next) ∧ listp (orl + vtail0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][vs[(orl + qrl).last].next].deqID = None ∧ nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ (vtail = vs[(orl + qrl).last].next ∨ vtail = (orl + qrl).last) ∧ noid(tid, orl + vtail0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl).last].next; None))
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) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ x + a ' ≠ []; (s) ⊦ a + x = a ' + x; (s)
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], 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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ ((orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ∨ (orl + qrl).last = vs[(orl + qrl).last].next) ∧ listp (orl + vtail0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][vs[(orl + qrl).last].next].deqID = None ∧ nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ (vtail = vs[(orl + qrl).last].next ∨ vtail = (orl + qrl).last) ∧ noid(tid, orl + vtail0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl).last].next; None)) |
⊦ listp(rl, vs, ps, owns) ∧ r ≠ null ∧ r ∈ vs ∧ r ∈ ps → (listp(rl + r ', vs, ps[rl.last, ps[rl.last].next:= r], owns(r; None)) ↔ vs[rl.last].next = r ∧ ps[r].next = null ∧ ps[r].deqID = None)
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(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), listp(orl + qrl, vs, ps, owns) ∧ vs[(orl + qrl).last].next ≠ null ∧ vs[(orl + qrl).last].next ∈ vs ∧ vs[(orl + qrl).last].next ∈ ps → ( listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ↔ vs[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ ps[vs[(orl + qrl).last].next].next = null ∧ ps[vs[(orl + qrl).last].next].deqID = None), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ((orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ∨ (orl + qrl).last = vs[(orl + qrl).last].next) ∧ listp (orl + vtail0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][vs[(orl + qrl).last].next].deqID = None ∧ nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ (vtail = vs[(orl + qrl).last].next ∨ vtail = (orl + qrl).last) ∧ noid(tid, orl + vtail0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl).last].next; None))
Used terms: ps, orl + qrl, owns, vs[(orl + qrl).last].next, vs
| ⊦ listp(rl, vs, ps, owns) ∧ r ≠ null ∧ r ∈ vs ∧ r ∈ ps → (listp(rl + r ', vs, ps[rl.last, ps[rl.last].next:= r], owns(r; None)) ↔ vs[rl.last].next = r ∧ ps[r].next = null ∧ ps[r].deqID = None) |
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(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), listp(orl + qrl, vs, ps, owns) ∧ vs[(orl + qrl).last].next ≠ null ∧ vs[(orl + qrl).last].next ∈ vs ∧ vs[(orl + qrl).last].next ∈ ps → ( listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ↔ vs[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ ps[vs[(orl + qrl).last].next].next = null ∧ ps[vs[(orl + qrl).last].next].deqID = None), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ((orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ∨ (orl + qrl).last = vs[(orl + qrl).last].next) ∧ listp (orl + vtail0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][vs[(orl + qrl).last].next].deqID = None ∧ nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ (vtail = vs[(orl + qrl).last].next ∨ vtail = (orl + qrl).last) ∧ noid(tid, orl + vtail0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl).last].next; None)) |
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ 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), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ((orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ∨ (orl + qrl).last = vs[(orl + qrl).last].next) ∧ listp (orl + vtail0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][vs[(orl + qrl).last].next].deqID = None ∧ nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ (vtail = vs[(orl + qrl).last].next ∨ vtail = (orl + qrl).last) ∧ noid(tid, orl + vtail0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl).last].next; None))
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ 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), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ((orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ∨ (orl + qrl).last = vs[(orl + qrl).last].next) ∧ listp (orl + vtail0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][vs[(orl + qrl).last].next].deqID = None ∧ nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ (vtail = vs[(orl + qrl).last].next ∨ vtail = (orl + qrl).last) ∧ noid(tid, orl + vtail0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl).last].next; None)) |
⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next))
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, 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), listp(orl + qrl, vs, ps, owns) ∧ vs[(orl + qrl).last].next ≠ null → vs[(orl + qrl).last].next ∈ vs ∧ vs[(orl + qrl).last].next ∈ ps ∧ ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next] ∧ ps[vs[(orl + qrl).last].next].deqID = None ∧ ps[vs[(orl + qrl).last].next].next = null ∧ weak?(owns(vs[(orl + qrl).last].next)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ ((orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ∨ (orl + qrl).last = vs[(orl + qrl).last].next) ∧ listp (orl + vtail0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][vs[(orl + qrl).last].next].deqID = None ∧ nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ (vtail = vs[(orl + qrl).last].next ∨ vtail = (orl + qrl).last) ∧ noid(tid, orl + vtail0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl).last].next; None))
Used terms: orl + qrl, vs, ps, owns
| ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next)) |
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, 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), listp(orl + qrl, vs, ps, owns) ∧ vs[(orl + qrl).last].next ≠ null → vs[(orl + qrl).last].next ∈ vs ∧ vs[(orl + qrl).last].next ∈ ps ∧ ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next] ∧ ps[vs[(orl + qrl).last].next].deqID = None ∧ ps[vs[(orl + qrl).last].next].next = null ∧ weak?(owns(vs[(orl + qrl).last].next)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ ((orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ∨ (orl + qrl).last = vs[(orl + qrl).last].next) ∧ listp (orl + vtail0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][vs[(orl + qrl).last].next].deqID = None ∧ nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ (vtail = vs[(orl + qrl).last].next ∨ vtail = (orl + qrl).last) ∧ noid(tid, orl + vtail0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl).last].next; None)) |
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ ((orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ∨ (orl + qrl).last = vs[(orl + qrl).last].next) ∧ listp (orl + vtail0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][vs[(orl + qrl).last].next].deqID = None ∧ nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ (vtail = vs[(orl + qrl).last].next ∨ vtail = (orl + qrl).last) ∧ noid(tid, orl + vtail0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl).last].next; None))
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ ((orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ∨ (orl + qrl).last = vs[(orl + qrl).last].next) ∧ listp (orl + vtail0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][vs[(orl + qrl).last].next].deqID = None ∧ nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ (vtail = vs[(orl + qrl).last].next ∨ vtail = (orl + qrl).last) ∧ noid(tid, orl + vtail0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl).last].next; None)) |
⊦ a ≠ b → st[b, d][a] = st[a]
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ (orl + qrl).last, vs[(orl + qrl).last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ dups(qrl), ¬ dups(orl), ¬ dups(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), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ((orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ∨ (orl + qrl).last = vs[(orl + qrl).last].next) ∧ listp (orl + vtail0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ps[vs[(orl + qrl).last].next].deqID = None ∧ nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ (vtail = vs[(orl + qrl).last].next ∨ vtail = (orl + qrl).last) ∧ noid(tid, orl + vtail0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl).last].next; None))
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, (orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next, vs[(orl + qrl).last].next
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ (orl + qrl).last, vs[(orl + qrl).last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ dups(qrl), ¬ dups(orl), ¬ dups(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), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ((orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ∨ (orl + qrl).last = vs[(orl + qrl).last].next) ∧ listp (orl + vtail0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ps[vs[(orl + qrl).last].next].deqID = None ∧ nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ (vtail = vs[(orl + qrl).last].next ∨ vtail = (orl + qrl).last) ∧ noid(tid, orl + vtail0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl).last].next; None)) |
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ 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), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp (orl + vtail0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ (vtail = vs[(orl + qrl).last].next ∨ vtail = (orl + qrl).last) ∧ noid(tid, orl + vtail0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl).last].next; None))
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ 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), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp (orl + vtail0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ (vtail = vs[(orl + qrl).last].next ∨ vtail = (orl + qrl).last) ∧ noid(tid, orl + vtail0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl).last].next; None)) |
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vtail = (orl + qrl).last, vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ listp (orl + vtail0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ (vtail = vs[(orl + qrl).last].next ∨ vtail = (orl + qrl).last) ∧ noid(tid, orl + vtail0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl).last].next; None))
Used simplifier rules: ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vtail = (orl + qrl).last, vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ listp (orl + vtail0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ (vtail = vs[(orl + qrl).last].next ∨ vtail = (orl + qrl).last) ∧ noid(tid, orl + vtail0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl).last].next; None)) |
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ 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), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp (orl + vtail0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ noid(tid, orl + vtail0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl).last].next; None))
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ 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), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp (orl + vtail0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ noid(tid, orl + vtail0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl).last].next; None)) |
⊦ listp(rl, vs, ps, owns) → ¬ dups(rl)
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, 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), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) → ¬ dups((orl + qrl) + vs[(orl + qrl).last].next '), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ listp (orl + vtail0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ noid(tid, orl + vtail0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl).last].next; None))
Used terms: (orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)
| ⊦ listp(rl, vs, ps, owns) → ¬ dups(rl) |
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, 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), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) → ¬ dups((orl + qrl) + vs[(orl + qrl).last].next '), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ listp (orl + vtail0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ noid(tid, orl + vtail0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl).last].next; None)) |
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp (orl + vtail0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ noid(tid, orl + vtail0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl).last].next; None))
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws)
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp (orl + vtail0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ noid(tid, orl + vtail0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl).last].next; None)) |
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ listp(orl + vtail0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ orl.last = vhead ∧ unmarkedp(qrl0, vs), orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noid(tid, orl + vtail0 ' + qrl0, vhead, vs), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noowns(tid, owns(vs[(orl + qrl).last].next; None)), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ listp(orl + vtail0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ |
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ |
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ markedp(rl, vs) ↔ (∀ r. r ∈ rl → some?(vs[r].deqID))
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), ∃ r. ¬(r ∈ orl → some?(ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦
Used terms: orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]
| ⊦ markedp(rl, vs) ↔ (∀ r. r ∈ rl → some?(vs[r].deqID)) |
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), ∃ r. ¬(r ∈ orl → some?(ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ |
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), r ∈ orl, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], r ∈ ps, r ∈ vs, r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ some?(ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), r ∈ orl, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], r ∈ ps, r ∈ vs, r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ some?(ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ markedp(rl, vs) ↔ (∀ r. r ∈ rl → some?(vs[r].deqID))
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), 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), weak?(owns(vs[(orl + qrl).last].next)), r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], r ∈ vs, r ∈ ps, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ some?(ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), ∀ r. r ∈ orl → some?(ps[r].deqID), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦
Used terms: orl, ps
| ⊦ markedp(rl, vs) ↔ (∀ r. r ∈ rl → some?(vs[r].deqID)) |
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), 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), weak?(owns(vs[(orl + qrl).last].next)), r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], r ∈ vs, r ∈ ps, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ some?(ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), ∀ r. r ∈ orl → some?(ps[r].deqID), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ |
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), r ∈ orl, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], r ∈ ps, r ∈ vs, r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ some?(ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), r ∈ orl → some?(ps[r].deqID), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used terms: r
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), r ∈ orl, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], r ∈ ps, r ∈ vs, r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ some?(ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), r ∈ orl → some?(ps[r].deqID), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), 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), some?(ps[r].deqID), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], r ∈ vs, r ∈ ps, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ some?(ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), 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), some?(ps[r].deqID), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], r ∈ vs, r ∈ ps, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ some?(ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a ∈ st[a, d]; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) Used terms: ps, (orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next, r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ |
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = phead0 + orl0, rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], qrl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(orl0, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ unmarkedp([], vs); (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, phead0, y
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = phead0 + orl0, rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], qrl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(orl0, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
ps[vtail0].deqID = None, vs[vs[(vtail0 ' + orl0).last].next].deqID = None, vs[vs[(vtail0 ' + orl0).last].next].next = null, ps[vs[(vtail0 ' + orl0).last].next] = vs[vs[(vtail0 ' + orl0).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(vtail0 ' + orl0).last].next ≠ vtail0, vs[(vtail0 ' + orl0).last].next ≠ (vtail0 ' + orl0).last, vs[(vtail0 ' + orl0).last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), listp (orl + (vtail0 ' + orl0) + vs[(vtail0 ' + orl0).last].next ', vs, ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next], owns(vs[(vtail0 ' + orl0).last].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[(vtail0 ' + orl0).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(vtail0 ' + orl0).last].next ∈ ps, vs[(vtail0 ' + orl0).last].next ∈ vs, phead ∈ ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next], ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vs[(vtail0 ' + orl0).last].next ∈ orl0, ¬ vs[(vtail0 ' + orl0).last].next ∈ orl, ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ 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), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next][vtail0].deqID = None ∧ unmarkedp(orl0, ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next])
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ' + x ≠ []; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (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 = b ' + y ↔ a = b ∧ x = y; (ws)
| ps[vtail0].deqID = None, vs[vs[(vtail0 ' + orl0).last].next].deqID = None, vs[vs[(vtail0 ' + orl0).last].next].next = null, ps[vs[(vtail0 ' + orl0).last].next] = vs[vs[(vtail0 ' + orl0).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(vtail0 ' + orl0).last].next ≠ vtail0, vs[(vtail0 ' + orl0).last].next ≠ (vtail0 ' + orl0).last, vs[(vtail0 ' + orl0).last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), listp (orl + (vtail0 ' + orl0) + vs[(vtail0 ' + orl0).last].next ', vs, ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next], owns(vs[(vtail0 ' + orl0).last].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[(vtail0 ' + orl0).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(vtail0 ' + orl0).last].next ∈ ps, vs[(vtail0 ' + orl0).last].next ∈ vs, phead ∈ ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next], ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vs[(vtail0 ' + orl0).last].next ∈ orl0, ¬ vs[(vtail0 ' + orl0).last].next ∈ orl, ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ 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), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next][vtail0].deqID = None ∧ unmarkedp(orl0, ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next]) |
⊦ a ≠ b → st[b, d][a] = st[a]
vs[vs[(vtail0 ' + orl0).last].next].deqID = None, ps[vtail0].deqID = None, vs[vs[(vtail0 ' + orl0).last].next].next = null, ps[vs[(vtail0 ' + orl0).last].next] = vs[vs[(vtail0 ' + orl0).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(vtail0 ' + orl0).last].next ≠ vtail0, vs[(vtail0 ' + orl0).last].next ≠ (vtail0 ' + orl0).last, vs[(vtail0 ' + orl0).last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ (vtail0 ' + orl0).last, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp (orl + (vtail0 ' + orl0) + vs[(vtail0 ' + orl0).last].next ', vs, ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next], owns(vs[(vtail0 ' + orl0).last].next; None)), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[(vtail0 ' + orl0).last].next)), phead ∈ ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next], vs[(vtail0 ' + orl0).last].next ∈ vs, vs[(vtail0 ' + orl0).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vs[(vtail0 ' + orl0).last].next ∈ orl0, ¬ vs[(vtail0 ' + orl0).last].next ∈ orl, ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ 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), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ ps[vtail0].deqID = None ∧ unmarkedp(orl0, ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next])
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ node ∈ rl → (unmarkedp(rl, vs[node, nd]) ↔ unmarkedp(rl, vs)); (s) Used terms: ps, (vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next, vtail0
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| vs[vs[(vtail0 ' + orl0).last].next].deqID = None, ps[vtail0].deqID = None, vs[vs[(vtail0 ' + orl0).last].next].next = null, ps[vs[(vtail0 ' + orl0).last].next] = vs[vs[(vtail0 ' + orl0).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(vtail0 ' + orl0).last].next ≠ vtail0, vs[(vtail0 ' + orl0).last].next ≠ (vtail0 ' + orl0).last, vs[(vtail0 ' + orl0).last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ (vtail0 ' + orl0).last, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp (orl + (vtail0 ' + orl0) + vs[(vtail0 ' + orl0).last].next ', vs, ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next], owns(vs[(vtail0 ' + orl0).last].next; None)), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[(vtail0 ' + orl0).last].next)), phead ∈ ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next], vs[(vtail0 ' + orl0).last].next ∈ vs, vs[(vtail0 ' + orl0).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vs[(vtail0 ' + orl0).last].next ∈ orl0, ¬ vs[(vtail0 ' + orl0).last].next ∈ orl, ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ 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), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ ps[vtail0].deqID = None ∧ unmarkedp(orl0, ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next]) |
ps[vtail0].deqID = None, vs[vs[(vtail0 ' + orl0).last].next].deqID = None, vs[vs[(vtail0 ' + orl0).last].next].next = null, ps[vs[(vtail0 ' + orl0).last].next] = vs[vs[(vtail0 ' + orl0).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(vtail0 ' + orl0).last].next ≠ vtail0, vs[(vtail0 ' + orl0).last].next ≠ (vtail0 ' + orl0).last, vs[(vtail0 ' + orl0).last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ (vtail0 ' + orl0).last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), listp (orl + (vtail0 ' + orl0) + vs[(vtail0 ' + orl0).last].next ', vs, ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next], owns(vs[(vtail0 ' + orl0).last].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[(vtail0 ' + orl0).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(vtail0 ' + orl0).last].next ∈ ps, vs[(vtail0 ' + orl0).last].next ∈ vs, phead ∈ ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next], ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ unmarkedp(orl0, ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next]), ¬ vs[(vtail0 ' + orl0).last].next ∈ orl0, ¬ vs[(vtail0 ' + orl0).last].next ∈ orl, ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ 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), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
| ps[vtail0].deqID = None, vs[vs[(vtail0 ' + orl0).last].next].deqID = None, vs[vs[(vtail0 ' + orl0).last].next].next = null, ps[vs[(vtail0 ' + orl0).last].next] = vs[vs[(vtail0 ' + orl0).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(vtail0 ' + orl0).last].next ≠ vtail0, vs[(vtail0 ' + orl0).last].next ≠ (vtail0 ' + orl0).last, vs[(vtail0 ' + orl0).last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ (vtail0 ' + orl0).last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), listp (orl + (vtail0 ' + orl0) + vs[(vtail0 ' + orl0).last].next ', vs, ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next], owns(vs[(vtail0 ' + orl0).last].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[(vtail0 ' + orl0).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(vtail0 ' + orl0).last].next ∈ ps, vs[(vtail0 ' + orl0).last].next ∈ vs, phead ∈ ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next], ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ unmarkedp(orl0, ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next]), ¬ vs[(vtail0 ' + orl0).last].next ∈ orl0, ¬ vs[(vtail0 ' + orl0).last].next ∈ orl, ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ 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), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
⊦ unmarkedp(rl, vs) ↔ (∀ r. r ∈ rl → vs[r].deqID = None)
vs[vs[(vtail0 ' + orl0).last].next].deqID = None, ps[vtail0].deqID = None, vs[vs[(vtail0 ' + orl0).last].next].next = null, ps[vs[(vtail0 ' + orl0).last].next] = vs[vs[(vtail0 ' + orl0).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(vtail0 ' + orl0).last].next ≠ vtail0, vs[(vtail0 ' + orl0).last].next ≠ (vtail0 ' + orl0).last, vs[(vtail0 ' + orl0).last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ (vtail0 ' + orl0).last, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp (orl + (vtail0 ' + orl0) + vs[(vtail0 ' + orl0).last].next ', vs, ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next], owns(vs[(vtail0 ' + orl0).last].next; None)), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[(vtail0 ' + orl0).last].next)), phead ∈ ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next], vs[(vtail0 ' + orl0).last].next ∈ vs, vs[(vtail0 ' + orl0).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vs[(vtail0 ' + orl0).last].next ∈ orl0, ¬ vs[(vtail0 ' + orl0).last].next ∈ orl, ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ 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), ∃ r. ¬(r ∈ orl0 → ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next][r].deqID = None), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used terms: orl0, ps [(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next ]
| ⊦ unmarkedp(rl, vs) ↔ (∀ r. r ∈ rl → vs[r].deqID = None) |
| vs[vs[(vtail0 ' + orl0).last].next].deqID = None, ps[vtail0].deqID = None, vs[vs[(vtail0 ' + orl0).last].next].next = null, ps[vs[(vtail0 ' + orl0).last].next] = vs[vs[(vtail0 ' + orl0).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(vtail0 ' + orl0).last].next ≠ vtail0, vs[(vtail0 ' + orl0).last].next ≠ (vtail0 ' + orl0).last, vs[(vtail0 ' + orl0).last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ (vtail0 ' + orl0).last, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp (orl + (vtail0 ' + orl0) + vs[(vtail0 ' + orl0).last].next ', vs, ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next], owns(vs[(vtail0 ' + orl0).last].next; None)), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[(vtail0 ' + orl0).last].next)), phead ∈ ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next], vs[(vtail0 ' + orl0).last].next ∈ vs, vs[(vtail0 ' + orl0).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vs[(vtail0 ' + orl0).last].next ∈ orl0, ¬ vs[(vtail0 ' + orl0).last].next ∈ orl, ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ 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), ∃ r. ¬(r ∈ orl0 → ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next][r].deqID = None), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
ps[vtail0].deqID = None, vs[vs[orl0.last].next].deqID = None, vs[vs[orl0.last].next].next = null, ps[vs[orl0.last].next] = vs[vs[orl0.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next][r].deqID ≠ None, vs[orl0.last].next ≠ vtail0, vs[orl0.last].next ≠ orl0.last, vs[orl0.last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ orl0.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), listp(orl + vtail0 ' + orl0 + vs[orl0.last].next ', vs, ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next], owns(vs[orl0.last].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[orl0.last].next)), r ∈ orl0, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[orl0.last].next ∈ ps, vs[orl0.last].next ∈ vs, r ∈ vs, r ∈ ps, phead ∈ ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next], ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ orl, ¬ vs[orl0.last].next ∈ orl0, ¬ vs[orl0.last].next ∈ 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), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ a ∈ x → (b ' + x).last = x.last; (s)
| ps[vtail0].deqID = None, vs[vs[orl0.last].next].deqID = None, vs[vs[orl0.last].next].next = null, ps[vs[orl0.last].next] = vs[vs[orl0.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next][r].deqID ≠ None, vs[orl0.last].next ≠ vtail0, vs[orl0.last].next ≠ orl0.last, vs[orl0.last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ orl0.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), listp(orl + vtail0 ' + orl0 + vs[orl0.last].next ', vs, ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next], owns(vs[orl0.last].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[orl0.last].next)), r ∈ orl0, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[orl0.last].next ∈ ps, vs[orl0.last].next ∈ vs, r ∈ vs, r ∈ ps, phead ∈ ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next], ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ orl, ¬ vs[orl0.last].next ∈ orl0, ¬ vs[orl0.last].next ∈ 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), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
⊦ unmarkedp(rl, vs) ↔ (∀ r. r ∈ rl → vs[r].deqID = None)
vs[vs[orl0.last].next].deqID = None, ps[vtail0].deqID = None, vs[vs[orl0.last].next].next = null, ps[vs[orl0.last].next] = vs[vs[orl0.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next][r].deqID ≠ None, vs[orl0.last].next ≠ vtail0, vs[orl0.last].next ≠ orl0.last, vs[orl0.last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ orl0.last, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + orl0 + vs[orl0.last].next ', vs, ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next], owns(vs[orl0.last].next; None)), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[orl0.last].next)), phead ∈ ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next], r ∈ ps, r ∈ vs, vs[orl0.last].next ∈ vs, vs[orl0.last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ orl0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ orl, ¬ vs[orl0.last].next ∈ orl0, ¬ vs[orl0.last].next ∈ 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), ∀ r. r ∈ orl0 → ps[r].deqID = None, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used terms: orl0, ps
| ⊦ unmarkedp(rl, vs) ↔ (∀ r. r ∈ rl → vs[r].deqID = None) |
| vs[vs[orl0.last].next].deqID = None, ps[vtail0].deqID = None, vs[vs[orl0.last].next].next = null, ps[vs[orl0.last].next] = vs[vs[orl0.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next][r].deqID ≠ None, vs[orl0.last].next ≠ vtail0, vs[orl0.last].next ≠ orl0.last, vs[orl0.last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ orl0.last, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + orl0 + vs[orl0.last].next ', vs, ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next], owns(vs[orl0.last].next; None)), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[orl0.last].next)), phead ∈ ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next], r ∈ ps, r ∈ vs, vs[orl0.last].next ∈ vs, vs[orl0.last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ orl0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ orl, ¬ vs[orl0.last].next ∈ orl0, ¬ vs[orl0.last].next ∈ 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), ∀ r. r ∈ orl0 → ps[r].deqID = None, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
ps[vtail0].deqID = None, vs[vs[orl0.last].next].deqID = None, vs[vs[orl0.last].next].next = null, ps[vs[orl0.last].next] = vs[vs[orl0.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next][r].deqID ≠ None, vs[orl0.last].next ≠ vtail0, vs[orl0.last].next ≠ orl0.last, vs[orl0.last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ orl0.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), listp(orl + vtail0 ' + orl0 + vs[orl0.last].next ', vs, ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next], owns(vs[orl0.last].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[orl0.last].next)), r ∈ orl0, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[orl0.last].next ∈ ps, vs[orl0.last].next ∈ vs, r ∈ vs, r ∈ ps, phead ∈ ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next], ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ orl, ¬ vs[orl0.last].next ∈ orl0, ¬ vs[orl0.last].next ∈ 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), r ∈ orl0 → ps[r].deqID = None, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used terms: r
| ps[vtail0].deqID = None, vs[vs[orl0.last].next].deqID = None, vs[vs[orl0.last].next].next = null, ps[vs[orl0.last].next] = vs[vs[orl0.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next][r].deqID ≠ None, vs[orl0.last].next ≠ vtail0, vs[orl0.last].next ≠ orl0.last, vs[orl0.last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ orl0.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), listp(orl + vtail0 ' + orl0 + vs[orl0.last].next ', vs, ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next], owns(vs[orl0.last].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[orl0.last].next)), r ∈ orl0, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[orl0.last].next ∈ ps, vs[orl0.last].next ∈ vs, r ∈ vs, r ∈ ps, phead ∈ ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next], ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ orl, ¬ vs[orl0.last].next ∈ orl0, ¬ vs[orl0.last].next ∈ 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), r ∈ orl0 → ps[r].deqID = None, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
vs[vs[orl0.last].next].deqID = None, ps[vtail0].deqID = None, ps[r].deqID = None, vs[vs[orl0.last].next].next = null, ps[vs[orl0.last].next] = vs[vs[orl0.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next][r].deqID ≠ None, vs[orl0.last].next ≠ vtail0, vs[orl0.last].next ≠ orl0.last, vs[orl0.last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ orl0.last, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + orl0 + vs[orl0.last].next ', vs, ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next], owns(vs[orl0.last].next; None)), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[orl0.last].next)), phead ∈ ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next], r ∈ ps, r ∈ vs, vs[orl0.last].next ∈ vs, vs[orl0.last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ orl0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ orl, ¬ vs[orl0.last].next ∈ orl0, ¬ vs[orl0.last].next ∈ 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), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
| vs[vs[orl0.last].next].deqID = None, ps[vtail0].deqID = None, ps[r].deqID = None, vs[vs[orl0.last].next].next = null, ps[vs[orl0.last].next] = vs[vs[orl0.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next][r].deqID ≠ None, vs[orl0.last].next ≠ vtail0, vs[orl0.last].next ≠ orl0.last, vs[orl0.last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ orl0.last, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + orl0 + vs[orl0.last].next ', vs, ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next], owns(vs[orl0.last].next; None)), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[orl0.last].next)), phead ∈ ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next], r ∈ ps, r ∈ vs, vs[orl0.last].next ∈ vs, vs[orl0.last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ orl0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ orl, ¬ vs[orl0.last].next ∈ orl0, ¬ vs[orl0.last].next ∈ 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), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ a ≠ b → st[b, d][a] = st[a]; (s) ⊦ ¬ a ∈ []; (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, phead0, y
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ |
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[r].deqID ≠ None, vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], r ≠ orl.head, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ qrl, ¬ r ∈ orl, ¬ r ∈ 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), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), r = vtail0 ∨ r ∈ qrl0 ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (x + y).head = x.head; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ nonullRetRefs(rl, vs, vretRefs, pretRefs) → ( nonullRetRefs(rl0, vs0, vretRefs0, pretRefs0) ↔ (∀ r. ( r ∈ rl ∧ r ≠ rl.head ∧ vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null) → r ∈ rl0 ∧ r ≠ rl0.head ∧ vs0[r].deqID ≠ None → vretRefs0(vs0[r].deqID.tid) ≠ null ∧ pretRefs0(vs0[r].deqID.tid) ≠ null)); (ss)
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[r].deqID ≠ None, vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], r ≠ orl.head, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ qrl, ¬ r ∈ orl, ¬ r ∈ 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), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), r = vtail0 ∨ r ∈ qrl0 ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null |
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, orl = phead0 + orl0, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[r].deqID ≠ None, vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], r ≠ phead0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ qrl, ¬ r ∈ orl, ¬ r ∈ 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), r = vtail0 ∨ r ∈ qrl0, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: orl, head, tail
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, orl = phead0 + orl0, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[r].deqID ≠ None, vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], r ≠ phead0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ qrl, ¬ r ∈ orl, ¬ r ∈ 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), r = vtail0 ∨ r ∈ qrl0, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null |
qrl + vs[((phead0 ' + orl0) + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[((phead0 ' + orl0) + qrl).last].next].deqID = None, vs[vs[((phead0 ' + orl0) + qrl).last].next].next = null, ps[vs[((phead0 ' + orl0) + qrl).last].next] = vs[vs[((phead0 ' + orl0) + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[r].deqID ≠ None, vs[((phead0 ' + orl0) + qrl).last].next ≠ null, vs[((phead0 ' + orl0) + qrl).last].next ≠ ((phead0 ' + orl0) + qrl).last, vs[((phead0 ' + orl0) + qrl).last].next ≠ phead0, r ≠ phead0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((phead0 ' + orl0) + qrl, vs, ps, owns), listp ((phead0 ' + orl0) + vtail0 ' + qrl0, vs, ps[((phead0 ' + orl0) + qrl).last, ps[((phead0 ' + orl0) + qrl).last].next:= vs[((phead0 ' + orl0) + qrl).last].next], owns(vs[((phead0 ' + orl0) + qrl).last].next; None)), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (phead0 ' + orl0) + qrl, vhead, vs), nonullRetRefs((phead0 ' + orl0) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(qrl, ps), weak?(owns(vs[((phead0 ' + orl0) + qrl).last].next)), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, phead ∈ ps[((phead0 ' + orl0) + qrl).last, ps[((phead0 ' + orl0) + qrl).last].next:= vs[((phead0 ' + orl0) + qrl).last].next], vs[((phead0 ' + orl0) + qrl).last].next ∈ ps, vs[((phead0 ' + orl0) + qrl).last].next ∈ vs, ¬ dups(orl0 + qrl), ¬ dups(orl0), ¬ dups(qrl), ¬ r ∈ qrl, ¬ phead0 ∈ orl0, ¬ phead0 ∈ qrl, ¬ vs[((phead0 ' + orl0) + qrl).last].next ∈ orl0, ¬ vs[((phead0 ' + orl0) + qrl).last].next ∈ qrl, ¬ r ∈ 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), vtail0 ∈ qrl ∨ vtail0 = vs[((phead0 ' + orl0) + qrl).last].next, r = vtail0 ∨ r ∈ qrl0, phead = phead0 ∨ phead ∈ orl0, vs[((phead0 ' + orl0) + qrl).last].next = vtail0 ∨ vs[((phead0 ' + orl0) + qrl).last].next ∈ qrl0, ((phead0 ' + orl0) + qrl).last = phead0 ∨ ((phead0 ' + orl0) + qrl).last ∈ orl0 ∨ ((phead0 ' + orl0) + qrl).last ∈ qrl, (phead0 ' + orl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl0 ≠ [] ∧ (phead0 ' + orl0.butlast).last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs) ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null
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) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] listp-nextoflast: ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next)); (forward) from specification DMSQ in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ a + x = a ' + x; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ (a ' + x).butlast = [] ↔ x = []; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ a ' + x ≠ []; (s)
| qrl + vs[((phead0 ' + orl0) + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[((phead0 ' + orl0) + qrl).last].next].deqID = None, vs[vs[((phead0 ' + orl0) + qrl).last].next].next = null, ps[vs[((phead0 ' + orl0) + qrl).last].next] = vs[vs[((phead0 ' + orl0) + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[r].deqID ≠ None, vs[((phead0 ' + orl0) + qrl).last].next ≠ null, vs[((phead0 ' + orl0) + qrl).last].next ≠ ((phead0 ' + orl0) + qrl).last, vs[((phead0 ' + orl0) + qrl).last].next ≠ phead0, r ≠ phead0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((phead0 ' + orl0) + qrl, vs, ps, owns), listp ((phead0 ' + orl0) + vtail0 ' + qrl0, vs, ps[((phead0 ' + orl0) + qrl).last, ps[((phead0 ' + orl0) + qrl).last].next:= vs[((phead0 ' + orl0) + qrl).last].next], owns(vs[((phead0 ' + orl0) + qrl).last].next; None)), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (phead0 ' + orl0) + qrl, vhead, vs), nonullRetRefs((phead0 ' + orl0) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(qrl, ps), weak?(owns(vs[((phead0 ' + orl0) + qrl).last].next)), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, phead ∈ ps[((phead0 ' + orl0) + qrl).last, ps[((phead0 ' + orl0) + qrl).last].next:= vs[((phead0 ' + orl0) + qrl).last].next], vs[((phead0 ' + orl0) + qrl).last].next ∈ ps, vs[((phead0 ' + orl0) + qrl).last].next ∈ vs, ¬ dups(orl0 + qrl), ¬ dups(orl0), ¬ dups(qrl), ¬ r ∈ qrl, ¬ phead0 ∈ orl0, ¬ phead0 ∈ qrl, ¬ vs[((phead0 ' + orl0) + qrl).last].next ∈ orl0, ¬ vs[((phead0 ' + orl0) + qrl).last].next ∈ qrl, ¬ r ∈ 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), vtail0 ∈ qrl ∨ vtail0 = vs[((phead0 ' + orl0) + qrl).last].next, r = vtail0 ∨ r ∈ qrl0, phead = phead0 ∨ phead ∈ orl0, vs[((phead0 ' + orl0) + qrl).last].next = vtail0 ∨ vs[((phead0 ' + orl0) + qrl).last].next ∈ qrl0, ((phead0 ' + orl0) + qrl).last = phead0 ∨ ((phead0 ' + orl0) + qrl).last ∈ orl0 ∨ ((phead0 ' + orl0) + qrl).last ∈ qrl, (phead0 ' + orl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl0 ≠ [] ∧ (phead0 ' + orl0.butlast).last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs) ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null |
⊦ y ≠ [] → (x + y).last = y.last
qrl + vs[qrl.last].next ' = vtail0 ' + qrl0, vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[r].deqID ≠ None, vs[qrl.last].next ≠ null, vs[qrl.last].next ≠ qrl.last, vs[qrl.last].next ≠ phead0, qrl ≠ [], r ≠ phead0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((phead0 ' + orl0) + vtail0 ' + qrl0, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)), listp((phead0 ' + orl0) + qrl, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (phead0 ' + orl0) + qrl, vhead, vs), nonullRetRefs((phead0 ' + orl0) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(qrl, ps), weak?(owns(vs[qrl.last].next)), vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ ps, phead ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl0 + qrl), ¬ dups(orl0), ¬ dups(qrl), ¬ r ∈ qrl, ¬ phead0 ∈ orl0, ¬ phead0 ∈ qrl, ¬ vs[qrl.last].next ∈ orl0, ¬ vs[qrl.last].next ∈ qrl, ¬ r ∈ 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), (phead0 ' + orl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl0 ≠ [] ∧ (phead0 ' + orl0.butlast).last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs), qrl.last = phead0 ∨ qrl.last ∈ orl0 ∨ qrl.last ∈ qrl, vs[qrl.last].next = vtail0 ∨ vs[qrl.last].next ∈ qrl0, phead = phead0 ∨ phead ∈ orl0, r = vtail0 ∨ r ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[qrl.last].next ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null
Used simplifier rules: ⊦ [] + x = x; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ ¬ dups([]); (s) ⊦ unmarkedp([], vs); (s) listp-nextoflast: ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next)); (forward) from specification DMSQ ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ a ∈ []; (s) Used terms: phead0 ' + orl0, qrl
| ⊦ y ≠ [] → (x + y).last = y.last |
| qrl + vs[qrl.last].next ' = vtail0 ' + qrl0, vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[r].deqID ≠ None, vs[qrl.last].next ≠ null, vs[qrl.last].next ≠ qrl.last, vs[qrl.last].next ≠ phead0, qrl ≠ [], r ≠ phead0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((phead0 ' + orl0) + vtail0 ' + qrl0, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)), listp((phead0 ' + orl0) + qrl, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (phead0 ' + orl0) + qrl, vhead, vs), nonullRetRefs((phead0 ' + orl0) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(qrl, ps), weak?(owns(vs[qrl.last].next)), vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ ps, phead ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl0 + qrl), ¬ dups(orl0), ¬ dups(qrl), ¬ r ∈ qrl, ¬ phead0 ∈ orl0, ¬ phead0 ∈ qrl, ¬ vs[qrl.last].next ∈ orl0, ¬ vs[qrl.last].next ∈ qrl, ¬ r ∈ 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), (phead0 ' + orl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl0 ≠ [] ∧ (phead0 ' + orl0.butlast).last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs), qrl.last = phead0 ∨ qrl.last ∈ orl0 ∨ qrl.last ∈ qrl, vs[qrl.last].next = vtail0 ∨ vs[qrl.last].next ∈ qrl0, phead = phead0 ∨ phead ∈ orl0, r = vtail0 ∨ r ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[qrl.last].next ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null |
qrl + vs[qrl.last].next ' = vtail0 ' + qrl0, vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[r].deqID ≠ None, vs[qrl.last].next ≠ null, vs[qrl.last].next ≠ qrl.last, vs[qrl.last].next ≠ phead0, qrl ≠ [], r ≠ phead0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((phead0 ' + orl0) + qrl, vs, ps, owns), listp((phead0 ' + orl0) + vtail0 ' + qrl0, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (phead0 ' + orl0) + qrl, vhead, vs), nonullRetRefs((phead0 ' + orl0) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(qrl, ps), weak?(owns(vs[qrl.last].next)), r ∈ vs, vs[qrl.last].next ∈ vs, r ∈ qrl0, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, phead ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], vs[qrl.last].next ∈ qrl0, vtail0 ∈ qrl, vtail0 ∈ ps, vtail0 ∈ vs, r ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], vs[qrl.last].next ∈ ps, ¬ dups(orl0 + qrl), ¬ dups(orl0), ¬ dups(qrl), ¬ r ∈ qrl, ¬ phead0 ∈ orl0, ¬ phead0 ∈ qrl, ¬ vs[qrl.last].next ∈ orl0, ¬ vs[qrl.last].next ∈ qrl, ¬ r ∈ 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), phead = phead0 ∨ phead ∈ orl0, (phead0 ' + orl0).last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl0 ≠ [] ∧ (phead0 ' + orl0.butlast).last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs) ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null
Used simplifier rules: ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ a ∈ x → a ∈ x + y; (s) ⊦ a ∈ y → a ∈ x + y; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] inapp-08: ⊦ a ' + x = y + b ' ∧ y ≠ [] → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] ⊦ x.last ∈ x ↔ x ≠ []; (s)
| qrl + vs[qrl.last].next ' = vtail0 ' + qrl0, vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[r].deqID ≠ None, vs[qrl.last].next ≠ null, vs[qrl.last].next ≠ qrl.last, vs[qrl.last].next ≠ phead0, qrl ≠ [], r ≠ phead0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((phead0 ' + orl0) + qrl, vs, ps, owns), listp((phead0 ' + orl0) + vtail0 ' + qrl0, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (phead0 ' + orl0) + qrl, vhead, vs), nonullRetRefs((phead0 ' + orl0) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(qrl, ps), weak?(owns(vs[qrl.last].next)), r ∈ vs, vs[qrl.last].next ∈ vs, r ∈ qrl0, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, phead ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], vs[qrl.last].next ∈ qrl0, vtail0 ∈ qrl, vtail0 ∈ ps, vtail0 ∈ vs, r ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], vs[qrl.last].next ∈ ps, ¬ dups(orl0 + qrl), ¬ dups(orl0), ¬ dups(qrl), ¬ r ∈ qrl, ¬ phead0 ∈ orl0, ¬ phead0 ∈ qrl, ¬ vs[qrl.last].next ∈ orl0, ¬ vs[qrl.last].next ∈ qrl, ¬ r ∈ 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), phead = phead0 ∨ phead ∈ orl0, (phead0 ' + orl0).last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl0 ≠ [] ∧ (phead0 ' + orl0.butlast).last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs) ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null |
Used simplifier rules: ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws) ⊦ a ' + x ≠ []; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a + x = a ' + x; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, tail
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ orl.last = vhead ∧ unmarkedp(qrl0, vs), orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) |
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ (orl + qrl).last, vs[(orl + qrl).last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, orl.last, vs), noid(tid, orl + qrl, orl.last, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ unmarkedp(qrl0, vs), ¬ vs[(orl + qrl).last].next ∈ qrl, ¬ vs[(orl + qrl).last].next ∈ orl, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[orl.last].next ≠ null ∧ vs[vs[orl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.last].next].deqID.tid)) = Claimed(vs[vs[orl.last].next].deqID.tid, vs[vs[orl.last].next].val), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ orl.butlast ≠ [] ∧ orl.butlast.last = orl.last ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ (orl + qrl).last, vs[(orl + qrl).last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, orl.last, vs), noid(tid, orl + qrl, orl.last, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ unmarkedp(qrl0, vs), ¬ vs[(orl + qrl).last].next ∈ qrl, ¬ vs[(orl + qrl).last].next ∈ orl, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[orl.last].next ≠ null ∧ vs[vs[orl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.last].next].deqID.tid)) = Claimed(vs[vs[orl.last].next].deqID.tid, vs[vs[orl.last].next].val), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ orl.butlast ≠ [] ∧ orl.butlast.last = orl.last ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) |
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, orl = orl0 + phead0 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ (orl + qrl).last, vs[(orl + qrl).last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead0, vs), noid(tid, orl + qrl, phead0, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ unmarkedp(qrl0, vs), ¬ vs[(orl + qrl).last].next ∈ qrl, ¬ vs[(orl + qrl).last].next ∈ orl, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ⊦ orl0 ≠ [] ∧ orl0.last = phead0 ∧ phead ≠ phead0 ∧ unmarkedp(qrl, vs)
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, phead0, y
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, orl = orl0 + phead0 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ (orl + qrl).last, vs[(orl + qrl).last].next ≠ null, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead0, vs), noid(tid, orl + qrl, phead0, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ unmarkedp(qrl0, vs), ¬ vs[(orl + qrl).last].next ∈ qrl, ¬ vs[(orl + qrl).last].next ∈ orl, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ⊦ orl0 ≠ [] ∧ orl0.last = phead0 ∧ phead ≠ phead0 ∧ unmarkedp(qrl, vs) |
qrl + vs[(phead0 ' + qrl).last].next ' = ps[(phead0 ' + qrl).last, ps[(phead0 ' + qrl).last].next:= vs[(phead0 ' + qrl).last].next][phead0].next ' + qrl0, vs[vs[(phead0 ' + qrl).last].next].deqID = None, vs[vs[(phead0 ' + qrl).last].next].next = null, ps[vs[(phead0 ' + qrl).last].next] = vs[vs[(phead0 ' + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(phead0 ' + qrl).last].next ≠ (phead0 ' + qrl).last, vs[(phead0 ' + qrl).last].next ≠ null, vs[(phead0 ' + qrl).last].next ≠ phead0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + phead0 ') + qrl, vs, ps, owns), listp (orl0 + phead0 ' + qrl + vs[(phead0 ' + qrl).last].next ', vs, ps[(phead0 ' + qrl).last, ps[(phead0 ' + qrl).last].next:= vs[(phead0 ' + qrl).last].next], owns(vs[(phead0 ' + qrl).last].next; None)), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, phead0, vs), noid(tid, (orl0 + phead0 ') + qrl, phead0, vs), nonullRetRefs((orl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(qrl, ps), weak?(owns(vs[(phead0 ' + qrl).last].next)), phead ∈ ps[(phead0 ' + qrl).last, ps[(phead0 ' + qrl).last].next:= vs[(phead0 ' + qrl).last].next], vs[(phead0 ' + qrl).last].next ∈ vs, vs[(phead0 ' + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl0 + qrl), ¬ dups(orl0), ¬ dups(qrl), ¬ unmarkedp(qrl0, vs), ¬ phead0 ∈ orl0, ¬ phead0 ∈ qrl, ¬ vs[(phead0 ' + qrl).last].next ∈ qrl, ¬ vs[(phead0 ' + qrl).last].next ∈ orl0, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ orl0 ∨ phead = phead0, (phead0 ' + qrl).last ∈ orl0 ∨ (phead0 ' + qrl).last = phead0 ∨ (phead0 ' + qrl).last ∈ qrl, vs[(phead0 ' + qrl).last].next = ps[(phead0 ' + qrl).last, ps[(phead0 ' + qrl).last].next:= vs[(phead0 ' + qrl).last].next][phead0].next ∨ vs[(phead0 ' + qrl).last].next ∈ qrl0, ps[(phead0 ' + qrl).last, ps[(phead0 ' + qrl).last].next:= vs[(phead0 ' + qrl).last].next][phead0].next ∈ qrl ∨ ps[(phead0 ' + qrl).last, ps[(phead0 ' + qrl).last].next:= vs[(phead0 ' + qrl).last].next][phead0].next = vs[(phead0 ' + qrl).last].next ⊦ orl0 ≠ [] ∧ orl0.last = phead0 ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs)
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) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ 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)
| qrl + vs[(phead0 ' + qrl).last].next ' = ps[(phead0 ' + qrl).last, ps[(phead0 ' + qrl).last].next:= vs[(phead0 ' + qrl).last].next][phead0].next ' + qrl0, vs[vs[(phead0 ' + qrl).last].next].deqID = None, vs[vs[(phead0 ' + qrl).last].next].next = null, ps[vs[(phead0 ' + qrl).last].next] = vs[vs[(phead0 ' + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(phead0 ' + qrl).last].next ≠ (phead0 ' + qrl).last, vs[(phead0 ' + qrl).last].next ≠ null, vs[(phead0 ' + qrl).last].next ≠ phead0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + phead0 ') + qrl, vs, ps, owns), listp (orl0 + phead0 ' + qrl + vs[(phead0 ' + qrl).last].next ', vs, ps[(phead0 ' + qrl).last, ps[(phead0 ' + qrl).last].next:= vs[(phead0 ' + qrl).last].next], owns(vs[(phead0 ' + qrl).last].next; None)), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, phead0, vs), noid(tid, (orl0 + phead0 ') + qrl, phead0, vs), nonullRetRefs((orl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(qrl, ps), weak?(owns(vs[(phead0 ' + qrl).last].next)), phead ∈ ps[(phead0 ' + qrl).last, ps[(phead0 ' + qrl).last].next:= vs[(phead0 ' + qrl).last].next], vs[(phead0 ' + qrl).last].next ∈ vs, vs[(phead0 ' + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl0 + qrl), ¬ dups(orl0), ¬ dups(qrl), ¬ unmarkedp(qrl0, vs), ¬ phead0 ∈ orl0, ¬ phead0 ∈ qrl, ¬ vs[(phead0 ' + qrl).last].next ∈ qrl, ¬ vs[(phead0 ' + qrl).last].next ∈ orl0, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ orl0 ∨ phead = phead0, (phead0 ' + qrl).last ∈ orl0 ∨ (phead0 ' + qrl).last = phead0 ∨ (phead0 ' + qrl).last ∈ qrl, vs[(phead0 ' + qrl).last].next = ps[(phead0 ' + qrl).last, ps[(phead0 ' + qrl).last].next:= vs[(phead0 ' + qrl).last].next][phead0].next ∨ vs[(phead0 ' + qrl).last].next ∈ qrl0, ps[(phead0 ' + qrl).last, ps[(phead0 ' + qrl).last].next:= vs[(phead0 ' + qrl).last].next][phead0].next ∈ qrl ∨ ps[(phead0 ' + qrl).last, ps[(phead0 ' + qrl).last].next:= vs[(phead0 ' + qrl).last].next][phead0].next = vs[(phead0 ' + qrl).last].next ⊦ orl0 ≠ [] ∧ orl0.last = phead0 ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs) |
⊦ y ≠ [] → (x + y).last = y.last
qrl + vs[qrl.last].next ' = ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][phead0].next ' + qrl0, vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[qrl.last].next ≠ qrl.last, vs[qrl.last].next ≠ null, vs[qrl.last].next ≠ phead0, qrl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + phead0 ' + qrl + vs[qrl.last].next ', vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)), listp((orl0 + phead0 ') + qrl, vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, phead0, vs), noid(tid, (orl0 + phead0 ') + qrl, phead0, vs), nonullRetRefs((orl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(qrl, ps), weak?(owns(vs[qrl.last].next)), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, phead ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], ¬ dups(orl0 + qrl), ¬ dups(orl0), ¬ dups(qrl), ¬ unmarkedp(qrl0, vs), ¬ phead0 ∈ orl0, ¬ phead0 ∈ qrl, ¬ vs[qrl.last].next ∈ qrl, ¬ vs[qrl.last].next ∈ orl0, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][phead0].next ∈ qrl ∨ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][phead0].next = vs[qrl.last].next, vs[qrl.last].next = ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][phead0].next ∨ vs[qrl.last].next ∈ qrl0, qrl.last ∈ orl0 ∨ qrl.last = phead0 ∨ qrl.last ∈ qrl, phead ∈ orl0 ∨ phead = phead0 ⊦ orl0 ≠ [] ∧ orl0.last = phead0 ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs)
Used simplifier rules: ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).next = nxt; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) ⊦ unmarkedp([], vs); (s) Used terms: phead0 ', qrl
| ⊦ y ≠ [] → (x + y).last = y.last |
| qrl + vs[qrl.last].next ' = ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][phead0].next ' + qrl0, vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[qrl.last].next ≠ qrl.last, vs[qrl.last].next ≠ null, vs[qrl.last].next ≠ phead0, qrl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + phead0 ' + qrl + vs[qrl.last].next ', vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)), listp((orl0 + phead0 ') + qrl, vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, phead0, vs), noid(tid, (orl0 + phead0 ') + qrl, phead0, vs), nonullRetRefs((orl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(qrl, ps), weak?(owns(vs[qrl.last].next)), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, phead ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], ¬ dups(orl0 + qrl), ¬ dups(orl0), ¬ dups(qrl), ¬ unmarkedp(qrl0, vs), ¬ phead0 ∈ orl0, ¬ phead0 ∈ qrl, ¬ vs[qrl.last].next ∈ qrl, ¬ vs[qrl.last].next ∈ orl0, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][phead0].next ∈ qrl ∨ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][phead0].next = vs[qrl.last].next, vs[qrl.last].next = ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][phead0].next ∨ vs[qrl.last].next ∈ qrl0, qrl.last ∈ orl0 ∨ qrl.last = phead0 ∨ qrl.last ∈ qrl, phead ∈ orl0 ∨ phead = phead0 ⊦ orl0 ≠ [] ∧ orl0.last = phead0 ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs) |
qrl + vs[qrl.last].next ' = ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][phead0].next ' + qrl0, vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[qrl.last].next ≠ phead0, vs[qrl.last].next ≠ null, vs[qrl.last].next ≠ qrl.last, qrl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + phead0 ' + qrl + vs[qrl.last].next ', vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)), listp((orl0 + phead0 ') + qrl, vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, phead0, vs), noid(tid, (orl0 + phead0 ') + qrl, phead0, vs), nonullRetRefs((orl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(qrl.tail, vs), unmarkedp(qrl, ps), weak?(owns(vs[qrl.last].next)), ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][phead0].next ∈ qrl, vs[qrl.last].next ∈ qrl0, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, phead ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][phead0].next ∈ vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][phead0].next ∈ ps, ¬ dups(qrl), ¬ dups(orl0), ¬ dups(orl0 + qrl), ¬ unmarkedp(qrl0, vs), ¬ vs[qrl.last].next ∈ orl0, ¬ vs[qrl.last].next ∈ qrl, ¬ phead0 ∈ qrl, ¬ phead0 ∈ orl0, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ orl0 ∨ phead = phead0 ⊦ orl0 ≠ [] ∧ orl0.last = phead0 ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ a ∈ x → a ∈ x + y; (s) ⊦ a ∈ y → a ∈ x + y; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] inapp-08: ⊦ a ' + x = y + b ' ∧ y ≠ [] → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] ⊦ x.last ∈ x ↔ x ≠ []; (s)
| qrl + vs[qrl.last].next ' = ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][phead0].next ' + qrl0, vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[qrl.last].next ≠ phead0, vs[qrl.last].next ≠ null, vs[qrl.last].next ≠ qrl.last, qrl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + phead0 ' + qrl + vs[qrl.last].next ', vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)), listp((orl0 + phead0 ') + qrl, vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, phead0, vs), noid(tid, (orl0 + phead0 ') + qrl, phead0, vs), nonullRetRefs((orl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(qrl.tail, vs), unmarkedp(qrl, ps), weak?(owns(vs[qrl.last].next)), ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][phead0].next ∈ qrl, vs[qrl.last].next ∈ qrl0, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, phead ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][phead0].next ∈ vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][phead0].next ∈ ps, ¬ dups(qrl), ¬ dups(orl0), ¬ dups(orl0 + qrl), ¬ unmarkedp(qrl0, vs), ¬ vs[qrl.last].next ∈ orl0, ¬ vs[qrl.last].next ∈ qrl, ¬ phead0 ∈ qrl, ¬ phead0 ∈ orl0, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ orl0 ∨ phead = phead0 ⊦ orl0 ≠ [] ∧ orl0.last = phead0 ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs) |
Used simplifier rules: ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws) ⊦ a ' + x ≠ []; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a + x = a ' + x; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) 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] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, tail
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noid(tid, orl + vtail0 ' + qrl0, vhead, vs), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ |
⊦ noid(tid, rl, r, vs) → (noid(tid, rl0, r, vs0) ↔ (∀ r0. (r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) → r0 ≠ r ∧ r0 ∈ rl0 from r → vs0[r0].deqID ≠ Some(tid)))
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), ∃ r0. ¬ ((r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead → vs[r0].deqID ≠ Some(tid)) → r0 ≠ vhead ∧ r0 ∈ orl + vtail0 ' + qrl0 from vhead → vs[r0].deqID ≠ Some(tid)), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used terms: orl + qrl, tid, vhead, vs, orl + vtail0 ' + qrl0, vs
| ⊦ noid(tid, rl, r, vs) → (noid(tid, rl0, r, vs0) ↔ (∀ r0. (r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) → r0 ≠ r ∧ r0 ∈ rl0 from r → vs0[r0].deqID ≠ Some(tid))) |
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), ∃ r0. ¬ ((r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead → vs[r0].deqID ≠ Some(tid)) → r0 ≠ vhead ∧ r0 ∈ orl + vtail0 ' + qrl0 from vhead → vs[r0].deqID ≠ Some(tid)), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[r0].deqID = Some(tid), vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), r0 ∈ orl + vtail0 ' + qrl0 from vhead, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ qrl, ¬ r0 ∈ 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[r0].deqID = Some(tid), vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), r0 ∈ orl + vtail0 ' + qrl0 from vhead, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ qrl, ¬ r0 ∈ 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[r0].deqID = Some(tid), vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = [], rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], r0 ∈ orl + vtail0 ' + qrl0 from vhead, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ qrl, ¬ r0 ∈ 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), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
qrl + vs[qrl.last].next ' = vtail0 ' + qrl0, vs[vs[qrl.last].next].deqID = None, vs[r0].deqID = Some(tid), vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[qrl.last].next ≠ null, vs[qrl.last].next ≠ qrl.last, orl ≠ [], qrl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp((orl + qrl) + vs[qrl.last].next ', vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)), 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), weak?(owns(vs[qrl.last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, phead ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], r0 ∈ orl + vtail0 ' + qrl0 from vhead, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vs[qrl.last].next ∈ orl, ¬ vs[qrl.last].next ∈ qrl, ¬ r0 ∈ 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), vtail0 ∈ qrl ∨ vtail0 = vs[qrl.last].next, vs[qrl.last].next = vtail0 ∨ vs[qrl.last].next ∈ qrl0, qrl.last ∈ orl ∨ qrl.last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used terms: orl, qrl
| ⊦ y ≠ [] → (x + y).last = y.last |
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[r0].deqID = Some(tid), vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = [], rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], r0 ∈ orl + vtail0 ' + qrl0 from vhead, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ qrl, ¬ r0 ∈ 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), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[r0].deqID = Some(tid), vs[vs[orl.last].next].deqID = None, vs[vs[orl.last].next].next = null, ps[vs[orl.last].next] = vs[vs[orl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[orl.last].next ≠ null, vs[orl.last].next ≠ orl.last, orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vs[orl.last].next ', vs, ps[orl.last, ps[orl.last].next:= vs[orl.last].next], owns(vs[orl.last].next; None)), listp(orl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl, vhead, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[orl.last].next)), r0 ∈ orl + vs[orl.last].next ' from vhead, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, phead ∈ ps[orl.last, ps[orl.last].next:= vs[orl.last].next], vs[orl.last].next ∈ ps, vs[orl.last].next ∈ vs, ¬ dups(orl), ¬ vs[orl.last].next ∈ orl, ¬ r0 ∈ orl 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 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ listp-nextoflast: ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next)); (forward) from specification DMSQ ⊦ ¬ a ∈ []; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ [] + x = x; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws)
| vs[r0].deqID = Some(tid), vs[vs[orl.last].next].deqID = None, vs[vs[orl.last].next].next = null, ps[vs[orl.last].next] = vs[vs[orl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[orl.last].next ≠ null, vs[orl.last].next ≠ orl.last, orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vs[orl.last].next ', vs, ps[orl.last, ps[orl.last].next:= vs[orl.last].next], owns(vs[orl.last].next; None)), listp(orl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl, vhead, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[orl.last].next)), r0 ∈ orl + vs[orl.last].next ' from vhead, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, phead ∈ ps[orl.last, ps[orl.last].next:= vs[orl.last].next], vs[orl.last].next ∈ ps, vs[orl.last].next ∈ vs, ¬ dups(orl), ¬ vs[orl.last].next ∈ orl, ¬ r0 ∈ orl 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 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ⊦ |
vs[vs[phead0].next].deqID = None, vs[r0].deqID = Some(tid), vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl = orl0 + phead0 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl, vs, ps, owns), listp(orl + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl, vhead, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, r0 ∈ orl + vs[phead0].next ' from vhead, ¬ dups(orl), ¬ vs[phead0].next ∈ orl, ¬ r0 ∈ orl 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), phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, phead0, y
| vs[vs[phead0].next].deqID = None, vs[r0].deqID = Some(tid), vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl = orl0 + phead0 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl, vs, ps, owns), listp(orl + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl, vhead, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, r0 ∈ orl + vs[phead0].next ' from vhead, ¬ dups(orl), ¬ vs[phead0].next ∈ orl, ¬ r0 ∈ orl 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), phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ⊦ |
vs[r0].deqID = Some(tid), vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), listp(orl0 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + phead0 ', vhead, vs), nonullRetRefs(orl0 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), weak?(owns(vs[phead0].next)), r0 ∈ (orl0 + phead0 ') + vs[phead0].next ' from vhead, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl0), ¬ r0 ∈ orl0 + phead0 ' from vhead, ¬ phead0 ∈ orl0, ¬ vs[phead0].next ∈ 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), phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0, phead ∈ orl0 ∨ phead = phead0 ⊦
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)
| vs[r0].deqID = Some(tid), vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), listp(orl0 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + phead0 ', vhead, vs), nonullRetRefs(orl0 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), weak?(owns(vs[phead0].next)), r0 ∈ (orl0 + phead0 ') + vs[phead0].next ' from vhead, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl0), ¬ r0 ∈ orl0 + phead0 ' from vhead, ¬ phead0 ∈ orl0, ¬ vs[phead0].next ∈ 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), phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0, phead ∈ orl0 ∨ phead = phead0 ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ None ≠ Some(tid); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ a ∈ []; (s) ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s) ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) Used terms: orl0 + phead0 ', vs[phead0].next ', vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| qrl + vs[qrl.last].next ' = vtail0 ' + qrl0, vs[vs[qrl.last].next].deqID = None, vs[r0].deqID = Some(tid), vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[qrl.last].next ≠ null, vs[qrl.last].next ≠ qrl.last, orl ≠ [], qrl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp((orl + qrl) + vs[qrl.last].next ', vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)), 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), weak?(owns(vs[qrl.last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, phead ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], r0 ∈ orl + vtail0 ' + qrl0 from vhead, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vs[qrl.last].next ∈ orl, ¬ vs[qrl.last].next ∈ qrl, ¬ r0 ∈ 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), vtail0 ∈ qrl ∨ vtail0 = vs[qrl.last].next, vs[qrl.last].next = vtail0 ∨ vs[qrl.last].next ∈ qrl0, qrl.last ∈ orl ∨ qrl.last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
qrl + vs[qrl.last].next ' = vtail0 ' + qrl0, vs[vs[qrl.last].next].deqID = None, vs[r0].deqID = Some(tid), vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[qrl.last].next ≠ qrl.last, vs[qrl.last].next ≠ null, orl ≠ [], qrl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp((orl + qrl) + vs[qrl.last].next ', vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)), 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), weak?(owns(vs[qrl.last].next)), vtail0 ∈ qrl, vs[qrl.last].next ∈ qrl0, phead ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, r0 ∈ orl + vtail0 ' + qrl0 from vhead, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ r0 ∈ orl + qrl from vhead, ¬ vs[qrl.last].next ∈ qrl, ¬ vs[qrl.last].next ∈ 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), orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ a ∈ x → a ∈ x + y; (s) ⊦ a ∈ y → a ∈ x + y; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] inapp-08: ⊦ a ' + x = y + b ' ∧ y ≠ [] → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] ⊦ x.last ∈ x ↔ x ≠ []; (s)
| qrl + vs[qrl.last].next ' = vtail0 ' + qrl0, vs[vs[qrl.last].next].deqID = None, vs[r0].deqID = Some(tid), vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[qrl.last].next ≠ qrl.last, vs[qrl.last].next ≠ null, orl ≠ [], qrl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp((orl + qrl) + vs[qrl.last].next ', vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)), 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), weak?(owns(vs[qrl.last].next)), vtail0 ∈ qrl, vs[qrl.last].next ∈ qrl0, phead ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, r0 ∈ orl + vtail0 ' + qrl0 from vhead, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ r0 ∈ orl + qrl from vhead, ¬ vs[qrl.last].next ∈ qrl, ¬ vs[qrl.last].next ∈ 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), orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
qrl + vs[qrl.last].next ' = vtail0 ' + qrl0, vs[r0].deqID = Some(tid), vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = phead0 + orl0, rvowns(vretRefs(tid)) = Pending(tid), vs[qrl.last].next ≠ qrl.last, vs[qrl.last].next ≠ null, orl ≠ [], qrl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + qrl) + vs[qrl.last].next ', vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)), 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), weak?(owns(vs[qrl.last].next)), vtail0 ∈ ps, vtail0 ∈ vs, r0 ∈ orl + vtail0 ' + qrl0 from vhead, vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, phead ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], vs[qrl.last].next ∈ qrl0, vtail0 ∈ qrl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ r0 ∈ orl + qrl from vhead, ¬ vs[qrl.last].next ∈ qrl, ¬ vs[qrl.last].next ∈ 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), 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
| qrl + vs[qrl.last].next ' = vtail0 ' + qrl0, vs[r0].deqID = Some(tid), vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = phead0 + orl0, rvowns(vretRefs(tid)) = Pending(tid), vs[qrl.last].next ≠ qrl.last, vs[qrl.last].next ≠ null, orl ≠ [], qrl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + qrl) + vs[qrl.last].next ', vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)), 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), weak?(owns(vs[qrl.last].next)), vtail0 ∈ ps, vtail0 ∈ vs, r0 ∈ orl + vtail0 ' + qrl0 from vhead, vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, phead ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], vs[qrl.last].next ∈ qrl0, vtail0 ∈ qrl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ r0 ∈ orl + qrl from vhead, ¬ vs[qrl.last].next ∈ qrl, ¬ vs[qrl.last].next ∈ 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), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
ps[vtail0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[(vtail0 ' + orl0).last].next].deqID = None, vs[vs[(vtail0 ' + orl0).last].next].next = null, ps[vs[(vtail0 ' + orl0).last].next] = vs[vs[(vtail0 ' + orl0).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(vtail0 ' + orl0).last].next ≠ vtail0, vs[(vtail0 ' + orl0).last].next ≠ null, vs[(vtail0 ' + orl0).last].next ≠ (vtail0 ' + orl0).last, orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp (orl + (vtail0 ' + orl0) + vs[(vtail0 ' + orl0).last].next ', vs, ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next], owns(vs[(vtail0 ' + orl0).last].next; None)), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[(vtail0 ' + orl0).last].next)), vtail0 ∈ ps, vtail0 ∈ vs, r0 ∈ orl + vtail0 ' + orl0 + vs[(vtail0 ' + orl0).last].next ' from vhead, vs[(vtail0 ' + orl0).last].next ∈ vs, vs[(vtail0 ' + orl0).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, phead ∈ ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next], ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vs[(vtail0 ' + orl0).last].next ∈ orl, ¬ vs[(vtail0 ' + orl0).last].next ∈ orl0, ¬ r0 ∈ orl + vtail0 ' + orl0 from vhead, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ 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[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[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(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ' + x ≠ []; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)
| ps[vtail0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[(vtail0 ' + orl0).last].next].deqID = None, vs[vs[(vtail0 ' + orl0).last].next].next = null, ps[vs[(vtail0 ' + orl0).last].next] = vs[vs[(vtail0 ' + orl0).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(vtail0 ' + orl0).last].next ≠ vtail0, vs[(vtail0 ' + orl0).last].next ≠ null, vs[(vtail0 ' + orl0).last].next ≠ (vtail0 ' + orl0).last, orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp (orl + (vtail0 ' + orl0) + vs[(vtail0 ' + orl0).last].next ', vs, ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next], owns(vs[(vtail0 ' + orl0).last].next; None)), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[(vtail0 ' + orl0).last].next)), vtail0 ∈ ps, vtail0 ∈ vs, r0 ∈ orl + vtail0 ' + orl0 + vs[(vtail0 ' + orl0).last].next ' from vhead, vs[(vtail0 ' + orl0).last].next ∈ vs, vs[(vtail0 ' + orl0).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, phead ∈ ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next], ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vs[(vtail0 ' + orl0).last].next ∈ orl, ¬ vs[(vtail0 ' + orl0).last].next ∈ orl0, ¬ r0 ∈ orl + vtail0 ' + orl0 from vhead, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ 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[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
vs[vs[(vtail0 ' + orl0).last].next].deqID = None, vs[r0].deqID = Some(tid), ps[vtail0].deqID = None, vs[vs[(vtail0 ' + orl0).last].next].next = null, ps[vs[(vtail0 ' + orl0).last].next] = vs[vs[(vtail0 ' + orl0).last].next], dom vrvHp = dom prvHp, orl0 = [], pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(vtail0 ' + orl0).last].next ≠ vtail0, vs[(vtail0 ' + orl0).last].next ≠ null, vs[(vtail0 ' + orl0).last].next ≠ (vtail0 ' + orl0).last, orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), listp (orl + (vtail0 ' + orl0) + vs[(vtail0 ' + orl0).last].next ', vs, ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next], owns(vs[(vtail0 ' + orl0).last].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[(vtail0 ' + orl0).last].next)), phead ∈ ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next], phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(vtail0 ' + orl0).last].next ∈ ps, vs[(vtail0 ' + orl0).last].next ∈ vs, r0 ∈ orl + vtail0 ' + orl0 + vs[(vtail0 ' + orl0).last].next ' from vhead, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vs[(vtail0 ' + orl0).last].next ∈ orl, ¬ vs[(vtail0 ' + orl0).last].next ∈ orl0, ¬ r0 ∈ orl + vtail0 ' + orl0 from vhead, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ 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[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
vs[vs[orl0.last].next].deqID = None, vs[r0].deqID = Some(tid), ps[vtail0].deqID = None, vs[vs[orl0.last].next].next = null, ps[vs[orl0.last].next] = vs[vs[orl0.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[orl0.last].next ≠ vtail0, vs[orl0.last].next ≠ null, vs[orl0.last].next ≠ orl0.last, orl ≠ [], orl0 ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), listp(orl + (vtail0 ' + orl0) + vs[orl0.last].next ', vs, ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next], owns(vs[orl0.last].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[orl0.last].next)), phead ∈ ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next], phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[orl0.last].next ∈ ps, vs[orl0.last].next ∈ vs, r0 ∈ orl + vtail0 ' + orl0 + vs[orl0.last].next ' from vhead, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vs[orl0.last].next ∈ orl, ¬ vs[orl0.last].next ∈ orl0, ¬ r0 ∈ orl + vtail0 ' + orl0 from vhead, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ 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[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used terms: vtail0 ', orl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| vs[vs[(vtail0 ' + orl0).last].next].deqID = None, vs[r0].deqID = Some(tid), ps[vtail0].deqID = None, vs[vs[(vtail0 ' + orl0).last].next].next = null, ps[vs[(vtail0 ' + orl0).last].next] = vs[vs[(vtail0 ' + orl0).last].next], dom vrvHp = dom prvHp, orl0 = [], pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(vtail0 ' + orl0).last].next ≠ vtail0, vs[(vtail0 ' + orl0).last].next ≠ null, vs[(vtail0 ' + orl0).last].next ≠ (vtail0 ' + orl0).last, orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), listp (orl + (vtail0 ' + orl0) + vs[(vtail0 ' + orl0).last].next ', vs, ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next], owns(vs[(vtail0 ' + orl0).last].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[(vtail0 ' + orl0).last].next)), phead ∈ ps[(vtail0 ' + orl0).last, ps[(vtail0 ' + orl0).last].next:= vs[(vtail0 ' + orl0).last].next], phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(vtail0 ' + orl0).last].next ∈ ps, vs[(vtail0 ' + orl0).last].next ∈ vs, r0 ∈ orl + vtail0 ' + orl0 + vs[(vtail0 ' + orl0).last].next ' from vhead, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vs[(vtail0 ' + orl0).last].next ∈ orl, ¬ vs[(vtail0 ' + orl0).last].next ∈ orl0, ¬ r0 ∈ orl + vtail0 ' + orl0 from vhead, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ 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[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
ps[vtail0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[vtail0].next].deqID = None, vs[vs[vtail0].next].next = null, ps[vs[vtail0].next] = vs[vs[vtail0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vtail0].next ≠ null, vs[vtail0].next ≠ vtail0, orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + vs[vtail0].next ', vs, ps[vtail0, ps[vtail0].next:= vs[vtail0].next], owns(vs[vtail0].next; None)), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[vtail0].next)), vtail0 ∈ ps, vtail0 ∈ vs, r0 ∈ orl + vtail0 ' + vs[vtail0].next ' from vhead, vs[vtail0].next ∈ vs, vs[vtail0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, phead ∈ ps[vtail0, ps[vtail0].next:= vs[vtail0].next], ¬ dups(orl), ¬ vtail0 ∈ orl, ¬ vs[vtail0].next ∈ orl, ¬ r0 ∈ orl + vtail0 ' 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 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ unmarkedp([], vs); (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ dups([]); (s) ⊦ [] + x = x; (s)
| ps[vtail0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[vtail0].next].deqID = None, vs[vs[vtail0].next].next = null, ps[vs[vtail0].next] = vs[vs[vtail0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vtail0].next ≠ null, vs[vtail0].next ≠ vtail0, orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + vs[vtail0].next ', vs, ps[vtail0, ps[vtail0].next:= vs[vtail0].next], owns(vs[vtail0].next; None)), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[vtail0].next)), vtail0 ∈ ps, vtail0 ∈ vs, r0 ∈ orl + vtail0 ' + vs[vtail0].next ' from vhead, vs[vtail0].next ∈ vs, vs[vtail0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, phead ∈ ps[vtail0, ps[vtail0].next:= vs[vtail0].next], ¬ dups(orl), ¬ vtail0 ∈ orl, ¬ vs[vtail0].next ∈ orl, ¬ r0 ∈ orl + vtail0 ' 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 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
vs[vs[vtail0].next].deqID = None, vs[r0].deqID = Some(tid), ps[vtail0].deqID = None, vs[vs[vtail0].next].next = null, ps[vs[vtail0].next] = vs[vs[vtail0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vtail0].next ≠ null, vs[vtail0].next ≠ vtail0, orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ', vs, ps, owns), listp(orl + vtail0 ' + vs[vtail0].next ', vs, ps[vtail0, ps[vtail0].next:= vs[vtail0].next], owns(vs[vtail0].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[vtail0].next)), phead ∈ ps[vtail0, ps[vtail0].next:= vs[vtail0].next], phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[vtail0].next ∈ ps, vs[vtail0].next ∈ vs, r0 ∈ orl + vtail0 ' + vs[vtail0].next ' from vhead, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(orl), ¬ vhead ∈ orl, ¬ vtail0 ∈ orl, ¬ vs[vtail0].next ∈ orl, ¬ r0 ∈ orl + vtail0 ' 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 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ⊦
Used simplifier rules: ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) 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 a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ None ≠ Some(tid); (s) Used terms: orl, vtail0 ' + vs[vtail0].next ', vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs[vs[vtail0].next].deqID = None, vs[r0].deqID = Some(tid), ps[vtail0].deqID = None, vs[vs[vtail0].next].next = null, ps[vs[vtail0].next] = vs[vs[vtail0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vtail0].next ≠ null, vs[vtail0].next ≠ vtail0, orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ', vs, ps, owns), listp(orl + vtail0 ' + vs[vtail0].next ', vs, ps[vtail0, ps[vtail0].next:= vs[vtail0].next], owns(vs[vtail0].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[vtail0].next)), phead ∈ ps[vtail0, ps[vtail0].next:= vs[vtail0].next], phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[vtail0].next ∈ ps, vs[vtail0].next ∈ vs, r0 ∈ orl + vtail0 ' + vs[vtail0].next ' from vhead, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(orl), ¬ vhead ∈ orl, ¬ vtail0 ∈ orl, ¬ vs[vtail0].next ∈ orl, ¬ r0 ∈ orl + vtail0 ' 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 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ⊦ |
vs[vtail0].deqID = None, ps[vtail0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[vtail0].next].deqID = None, vs[vs[vtail0].next].next = null, ps[vs[vtail0].next] = vs[vs[vtail0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl.last ≠ orl.butlast.last, vs[vtail0].next ≠ null, vs[vtail0].next ≠ vtail0, orl ≠ orl.head ', orl ≠ [], phead ≠ orl.last, r0 ≠ orl.butlast.last, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + vs[vtail0].next ', vs, ps[vtail0, ps[vtail0].next:= vs[vtail0].next], owns(vs[vtail0].next; None)), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, orl.butlast.last, vs), noid(tid, orl + vtail0 ', orl.butlast.last, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[vtail0].next)), vs[vtail0].next ∈ vs, vs[vtail0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, phead ∈ ps[vtail0, ps[vtail0].next:= vs[vtail0].next], vtail0 ∈ ps, vtail0 ∈ vs, r0 ∈ vtail0 ' + vs[vtail0].next ' from orl.butlast.last, ¬ dups(orl), ¬ orl.butlast.last ∈ orl, ¬ vtail0 ∈ orl, ¬ vs[vtail0].next ∈ orl, ¬ r0 ∈ (vtail0 = orl.butlast.last ⊃ orl.butlast.last ';[]), 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) ⊦
Used simplifier rules: ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss) ⊦ x.last ∈ x ↔ x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| vs[vtail0].deqID = None, ps[vtail0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[vtail0].next].deqID = None, vs[vs[vtail0].next].next = null, ps[vs[vtail0].next] = vs[vs[vtail0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl.last ≠ orl.butlast.last, vs[vtail0].next ≠ null, vs[vtail0].next ≠ vtail0, orl ≠ orl.head ', orl ≠ [], phead ≠ orl.last, r0 ≠ orl.butlast.last, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + vs[vtail0].next ', vs, ps[vtail0, ps[vtail0].next:= vs[vtail0].next], owns(vs[vtail0].next; None)), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, orl.butlast.last, vs), noid(tid, orl + vtail0 ', orl.butlast.last, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[vtail0].next)), vs[vtail0].next ∈ vs, vs[vtail0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, phead ∈ ps[vtail0, ps[vtail0].next:= vs[vtail0].next], vtail0 ∈ ps, vtail0 ∈ vs, r0 ∈ vtail0 ' + vs[vtail0].next ' from orl.butlast.last, ¬ dups(orl), ¬ orl.butlast.last ∈ orl, ¬ vtail0 ∈ orl, ¬ vs[vtail0].next ∈ orl, ¬ r0 ∈ (vtail0 = orl.butlast.last ⊃ orl.butlast.last ';[]), 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) ⊦ |
vs[vs[vtail0].next].deqID = None, vs[r0].deqID = Some(tid), ps[vtail0].deqID = None, vs[vtail0].deqID = None, vs[vs[vtail0].next].next = null, ps[vs[vtail0].next] = vs[vs[vtail0].next], dom vrvHp = dom prvHp, orl = phead0 + orl0, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl.last ≠ orl.butlast.last, vs[vtail0].next ≠ null, vs[vtail0].next ≠ vtail0, orl ≠ phead0 ', orl ≠ [], phead ≠ orl.last, r0 ≠ orl.butlast.last, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ', vs, ps, owns), listp(orl + vtail0 ' + vs[vtail0].next ', vs, ps[vtail0, ps[vtail0].next:= vs[vtail0].next], owns(vs[vtail0].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, orl.butlast.last, vs), noid(tid, orl + vtail0 ', orl.butlast.last, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[vtail0].next)), r0 ∈ vtail0 ' + vs[vtail0].next ' from orl.butlast.last, vtail0 ∈ vs, vtail0 ∈ ps, phead ∈ ps[vtail0, ps[vtail0].next:= vs[vtail0].next], phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[vtail0].next ∈ ps, vs[vtail0].next ∈ vs, ¬ dups(orl), ¬ orl.butlast.last ∈ orl, ¬ vtail0 ∈ orl, ¬ vs[vtail0].next ∈ orl, ¬ r0 ∈ (vtail0 = orl.butlast.last ⊃ orl.butlast.last ';[]), 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) ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: orl, head, tail
| vs[vs[vtail0].next].deqID = None, vs[r0].deqID = Some(tid), ps[vtail0].deqID = None, vs[vtail0].deqID = None, vs[vs[vtail0].next].next = null, ps[vs[vtail0].next] = vs[vs[vtail0].next], dom vrvHp = dom prvHp, orl = phead0 + orl0, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl.last ≠ orl.butlast.last, vs[vtail0].next ≠ null, vs[vtail0].next ≠ vtail0, orl ≠ phead0 ', orl ≠ [], phead ≠ orl.last, r0 ≠ orl.butlast.last, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ', vs, ps, owns), listp(orl + vtail0 ' + vs[vtail0].next ', vs, ps[vtail0, ps[vtail0].next:= vs[vtail0].next], owns(vs[vtail0].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, orl.butlast.last, vs), noid(tid, orl + vtail0 ', orl.butlast.last, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[vtail0].next)), r0 ∈ vtail0 ' + vs[vtail0].next ' from orl.butlast.last, vtail0 ∈ vs, vtail0 ∈ ps, phead ∈ ps[vtail0, ps[vtail0].next:= vs[vtail0].next], phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[vtail0].next ∈ ps, vs[vtail0].next ∈ vs, ¬ dups(orl), ¬ orl.butlast.last ∈ orl, ¬ vtail0 ∈ orl, ¬ vs[vtail0].next ∈ orl, ¬ r0 ∈ (vtail0 = orl.butlast.last ⊃ orl.butlast.last ';[]), 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) ⊦ |
vs[vtail0].deqID = None, ps[vtail0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[vtail0].next].deqID = None, vs[vs[vtail0].next].next = null, ps[vs[vtail0].next] = vs[vs[vtail0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl0.last ≠ (phead0 ' + orl0.butlast).last, (phead0 ' + orl0.butlast).last ≠ phead0, vs[vtail0].next ≠ null, vs[vtail0].next ≠ vtail0, vs[vtail0].next ≠ phead0, orl0 ≠ [], phead ≠ orl0.last, r0 ≠ (phead0 ' + orl0.butlast).last, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((phead0 ' + orl0) + vtail0 ' + vs[vtail0].next ', vs, ps[vtail0, ps[vtail0].next:= vs[vtail0].next], owns(vs[vtail0].next; None)), listp((phead0 ' + orl0) + vtail0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, (phead0 ' + orl0.butlast).last, vs), noid(tid, (phead0 ' + orl0) + vtail0 ', (phead0 ' + orl0.butlast).last, vs), nonullRetRefs((phead0 ' + orl0) + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), weak?(owns(vs[vtail0].next)), vs[vtail0].next ∈ vs, vs[vtail0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ ps[vtail0, ps[vtail0].next:= vs[vtail0].next], vtail0 ∈ ps, vtail0 ∈ vs, r0 ∈ vtail0 ' + vs[vtail0].next ' from (phead0 ' + orl0.butlast).last, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl0.butlast).last ∈ orl0, ¬ vtail0 ∈ orl0, ¬ vs[vtail0].next ∈ orl0, ¬ r0 ∈ (vtail0 = (phead0 ' + orl0.butlast).last ⊃ (phead0 ' + orl0.butlast).last ';[]), vs[(phead0 ' + orl0.butlast).last].next ≠ null ∧ vs[vs[(phead0 ' + orl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl0.butlast).last].next].deqID.tid, vs[vs[(phead0 ' + orl0.butlast).last].next].val), phead = phead0 ∨ phead ∈ orl0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ a ' + x ≠ []; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws)
| vs[vtail0].deqID = None, ps[vtail0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[vtail0].next].deqID = None, vs[vs[vtail0].next].next = null, ps[vs[vtail0].next] = vs[vs[vtail0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl0.last ≠ (phead0 ' + orl0.butlast).last, (phead0 ' + orl0.butlast).last ≠ phead0, vs[vtail0].next ≠ null, vs[vtail0].next ≠ vtail0, vs[vtail0].next ≠ phead0, orl0 ≠ [], phead ≠ orl0.last, r0 ≠ (phead0 ' + orl0.butlast).last, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((phead0 ' + orl0) + vtail0 ' + vs[vtail0].next ', vs, ps[vtail0, ps[vtail0].next:= vs[vtail0].next], owns(vs[vtail0].next; None)), listp((phead0 ' + orl0) + vtail0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, (phead0 ' + orl0.butlast).last, vs), noid(tid, (phead0 ' + orl0) + vtail0 ', (phead0 ' + orl0.butlast).last, vs), nonullRetRefs((phead0 ' + orl0) + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), weak?(owns(vs[vtail0].next)), vs[vtail0].next ∈ vs, vs[vtail0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ ps[vtail0, ps[vtail0].next:= vs[vtail0].next], vtail0 ∈ ps, vtail0 ∈ vs, r0 ∈ vtail0 ' + vs[vtail0].next ' from (phead0 ' + orl0.butlast).last, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl0.butlast).last ∈ orl0, ¬ vtail0 ∈ orl0, ¬ vs[vtail0].next ∈ orl0, ¬ r0 ∈ (vtail0 = (phead0 ' + orl0.butlast).last ⊃ (phead0 ' + orl0.butlast).last ';[]), vs[(phead0 ' + orl0.butlast).last].next ≠ null ∧ vs[vs[(phead0 ' + orl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl0.butlast).last].next].deqID.tid, vs[vs[(phead0 ' + orl0.butlast).last].next].val), phead = phead0 ∨ phead ∈ orl0 ⊦ |
vs[vs[vtail0].next].deqID = None, vs[r0].deqID = Some(tid), ps[vtail0].deqID = None, vs[vtail0].deqID = None, vs[vs[vtail0].next].next = null, ps[vs[vtail0].next] = vs[vs[vtail0].next], dom vrvHp = dom prvHp, orl0 = orl + phead1 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (phead0 ' + orl).last ≠ phead0, vs[vtail0].next ≠ null, vs[vtail0].next ≠ vtail0, vs[vtail0].next ≠ phead0, orl0 ≠ [], phead ≠ phead1, phead1 ≠ (phead0 ' + orl).last, r0 ≠ (phead0 ' + orl).last, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((phead0 ' + orl0) + vtail0 ', vs, ps, owns), listp((phead0 ' + orl0) + vtail0 ' + vs[vtail0].next ', vs, ps[vtail0, ps[vtail0].next:= vs[vtail0].next], owns(vs[vtail0].next; None)), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, (phead0 ' + orl).last, vs), noid(tid, (phead0 ' + orl0) + vtail0 ', (phead0 ' + orl).last, vs), nonullRetRefs((phead0 ' + orl0) + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), weak?(owns(vs[vtail0].next)), r0 ∈ vtail0 ' + vs[vtail0].next ' from (phead0 ' + orl).last, vtail0 ∈ vs, vtail0 ∈ ps, phead ∈ ps[vtail0, ps[vtail0].next:= vs[vtail0].next], vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[vtail0].next ∈ ps, vs[vtail0].next ∈ vs, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl).last ∈ orl0, ¬ vtail0 ∈ orl0, ¬ vs[vtail0].next ∈ orl0, ¬ r0 ∈ (vtail0 = (phead0 ' + orl).last ⊃ (phead0 ' + orl).last ';[]), vs[(phead0 ' + orl).last].next ≠ null ∧ vs[vs[(phead0 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl).last].next].deqID.tid, vs[vs[(phead0 ' + orl).last].next].val), phead = phead0 ∨ phead ∈ orl0 ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, phead1, y
| vs[vs[vtail0].next].deqID = None, vs[r0].deqID = Some(tid), ps[vtail0].deqID = None, vs[vtail0].deqID = None, vs[vs[vtail0].next].next = null, ps[vs[vtail0].next] = vs[vs[vtail0].next], dom vrvHp = dom prvHp, orl0 = orl + phead1 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (phead0 ' + orl).last ≠ phead0, vs[vtail0].next ≠ null, vs[vtail0].next ≠ vtail0, vs[vtail0].next ≠ phead0, orl0 ≠ [], phead ≠ phead1, phead1 ≠ (phead0 ' + orl).last, r0 ≠ (phead0 ' + orl).last, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((phead0 ' + orl0) + vtail0 ', vs, ps, owns), listp((phead0 ' + orl0) + vtail0 ' + vs[vtail0].next ', vs, ps[vtail0, ps[vtail0].next:= vs[vtail0].next], owns(vs[vtail0].next; None)), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, (phead0 ' + orl).last, vs), noid(tid, (phead0 ' + orl0) + vtail0 ', (phead0 ' + orl).last, vs), nonullRetRefs((phead0 ' + orl0) + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), weak?(owns(vs[vtail0].next)), r0 ∈ vtail0 ' + vs[vtail0].next ' from (phead0 ' + orl).last, vtail0 ∈ vs, vtail0 ∈ ps, phead ∈ ps[vtail0, ps[vtail0].next:= vs[vtail0].next], vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[vtail0].next ∈ ps, vs[vtail0].next ∈ vs, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl).last ∈ orl0, ¬ vtail0 ∈ orl0, ¬ vs[vtail0].next ∈ orl0, ¬ r0 ∈ (vtail0 = (phead0 ' + orl).last ⊃ (phead0 ' + orl).last ';[]), vs[(phead0 ' + orl).last].next ≠ null ∧ vs[vs[(phead0 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl).last].next].deqID.tid, vs[vs[(phead0 ' + orl).last].next].val), phead = phead0 ∨ phead ∈ orl0 ⊦ |
vs[vs[ps[phead1].next].next].deqID = None, vs[r0].deqID = Some(tid), ps[ps[phead1].next].deqID = None, vs[ps[phead1].next].deqID = None, vs[vs[ps[phead1].next].next].next = null, ps[vs[ps[phead1].next].next] = vs[vs[ps[phead1].next].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (phead0 ' + orl).last ≠ phead0, vs[ps[phead1].next].next ≠ phead1, ps[phead1].next ≠ phead1, ps[phead1].next ≠ phead0, vs[ps[phead1].next].next ≠ phead0, vs[ps[phead1].next].next ≠ ps[phead1].next, vs[ps[phead1].next].next ≠ null, phead ≠ phead1, phead0 ≠ phead1, phead1 ≠ (phead0 ' + orl).last, r0 ≠ (phead0 ' + orl).last, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((phead0 ' + orl + phead1 ') + ps[phead1].next ', vs, ps, owns), listp ((phead0 ' + orl + phead1 ') + ps[phead1].next ' + vs[ps[phead1].next].next ', vs, ps[ps[phead1].next, ps[ps[phead1].next].next:= vs[ps[phead1].next].next], owns(vs[ps[phead1].next].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, (phead0 ' + orl).last, vs), noid(tid, (phead0 ' + orl + phead1 ') + ps[phead1].next ', (phead0 ' + orl).last, vs), nonullRetRefs((phead0 ' + orl + phead1 ') + ps[phead1].next ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead0].deqID), some?(vs[phead0].deqID), weak?(owns(vs[ps[phead1].next].next)), r0 ∈ ps[phead1].next ' + vs[ps[phead1].next].next ' from (phead0 ' + orl).last, ps[phead1].next ∈ vs, ps[phead1].next ∈ ps, phead ∈ ps[ps[phead1].next, ps[ps[phead1].next].next:= vs[ps[phead1].next].next], vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[ps[phead1].next].next ∈ ps, vs[ps[phead1].next].next ∈ vs, ¬ dups(orl), ¬ vs[ps[phead1].next].next ∈ orl, ¬ ps[phead1].next ∈ orl, ¬ (phead0 ' + orl).last ∈ orl, ¬ phead0 ∈ orl, ¬ phead1 ∈ orl, ¬ r0 ∈ (ps[phead1].next = (phead0 ' + orl).last ⊃ (phead0 ' + orl).last ';[]), vs[(phead0 ' + orl).last].next ≠ null ∧ vs[vs[(phead0 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl).last].next].deqID.tid, vs[vs[(phead0 ' + orl).last].next].val), phead = phead0 ∨ phead ∈ orl ⊦
Used simplifier rules: ⊦ a ≠ b → st[b, d][a] = st[a]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ 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)
| vs[vs[ps[phead1].next].next].deqID = None, vs[r0].deqID = Some(tid), ps[ps[phead1].next].deqID = None, vs[ps[phead1].next].deqID = None, vs[vs[ps[phead1].next].next].next = null, ps[vs[ps[phead1].next].next] = vs[vs[ps[phead1].next].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (phead0 ' + orl).last ≠ phead0, vs[ps[phead1].next].next ≠ phead1, ps[phead1].next ≠ phead1, ps[phead1].next ≠ phead0, vs[ps[phead1].next].next ≠ phead0, vs[ps[phead1].next].next ≠ ps[phead1].next, vs[ps[phead1].next].next ≠ null, phead ≠ phead1, phead0 ≠ phead1, phead1 ≠ (phead0 ' + orl).last, r0 ≠ (phead0 ' + orl).last, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((phead0 ' + orl + phead1 ') + ps[phead1].next ', vs, ps, owns), listp ((phead0 ' + orl + phead1 ') + ps[phead1].next ' + vs[ps[phead1].next].next ', vs, ps[ps[phead1].next, ps[ps[phead1].next].next:= vs[ps[phead1].next].next], owns(vs[ps[phead1].next].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, (phead0 ' + orl).last, vs), noid(tid, (phead0 ' + orl + phead1 ') + ps[phead1].next ', (phead0 ' + orl).last, vs), nonullRetRefs((phead0 ' + orl + phead1 ') + ps[phead1].next ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead0].deqID), some?(vs[phead0].deqID), weak?(owns(vs[ps[phead1].next].next)), r0 ∈ ps[phead1].next ' + vs[ps[phead1].next].next ' from (phead0 ' + orl).last, ps[phead1].next ∈ vs, ps[phead1].next ∈ ps, phead ∈ ps[ps[phead1].next, ps[ps[phead1].next].next:= vs[ps[phead1].next].next], vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[ps[phead1].next].next ∈ ps, vs[ps[phead1].next].next ∈ vs, ¬ dups(orl), ¬ vs[ps[phead1].next].next ∈ orl, ¬ ps[phead1].next ∈ orl, ¬ (phead0 ' + orl).last ∈ orl, ¬ phead0 ∈ orl, ¬ phead1 ∈ orl, ¬ r0 ∈ (ps[phead1].next = (phead0 ' + orl).last ⊃ (phead0 ' + orl).last ';[]), vs[(phead0 ' + orl).last].next ≠ null ∧ vs[vs[(phead0 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl).last].next].deqID.tid, vs[vs[(phead0 ' + orl).last].next].val), phead = phead0 ∨ phead ∈ orl ⊦ |
⊦ 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: phead0 ', orl
| ⊦ y ≠ [] → (x + y).last = y.last |
| vs[vs[orl0.last].next].deqID = None, vs[r0].deqID = Some(tid), ps[vtail0].deqID = None, vs[vs[orl0.last].next].next = null, ps[vs[orl0.last].next] = vs[vs[orl0.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[orl0.last].next ≠ vtail0, vs[orl0.last].next ≠ null, vs[orl0.last].next ≠ orl0.last, orl ≠ [], orl0 ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), listp(orl + (vtail0 ' + orl0) + vs[orl0.last].next ', vs, ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next], owns(vs[orl0.last].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[orl0.last].next)), phead ∈ ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next], phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[orl0.last].next ∈ ps, vs[orl0.last].next ∈ vs, r0 ∈ orl + vtail0 ' + orl0 + vs[orl0.last].next ' from vhead, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vs[orl0.last].next ∈ orl, ¬ vs[orl0.last].next ∈ orl0, ¬ r0 ∈ orl + vtail0 ' + orl0 from vhead, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ 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[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
ps[vtail0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[orl0.last].next].deqID = None, vs[vs[orl0.last].next].next = null, ps[vs[orl0.last].next] = vs[vs[orl0.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[orl0.last].next ≠ vtail0, vs[orl0.last].next ≠ null, vs[orl0.last].next ≠ orl0.last, orl ≠ [], orl0 ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + (vtail0 ' + orl0) + vs[orl0.last].next ', vs, ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next], owns(vs[orl0.last].next; None)), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[orl0.last].next)), vtail0 ∈ ps, vtail0 ∈ vs, r0 ∈ orl + vtail0 ' + orl0 + vs[orl0.last].next ' from vhead, vs[orl0.last].next ∈ vs, vs[orl0.last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, phead ∈ ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next], ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vs[orl0.last].next ∈ orl, ¬ vs[orl0.last].next ∈ orl0, ¬ r0 ∈ orl + vtail0 ' + orl0 from vhead, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ 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[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ
| ps[vtail0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[orl0.last].next].deqID = None, vs[vs[orl0.last].next].next = null, ps[vs[orl0.last].next] = vs[vs[orl0.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[orl0.last].next ≠ vtail0, vs[orl0.last].next ≠ null, vs[orl0.last].next ≠ orl0.last, orl ≠ [], orl0 ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + (vtail0 ' + orl0) + vs[orl0.last].next ', vs, ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next], owns(vs[orl0.last].next; None)), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[orl0.last].next)), vtail0 ∈ ps, vtail0 ∈ vs, r0 ∈ orl + vtail0 ' + orl0 + vs[orl0.last].next ' from vhead, vs[orl0.last].next ∈ vs, vs[orl0.last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, phead ∈ ps[orl0.last, ps[orl0.last].next:= vs[orl0.last].next], ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vs[orl0.last].next ∈ orl, ¬ vs[orl0.last].next ∈ orl0, ¬ r0 ∈ orl + vtail0 ' + orl0 from vhead, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ 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[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
vs[vs[phead0].next].deqID = None, vs[r0].deqID = Some(tid), ps[vtail0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl0 = orl1 + phead0 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ vtail0, vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, orl ≠ [], orl0 ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), listp(orl + (vtail0 ' + orl0) + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[phead0].next)), phead ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, r0 ∈ orl + vtail0 ' + orl0 + vs[phead0].next ' from vhead, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vs[phead0].next ∈ orl, ¬ vs[phead0].next ∈ orl0, ¬ r0 ∈ orl + vtail0 ' + orl0 from vhead, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ 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[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, phead0, y
| vs[vs[phead0].next].deqID = None, vs[r0].deqID = Some(tid), ps[vtail0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl0 = orl1 + phead0 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ vtail0, vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, orl ≠ [], orl0 ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), listp(orl + (vtail0 ' + orl0) + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[phead0].next)), phead ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, r0 ∈ orl + vtail0 ' + orl0 + vs[phead0].next ' from vhead, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vs[phead0].next ∈ orl, ¬ vs[phead0].next ∈ orl0, ¬ r0 ∈ orl + vtail0 ' + orl0 from vhead, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ 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[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
ps[vtail0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ vtail0, vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + (vtail0 ' + orl1 + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), listp(orl + vtail0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl + vtail0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, r0 ∈ orl + vtail0 ' + (orl1 + phead0 ') + vs[phead0].next ' from vhead, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, phead ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[phead0].next ∈ orl, ¬ vs[phead0].next ∈ orl1, ¬ r0 ∈ orl + vtail0 ' + orl1 + phead0 ' from vhead, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ 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), orl.last = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ⊦
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-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ 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[vtail0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ vtail0, vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + (vtail0 ' + orl1 + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), listp(orl + vtail0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl + vtail0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, r0 ∈ orl + vtail0 ' + (orl1 + phead0 ') + vs[phead0].next ' from vhead, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, phead ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[phead0].next ∈ orl, ¬ vs[phead0].next ∈ orl1, ¬ r0 ∈ orl + vtail0 ' + orl1 + phead0 ' from vhead, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ 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), orl.last = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[r0].deqID = Some(tid), ps[vtail0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ vtail0, vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl1 + phead0 ', vs, ps, owns), listp(orl + (vtail0 ' + orl1 + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl + vtail0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), phead ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, r0 ∈ orl + vtail0 ' + (orl1 + phead0 ') + vs[phead0].next ' from vhead, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ orl, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[phead0].next ∈ orl, ¬ vs[phead0].next ∈ orl1, ¬ r0 ∈ orl + vtail0 ' + orl1 + phead0 ' from vhead, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ 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), orl.last = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ⊦
Used simplifier rules: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) 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 a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ None ≠ Some(tid); (s) Used terms: orl, vtail0 ' + (orl1 + phead0 ') + vs[phead0].next ', vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[r0].deqID = Some(tid), ps[vtail0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ vtail0, vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl1 + phead0 ', vs, ps, owns), listp(orl + (vtail0 ' + orl1 + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl + vtail0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), phead ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, r0 ∈ orl + vtail0 ' + (orl1 + phead0 ') + vs[phead0].next ' from vhead, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ orl, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[phead0].next ∈ orl, ¬ vs[phead0].next ∈ orl1, ¬ r0 ∈ orl + vtail0 ' + orl1 + phead0 ' from vhead, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ 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), orl.last = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ⊦ |
ps[vtail0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ vtail0, vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + (vtail0 ' + orl1 + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), listp(orl + vtail0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl + vtail0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, phead ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], vtail0 ∈ ps, vtail0 ∈ vs, r0 ∈ vtail0 ' + orl1 + phead0 ' + vs[phead0].next ' from vhead, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ vhead ∈ orl, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[phead0].next ∈ orl, ¬ vs[phead0].next ∈ orl1, ¬ r0 ∈ vtail0 ' + orl1 + phead0 ' 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 ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| ps[vtail0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ vtail0, vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + (vtail0 ' + orl1 + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), listp(orl + vtail0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl + vtail0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, phead ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], vtail0 ∈ ps, vtail0 ∈ vs, r0 ∈ vtail0 ' + orl1 + phead0 ' + vs[phead0].next ' from vhead, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ vhead ∈ orl, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[phead0].next ∈ orl, ¬ vs[phead0].next ∈ orl1, ¬ r0 ∈ vtail0 ' + orl1 + phead0 ' 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 ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[r0].deqID = Some(tid), ps[vtail0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ vtail0, vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl1 + phead0 ', vs, ps, owns), listp(orl + (vtail0 ' + orl1 + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl + vtail0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), r0 ∈ vtail0 ' + orl1 + phead0 ' + vs[phead0].next ' from vhead, vtail0 ∈ vs, vtail0 ∈ ps, phead ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ vtail0 ', ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ vhead ∈ orl, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[phead0].next ∈ orl, ¬ vs[phead0].next ∈ orl1, ¬ r0 ∈ vtail0 ' + orl1 + phead0 ' 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 ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ⊦
Used simplifier rules: ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ None ≠ Some(tid); (s) Used terms: vtail0 ', orl1 + phead0 ' + vs[phead0].next ', vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[r0].deqID = Some(tid), ps[vtail0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ vtail0, vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl1 + phead0 ', vs, ps, owns), listp(orl + (vtail0 ' + orl1 + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl + vtail0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), r0 ∈ vtail0 ' + orl1 + phead0 ' + vs[phead0].next ' from vhead, vtail0 ∈ vs, vtail0 ∈ ps, phead ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ vtail0 ', ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ vhead ∈ orl, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[phead0].next ∈ orl, ¬ vs[phead0].next ∈ orl1, ¬ r0 ∈ vtail0 ' + orl1 + phead0 ' 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 ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ⊦ |
ps[vtail0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ vtail0, vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, orl ≠ [], r0 ≠ vhead, vhead ≠ vtail0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + (vtail0 ' + orl1 + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), listp(orl + vtail0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl + vtail0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, phead ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], vtail0 ∈ ps, vtail0 ∈ vs, r0 ∈ orl1 + phead0 ' + vs[phead0].next ' from vhead, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ vhead ∈ orl, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[phead0].next ∈ orl, ¬ vs[phead0].next ∈ orl1, ¬ r0 ∈ orl1 + phead0 ' 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 ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| ps[vtail0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ vtail0, vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, orl ≠ [], r0 ≠ vhead, vhead ≠ vtail0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + (vtail0 ' + orl1 + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), listp(orl + vtail0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl + vtail0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, phead ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], vtail0 ∈ ps, vtail0 ∈ vs, r0 ∈ orl1 + phead0 ' + vs[phead0].next ' from vhead, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ vhead ∈ orl, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[phead0].next ∈ orl, ¬ vs[phead0].next ∈ orl1, ¬ r0 ∈ orl1 + phead0 ' 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 ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[r0].deqID = Some(tid), ps[vtail0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ vtail0, vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, orl ≠ [], r0 ≠ vhead, vhead ≠ vtail0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl1 + phead0 ', vs, ps, owns), listp(orl + (vtail0 ' + orl1 + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl + vtail0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), r0 ∈ orl1 + phead0 ' + vs[phead0].next ' from vhead, vtail0 ∈ vs, vtail0 ∈ ps, phead ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ vhead ∈ orl, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[phead0].next ∈ orl, ¬ vs[phead0].next ∈ orl1, ¬ r0 ∈ orl1 + phead0 ' 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 ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ⊦
Used simplifier rules: ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ None ≠ Some(tid); (s) Used terms: orl1, phead0 ' + vs[phead0].next ', vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[r0].deqID = Some(tid), ps[vtail0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ vtail0, vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, orl ≠ [], r0 ≠ vhead, vhead ≠ vtail0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl1 + phead0 ', vs, ps, owns), listp(orl + (vtail0 ' + orl1 + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl + vtail0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), r0 ∈ orl1 + phead0 ' + vs[phead0].next ' from vhead, vtail0 ∈ vs, vtail0 ∈ ps, phead ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ vhead ∈ orl, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[phead0].next ∈ orl, ¬ vs[phead0].next ∈ orl1, ¬ r0 ∈ orl1 + phead0 ' 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 ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ⊦ |
ps[vtail0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ vtail0, vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, orl ≠ [], r0 ≠ vhead, vhead ≠ vtail0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + (vtail0 ' + orl1 + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), listp(orl + vtail0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl + vtail0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, phead ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], vtail0 ∈ ps, vtail0 ∈ vs, r0 ∈ phead0 ' + vs[phead0].next ' from vhead, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ vhead ∈ orl, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[phead0].next ∈ orl, ¬ vs[phead0].next ∈ orl1, ¬ r0 ∈ (phead0 = vhead ⊃ 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 ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| ps[vtail0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ vtail0, vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, orl ≠ [], r0 ≠ vhead, vhead ≠ vtail0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + (vtail0 ' + orl1 + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), listp(orl + vtail0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl + vtail0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, phead ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], vtail0 ∈ ps, vtail0 ∈ vs, r0 ∈ phead0 ' + vs[phead0].next ' from vhead, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ vhead ∈ orl, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[phead0].next ∈ orl, ¬ vs[phead0].next ∈ orl1, ¬ r0 ∈ (phead0 = vhead ⊃ 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 ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[r0].deqID = Some(tid), ps[vtail0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ vtail0, vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, orl ≠ [], r0 ≠ vhead, vhead ≠ vtail0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl1 + phead0 ', vs, ps, owns), listp(orl + (vtail0 ' + orl1 + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl + vtail0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), r0 ∈ phead0 ' + vs[phead0].next ' from vhead, vtail0 ∈ vs, vtail0 ∈ ps, phead ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ phead0 ', ¬ vhead ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ vhead ∈ orl, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[phead0].next ∈ orl, ¬ vs[phead0].next ∈ orl1, ¬ r0 ∈ (phead0 = vhead ⊃ 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 ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ⊦
Used simplifier rules: ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ None ≠ Some(tid); (s) Used terms: phead0 ', vs[phead0].next ', vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[r0].deqID = Some(tid), ps[vtail0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ vtail0, vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, orl ≠ [], r0 ≠ vhead, vhead ≠ vtail0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl1 + phead0 ', vs, ps, owns), listp(orl + (vtail0 ' + orl1 + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl + vtail0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), r0 ∈ phead0 ' + vs[phead0].next ' from vhead, vtail0 ∈ vs, vtail0 ∈ ps, phead ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ phead0 ', ¬ vhead ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ vhead ∈ orl, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[phead0].next ∈ orl, ¬ vs[phead0].next ∈ orl1, ¬ r0 ∈ (phead0 = vhead ⊃ 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 ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ⊦ |
ps[vtail0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ vtail0, vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, orl ≠ [], r0 ≠ vhead, vhead ≠ vtail0, vhead ≠ phead0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + (vtail0 ' + orl1 + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), listp(orl + vtail0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl + vtail0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, phead ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], vtail0 ∈ ps, vtail0 ∈ vs, r0 ∈ (vs[phead0].next = vhead ⊃ vs[phead0].next ';[]), ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ vhead ∈ orl, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[phead0].next ∈ orl, ¬ vs[phead0].next ∈ 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), orl.last = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ⊦
Used simplifier rules: ⊦ ¬ a ∈ []; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| ps[vtail0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ vtail0, vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, orl ≠ [], r0 ≠ vhead, vhead ≠ vtail0, vhead ≠ phead0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + (vtail0 ' + orl1 + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), listp(orl + vtail0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl + vtail0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, phead ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], vtail0 ∈ ps, vtail0 ∈ vs, r0 ∈ (vs[phead0].next = vhead ⊃ vs[phead0].next ';[]), ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ vhead ∈ orl, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[phead0].next ∈ orl, ¬ vs[phead0].next ∈ 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), orl.last = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ⊦ |
Used simplifier rules: ⊦ ¬ a ∈ []; (s) ⊦ a ∈ b ' ↔ a = b; (s)
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noowns(tid, owns(vs[(orl + qrl).last].next; None)), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ |
⊦ noowns(tid, owns) ↔ (∀ r. owns(r) ≠ None → owns(r).tid ≠ tid)
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), ∃ r. ¬(owns(vs[(orl + qrl).last].next; None)(r) ≠ None → owns(vs[(orl + qrl).last].next; None)(r).tid ≠ tid), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used terms: tid, owns(vs[(orl + qrl).last].next; None)
| ⊦ noowns(tid, owns) ↔ (∀ r. owns(r) ≠ None → owns(r).tid ≠ tid) |
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), ∃ r. ¬(owns(vs[(orl + qrl).last].next; None)(r) ≠ None → owns(vs[(orl + qrl).last].next; None)(r).tid ≠ tid), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ noowns(tid, owns) ↔ (∀ r. owns(r) ≠ None → owns(r).tid ≠ tid)
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), ∀ r. owns(r) ≠ None → owns(r).tid ≠ tid, ∃ r. ¬(owns(vs[(orl + qrl).last].next; None)(r) ≠ None → owns(vs[(orl + qrl).last].next; None)(r).tid ≠ tid), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦
Used terms: tid, owns
| ⊦ noowns(tid, owns) ↔ (∀ r. owns(r) ≠ None → owns(r).tid ≠ tid) |
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), ∀ r. owns(r) ≠ None → owns(r).tid ≠ tid, ∃ r. ¬(owns(vs[(orl + qrl).last].next; None)(r) ≠ None → owns(vs[(orl + qrl).last].next; None)(r).tid ≠ tid), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ |
qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(owns(r).tid) = vretRefs(owns(r).tid), rvowns(vretRefs(owns(r).tid)) = Pending(owns(r).tid), vs[(orl + qrl).last].next ≠ r, vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, None ≠ owns(r), orl ≠ [], vretRefs(owns(r).tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(owns(r).tid, vhead, vs), noid(owns(r).tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(owns(r).tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), ∀ r0. owns(r0) ≠ None → owns(r0).tid ≠ owns(r).tid, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
| qrl + vs[(orl + qrl).last].next ' = vtail0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(owns(r).tid) = vretRefs(owns(r).tid), rvowns(vretRefs(owns(r).tid)) = Pending(owns(r).tid), vs[(orl + qrl).last].next ≠ r, vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ (orl + qrl).last, None ≠ owns(r), orl ≠ [], vretRefs(owns(r).tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp ((orl + qrl) + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), markedp(orl, ps), markedp(orl, vs), nextnottid(owns(r).tid, vhead, vs), noid(owns(r).tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(owns(r).tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vs[(orl + qrl).last].next ∈ orl, ¬ vs[(orl + qrl).last].next ∈ 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), ∀ r0. owns(r0) ≠ None → owns(r0).tid ≠ owns(r).tid, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ qrl0, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
Used terms: r
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, orl ≠ [], 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 ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (lst ∈ orl ∨ lst ∈ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ listp (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs, ps[lst, ps[lst].next:= vs[lst].next], (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)) ∧ ¬ dups(orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), ps[lst, ps[lst].next:= vs[lst].next]) ∧ nonullRetRefs(orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ ( (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ≠ [] → unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs)) ∧ ( vtail = (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)).last ∨ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ≠ [] ∧ vtail = (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).butlast).last ∧ vs[(lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).last].deqID = None ∧ vs[(lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).last].next = null) ∧ noid(tid, orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vhead, vs) ∧ noowns(tid, (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)) |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, orl ≠ [], 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 ∈ orl, 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next])
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, orl ≠ [], 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 ∈ orl, 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next]) |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, orl ≠ [], 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 ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns), 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), lst ∈ orl ∨ lst ∈ 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, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, orl ≠ [], 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 ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]), 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), lst ∈ orl ∨ lst ∈ 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, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, orl ≠ [], 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 ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next]), 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), lst ∈ orl ∨ lst ∈ 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, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, orl ≠ [], 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 ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns), 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), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
⊦ listp(rl, vs, ps, owns) ∧ lst ∈ rl ∧ lst ≠ rl.last → listp(rl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)
Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, orl + qrl, lst, owns, vs
| ⊦ listp(rl, vs, ps, owns) ∧ lst ∈ rl ∧ lst ≠ rl.last → listp(rl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) |
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, orl ≠ [], 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 ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]), 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), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
⊦ markedp(rl, vs) ↔ (∀ r. r ∈ rl → some?(vs[r].deqID))
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, orl ≠ [], 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 ∈ orl, 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), ∃ r. ¬(r ∈ orl → some?(ps[lst, ps[lst].next:= vs[lst].next][r].deqID)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used terms: orl, ps[lst, ps[lst].next:= vs[lst].next]
| ⊦ markedp(rl, vs) ↔ (∀ r. r ∈ rl → some?(vs[r].deqID)) |
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, orl ≠ [], 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 ∈ orl, 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), ∃ r. ¬(r ∈ orl → some?(ps[lst, ps[lst].next:= vs[lst].next][r].deqID)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, orl ≠ [], 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), r ∈ orl, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ some?(ps[lst, ps[lst].next:= vs[lst].next][r].deqID), 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), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[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, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, orl ≠ [], 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), r ∈ orl, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ some?(ps[lst, ps[lst].next:= vs[lst].next][r].deqID), 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), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
⊦ markedp(rl, vs) ↔ (∀ r. r ∈ rl → some?(vs[r].deqID))
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), 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), r ∈ ps, r ∈ vs, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, r ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ some?(ps[lst, ps[lst].next:= vs[lst].next][r].deqID), 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), ∀ r. r ∈ orl → some?(ps[r].deqID), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used terms: orl, ps
| ⊦ markedp(rl, vs) ↔ (∀ r. r ∈ rl → some?(vs[r].deqID)) |
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), 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), r ∈ ps, r ∈ vs, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, r ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ some?(ps[lst, ps[lst].next:= vs[lst].next][r].deqID), 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), ∀ r. r ∈ orl → some?(ps[r].deqID), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), 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), r ∈ orl, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ some?(ps[lst, ps[lst].next:= vs[lst].next][r].deqID), 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), r ∈ orl → some?(ps[r].deqID), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used terms: r
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), 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), r ∈ orl, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ some?(ps[lst, ps[lst].next:= vs[lst].next][r].deqID), 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), r ∈ orl → some?(ps[r].deqID), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ 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, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), 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), some?(ps[r].deqID), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, r ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ some?(ps[lst, ps[lst].next:= vs[lst].next][r].deqID), 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, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), 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), some?(ps[r].deqID), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, r ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ some?(ps[lst, ps[lst].next:= vs[lst].next][r].deqID), 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, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) Used terms: ps, lst, ps[lst].next:= vs[lst].next, r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, orl ≠ [], 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 ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next]), 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), lst ∈ orl ∨ lst ∈ 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, pretRefs(tid) = vretRefs(tid), qrl = vtail0 + qrl0, rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, orl ≠ [], qrl ≠ [], 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 ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next]), 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, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl0, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ dups([]); (s) ⊦ unmarkedp([], vs); (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, vtail0, y
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = vtail0 + qrl0, rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, orl ≠ [], qrl ≠ [], 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 ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next]), 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, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl0, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (vtail0 ' + qrl0).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs), lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ qrl0, vtail = (vtail0 ' + qrl0).last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[(vtail0 ' + qrl0).last].deqID = None ∧ vs[(vtail0 ' + qrl0).last].next = null ⊦ ps[lst, ps[lst].next:= vs[lst].next][vtail0].deqID = None ∧ unmarkedp(qrl0, ps[lst, ps[lst].next:= vs[lst].next])
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 + x = a ' + x; (s) ⊦ a ' + x ≠ []; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws)
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (vtail0 ' + qrl0).last, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs), lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ qrl0, vtail = (vtail0 ' + qrl0).last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[(vtail0 ' + qrl0).last].deqID = None ∧ vs[(vtail0 ' + qrl0).last].next = null ⊦ ps[lst, ps[lst].next:= vs[lst].next][vtail0].deqID = None ∧ unmarkedp(qrl0, ps[lst, ps[lst].next:= vs[lst].next]) |
⊦ a ≠ b → st[b, d][a] = st[a]
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (vtail0 ' + qrl0).last, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ lst, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, 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 = (vtail0 ' + qrl0).last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[(vtail0 ' + qrl0).last].deqID = None ∧ vs[(vtail0 ' + qrl0).last].next = null, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ qrl0, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ ps[vtail0].deqID = None ∧ unmarkedp(qrl0, ps[lst, ps[lst].next:= vs[lst].next])
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ ¬ node ∈ rl → (unmarkedp(rl, vs[node, nd]) ↔ unmarkedp(rl, vs)); (s) Used terms: ps, lst, ps[lst].next:= vs[lst].next, vtail0
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (vtail0 ' + qrl0).last, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ lst, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, 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 = (vtail0 ' + qrl0).last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[(vtail0 ' + qrl0).last].deqID = None ∧ vs[(vtail0 ' + qrl0).last].next = null, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ qrl0, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ ps[vtail0].deqID = None ∧ unmarkedp(qrl0, ps[lst, ps[lst].next:= vs[lst].next]) |
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (vtail0 ' + qrl0).last, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ lst, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ unmarkedp(qrl0, ps[lst, ps[lst].next:= vs[lst].next]), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs), vtail = (vtail0 ' + qrl0).last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[(vtail0 ' + qrl0).last].deqID = None ∧ vs[(vtail0 ' + qrl0).last].next = null, lst ∈ orl ∨ lst ∈ qrl0 ⊦
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (vtail0 ' + qrl0).last, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ lst, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ unmarkedp(qrl0, ps[lst, ps[lst].next:= vs[lst].next]), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs), vtail = (vtail0 ' + qrl0).last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[(vtail0 ' + qrl0).last].deqID = None ∧ vs[(vtail0 ' + qrl0).last].next = null, lst ∈ orl ∨ lst ∈ qrl0 ⊦ |
⊦ unmarkedp(rl, vs) ↔ (∀ r. r ∈ rl → vs[r].deqID = None)
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (vtail0 ' + qrl0).last, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ lst, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, 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), ∃ r. ¬(r ∈ qrl0 → ps[lst, ps[lst].next:= vs[lst].next][r].deqID = None), lst ∈ orl ∨ lst ∈ qrl0, vtail = (vtail0 ' + qrl0).last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[(vtail0 ' + qrl0).last].deqID = None ∧ vs[(vtail0 ' + qrl0).last].next = null, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦
Used terms: qrl0, ps[lst, ps[lst].next:= vs[lst].next]
| ⊦ unmarkedp(rl, vs) ↔ (∀ r. r ∈ rl → vs[r].deqID = None) |
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (vtail0 ' + qrl0).last, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ lst, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, 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), ∃ r. ¬(r ∈ qrl0 → ps[lst, ps[lst].next:= vs[lst].next][r].deqID = None), lst ∈ orl ∨ lst ∈ qrl0, vtail = (vtail0 ' + qrl0).last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[(vtail0 ' + qrl0).last].deqID = None ∧ vs[(vtail0 ' + qrl0).last].next = null, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ |
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[lst, ps[lst].next:= vs[lst].next][r].deqID ≠ None, vs[lst].next ≠ null, lst ≠ qrl0.last, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ lst, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), r ∈ qrl0, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs), lst ∈ orl ∨ lst ∈ qrl0, vtail = qrl0.last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ a ∈ x → (b ' + x).last = x.last; (s)
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[lst, ps[lst].next:= vs[lst].next][r].deqID ≠ None, vs[lst].next ≠ null, lst ≠ qrl0.last, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ lst, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), r ∈ qrl0, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs), lst ∈ orl ∨ lst ∈ qrl0, vtail = qrl0.last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
⊦ unmarkedp(rl, vs) ↔ (∀ r. r ∈ rl → vs[r].deqID = None)
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[lst, ps[lst].next:= vs[lst].next][r].deqID ≠ None, vs[lst].next ≠ null, lst ≠ qrl0.last, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ lst, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), r ∈ ps, r ∈ vs, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, r ∈ qrl0, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, 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), ∀ r. r ∈ qrl0 → ps[r].deqID = None, vtail = qrl0.last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl ∨ lst ∈ qrl0, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦
Used terms: qrl0, ps
| ⊦ unmarkedp(rl, vs) ↔ (∀ r. r ∈ rl → vs[r].deqID = None) |
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[lst, ps[lst].next:= vs[lst].next][r].deqID ≠ None, vs[lst].next ≠ null, lst ≠ qrl0.last, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ lst, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), r ∈ ps, r ∈ vs, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, r ∈ qrl0, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, 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), ∀ r. r ∈ qrl0 → ps[r].deqID = None, vtail = qrl0.last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl ∨ lst ∈ qrl0, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ |
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[lst, ps[lst].next:= vs[lst].next][r].deqID ≠ None, vs[lst].next ≠ null, lst ≠ qrl0.last, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ lst, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), r ∈ qrl0, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, 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), r ∈ qrl0 → ps[r].deqID = None, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs), lst ∈ orl ∨ lst ∈ qrl0, vtail = qrl0.last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
Used terms: r
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[lst, ps[lst].next:= vs[lst].next][r].deqID ≠ None, vs[lst].next ≠ null, lst ≠ qrl0.last, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ lst, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), r ∈ qrl0, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, 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), r ∈ qrl0 → ps[r].deqID = None, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs), lst ∈ orl ∨ lst ∈ qrl0, vtail = qrl0.last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
ps[vtail0].deqID = None, ps[r].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[lst, ps[lst].next:= vs[lst].next][r].deqID ≠ None, vs[lst].next ≠ null, lst ≠ qrl0.last, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ lst, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), r ∈ ps, r ∈ vs, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, r ∈ qrl0, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, 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 = qrl0.last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl ∨ lst ∈ qrl0, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦
| ps[vtail0].deqID = None, ps[r].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[lst, ps[lst].next:= vs[lst].next][r].deqID ≠ None, vs[lst].next ≠ null, lst ≠ qrl0.last, orl ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ lst, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), r ∈ ps, r ∈ vs, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, r ∈ qrl0, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, 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 = qrl0.last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl ∨ lst ∈ qrl0, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) Used terms: ps, lst, ps[lst].next:= vs[lst].next, r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
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.