| ⊦ ( (ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( 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)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (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, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D19, a) ∧ pcstepf(gs, ls, D19, a) = D20 → ( lstepf(gs, ls, D19, a).nxt ≠ null ∧ lstepf(gs, ls, D19, a).nxt = gstepf(gs, ls, D19, a).ps[lstepf(gs, ls, D19, a).first].next ∧ lstepf(gs, ls, D19, a).optval = Val(gstepf(gs, ls, D19, a).vs[lstepf(gs, ls, D19, a).nxt].val) ∧ ( gstepf(gs, ls, D19, a).qrl ≠ [] ∧ gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).qrl.head].deqID = Some(lstepf(gs, ls, D19, a).tid) → gstepf(gs, ls, D19, a).vhead = lstepf(gs, ls, D19, a).first ∧ lstepf(gs, ls, D19, a).success) ∧ (lstepf(gs, ls, D19, a).success ⊃ gstepf(gs, ls, D19, a).vs[lstepf(gs, ls, D19, a).nxt].deqID = Some(lstepf(gs, ls, D19, a).tid) ∧ gstepf(gs, ls, D19, a).rvowns(gstepf(gs, ls, D19, a).vretRefs(lstepf(gs, ls, D19, a).tid)) = Claimed(lstepf(gs, ls, D19, a).tid, lstepf(gs, ls, D19, a).optval.val) ∧ (gstepf(gs, ls, D19, a).ps[lstepf(gs, ls, D19, a).nxt].deqID = None → gstepf(gs, ls, D19, a).vhead = lstepf(gs, ls, D19, a).first) ∧ noid (lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, lstepf(gs, ls, D19, a).nxt, gstepf(gs, ls, D19, a).vs) ; gstepf(gs, ls, D19, a).vs[lstepf(gs, ls, D19, a).nxt].deqID ≠ None ∧ noid (lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, lstepf(gs, ls, D19, a).first, gstepf(gs, ls, D19, a).vs) ∧ gstepf(gs, ls, D19, a).rvowns(gstepf(gs, ls, D19, a).vretRefs(lstepf(gs, ls, D19, a).tid)) = Pending(lstepf(gs, ls, D19, a).tid) )) ∧ ( listp (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).ps, gstepf(gs, ls, D19, a).owns) ∧ ¬ dups(gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl) ∧ markedp(gstepf(gs, ls, D19, a).orl, gstepf(gs, ls, D19, a).ps) ∧ markedp(gstepf(gs, ls, D19, a).orl, gstepf(gs, ls, D19, a).vs) ∧ unmarkedp(gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).ps) ∧ gstepf(gs, ls, D19, a).orl ≠ [] ∧ gstepf(gs, ls, D19, a).phead ∈ gstepf(gs, ls, D19, a).orl ∧ rvownerok(gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).vrvHp, gstepf(gs, ls, D19, a).rvowns) ∧ allocrv(gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D19, a).pretRefs, gstepf(gs, ls, D19, a).prvHp, gstepf(gs, ls, D19, a).rvowns) ∧ allocrv(gstepf(gs, ls, D19, a).pretRefs, gstepf(gs, ls, D19, a).prvHp) ∧ dom gstepf(gs, ls, D19, a).vrvHp = dom gstepf(gs, ls, D19, a).prvHp ∧ ( gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next ≠ null ∧ gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D19, a).rvowns (gstepf(gs, ls, D19, a).vretRefs(gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].deqID.tid, gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D19, a).orl.last = gstepf(gs, ls, D19, a).vhead ∧ (gstepf(gs, ls, D19, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D19, a).qrl.tail, gstepf(gs, ls, D19, a).vs)) ∨ gstepf(gs, ls, D19, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D19, a).orl.butlast.last = gstepf(gs, ls, D19, a).vhead ∧ gstepf(gs, ls, D19, a).phead ≠ gstepf(gs, ls, D19, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs)) ∧ ( gstepf(gs, ls, D19, a).vtail = (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl).last ∨ gstepf(gs, ls, D19, a).qrl ≠ [] ∧ gstepf(gs, ls, D19, a).vtail = (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl.butlast).last ∧ gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D19, a).vs[(gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, D19, a).first ∈ gstepf(gs, ls, D19, a).orl ∧ gstepf(gs, ls, D19, a).vhead ∈ gstepf(gs, ls, D19, a).orl from lstepf(gs, ls, D19, a).first) ∧ ( lstepf(gs, ls, D19, a).first ≠ lstepf(gs, ls, D19, a).lst ∧ gstepf(gs, ls, D19, a).vtail ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from lstepf(gs, ls, D19, a).lst) ∧ lstepf(gs, ls, D19, a).lst ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from lstepf(gs, ls, D19, a).first ∧ ( gstepf(gs, ls, D19, a).vretRefs(lstepf(gs, ls, D19, a).tid) = lstepf(gs, ls, D19, a).rvref ∧ gstepf(gs, ls, D19, a).pretRefs(lstepf(gs, ls, D19, a).tid) = lstepf(gs, ls, D19, a).rvref ∧ lstepf(gs, ls, D19, a).rvref ∈ gstepf(gs, ls, D19, a).vrvHp ∧ lstepf(gs, ls, D19, a).rvref ≠ null) ∧ ( gstepf(gs, ls, D19, a).vhead ≠ lstepf(gs, ls, D19, a).first → nextnottid(lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).vhead, gstepf(gs, ls, D19, a).vs)) ∧ noowns(lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).owns) |
ls.nxt = gs.ps[ls.first].next, ls.optval = Val(gs.vs[ls.nxt].val), 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, D19, a) = D20, ls.first ≠ ls.lst, 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, ls.first, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), pre(gs, ls, D19, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ls.first ∈ gs.orl, gs.vhead ∈ gs.orl from ls.first, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, ls.lst ∈ gs.orl + gs.qrl from ls.first, 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, D19, a).nxt ≠ null ∧ lstepf(gs, ls, D19, a).nxt = gstepf(gs, ls, D19, a).ps[lstepf(gs, ls, D19, a).first].next ∧ lstepf(gs, ls, D19, a).optval = Val(gstepf(gs, ls, D19, a).vs[lstepf(gs, ls, D19, a).nxt].val) ∧ ( gstepf(gs, ls, D19, a).qrl ≠ [] ∧ gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).qrl.head].deqID = Some(lstepf(gs, ls, D19, a).tid) → gstepf(gs, ls, D19, a).vhead = lstepf(gs, ls, D19, a).first ∧ lstepf(gs, ls, D19, a).success) ∧ (lstepf(gs, ls, D19, a).success ⊃ gstepf(gs, ls, D19, a).vs[lstepf(gs, ls, D19, a).nxt].deqID = Some(lstepf(gs, ls, D19, a).tid) ∧ gstepf(gs, ls, D19, a).rvowns(gstepf(gs, ls, D19, a).vretRefs(lstepf(gs, ls, D19, a).tid)) = Claimed(lstepf(gs, ls, D19, a).tid, lstepf(gs, ls, D19, a).optval.val) ∧ (gstepf(gs, ls, D19, a).ps[lstepf(gs, ls, D19, a).nxt].deqID = None → gstepf(gs, ls, D19, a).vhead = lstepf(gs, ls, D19, a).first) ∧ noid (lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, lstepf(gs, ls, D19, a).nxt, gstepf(gs, ls, D19, a).vs) ; gstepf(gs, ls, D19, a).vs[lstepf(gs, ls, D19, a).nxt].deqID ≠ None ∧ noid (lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, lstepf(gs, ls, D19, a).first, gstepf(gs, ls, D19, a).vs) ∧ gstepf(gs, ls, D19, a).rvowns(gstepf(gs, ls, D19, a).vretRefs(lstepf(gs, ls, D19, a).tid)) = Pending(lstepf(gs, ls, D19, a).tid) )) ∧ ( listp (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).ps, gstepf(gs, ls, D19, a).owns) ∧ ¬ dups(gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl) ∧ markedp(gstepf(gs, ls, D19, a).orl, gstepf(gs, ls, D19, a).ps) ∧ markedp(gstepf(gs, ls, D19, a).orl, gstepf(gs, ls, D19, a).vs) ∧ unmarkedp(gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).ps) ∧ gstepf(gs, ls, D19, a).orl ≠ [] ∧ gstepf(gs, ls, D19, a).phead ∈ gstepf(gs, ls, D19, a).orl ∧ rvownerok(gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).vrvHp, gstepf(gs, ls, D19, a).rvowns) ∧ allocrv(gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D19, a).pretRefs, gstepf(gs, ls, D19, a).prvHp, gstepf(gs, ls, D19, a).rvowns) ∧ allocrv(gstepf(gs, ls, D19, a).pretRefs, gstepf(gs, ls, D19, a).prvHp) ∧ dom gstepf(gs, ls, D19, a).vrvHp = dom gstepf(gs, ls, D19, a).prvHp ∧ ( gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next ≠ null ∧ gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D19, a).rvowns (gstepf(gs, ls, D19, a).vretRefs(gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].deqID.tid, gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D19, a).orl.last = gstepf(gs, ls, D19, a).vhead ∧ (gstepf(gs, ls, D19, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D19, a).qrl.tail, gstepf(gs, ls, D19, a).vs)) ∨ gstepf(gs, ls, D19, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D19, a).orl.butlast.last = gstepf(gs, ls, D19, a).vhead ∧ gstepf(gs, ls, D19, a).phead ≠ gstepf(gs, ls, D19, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs)) ∧ ( gstepf(gs, ls, D19, a).vtail = (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl).last ∨ gstepf(gs, ls, D19, a).qrl ≠ [] ∧ gstepf(gs, ls, D19, a).vtail = (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl.butlast).last ∧ gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D19, a).vs[(gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, D19, a).first ∈ gstepf(gs, ls, D19, a).orl ∧ gstepf(gs, ls, D19, a).vhead ∈ gstepf(gs, ls, D19, a).orl from lstepf(gs, ls, D19, a).first) ∧ ( lstepf(gs, ls, D19, a).first ≠ lstepf(gs, ls, D19, a).lst ∧ gstepf(gs, ls, D19, a).vtail ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from lstepf(gs, ls, D19, a).lst) ∧ lstepf(gs, ls, D19, a).lst ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from lstepf(gs, ls, D19, a).first ∧ ( gstepf(gs, ls, D19, a).vretRefs(lstepf(gs, ls, D19, a).tid) = lstepf(gs, ls, D19, a).rvref ∧ gstepf(gs, ls, D19, a).pretRefs(lstepf(gs, ls, D19, a).tid) = lstepf(gs, ls, D19, a).rvref ∧ lstepf(gs, ls, D19, a).rvref ∈ gstepf(gs, ls, D19, a).vrvHp ∧ lstepf(gs, ls, D19, a).rvref ≠ null) ∧ ( gstepf(gs, ls, D19, a).vhead ≠ lstepf(gs, ls, D19, a).first → nextnottid(lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).vhead, gstepf(gs, ls, D19, a).vs)) ∧ noowns(lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).owns)
| ls.nxt = gs.ps[ls.first].next, ls.optval = Val(gs.vs[ls.nxt].val), 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, D19, a) = D20, ls.first ≠ ls.lst, 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, ls.first, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), pre(gs, ls, D19, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ls.first ∈ gs.orl, gs.vhead ∈ gs.orl from ls.first, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, ls.lst ∈ gs.orl + gs.qrl from ls.first, 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, D19, a).nxt ≠ null ∧ lstepf(gs, ls, D19, a).nxt = gstepf(gs, ls, D19, a).ps[lstepf(gs, ls, D19, a).first].next ∧ lstepf(gs, ls, D19, a).optval = Val(gstepf(gs, ls, D19, a).vs[lstepf(gs, ls, D19, a).nxt].val) ∧ ( gstepf(gs, ls, D19, a).qrl ≠ [] ∧ gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).qrl.head].deqID = Some(lstepf(gs, ls, D19, a).tid) → gstepf(gs, ls, D19, a).vhead = lstepf(gs, ls, D19, a).first ∧ lstepf(gs, ls, D19, a).success) ∧ (lstepf(gs, ls, D19, a).success ⊃ gstepf(gs, ls, D19, a).vs[lstepf(gs, ls, D19, a).nxt].deqID = Some(lstepf(gs, ls, D19, a).tid) ∧ gstepf(gs, ls, D19, a).rvowns(gstepf(gs, ls, D19, a).vretRefs(lstepf(gs, ls, D19, a).tid)) = Claimed(lstepf(gs, ls, D19, a).tid, lstepf(gs, ls, D19, a).optval.val) ∧ (gstepf(gs, ls, D19, a).ps[lstepf(gs, ls, D19, a).nxt].deqID = None → gstepf(gs, ls, D19, a).vhead = lstepf(gs, ls, D19, a).first) ∧ noid (lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, lstepf(gs, ls, D19, a).nxt, gstepf(gs, ls, D19, a).vs) ; gstepf(gs, ls, D19, a).vs[lstepf(gs, ls, D19, a).nxt].deqID ≠ None ∧ noid (lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, lstepf(gs, ls, D19, a).first, gstepf(gs, ls, D19, a).vs) ∧ gstepf(gs, ls, D19, a).rvowns(gstepf(gs, ls, D19, a).vretRefs(lstepf(gs, ls, D19, a).tid)) = Pending(lstepf(gs, ls, D19, a).tid) )) ∧ ( listp (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).ps, gstepf(gs, ls, D19, a).owns) ∧ ¬ dups(gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl) ∧ markedp(gstepf(gs, ls, D19, a).orl, gstepf(gs, ls, D19, a).ps) ∧ markedp(gstepf(gs, ls, D19, a).orl, gstepf(gs, ls, D19, a).vs) ∧ unmarkedp(gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).ps) ∧ gstepf(gs, ls, D19, a).orl ≠ [] ∧ gstepf(gs, ls, D19, a).phead ∈ gstepf(gs, ls, D19, a).orl ∧ rvownerok(gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).vrvHp, gstepf(gs, ls, D19, a).rvowns) ∧ allocrv(gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D19, a).pretRefs, gstepf(gs, ls, D19, a).prvHp, gstepf(gs, ls, D19, a).rvowns) ∧ allocrv(gstepf(gs, ls, D19, a).pretRefs, gstepf(gs, ls, D19, a).prvHp) ∧ dom gstepf(gs, ls, D19, a).vrvHp = dom gstepf(gs, ls, D19, a).prvHp ∧ ( gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next ≠ null ∧ gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D19, a).rvowns (gstepf(gs, ls, D19, a).vretRefs(gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].deqID.tid, gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D19, a).orl.last = gstepf(gs, ls, D19, a).vhead ∧ (gstepf(gs, ls, D19, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D19, a).qrl.tail, gstepf(gs, ls, D19, a).vs)) ∨ gstepf(gs, ls, D19, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D19, a).orl.butlast.last = gstepf(gs, ls, D19, a).vhead ∧ gstepf(gs, ls, D19, a).phead ≠ gstepf(gs, ls, D19, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs)) ∧ ( gstepf(gs, ls, D19, a).vtail = (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl).last ∨ gstepf(gs, ls, D19, a).qrl ≠ [] ∧ gstepf(gs, ls, D19, a).vtail = (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl.butlast).last ∧ gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D19, a).vs[(gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, D19, a).first ∈ gstepf(gs, ls, D19, a).orl ∧ gstepf(gs, ls, D19, a).vhead ∈ gstepf(gs, ls, D19, a).orl from lstepf(gs, ls, D19, a).first) ∧ ( lstepf(gs, ls, D19, a).first ≠ lstepf(gs, ls, D19, a).lst ∧ gstepf(gs, ls, D19, a).vtail ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from lstepf(gs, ls, D19, a).lst) ∧ lstepf(gs, ls, D19, a).lst ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from lstepf(gs, ls, D19, a).first ∧ ( gstepf(gs, ls, D19, a).vretRefs(lstepf(gs, ls, D19, a).tid) = lstepf(gs, ls, D19, a).rvref ∧ gstepf(gs, ls, D19, a).pretRefs(lstepf(gs, ls, D19, a).tid) = lstepf(gs, ls, D19, a).rvref ∧ lstepf(gs, ls, D19, a).rvref ∈ gstepf(gs, ls, D19, a).vrvHp ∧ lstepf(gs, ls, D19, a).rvref ≠ null) ∧ ( gstepf(gs, ls, D19, a).vhead ≠ lstepf(gs, ls, D19, a).first → nextnottid(lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).vhead, gstepf(gs, ls, D19, a).vs)) ∧ noowns(lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).owns) |
ls.nxt = gs.ps[ls.first].next, ls.optval = Val(gs.vs[ls.nxt].val), 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.first ≠ ls.lst, 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, ls.first, 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, ls.first ∈ gs.ps, gs.phead ∈ gs.vs, ls.first ∈ gs.vs, gs.phead ∈ gs.orl, ls.first ∈ gs.orl, gs.vhead ∈ gs.orl from ls.first, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, 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 from ls.first ∨ 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) ⊦ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ≠ null ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .ps [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ] .next ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).optval = Val (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .val) ∧ ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl ≠ [] ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl .head ] .deqID = Some(((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) → ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).success) ∧ (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).success ⊃ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID = Some(((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .rvowns (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vretRefs (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid)) = Claimed (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).optval.val) ∧ ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .ps [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID = None → ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first) ∧ noid (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs) ; ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID ≠ None ∧ noid (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs) ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .rvowns (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vretRefs (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid)) = Pending(((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) ) ∧ listp ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .ps, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .owns) ∧ ¬ dups ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl) ∧ markedp (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .ps) ∧ markedp (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs) ∧ unmarkedp (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .ps) ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl ≠ [] ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .phead ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl ∧ rvownerok (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vretRefs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vrvHp, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .rvowns) ∧ allocrv (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vretRefs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vrvHp) ∧ nonullRetRefs ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vretRefs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .pretRefs) ∧ rvownerok (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .pretRefs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .prvHp, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .rvowns) ∧ allocrv (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .pretRefs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .prvHp) ∧ dom ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vrvHp = dom ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .prvHp ∧ ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead ] .next ≠ null ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead ] .next ] .deqID ≠ None → ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .rvowns (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vretRefs (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead ] .next ] .deqID .tid)) = Claimed (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead ] .next ] .deqID .tid, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead ] .next ] .val)) ∧ ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl .last = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead ∧ ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl ≠ [] → unmarkedp (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl .tail, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs)) ∨ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl .butlast ≠ [] ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl .butlast .last = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .phead ≠ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl .last ∧ unmarkedp (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs)) ∧ ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vtail = ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl ).last ∨ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl ≠ [] ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vtail = ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl .butlast ).last ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl .last ] .deqID = None ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl .last ] .next = null) ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl from ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ≠ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vtail ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl from ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∧ ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl from ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∨ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl) ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vretRefs (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .pretRefs (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vrvHp ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ≠ null ∧ ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead ≠ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first → nextnottid (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs)) ∧ noowns (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .owns)
Used simplifier rules: ⊦ Val(val).val = val; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ gstepf(gs, ls, D19, a) = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]) .rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ); (s) ⊦ lstepf(gs, ls, D19, a) = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true ;ls.success:= false ); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ pre(gs, ls, D19, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D19, a) = D20; (s)
| ls.nxt = gs.ps[ls.first].next, ls.optval = Val(gs.vs[ls.nxt].val), 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.first ≠ ls.lst, 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, ls.first, 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, ls.first ∈ gs.ps, gs.phead ∈ gs.vs, ls.first ∈ gs.vs, gs.phead ∈ gs.orl, ls.first ∈ gs.orl, gs.vhead ∈ gs.orl from ls.first, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, 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 from ls.first ∨ 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) ⊦ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ≠ null ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .ps [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ] .next ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).optval = Val (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .val) ∧ ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl ≠ [] ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl .head ] .deqID = Some(((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) → ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).success) ∧ (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).success ⊃ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID = Some(((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .rvowns (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vretRefs (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid)) = Claimed (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).optval.val) ∧ ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .ps [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID = None → ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first) ∧ noid (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs) ; ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID ≠ None ∧ noid (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs) ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .rvowns (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vretRefs (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid)) = Pending(((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) ) ∧ listp ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .ps, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .owns) ∧ ¬ dups ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl) ∧ markedp (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .ps) ∧ markedp (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs) ∧ unmarkedp (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .ps) ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl ≠ [] ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .phead ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl ∧ rvownerok (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vretRefs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vrvHp, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .rvowns) ∧ allocrv (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vretRefs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vrvHp) ∧ nonullRetRefs ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vretRefs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .pretRefs) ∧ rvownerok (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .pretRefs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .prvHp, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .rvowns) ∧ allocrv (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .pretRefs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .prvHp) ∧ dom ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vrvHp = dom ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .prvHp ∧ ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead ] .next ≠ null ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead ] .next ] .deqID ≠ None → ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .rvowns (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vretRefs (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead ] .next ] .deqID .tid)) = Claimed (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead ] .next ] .deqID .tid, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead ] .next ] .val)) ∧ ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl .last = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead ∧ ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl ≠ [] → unmarkedp (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl .tail, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs)) ∨ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl .butlast ≠ [] ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl .butlast .last = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .phead ≠ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl .last ∧ unmarkedp (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs)) ∧ ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vtail = ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl ).last ∨ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl ≠ [] ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vtail = ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl .butlast ).last ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl .last ] .deqID = None ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl .last ] .next = null) ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl from ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ≠ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vtail ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl from ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∧ ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .orl from ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∨ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .qrl) ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vretRefs (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .pretRefs (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vrvHp ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ≠ null ∧ ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead ≠ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first → nextnottid (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vhead, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .vs)) ∧ noowns (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(ls.rvref; Claimed(ls.tid, gs.vs[ls.nxt].val)) ;gs ) .owns) |
ls.nxt = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), 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.first ≠ ls.lst, 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, ls.first, 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, vtail ∈ orl + qrl from ls.lst, vhead ∈ orl from ls.first, ls.first ∈ orl, phead ∈ orl, ls.first ∈ vs, phead ∈ vs, ls.first ∈ ps, 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 from ls.first ∨ ls.lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ≠ null ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .ps [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ] .next ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).optval = Val (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .val) ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl ≠ [] ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl .head ] .deqID = Some(((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) → ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).success) ∧ (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).success ⊃ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID = Some(((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .rvowns (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vretRefs (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid)) = Claimed (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).optval.val) ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .ps [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID = None → ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first) ∧ noid (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs) ; ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID ≠ None ∧ noid (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs) ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .rvowns (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vretRefs (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid)) = Pending(((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) ) ∧ listp ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .ps, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .owns) ∧ ¬ dups ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl) ∧ markedp (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .ps) ∧ markedp (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs) ∧ unmarkedp (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .ps) ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl ≠ [] ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .phead ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl ∧ rvownerok (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vretRefs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vrvHp, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .rvowns) ∧ allocrv (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vretRefs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vrvHp) ∧ nonullRetRefs ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vretRefs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .pretRefs) ∧ rvownerok (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .pretRefs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .prvHp, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .rvowns) ∧ allocrv (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .pretRefs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .prvHp) ∧ dom ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vrvHp = dom ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .prvHp ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead ] .next ≠ null ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead ] .next ] .deqID ≠ None → ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .rvowns (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vretRefs (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead ] .next ] .deqID .tid)) = Claimed (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead ] .next ] .deqID .tid, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead ] .next ] .val)) ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl .last = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl ≠ [] → unmarkedp (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl .tail, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs)) ∨ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl .butlast ≠ [] ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl .butlast .last = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .phead ≠ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl .last ∧ unmarkedp (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs)) ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vtail = ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl ).last ∨ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl ≠ [] ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vtail = ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl .butlast ).last ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl .last ] .deqID = None ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl .last ] .next = null) ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl from ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ≠ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vtail ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl from ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl from ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∨ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl) ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vretRefs (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .pretRefs (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vrvHp ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ≠ null ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead ≠ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first → nextnottid (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs)) ∧ noowns (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .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 = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), 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.first ≠ ls.lst, 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, ls.first, 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, vtail ∈ orl + qrl from ls.lst, vhead ∈ orl from ls.first, ls.first ∈ orl, phead ∈ orl, ls.first ∈ vs, phead ∈ vs, ls.first ∈ ps, 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 from ls.first ∨ ls.lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ≠ null ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .ps [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ] .next ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).optval = Val (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .val) ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl ≠ [] ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl .head ] .deqID = Some(((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) → ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).success) ∧ (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).success ⊃ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID = Some(((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .rvowns (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vretRefs (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid)) = Claimed (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).optval.val) ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .ps [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID = None → ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first) ∧ noid (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs) ; ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID ≠ None ∧ noid (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs) ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .rvowns (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vretRefs (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid)) = Pending(((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) ) ∧ listp ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .ps, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .owns) ∧ ¬ dups ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl) ∧ markedp (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .ps) ∧ markedp (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs) ∧ unmarkedp (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .ps) ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl ≠ [] ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .phead ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl ∧ rvownerok (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vretRefs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vrvHp, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .rvowns) ∧ allocrv (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vretRefs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vrvHp) ∧ nonullRetRefs ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vretRefs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .pretRefs) ∧ rvownerok (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .pretRefs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .prvHp, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .rvowns) ∧ allocrv (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .pretRefs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .prvHp) ∧ dom ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vrvHp = dom ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .prvHp ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead ] .next ≠ null ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead ] .next ] .deqID ≠ None → ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .rvowns (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vretRefs (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead ] .next ] .deqID .tid)) = Claimed (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead ] .next ] .deqID .tid, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead ] .next ] .val)) ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl .last = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl ≠ [] → unmarkedp (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl .tail, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs)) ∨ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl .butlast ≠ [] ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl .butlast .last = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .phead ≠ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl .last ∧ unmarkedp (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs)) ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vtail = ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl ).last ∨ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl ≠ [] ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vtail = ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl .butlast ).last ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl .last ] .deqID = None ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl .last ] .next = null) ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl from ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ≠ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vtail ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl from ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .orl from ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∨ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .qrl) ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vretRefs (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .pretRefs (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vrvHp ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ≠ null ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead ≠ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first → nextnottid (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vhead, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .vs)) ∧ noowns (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ (gs.vs:= vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val)) ;gs ) .owns) |
ls.nxt = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), dom vrvHp = dom prvHp, pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.first ≠ ls.lst, 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, ls.first, 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.first ∈ orl, vhead ∈ orl from ls.first, vtail ∈ orl + qrl from ls.lst, ls.rvref ∈ vrvHp, phead ∈ vs, ls.first ∈ vs, phead ∈ ps, ls.first ∈ 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 from ls.first ∨ ls.lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ≠ null ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ] .next ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).optval = Val (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .val) ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .head ] .deqID = Some(((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) → ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).success) ∧ (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).success ⊃ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID = Some(((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid)) = Claimed (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).optval.val) ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID = None → ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first) ∧ noid (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ; ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID ≠ None ∧ noid (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid)) = Pending(((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) ) ∧ listp ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ ¬ dups ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ markedp (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ markedp (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ unmarkedp (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ≠ [] ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∧ rvownerok (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ nonullRetRefs ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs) ∧ rvownerok (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ dom ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp = dom ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ≠ null ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID ≠ None → ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid)) = Claimed (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .val)) ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] → unmarkedp (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .tail, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∨ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast ≠ [] ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast .last = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ≠ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last ∧ unmarkedp (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ).last ∨ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .butlast ).last ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .deqID = None ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .next = null) ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl from ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ≠ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl from ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∨ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ≠ null ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ≠ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first → nextnottid (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∧ noowns (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .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 ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .rvowns:= rvowns0 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns0); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs:= ps2 = mkgs (ps, ps2, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns); (s)
| ls.nxt = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), dom vrvHp = dom prvHp, pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.first ≠ ls.lst, 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, ls.first, 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.first ∈ orl, vhead ∈ orl from ls.first, vtail ∈ orl + qrl from ls.lst, ls.rvref ∈ vrvHp, phead ∈ vs, ls.first ∈ vs, phead ∈ ps, ls.first ∈ 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 from ls.first ∨ ls.lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ≠ null ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ] .next ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).optval = Val (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .val) ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .head ] .deqID = Some(((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) → ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).success) ∧ (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).success ⊃ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID = Some(((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid)) = Claimed (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).optval.val) ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID = None → ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first) ∧ noid (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ; ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID ≠ None ∧ noid (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid)) = Pending(((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) ) ∧ listp ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ ¬ dups ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ markedp (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ markedp (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ unmarkedp (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ≠ [] ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∧ rvownerok (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ nonullRetRefs ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs) ∧ rvownerok (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ dom ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp = dom ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ≠ null ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID ≠ None → ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid)) = Claimed (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .val)) ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] → unmarkedp (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .tail, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∨ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast ≠ [] ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast .last = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ≠ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last ∧ unmarkedp (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ).last ∨ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .butlast ).last ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .deqID = None ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .next = null) ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl from ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ≠ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl from ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∨ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) = ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ∈ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ≠ null ∧ ( ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ≠ ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first → nextnottid (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∧ noowns (((ps ⊕ vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.nxt].deqID = None ⊃ mkgs (ps, vs[ls.nxt, vs[ls.nxt].deqID:= Some(ls.tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(ls.rvref; Claimed(ls.tid, vs[ls.nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) |
dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), nxt = ps[first].next, optval = Val(vs[nxt].val), pretRefs(tid) = rvref, rvowns(rvref) = Pending(tid), ¬ success, vretRefs(tid) = rvref, first ≠ lst, 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, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, phead ∈ ps, first ∈ vs, phead ∈ vs, rvref ∈ vrvHp, vtail ∈ orl + qrl from lst, vhead ∈ orl from first, first ∈ orl, 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 from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ≠ null ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt = ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ] .next ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).optval = Val (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .val) ∧ ( ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .head ] .deqID = Some(((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) → ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead = ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).success) ∧ (((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).success ⊃ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID = Some(((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid)) = Claimed (((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).optval.val) ∧ ( ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID = None → ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead = ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first) ∧ noid (((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ; ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID ≠ None ∧ noid (((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid)) = Pending(((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) ) ∧ listp ( ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ ¬ dups ( ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ markedp (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ markedp (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ unmarkedp (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ≠ [] ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∧ rvownerok (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ nonullRetRefs ( ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs) ∧ rvownerok (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ dom ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp = dom ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp ∧ ( ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ≠ null ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID ≠ None → ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid)) = Claimed (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .val)) ∧ ( ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last = ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ ( ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] → unmarkedp (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .tail, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∨ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast ≠ [] ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast .last = ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ≠ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last ∧ unmarkedp (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∧ ( ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ).last ∨ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .butlast ).last ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .deqID = None ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .next = null) ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∈ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl from ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ≠ ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∧ ( ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∈ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl from ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∨ ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∈ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) = ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) = ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ∈ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ≠ null ∧ ( ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ≠ ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first → nextnottid (((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∧ noowns (((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .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 = ps[first].next, optval = Val(vs[nxt].val), pretRefs(tid) = rvref, rvowns(rvref) = Pending(tid), ¬ success, vretRefs(tid) = rvref, first ≠ lst, 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, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, phead ∈ ps, first ∈ vs, phead ∈ vs, rvref ∈ vrvHp, vtail ∈ orl + qrl from lst, vhead ∈ orl from first, first ∈ orl, 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 from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ≠ null ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt = ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ] .next ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).optval = Val (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .val) ∧ ( ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .head ] .deqID = Some(((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) → ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead = ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).success) ∧ (((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).success ⊃ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID = Some(((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid)) = Claimed (((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).optval.val) ∧ ( ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID = None → ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead = ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first) ∧ noid (((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ; ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID ≠ None ∧ noid (((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid)) = Pending(((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) ) ∧ listp ( ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ ¬ dups ( ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ markedp (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ markedp (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ unmarkedp (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ≠ [] ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∧ rvownerok (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ nonullRetRefs ( ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs) ∧ rvownerok (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ dom ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp = dom ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp ∧ ( ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ≠ null ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID ≠ None → ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid)) = Claimed (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .val)) ∧ ( ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last = ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ ( ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] → unmarkedp (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .tail, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∨ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast ≠ [] ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast .last = ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ≠ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last ∧ unmarkedp (((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∧ ( ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ).last ∨ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .butlast ).last ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .deqID = None ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .next = null) ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∈ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl from ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ≠ ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∧ ( ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∈ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl from ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∨ ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∈ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) = ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) = ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ∈ ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ≠ null ∧ ( ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ≠ ((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first → nextnottid (((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∧ noowns (((ps ⊕ vs)[nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[nxt].deqID = None ⊃ mkgs (ps, vs[nxt, vs[nxt].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(rvref; Claimed(tid, vs[nxt].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, first ≠ lst, 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, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ 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 from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ≠ null ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ] .next ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .optval = Val (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .val) ∧ ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .head ] .deqID = Some (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) → ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .success) ∧ (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .success ⊃ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID = Some (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid)) = Claimed (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .optval .val) ∧ ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID = None → ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first) ∧ noid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ; ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID ≠ None ∧ noid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid)) = Pending (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) ) ∧ listp ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ ¬ dups ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ markedp (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ markedp (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ unmarkedp (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ≠ [] ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∧ rvownerok (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ nonullRetRefs ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs) ∧ rvownerok (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ dom ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp = dom ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp ∧ ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ≠ null ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID ≠ None → ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid)) = Claimed (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .val)) ∧ ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] → unmarkedp (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .tail, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∨ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast ≠ [] ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast .last = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ≠ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last ∧ unmarkedp (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∧ ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ).last ∨ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .butlast ).last ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .deqID = None ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .next = null) ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∈ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ≠ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∧ ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∈ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∨ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∈ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∈ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ≠ null ∧ ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ≠ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first → nextnottid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∧ noowns (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns)
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 ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success:= success0 = mkls (tid, value, optval, node, nd, success0, node0, node1, rvref, optval0, node2, tid0, rvref0); (s)
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, first ≠ lst, 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, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ 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 from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ≠ null ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ] .next ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .optval = Val (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .val) ∧ ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .head ] .deqID = Some (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) → ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .success) ∧ (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .success ⊃ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID = Some (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid)) = Claimed (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .optval .val) ∧ ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID = None → ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first) ∧ noid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ; ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID ≠ None ∧ noid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid)) = Pending (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) ) ∧ listp ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ ¬ dups ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ markedp (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ markedp (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ unmarkedp (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ≠ [] ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∧ rvownerok (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ nonullRetRefs ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs) ∧ rvownerok (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ dom ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp = dom ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp ∧ ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ≠ null ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID ≠ None → ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid)) = Claimed (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .val)) ∧ ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] → unmarkedp (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .tail, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∨ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast ≠ [] ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast .last = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ≠ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last ∧ unmarkedp (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∧ ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ).last ∨ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .butlast ).last ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .deqID = None ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .next = null) ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∈ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ≠ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∧ ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∈ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∨ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∈ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∈ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ≠ null ∧ ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ≠ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first → nextnottid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∧ noowns (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) |
((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, first ≠ lst, 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, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, vhead ∈ orl from first, first ∈ orl, 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 from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ≠ null ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt = ps0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ] .next ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .optval = Val (vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .val) ∧ ( qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) → vhead0 = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .success) ∧ (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .success ⊃ vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID = Some (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) ∧ rvowns0 (vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid)) = Claimed (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .optval .val) ∧ ( ps0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID = None → vhead0 = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first) ∧ noid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, orl0 + qrl0, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt, vs0) ; vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID ≠ None ∧ noid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, orl0 + qrl0, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first, vs0) ∧ rvowns0 (vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid)) = Pending (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) ) ∧ listp(orl0 + qrl0, vs0, ps0, owns0) ∧ ¬ dups(orl0 + qrl0) ∧ markedp(orl0, ps0) ∧ markedp(orl0, vs0) ∧ unmarkedp(qrl0, ps0) ∧ orl0 ≠ [] ∧ phead0 ∈ orl0 ∧ rvownerok(vretRefs0, vrvHp0, rvowns0) ∧ allocrv(vretRefs0, vrvHp0) ∧ nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns0) ∧ allocrv(pretRefs0, prvHp0) ∧ dom vrvHp0 = dom prvHp0 ∧ ( vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val)) ∧ ( orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0)) ∧ (vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null) ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∈ orl0 ∧ vhead0 ∈ orl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ≠ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∧ vtail0 ∈ orl0 + qrl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∧ ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∈ orl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∨ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∈ qrl0) ∧ vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∧ pretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∈ vrvHp0 ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ≠ null ∧ ( vhead0 ≠ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first → nextnottid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, vhead0, vs0)) ∧ noowns (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, owns0)
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: qrl0, ps0, phead0, vrvHp0, vretRefs0, vhead0, vtail0, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0
| ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, first ≠ lst, 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, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, vhead ∈ orl from first, first ∈ orl, 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 from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ≠ null ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt = ps0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ] .next ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .optval = Val (vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .val) ∧ ( qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) → vhead0 = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .success) ∧ (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .success ⊃ vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID = Some (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) ∧ rvowns0 (vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid)) = Claimed (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .optval .val) ∧ ( ps0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID = None → vhead0 = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first) ∧ noid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, orl0 + qrl0, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt, vs0) ; vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID ≠ None ∧ noid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, orl0 + qrl0, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first, vs0) ∧ rvowns0 (vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid)) = Pending (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) ) ∧ listp(orl0 + qrl0, vs0, ps0, owns0) ∧ ¬ dups(orl0 + qrl0) ∧ markedp(orl0, ps0) ∧ markedp(orl0, vs0) ∧ unmarkedp(qrl0, ps0) ∧ orl0 ≠ [] ∧ phead0 ∈ orl0 ∧ rvownerok(vretRefs0, vrvHp0, rvowns0) ∧ allocrv(vretRefs0, vrvHp0) ∧ nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns0) ∧ allocrv(pretRefs0, prvHp0) ∧ dom vrvHp0 = dom prvHp0 ∧ ( vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val)) ∧ ( orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0)) ∧ (vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null) ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∈ orl0 ∧ vhead0 ∈ orl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ≠ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∧ vtail0 ∈ orl0 + qrl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∧ ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∈ orl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∨ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∈ qrl0) ∧ vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∧ pretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∈ vrvHp0 ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ≠ null ∧ ( vhead0 ≠ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first → nextnottid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, vhead0, vs0)) ∧ noowns (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, owns0) |
⊦ listp(rl + rl0, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + rl0, vs, ps, owns))
((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, first ≠ lst, 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, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ 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), listp(orl + qrl, vs, ps, owns) ∧ first ∈ orl → (∃ rl1, rl2. orl = rl1 + first ' + rl2 ∧ listp(first ' + rl2 + qrl, vs, ps, owns)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ≠ null ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt = ps0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ] .next ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .optval = Val (vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .val) ∧ ( qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) → vhead0 = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .success) ∧ (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .success ⊃ vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID = Some (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) ∧ rvowns0 (vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid)) = Claimed (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .optval .val) ∧ ( ps0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID = None → vhead0 = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first) ∧ noid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, orl0 + qrl0, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt, vs0) ; vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID ≠ None ∧ noid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, orl0 + qrl0, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first, vs0) ∧ rvowns0 (vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid)) = Pending (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) ) ∧ listp(orl0 + qrl0, vs0, ps0, owns0) ∧ ¬ dups(orl0 + qrl0) ∧ markedp(orl0, ps0) ∧ markedp(orl0, vs0) ∧ unmarkedp(qrl0, ps0) ∧ orl0 ≠ [] ∧ phead0 ∈ orl0 ∧ rvownerok(vretRefs0, vrvHp0, rvowns0) ∧ allocrv(vretRefs0, vrvHp0) ∧ nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns0) ∧ allocrv(pretRefs0, prvHp0) ∧ dom vrvHp0 = dom prvHp0 ∧ ( vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val)) ∧ ( orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0)) ∧ (vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null) ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∈ orl0 ∧ vhead0 ∈ orl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ≠ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∧ vtail0 ∈ orl0 + qrl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∧ ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∈ orl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∨ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∈ qrl0) ∧ vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∧ pretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∈ vrvHp0 ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ≠ null ∧ ( vhead0 ≠ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first → nextnottid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, vhead0, vs0)) ∧ noowns (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, owns0)
Used terms: ps, orl, owns, first, qrl, vs
| ⊦ listp(rl + rl0, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + rl0, vs, ps, owns)) |
| ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, first ≠ lst, 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, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ 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), listp(orl + qrl, vs, ps, owns) ∧ first ∈ orl → (∃ rl1, rl2. orl = rl1 + first ' + rl2 ∧ listp(first ' + rl2 + qrl, vs, ps, owns)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ≠ null ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt = ps0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ] .next ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .optval = Val (vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .val) ∧ ( qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) → vhead0 = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .success) ∧ (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .success ⊃ vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID = Some (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) ∧ rvowns0 (vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid)) = Claimed (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .optval .val) ∧ ( ps0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID = None → vhead0 = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first) ∧ noid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, orl0 + qrl0, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt, vs0) ; vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID ≠ None ∧ noid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, orl0 + qrl0, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first, vs0) ∧ rvowns0 (vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid)) = Pending (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) ) ∧ listp(orl0 + qrl0, vs0, ps0, owns0) ∧ ¬ dups(orl0 + qrl0) ∧ markedp(orl0, ps0) ∧ markedp(orl0, vs0) ∧ unmarkedp(qrl0, ps0) ∧ orl0 ≠ [] ∧ phead0 ∈ orl0 ∧ rvownerok(vretRefs0, vrvHp0, rvowns0) ∧ allocrv(vretRefs0, vrvHp0) ∧ nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns0) ∧ allocrv(pretRefs0, prvHp0) ∧ dom vrvHp0 = dom prvHp0 ∧ ( vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val)) ∧ ( orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0)) ∧ (vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null) ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∈ orl0 ∧ vhead0 ∈ orl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ≠ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∧ vtail0 ∈ orl0 + qrl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∧ ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∈ orl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∨ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∈ qrl0) ∧ vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∧ pretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∈ vrvHp0 ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ≠ null ∧ ( vhead0 ≠ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first → nextnottid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, vhead0, vs0)) ∧ noowns (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, owns0) |
((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, rl1 + first ' + rl2, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, rl1 + first ' + rl2, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, 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), (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ≠ null ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt = ps0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ] .next ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .optval = Val (vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .val) ∧ ( qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) → vhead0 = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .success) ∧ (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .success ⊃ vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID = Some (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) ∧ rvowns0 (vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid)) = Claimed (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .optval .val) ∧ ( ps0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID = None → vhead0 = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first) ∧ noid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, orl0 + qrl0, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt, vs0) ; vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID ≠ None ∧ noid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, orl0 + qrl0, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first, vs0) ∧ rvowns0 (vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid)) = Pending (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) ) ∧ listp(orl0 + qrl0, vs0, ps0, owns0) ∧ ¬ dups(orl0 + qrl0) ∧ markedp(orl0, ps0) ∧ markedp(orl0, vs0) ∧ unmarkedp(qrl0, ps0) ∧ orl0 ≠ [] ∧ phead0 ∈ orl0 ∧ rvownerok(vretRefs0, vrvHp0, rvowns0) ∧ allocrv(vretRefs0, vrvHp0) ∧ nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns0) ∧ allocrv(pretRefs0, prvHp0) ∧ dom vrvHp0 = dom prvHp0 ∧ ( vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val)) ∧ ( orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0)) ∧ (vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null) ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∈ orl0 ∧ vhead0 ∈ orl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ≠ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∧ vtail0 ∈ orl0 + qrl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∧ ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∈ orl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∨ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∈ qrl0) ∧ vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∧ pretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∈ vrvHp0 ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ≠ null ∧ ( vhead0 ≠ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first → nextnottid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, vhead0, vs0)) ∧ noowns (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, owns0)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' + y ≠ []; (s) ⊦ x = y + a ' + z → a ∈ x; (s)
| ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, rl1 + first ' + rl2, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, rl1 + first ' + rl2, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, 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), (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ≠ null ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt = ps0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ] .next ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .optval = Val (vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .val) ∧ ( qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) → vhead0 = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .success) ∧ (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .success ⊃ vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID = Some (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) ∧ rvowns0 (vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid)) = Claimed (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .optval .val) ∧ ( ps0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID = None → vhead0 = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first) ∧ noid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, orl0 + qrl0, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt, vs0) ; vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID ≠ None ∧ noid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, orl0 + qrl0, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first, vs0) ∧ rvowns0 (vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid)) = Pending (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) ) ∧ listp(orl0 + qrl0, vs0, ps0, owns0) ∧ ¬ dups(orl0 + qrl0) ∧ markedp(orl0, ps0) ∧ markedp(orl0, vs0) ∧ unmarkedp(qrl0, ps0) ∧ orl0 ≠ [] ∧ phead0 ∈ orl0 ∧ rvownerok(vretRefs0, vrvHp0, rvowns0) ∧ allocrv(vretRefs0, vrvHp0) ∧ nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns0) ∧ allocrv(pretRefs0, prvHp0) ∧ dom vrvHp0 = dom prvHp0 ∧ ( vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val)) ∧ ( orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0)) ∧ (vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null) ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∈ orl0 ∧ vhead0 ∈ orl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ≠ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∧ vtail0 ∈ orl0 + qrl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∧ ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∈ orl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∨ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∈ qrl0) ∧ vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∧ pretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∈ vrvHp0 ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ≠ null ∧ ( vhead0 ≠ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first → nextnottid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, vhead0, vs0)) ∧ noowns (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, owns0) |
(ps ⊕ vs)[ps[first].next].deqID = None, dom vrvHp = dom prvHp, mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, rl1 + first ' + rl2, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, 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 ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs) ⊦ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ≠ null ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt = ps0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ] .next ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .optval = Val (vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .val) ∧ ( qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) → vhead0 = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .success) ∧ (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .success ⊃ vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID = Some (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) ∧ rvowns0 (vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid)) = Claimed (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .optval .val) ∧ ( ps0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID = None → vhead0 = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first) ∧ noid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, orl0 + qrl0, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt, vs0) ; vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID ≠ None ∧ noid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, orl0 + qrl0, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first, vs0) ∧ rvowns0 (vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid)) = Pending (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) ) ∧ listp(orl0 + qrl0, vs0, ps0, owns0) ∧ ¬ dups(orl0 + qrl0) ∧ markedp(orl0, ps0) ∧ markedp(orl0, vs0) ∧ unmarkedp(qrl0, ps0) ∧ orl0 ≠ [] ∧ phead0 ∈ orl0 ∧ rvownerok(vretRefs0, vrvHp0, rvowns0) ∧ allocrv(vretRefs0, vrvHp0) ∧ nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns0) ∧ allocrv(pretRefs0, prvHp0) ∧ dom vrvHp0 = dom prvHp0 ∧ ( vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val)) ∧ ( orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0)) ∧ (vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null) ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∈ orl0 ∧ vhead0 ∈ orl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ≠ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∧ vtail0 ∈ orl0 + qrl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∧ ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∈ orl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∨ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∈ qrl0) ∧ vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∧ pretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∈ vrvHp0 ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ≠ null ∧ ( vhead0 ≠ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first → nextnottid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, vhead0, vs0)) ∧ noowns (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, owns0)
dom vrvHp = dom prvHp, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, rl1 + first ' + rl2, owns, rvowns) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (ps ⊕ vs)[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, 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 ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs) ⊦ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ≠ null ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt = ps0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ] .next ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .optval = Val (vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .val) ∧ ( qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) → vhead0 = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .success) ∧ (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .success ⊃ vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID = Some (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) ∧ rvowns0 (vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid)) = Claimed (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .optval .val) ∧ ( ps0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID = None → vhead0 = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first) ∧ noid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, orl0 + qrl0, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt, vs0) ; vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID ≠ None ∧ noid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, orl0 + qrl0, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first, vs0) ∧ rvowns0 (vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid)) = Pending (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) ) ∧ listp(orl0 + qrl0, vs0, ps0, owns0) ∧ ¬ dups(orl0 + qrl0) ∧ markedp(orl0, ps0) ∧ markedp(orl0, vs0) ∧ unmarkedp(qrl0, ps0) ∧ orl0 ≠ [] ∧ phead0 ∈ orl0 ∧ rvownerok(vretRefs0, vrvHp0, rvowns0) ∧ allocrv(vretRefs0, vrvHp0) ∧ nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns0) ∧ allocrv(pretRefs0, prvHp0) ∧ dom vrvHp0 = dom prvHp0 ∧ ( vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val)) ∧ ( orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0)) ∧ (vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null) ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∈ orl0 ∧ vhead0 ∈ orl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ≠ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∧ vtail0 ∈ orl0 + qrl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∧ ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∈ orl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∨ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∈ qrl0) ∧ vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∧ pretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∈ vrvHp0 ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ≠ null ∧ ( vhead0 ≠ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first → nextnottid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, vhead0, vs0)) ∧ noowns (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, owns0)
| (ps ⊕ vs)[ps[first].next].deqID = None, dom vrvHp = dom prvHp, mkgs (ps, vs[ps[first].next, vs[ps[first].next].deqID:= Some(tid)], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, rl1 + first ' + rl2, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[first].next].val))) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, 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 ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs) ⊦ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ≠ null ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt = ps0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ] .next ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .optval = Val (vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .val) ∧ ( qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) → vhead0 = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .success) ∧ (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .success ⊃ vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID = Some (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) ∧ rvowns0 (vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid)) = Claimed (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .optval .val) ∧ ( ps0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID = None → vhead0 = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first) ∧ noid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, orl0 + qrl0, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt, vs0) ; vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID ≠ None ∧ noid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, orl0 + qrl0, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first, vs0) ∧ rvowns0 (vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid)) = Pending (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) ) ∧ listp(orl0 + qrl0, vs0, ps0, owns0) ∧ ¬ dups(orl0 + qrl0) ∧ markedp(orl0, ps0) ∧ markedp(orl0, vs0) ∧ unmarkedp(qrl0, ps0) ∧ orl0 ≠ [] ∧ phead0 ∈ orl0 ∧ rvownerok(vretRefs0, vrvHp0, rvowns0) ∧ allocrv(vretRefs0, vrvHp0) ∧ nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns0) ∧ allocrv(pretRefs0, prvHp0) ∧ dom vrvHp0 = dom prvHp0 ∧ ( vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val)) ∧ ( orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0)) ∧ (vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null) ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∈ orl0 ∧ vhead0 ∈ orl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ≠ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∧ vtail0 ∈ orl0 + qrl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∧ ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∈ orl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∨ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∈ qrl0) ∧ vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∧ pretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∈ vrvHp0 ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ≠ null ∧ ( vhead0 ≠ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first → nextnottid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, vhead0, vs0)) ∧ noowns (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, owns0) |
(ps0 ⊕ vs)[ps0[first].next].deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ (qrl0 ≠ [] ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.head].deqID = Some(tid) → vhead0 = first) ∧ (ps0[ps0[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl0, ps0[first].next, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ listp((rl1 + first ' + rl2) + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0, owns0) ∧ markedp(rl1, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ some?(vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].deqID) ∧ markedp(rl2, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ rvownerok(vretRefs0, vrvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))) ∧ nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))) ∧ ( vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next ≠ null ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID ≠ None → ( vretRefs0(tid) = vretRefs0 (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID .tid) ⊃ Claimed(tid, vs[ps0[first].next].val) ;rvowns (vretRefs0 (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID .tid)) ) = Claimed (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID .tid, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].val)) ∧ ( (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])) ∧ ( vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].deqID = None ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next = null) ∧ (vhead0 ≠ first → nextnottid(tid, vhead0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]))
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ Claimed(tid, val) = Claimed(tid0, val0) ↔ tid = tid0 ∧ val = val0; (ws) ⊦ Some(tid) = Some(tid0) ↔ tid = tid0; (s) ⊦ (nd.deqID:= opttid).deqID = opttid; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).val = nd.val; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .first = node2; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .rvref = rvref; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ x = y + a ' + z → a ∈ x; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ Val(val).val = val; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ Val(val) = Val(val0) ↔ val = val0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) = mkgs (ps1, ps2, phead2, phead3, phead4, vretRefs1, vretRefs2, vrvHp1, vrvHp2, qrl1, qrl2, owns0, rvowns0) ↔ ps = ps1 ∧ ps0 = ps2 ∧ phead = phead2 ∧ phead0 = phead3 ∧ phead1 = phead4 ∧ vretRefs = vretRefs1 ∧ vretRefs0 = vretRefs2 ∧ vrvHp = vrvHp1 ∧ vrvHp0 = vrvHp2 ∧ qrl = qrl1 ∧ qrl0 = qrl2 ∧ owns = owns0 ∧ rvowns = rvowns0; (ws)
| (ps0 ⊕ vs)[ps0[first].next].deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ (qrl0 ≠ [] ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.head].deqID = Some(tid) → vhead0 = first) ∧ (ps0[ps0[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl0, ps0[first].next, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ listp((rl1 + first ' + rl2) + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0, owns0) ∧ markedp(rl1, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ some?(vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].deqID) ∧ markedp(rl2, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ rvownerok(vretRefs0, vrvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))) ∧ nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))) ∧ ( vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next ≠ null ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID ≠ None → ( vretRefs0(tid) = vretRefs0 (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID .tid) ⊃ Claimed(tid, vs[ps0[first].next].val) ;rvowns (vretRefs0 (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID .tid)) ) = Claimed (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID .tid, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].val)) ∧ ( (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])) ∧ ( vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].deqID = None ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next = null) ∧ (vhead0 ≠ first → nextnottid(tid, vhead0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])) |
⊦ (ps ⊕ vs)[r] = (r ∈ vs ⊃ vs[r];ps[r])
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs), lst ∈ rl2 ∨ lst ∈ qrl0, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ (qrl0 ≠ [] ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.head].deqID = Some(tid) → vhead0 = first) ∧ (ps0[ps0[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl0, ps0[first].next, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ listp((rl1 + first ' + rl2) + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0, owns0) ∧ markedp(rl1, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ some?(vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].deqID) ∧ markedp(rl2, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ rvownerok(vretRefs0, vrvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))) ∧ nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))) ∧ ( vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next ≠ null ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID ≠ None → ( vretRefs0(tid) = vretRefs0 (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID .tid) ⊃ Claimed(tid, vs[ps0[first].next].val) ;rvowns (vretRefs0 (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID .tid)) ) = Claimed (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID .tid, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].val)) ∧ ( (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])) ∧ ( vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].deqID = None ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next = null) ∧ (vhead0 ≠ first → nextnottid(tid, vhead0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]))
Used terms: ps0, vs, ps0[first].next
| ⊦ (ps ⊕ vs)[r] = (r ∈ vs ⊃ vs[r];ps[r]) |
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs), lst ∈ rl2 ∨ lst ∈ qrl0, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ (qrl0 ≠ [] ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.head].deqID = Some(tid) → vhead0 = first) ∧ (ps0[ps0[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl0, ps0[first].next, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ listp((rl1 + first ' + rl2) + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0, owns0) ∧ markedp(rl1, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ some?(vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].deqID) ∧ markedp(rl2, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ rvownerok(vretRefs0, vrvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))) ∧ nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))) ∧ ( vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next ≠ null ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID ≠ None → ( vretRefs0(tid) = vretRefs0 (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID .tid) ⊃ Claimed(tid, vs[ps0[first].next].val) ;rvowns (vretRefs0 (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID .tid)) ) = Claimed (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID .tid, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].val)) ∧ ( (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])) ∧ ( vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].deqID = None ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next = null) ∧ (vhead0 ≠ first → nextnottid(tid, vhead0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])) |
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = [], rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ (qrl0 ≠ [] ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.head].deqID = Some(tid) → vhead0 = first) ∧ (ps0[ps0[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl0, ps0[first].next, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ listp((rl1 + first ' + rl2) + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0, owns0) ∧ markedp(rl1, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ some?(vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].deqID) ∧ markedp(rl2, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ rvownerok(vretRefs0, vrvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))) ∧ nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))) ∧ ( vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next ≠ null ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID ≠ None → ( vretRefs0(tid) = vretRefs0 (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID .tid) ⊃ Claimed(tid, vs[ps0[first].next].val) ;rvowns (vretRefs0 (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID .tid)) ) = Claimed (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID .tid, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].val)) ∧ ( (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])) ∧ ( vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].deqID = None ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next = null) ∧ (vhead0 ≠ first → nextnottid(tid, vhead0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]))
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = first0 + rl, rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ (qrl0 ≠ [] ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.head].deqID = Some(tid) → vhead0 = first) ∧ (ps0[ps0[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl0, ps0[first].next, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ listp((rl1 + first ' + rl2) + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0, owns0) ∧ markedp(rl1, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ some?(vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].deqID) ∧ markedp(rl2, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ rvownerok(vretRefs0, vrvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))) ∧ nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))) ∧ ( vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next ≠ null ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID ≠ None → ( vretRefs0(tid) = vretRefs0 (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID .tid) ⊃ Claimed(tid, vs[ps0[first].next].val) ;rvowns (vretRefs0 (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID .tid)) ) = Claimed (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID .tid, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].val)) ∧ ( (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])) ∧ ( vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].deqID = None ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next = null) ∧ (vhead0 ≠ first → nextnottid(tid, vhead0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]))
Used simplifier rules: reflist freely generated by [], +;;
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = [], rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ (qrl0 ≠ [] ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.head].deqID = Some(tid) → vhead0 = first) ∧ (ps0[ps0[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl0, ps0[first].next, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ listp((rl1 + first ' + rl2) + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0, owns0) ∧ markedp(rl1, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ some?(vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].deqID) ∧ markedp(rl2, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ rvownerok(vretRefs0, vrvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))) ∧ nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))) ∧ ( vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next ≠ null ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID ≠ None → ( vretRefs0(tid) = vretRefs0 (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID .tid) ⊃ Claimed(tid, vs[ps0[first].next].val) ;rvowns (vretRefs0 (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID .tid)) ) = Claimed (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID .tid, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].val)) ∧ ( (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])) ∧ ( vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].deqID = None ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next = null) ∧ (vhead0 ≠ first → nextnottid(tid, vhead0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])) |
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + qrl0, vs, ps0, owns0), listp(rl1 + first ' + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + qrl0, first, vs), nonullRetRefs(rl1 + first ' + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), lst ∈ ps0, lst ∈ vs, lst ∈ qrl0, vtail0 ∈ rl1 + first ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl1, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead0 ≠ rl1.last ∧ unmarkedp(qrl0, vs) ⊦ noid(tid, rl1 + first ' + qrl0, ps0[first].next, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ listp(rl1 + first ' + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0, owns0) ∧ markedp(rl1, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ some?(vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].deqID) ∧ rvownerok(vretRefs0, vrvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))) ∧ nonullRetRefs(rl1 + first ' + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))) ∧ ( vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].next ≠ null ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].next].deqID ≠ None → ( vretRefs0(tid) = vretRefs0 (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].next].deqID .tid) ⊃ Claimed(tid, vs[ps0[first].next].val) ;rvowns (vretRefs0 (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].next].deqID .tid)) ) = Claimed (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].next].deqID.tid, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].next].val)) ∧ ( (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead0 ≠ rl1.last ∧ unmarkedp(qrl0, vs[ps0[rl1.last].next, vs[ps0[rl1.last].next].deqID:= Some(tid)])) ∧ ( vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + qrl0.butlast).last ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].deqID = None ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next = null)
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-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 ⊦ [] + x = x; (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ markedp([], vs); (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s)
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + qrl0, vs, ps0, owns0), listp(rl1 + first ' + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + qrl0, first, vs), nonullRetRefs(rl1 + first ' + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), lst ∈ ps0, lst ∈ vs, lst ∈ qrl0, vtail0 ∈ rl1 + first ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl1, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead0 ≠ rl1.last ∧ unmarkedp(qrl0, vs) ⊦ noid(tid, rl1 + first ' + qrl0, ps0[first].next, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ listp(rl1 + first ' + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0, owns0) ∧ markedp(rl1, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ some?(vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].deqID) ∧ rvownerok(vretRefs0, vrvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))) ∧ nonullRetRefs(rl1 + first ' + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))) ∧ ( vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].next ≠ null ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].next].deqID ≠ None → ( vretRefs0(tid) = vretRefs0 (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].next].deqID .tid) ⊃ Claimed(tid, vs[ps0[first].next].val) ;rvowns (vretRefs0 (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].next].deqID .tid)) ) = Claimed (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].next].deqID.tid, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].next].val)) ∧ ( (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead0 ≠ rl1.last ∧ unmarkedp(qrl0, vs[ps0[rl1.last].next, vs[ps0[rl1.last].next].deqID:= Some(tid)])) ∧ ( vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + qrl0.butlast).last ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].deqID = None ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next = null) |
(ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl0 = phead + rl, rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, qrl0 ≠ [], vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + qrl0, vs, ps0, owns0), listp(first ' + qrl0, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + qrl0, first, vs), nonullRetRefs(rl1 + first ' + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + qrl0 from lst, lst ∈ qrl0, lst ∈ vs, lst ∈ ps0, ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl1, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), (qrl0 ≠ [] → unmarkedp(rl, vs)) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead0 ≠ rl1.last ∧ unmarkedp(qrl0, vs), vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ⊦ noid(tid, rl1 + first ' + qrl0, ps0[first].next, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ listp(rl1 + first ' + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0, owns0) ∧ markedp(rl1, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ some?(vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].deqID) ∧ rvownerok(vretRefs0, vrvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))) ∧ nonullRetRefs(rl1 + first ' + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))) ∧ ( vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].next ≠ null ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].next].deqID ≠ None → ( vretRefs0(tid) = vretRefs0 (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].next].deqID .tid) ⊃ Claimed(tid, vs[ps0[first].next].val) ;rvowns (vretRefs0 (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].next].deqID .tid)) ) = Claimed (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].next].deqID.tid, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].next].val)) ∧ ( (qrl0 ≠ [] → unmarkedp(rl, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead0 ≠ rl1.last ∧ unmarkedp(qrl0, vs[ps0[rl1.last].next, vs[ps0[rl1.last].next].deqID:= Some(tid)])) ∧ ( vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + qrl0.butlast).last ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].deqID = None ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next = null)
Used simplifier rules: ⊦ ¬ a ∈ []; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl0, phead, y
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl0 = phead + rl, rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, qrl0 ≠ [], vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + qrl0, vs, ps0, owns0), listp(first ' + qrl0, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + qrl0, first, vs), nonullRetRefs(rl1 + first ' + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + qrl0 from lst, lst ∈ qrl0, lst ∈ vs, lst ∈ ps0, ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl1, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), (qrl0 ≠ [] → unmarkedp(rl, vs)) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead0 ≠ rl1.last ∧ unmarkedp(qrl0, vs), vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ⊦ noid(tid, rl1 + first ' + qrl0, ps0[first].next, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ listp(rl1 + first ' + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0, owns0) ∧ markedp(rl1, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ some?(vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].deqID) ∧ rvownerok(vretRefs0, vrvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))) ∧ nonullRetRefs(rl1 + first ' + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))) ∧ ( vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].next ≠ null ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].next].deqID ≠ None → ( vretRefs0(tid) = vretRefs0 (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].next].deqID .tid) ⊃ Claimed(tid, vs[ps0[first].next].val) ;rvowns (vretRefs0 (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].next].deqID .tid)) ) = Claimed (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].next].deqID.tid, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].next].val)) ∧ ( (qrl0 ≠ [] → unmarkedp(rl, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead0 ≠ rl1.last ∧ unmarkedp(qrl0, vs[ps0[rl1.last].next, vs[ps0[rl1.last].next].deqID:= Some(tid)])) ∧ ( vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + qrl0.butlast).last ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].deqID = None ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next = null) |
(vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[first].next ' + rl, vs, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(rl, vs), lst ∈ ps0, lst ∈ vs, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), lst = vs[first].next ∨ lst ∈ rl, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, phead0 ∈ rl1 ∨ phead0 = first ⊦ noid(tid, rl1 + first ' + vs[first].next ' + rl, vs[first].next, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)]) ∧ listp(rl1 + first ' + vs[first].next ' + rl, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], ps0, owns0) ∧ rvownerok(vretRefs0, vrvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[vs[first].next].val))) ∧ nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[vs[first].next].val))) ∧ ( vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][(vs[first].next ' + rl).last].deqID = None ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][(vs[first].next ' + rl).last].next = null)
Used simplifier rules: ⊦ ¬ node ∈ rl → (unmarkedp(rl, vs[node, nd]) ↔ unmarkedp(rl, vs)); (s) ⊦ Claimed(tid, val) = Claimed(tid0, val0) ↔ tid = tid0 ∧ val = val0; (ws) ⊦ (nd.deqID:= opttid).val = nd.val; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ a ≠ b → st[b, d][a] = st[a]; (s) ⊦ Some(tid).tid = tid; (s) ⊦ (nd.deqID:= opttid).deqID = opttid; (s) ⊦ None ≠ Some(tid); (s) ⊦ ¬ node ∈ rl → (markedp(rl, vs[node, nd]) ↔ markedp(rl, vs)); (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: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a + x = a ' + x; (s) ⊦ a ' + 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(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s)
| (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[first].next ' + rl, vs, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(rl, vs), lst ∈ ps0, lst ∈ vs, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), lst = vs[first].next ∨ lst ∈ rl, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, phead0 ∈ rl1 ∨ phead0 = first ⊦ noid(tid, rl1 + first ' + vs[first].next ' + rl, vs[first].next, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)]) ∧ listp(rl1 + first ' + vs[first].next ' + rl, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], ps0, owns0) ∧ rvownerok(vretRefs0, vrvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[vs[first].next].val))) ∧ nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[vs[first].next].val))) ∧ ( vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][(vs[first].next ' + rl).last].deqID = None ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][(vs[first].next ' + rl).last].next = null) |
ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ noid(tid, rl1 + first ' + vs[first].next ' + rl, vs[first].next, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)]), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦
ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ listp(rl1 + first ' + vs[first].next ' + rl, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], ps0, owns0), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦
ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ rvownerok(vretRefs0, vrvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[vs[first].next].val))), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦
ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], vretRefs0, pretRefs0), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦
ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ rvownerok(pretRefs0, prvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[vs[first].next].val))), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦
ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, vtail0 ≠ (vs[first].next ' + rl).last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][(vs[first].next ' + rl).last].deqID = None ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][(vs[first].next ' + rl).last].next = null
| ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ noid(tid, rl1 + first ' + vs[first].next ' + rl, vs[first].next, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)]), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦ |
⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid))
(vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[first].next ' + rl, vs, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(rl, vs), lst ∈ ps0, lst ∈ vs, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), ∃ r0. ¬ ( r0 ≠ vs[first].next ∧ r0 ∈ rl1 + first ' + vs[first].next ' + rl from vs[first].next → vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][r0].deqID ≠ Some(tid)), lst = vs[first].next ∨ lst ∈ rl, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, phead0 ∈ rl1 ∨ phead0 = first ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: tid, rl1 + first ' + vs[first].next ' + rl, vs[first].next, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)]
| ⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) |
| (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[first].next ' + rl, vs, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(rl, vs), lst ∈ ps0, lst ∈ vs, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), ∃ r0. ¬ ( r0 ≠ vs[first].next ∧ r0 ∈ rl1 + first ' + vs[first].next ' + rl from vs[first].next → vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][r0].deqID ≠ Some(tid)), lst = vs[first].next ∨ lst ∈ rl, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, phead0 ∈ rl1 ∨ phead0 = first ⊦ |
ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, vs[r0].deqID = Some(tid), ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, r0 ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, r0 ∈ rl, r0 ∈ vs, r0 ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, lst = vs[first].next ∨ lst ∈ rl, vtail0 = rl.last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[rl.last].deqID = None ∧ vs[rl.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) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ≠ b → st[b, d][a] = st[a]; (s)
| ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, vs[r0].deqID = Some(tid), ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, r0 ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, r0 ∈ rl, r0 ∈ vs, r0 ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, lst = vs[first].next ∨ lst ∈ rl, vtail0 = rl.last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[rl.last].deqID = None ∧ vs[rl.last].next = null ⊦ |
⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid))
vs[r0].deqID = Some(tid), (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, r0 ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[first].next ' + rl, vs, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(rl, vs), r0 ∈ ps0, r0 ∈ vs, r0 ∈ rl, lst ∈ ps0, lst ∈ vs, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), ∀ r0. r0 ≠ first ∧ r0 ∈ rl1 + first ' + vs[first].next ' + rl from first → vs[r0].deqID ≠ Some(tid), vtail0 = rl.last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[rl.last].deqID = None ∧ vs[rl.last].next = null, lst = vs[first].next ∨ lst ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ⊦
Used terms: tid, rl1 + first ' + vs[first].next ' + rl, first, vs
| ⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) |
| vs[r0].deqID = Some(tid), (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, r0 ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[first].next ' + rl, vs, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(rl, vs), r0 ∈ ps0, r0 ∈ vs, r0 ∈ rl, lst ∈ ps0, lst ∈ vs, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), ∀ r0. r0 ≠ first ∧ r0 ∈ rl1 + first ' + vs[first].next ' + rl from first → vs[r0].deqID ≠ Some(tid), vtail0 = rl.last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[rl.last].deqID = None ∧ vs[rl.last].next = null, lst = vs[first].next ∨ lst ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ⊦ |
ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, vs[r0].deqID = Some(tid), ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, r0 ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, r0 ∈ rl, r0 ∈ vs, r0 ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), ∀ r. r ≠ first ∧ (r = vs[first].next ∨ r ∈ rl) → vs[r].deqID ≠ Some(tid), phead0 ∈ rl1 ∨ phead0 = first, lst = vs[first].next ∨ lst ∈ rl, vtail0 = rl.last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[rl.last].deqID = None ∧ vs[rl.last].next = null ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, vs[r0].deqID = Some(tid), ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, r0 ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, r0 ∈ rl, r0 ∈ vs, r0 ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), ∀ r. r ≠ first ∧ (r = vs[first].next ∨ r ∈ rl) → vs[r].deqID ≠ Some(tid), phead0 ∈ rl1 ∨ phead0 = first, lst = vs[first].next ∨ lst ∈ rl, vtail0 = rl.last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[rl.last].deqID = None ∧ vs[rl.last].next = null ⊦ |
Used terms: r0
| ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ listp(rl1 + first ' + vs[first].next ' + rl, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], ps0, owns0), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦ |
⊦ ps[r].deqID = None ∧ r ∈ ps ∧ vs[r].deqID = None ∧ r ∈ vs ∧ r ≠ null ∧ r ≠ vs[rl.last].next → (listp(rl, vs[r, vs[r].deqID:= Some(tid)], ps, owns) ↔ listp(rl, vs, ps, owns))
(vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[first].next ' + rl, vs, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(rl, vs), lst ∈ ps0, lst ∈ vs, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ listp(rl1 + first ' + vs[first].next ' + rl, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], ps0, owns0), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), lst = vs[first].next ∨ lst ∈ rl, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, phead0 ∈ rl1 ∨ phead0 = first ⊦ ps0[vs[first].next].deqID = None ∧ vs[first].next ∈ ps0 ∧ vs[vs[first].next].deqID = None ∧ vs[first].next ∈ vs ∧ vs[first].next ≠ null ∧ vs[first].next ≠ vs[(rl1 + first ' + vs[first].next ' + rl).last].next
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps0, rl1 + first ' + vs[first].next ' + rl, tid, owns0, vs[first].next, vs
| ⊦ ps[r].deqID = None ∧ r ∈ ps ∧ vs[r].deqID = None ∧ r ∈ vs ∧ r ≠ null ∧ r ≠ vs[rl.last].next → (listp(rl, vs[r, vs[r].deqID:= Some(tid)], ps, owns) ↔ listp(rl, vs, ps, owns)) |
| (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[first].next ' + rl, vs, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(rl, vs), lst ∈ ps0, lst ∈ vs, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ listp(rl1 + first ' + vs[first].next ' + rl, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], ps0, owns0), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), lst = vs[first].next ∨ lst ∈ rl, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, phead0 ∈ rl1 ∨ phead0 = first ⊦ ps0[vs[first].next].deqID = None ∧ vs[first].next ∈ ps0 ∧ vs[vs[first].next].deqID = None ∧ vs[first].next ∈ vs ∧ vs[first].next ≠ null ∧ vs[first].next ≠ vs[(rl1 + first ' + vs[first].next ' + rl).last].next |
ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ listp(rl1 + first ' + vs[first].next ' + rl, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], ps0, owns0), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦ vs[first].next ∈ ps0 ∧ vs[vs[first].next].deqID = None ∧ vs[first].next ∈ vs ∧ vs[first].next ≠ vs[(vs[first].next ' + rl).last].next
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s)
| ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ listp(rl1 + first ' + vs[first].next ' + rl, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], ps0, owns0), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦ vs[first].next ∈ ps0 ∧ vs[vs[first].next].deqID = None ∧ vs[first].next ∈ vs ∧ vs[first].next ≠ vs[(vs[first].next ' + rl).last].next |
(vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rl = first0 + rl0, rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[first].next ' + rl, vs, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(rl, vs), lst ∈ ps0, lst ∈ vs, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ listp(rl1 + first ' + vs[first].next ' + rl, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], ps0, owns0), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), lst = vs[first].next ∨ lst ∈ rl, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, phead0 ∈ rl1 ∨ phead0 = first ⊦ vs[first].next ∈ ps0 ∧ vs[vs[first].next].deqID = None ∧ vs[first].next ∈ vs ∧ vs[first].next ≠ vs[(vs[first].next ' + rl).last].next
Used simplifier rules: reflist freely generated by [], +;; ⊦ unmarkedp([], vs); (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ ¬ dups([]); (s) ⊦ a '.butlast = []; (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ weak?(None); (s)
| (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rl = first0 + rl0, rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[first].next ' + rl, vs, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(rl, vs), lst ∈ ps0, lst ∈ vs, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ listp(rl1 + first ' + vs[first].next ' + rl, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], ps0, owns0), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), lst = vs[first].next ∨ lst ∈ rl, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, phead0 ∈ rl1 ∨ phead0 = first ⊦ vs[first].next ∈ ps0 ∧ vs[vs[first].next].deqID = None ∧ vs[first].next ∈ vs ∧ vs[first].next ≠ vs[(vs[first].next ' + rl).last].next |
vs[vs[vs[first].next].next].deqID = None, ps0[vs[vs[first].next].next].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, vs[vs[first].next].deqID = None, ps0[vs[first].next].next = vs[vs[first].next].next, ps0[first].next = vs[first].next, vs[first].next = vs[(vs[vs[first].next].next ' + rl0).last].next, ps0[vs[first].next].val = vs[vs[first].next].val, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(vs[first].next) = None, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, vs[first].next ≠ vs[vs[first].next].next, first ≠ lst, first ≠ null, first ≠ vs[first].next, first ≠ vs[vs[first].next].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl0, vs, ps0, owns0), listp(vs[vs[first].next].next ' + rl0, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl0, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl0, vs), unmarkedp(rl0, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, (vs[vs[first].next].next ' + rl0).last ∈ rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl0 from lst, lst ∈ vs, lst ∈ ps0, vs[first].next ∈ vs, vs[first].next ∈ ps0, ¬ dups(rl1 + rl0), ¬ dups(rl1), ¬ dups(rl0), ¬ listp(rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl0, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], ps0, owns0), ¬ weak?(vs[first].deqID), ¬ vs[vs[first].next].next ∈ rl1, ¬ vs[vs[first].next].next ∈ rl0, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl0, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl0, lst = vs[first].next ∨ lst = vs[vs[first].next].next ∨ lst ∈ rl0, phead0 ∈ rl1 ∨ phead0 = first ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ ¬ weak?(None); (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (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) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s)
| vs[vs[vs[first].next].next].deqID = None, ps0[vs[vs[first].next].next].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, vs[vs[first].next].deqID = None, ps0[vs[first].next].next = vs[vs[first].next].next, ps0[first].next = vs[first].next, vs[first].next = vs[(vs[vs[first].next].next ' + rl0).last].next, ps0[vs[first].next].val = vs[vs[first].next].val, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(vs[first].next) = None, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, vs[first].next ≠ vs[vs[first].next].next, first ≠ lst, first ≠ null, first ≠ vs[first].next, first ≠ vs[vs[first].next].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl0, vs, ps0, owns0), listp(vs[vs[first].next].next ' + rl0, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl0, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl0, vs), unmarkedp(rl0, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, (vs[vs[first].next].next ' + rl0).last ∈ rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl0 from lst, lst ∈ vs, lst ∈ ps0, vs[first].next ∈ vs, vs[first].next ∈ ps0, ¬ dups(rl1 + rl0), ¬ dups(rl1), ¬ dups(rl0), ¬ listp(rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl0, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], ps0, owns0), ¬ weak?(vs[first].deqID), ¬ vs[vs[first].next].next ∈ rl1, ¬ vs[vs[first].next].next ∈ rl0, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl0, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl0, lst = vs[first].next ∨ lst = vs[vs[first].next].next ∨ lst ∈ rl0, phead0 ∈ rl1 ∨ phead0 = first ⊦ |
vs[vs[first].next].next ' + rl0 = rl + phead ', vs[vs[first].next].deqID = None, ps0[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[vs[vs[first].next].next].deqID = None, vs[vs[vs[first].next].next].deqID = None, vs[first].next = vs[phead].next, ps0[first].next = vs[first].next, ps0[vs[first].next].next = vs[vs[first].next].next, ps0[first].val = vs[first].val, ps0[vs[first].next].val = vs[vs[first].next].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, owns0(vs[first].next) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[vs[first].next].next ' + rl0 ≠ [], vs[first].next ≠ null, vs[first].next ≠ vs[vs[first].next].next, first ≠ lst, first ≠ null, first ≠ vs[first].next, first ≠ vs[vs[first].next].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[vs[first].next].next ' + rl0, vs, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl0, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl0, ps0), unmarkedp(rl0, vs), vs[first].next ∈ ps0, vs[first].next ∈ vs, lst ∈ ps0, lst ∈ vs, phead ∈ rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl0), ¬ dups(rl1), ¬ dups(rl0), ¬ listp(rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl0, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], ps0, owns0), ¬ weak?(vs[first].deqID), ¬ vs[vs[first].next].next ∈ rl1, ¬ vs[vs[first].next].next ∈ rl0, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl0, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl0, phead0 ∈ rl1 ∨ phead0 = first, lst = vs[first].next ∨ lst = vs[vs[first].next].next ∨ lst ∈ rl0 ⊦
Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: vs[vs[first].next].next ' + rl0, phead, y
| vs[vs[first].next].next ' + rl0 = rl + phead ', vs[vs[first].next].deqID = None, ps0[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[vs[vs[first].next].next].deqID = None, vs[vs[vs[first].next].next].deqID = None, vs[first].next = vs[phead].next, ps0[first].next = vs[first].next, ps0[vs[first].next].next = vs[vs[first].next].next, ps0[first].val = vs[first].val, ps0[vs[first].next].val = vs[vs[first].next].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, owns0(vs[first].next) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[vs[first].next].next ' + rl0 ≠ [], vs[first].next ≠ null, vs[first].next ≠ vs[vs[first].next].next, first ≠ lst, first ≠ null, first ≠ vs[first].next, first ≠ vs[vs[first].next].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[vs[first].next].next ' + rl0, vs, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl0, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl0, ps0), unmarkedp(rl0, vs), vs[first].next ∈ ps0, vs[first].next ∈ vs, lst ∈ ps0, lst ∈ vs, phead ∈ rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl0), ¬ dups(rl1), ¬ dups(rl0), ¬ listp(rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl0, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], ps0, owns0), ¬ weak?(vs[first].deqID), ¬ vs[vs[first].next].next ∈ rl1, ¬ vs[vs[first].next].next ∈ rl0, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl0, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl0, phead0 ∈ rl1 ∨ phead0 = first, lst = vs[first].next ∨ lst = vs[vs[first].next].next ∨ lst ∈ rl0 ⊦ |
vs[vs[phead].next].next ' + rl0 = rl + phead ', vs[vs[phead].next].deqID = None, ps0[vs[phead].next].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[vs[vs[phead].next].next].deqID = None, vs[vs[vs[phead].next].next].deqID = None, vs[first].next = vs[phead].next, ps0[first].next = vs[phead].next, ps0[vs[phead].next].next = vs[vs[phead].next].next, ps0[first].val = vs[first].val, ps0[vs[phead].next].val = vs[vs[phead].next].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, owns0(vs[phead].next) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[phead].next ≠ vs[vs[phead].next].next, vs[phead].next ≠ null, first ≠ vs[vs[phead].next].next, first ≠ vs[phead].next, first ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(rl + phead ', vs, ps0, owns0), listp(rl1 + first ' + vs[phead].next ' + rl + phead ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[phead].next ' + rl + phead ', first, vs), nonullRetRefs(rl1 + first ' + vs[phead].next ' + rl + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl0, ps0), unmarkedp(rl0, vs), vs[phead].next ∈ ps0, vs[phead].next ∈ vs, lst ∈ ps0, lst ∈ vs, phead ∈ rl1 + first ' + vs[phead].next ' + rl + phead ' from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl1 + rl0), ¬ listp(rl1 + first ' + vs[phead].next ' + rl + phead ', vs[vs[phead].next, vs[vs[phead].next].deqID:= Some(tid)], ps0, owns0), ¬ weak?(vs[first].deqID), ¬ first ∈ rl0, ¬ vs[phead].next ∈ rl1, ¬ vs[phead].next ∈ rl0, ¬ first ∈ rl1, ¬ vs[vs[phead].next].next ∈ rl0, ¬ vs[vs[phead].next].next ∈ rl1, phead0 ∈ rl1 ∨ phead0 = first, lst = vs[phead].next ∨ lst = vs[vs[phead].next].next ∨ lst ∈ rl0, vs[vs[phead].next].next ∈ rl ∨ vs[vs[phead].next].next = phead, phead = vs[vs[phead].next].next ∨ phead ∈ rl0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ' + x ≠ []; (s)
| vs[vs[phead].next].next ' + rl0 = rl + phead ', vs[vs[phead].next].deqID = None, ps0[vs[phead].next].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[vs[vs[phead].next].next].deqID = None, vs[vs[vs[phead].next].next].deqID = None, vs[first].next = vs[phead].next, ps0[first].next = vs[phead].next, ps0[vs[phead].next].next = vs[vs[phead].next].next, ps0[first].val = vs[first].val, ps0[vs[phead].next].val = vs[vs[phead].next].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, owns0(vs[phead].next) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[phead].next ≠ vs[vs[phead].next].next, vs[phead].next ≠ null, first ≠ vs[vs[phead].next].next, first ≠ vs[phead].next, first ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(rl + phead ', vs, ps0, owns0), listp(rl1 + first ' + vs[phead].next ' + rl + phead ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[phead].next ' + rl + phead ', first, vs), nonullRetRefs(rl1 + first ' + vs[phead].next ' + rl + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl0, ps0), unmarkedp(rl0, vs), vs[phead].next ∈ ps0, vs[phead].next ∈ vs, lst ∈ ps0, lst ∈ vs, phead ∈ rl1 + first ' + vs[phead].next ' + rl + phead ' from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl1 + rl0), ¬ listp(rl1 + first ' + vs[phead].next ' + rl + phead ', vs[vs[phead].next, vs[vs[phead].next].deqID:= Some(tid)], ps0, owns0), ¬ weak?(vs[first].deqID), ¬ first ∈ rl0, ¬ vs[phead].next ∈ rl1, ¬ vs[phead].next ∈ rl0, ¬ first ∈ rl1, ¬ vs[vs[phead].next].next ∈ rl0, ¬ vs[vs[phead].next].next ∈ rl1, phead0 ∈ rl1 ∨ phead0 = first, lst = vs[phead].next ∨ lst = vs[vs[phead].next].next ∨ lst ∈ rl0, vs[vs[phead].next].next ∈ rl ∨ vs[vs[phead].next].next = phead, phead = vs[vs[phead].next].next ∨ phead ∈ rl0 ⊦ |
⊦ 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))
Used simplifier rules: ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ weak?(opttid) → opttid ≠ None; (as) Used terms: rl + phead ', vs, ps0, owns0
| ⊦ 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)) |
| ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ rvownerok(vretRefs0, vrvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[vs[first].next].val))), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦ |
(vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, vretRefs0(tid0) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[first].next ' + rl, vs, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(rl, vs), lst ∈ ps0, lst ∈ vs, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), pretRefs0(tid0) ≠ null → pretRefs0(tid0) ∈ prvHp0 ∧ rvowns(pretRefs0(tid0)).tid = tid0, lst = vs[first].next ∨ lst ∈ rl, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, phead0 ∈ rl1 ∨ phead0 = first ⊦ vretRefs0(tid0) ∈ vrvHp0 ∧ (vretRefs0(tid) = vretRefs0(tid0) ⊃ Claimed(tid, vs[vs[first].next].val);rvowns(vretRefs0(tid0))).tid = tid0
Used simplifier rules: ⊦ rvownerok(vretRefs, vrvHp, rvowns) → ( rvownerok(vretRefs0, vrvHp0, rvowns0) ↔ (∀ tid. ( vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid) → vretRefs0(tid) ≠ null → vretRefs0(tid) ∈ vrvHp0 ∧ rvowns0(vretRefs0(tid)).tid = tid)); (ss)
| (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, vretRefs0(tid0) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[first].next ' + rl, vs, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(rl, vs), lst ∈ ps0, lst ∈ vs, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), pretRefs0(tid0) ≠ null → pretRefs0(tid0) ∈ prvHp0 ∧ rvowns(pretRefs0(tid0)).tid = tid0, lst = vs[first].next ∨ lst ∈ rl, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, phead0 ∈ rl1 ∨ phead0 = first ⊦ vretRefs0(tid0) ∈ vrvHp0 ∧ (vretRefs0(tid) = vretRefs0(tid0) ⊃ Claimed(tid, vs[vs[first].next].val);rvowns(vretRefs0(tid0))).tid = tid0 |
⊦ rvownerok(vretRefs, vrvHp, rvowns) ↔ (∀ tid. vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid)
ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, vretRefs0(tid0) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, pretRefs0(tid0) ≠ null → pretRefs0(tid0) ∈ prvHp0 ∧ rvowns(pretRefs0(tid0)).tid = tid0, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), ∀ tid. vretRefs0(tid) ≠ null → vretRefs0(tid) ∈ vrvHp0 ∧ rvowns(vretRefs0(tid)).tid = tid, phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦ vretRefs0(tid0) ∈ vrvHp0 ∧ (vretRefs0(tid) = vretRefs0(tid0) ⊃ Claimed(tid, vs[vs[first].next].val);rvowns(vretRefs0(tid0))).tid = tid0
Used terms: vretRefs0, vrvHp0, rvowns
| ⊦ rvownerok(vretRefs, vrvHp, rvowns) ↔ (∀ tid. vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid) |
| ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, vretRefs0(tid0) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, pretRefs0(tid0) ≠ null → pretRefs0(tid0) ∈ prvHp0 ∧ rvowns(pretRefs0(tid0)).tid = tid0, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), ∀ tid. vretRefs0(tid) ≠ null → vretRefs0(tid) ∈ vrvHp0 ∧ rvowns(vretRefs0(tid)).tid = tid, phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦ vretRefs0(tid0) ∈ vrvHp0 ∧ (vretRefs0(tid) = vretRefs0(tid0) ⊃ Claimed(tid, vs[vs[first].next].val);rvowns(vretRefs0(tid0))).tid = tid0 |
(vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, vretRefs0(tid0) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[first].next ' + rl, vs, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(rl, vs), lst ∈ ps0, lst ∈ vs, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), pretRefs0(tid0) ≠ null → pretRefs0(tid0) ∈ prvHp0 ∧ rvowns(pretRefs0(tid0)).tid = tid0, vretRefs0(tid0) ≠ null → vretRefs0(tid0) ∈ vrvHp0 ∧ rvowns(vretRefs0(tid0)).tid = tid0, ∀ tid. vretRefs0(tid) ≠ null → vretRefs0(tid) ∈ vrvHp0 ∧ rvowns(vretRefs0(tid)).tid = tid, lst = vs[first].next ∨ lst ∈ rl, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, phead0 ∈ rl1 ∨ phead0 = first ⊦ vretRefs0(tid0) ∈ vrvHp0 ∧ (vretRefs0(tid) = vretRefs0(tid0) ⊃ Claimed(tid, vs[vs[first].next].val);rvowns(vretRefs0(tid0))).tid = tid0
Used terms: tid0
| (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, vretRefs0(tid0) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[first].next ' + rl, vs, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(rl, vs), lst ∈ ps0, lst ∈ vs, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), pretRefs0(tid0) ≠ null → pretRefs0(tid0) ∈ prvHp0 ∧ rvowns(pretRefs0(tid0)).tid = tid0, vretRefs0(tid0) ≠ null → vretRefs0(tid0) ∈ vrvHp0 ∧ rvowns(vretRefs0(tid0)).tid = tid0, ∀ tid. vretRefs0(tid) ≠ null → vretRefs0(tid) ∈ vrvHp0 ∧ rvowns(vretRefs0(tid)).tid = tid, lst = vs[first].next ∨ lst ∈ rl, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, phead0 ∈ rl1 ∨ phead0 = first ⊦ vretRefs0(tid0) ∈ vrvHp0 ∧ (vretRefs0(tid) = vretRefs0(tid0) ⊃ Claimed(tid, vs[vs[first].next].val);rvowns(vretRefs0(tid0))).tid = tid0 |
ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, rvowns(vretRefs0(tid0)).tid = tid0, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, (vretRefs0(tid) = vretRefs0(tid0) ⊃ Claimed(tid, vs[vs[first].next].val);rvowns(vretRefs0(tid0))).tid ≠ tid0, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, vretRefs0(tid0) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, vretRefs0(tid0) ∈ vrvHp0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, pretRefs0(tid0) ≠ null → pretRefs0(tid0) ∈ prvHp0 ∧ rvowns(pretRefs0(tid0)).tid = tid0, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), ∀ tid. vretRefs0(tid) ≠ null → vretRefs0(tid) ∈ vrvHp0 ∧ rvowns(vretRefs0(tid)).tid = tid, phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦
| ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, rvowns(vretRefs0(tid0)).tid = tid0, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, (vretRefs0(tid) = vretRefs0(tid0) ⊃ Claimed(tid, vs[vs[first].next].val);rvowns(vretRefs0(tid0))).tid ≠ tid0, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, vretRefs0(tid0) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, vretRefs0(tid0) ∈ vrvHp0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, pretRefs0(tid0) ≠ null → pretRefs0(tid0) ∈ prvHp0 ∧ rvowns(pretRefs0(tid0)).tid = tid0, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), ∀ tid. vretRefs0(tid) ≠ null → vretRefs0(tid) ∈ vrvHp0 ∧ rvowns(vretRefs0(tid)).tid = tid, phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦ |
Used simplifier rules: ⊦ Claimed(tid, val).tid = tid; (s) ⊦ Pending(tid).tid = tid; (s)
| ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], vretRefs0, pretRefs0), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦ |
(vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][r].deqID ≠ None, vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, r ≠ (rl1 + first ').head, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[first].next ' + rl, vs, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(rl, vs), lst ∈ ps0, lst ∈ vs, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), vs[r].deqID ≠ None → vretRefs0(vs[r].deqID.tid) ≠ null ∧ pretRefs0(vs[r].deqID.tid) ≠ null, lst = vs[first].next ∨ lst ∈ rl, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, phead0 ∈ rl1 ∨ phead0 = first, r ∈ rl1 ∨ r = first ∨ r = vs[first].next ∨ r ∈ rl ⊦ vretRefs0(vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][r].deqID.tid) ≠ null ∧ pretRefs0(vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][r].deqID.tid) ≠ null
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (x + a ' + y).head = (x + a ').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)
| (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][r].deqID ≠ None, vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, r ≠ (rl1 + first ').head, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[first].next ' + rl, vs, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(rl, vs), lst ∈ ps0, lst ∈ vs, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), vs[r].deqID ≠ None → vretRefs0(vs[r].deqID.tid) ≠ null ∧ pretRefs0(vs[r].deqID.tid) ≠ null, lst = vs[first].next ∨ lst ∈ rl, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, phead0 ∈ rl1 ∨ phead0 = first, r ∈ rl1 ∨ r = first ∨ r = vs[first].next ∨ r ∈ rl ⊦ vretRefs0(vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][r].deqID.tid) ≠ null ∧ pretRefs0(vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][r].deqID.tid) ≠ null |
rl1 + first ' = phead + rl0, ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), rl1 + first ' ≠ [], vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][r].deqID ≠ None, vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, r ≠ phead, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[r].deqID ≠ None → vretRefs0(vs[r].deqID.tid) ≠ null ∧ pretRefs0(vs[r].deqID.tid) ≠ null, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), r ∈ rl1 ∨ r = first ∨ r = vs[first].next ∨ r ∈ rl, phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦ vretRefs0(vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][r].deqID.tid) ≠ null ∧ pretRefs0(vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][r].deqID.tid) ≠ null
Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ 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: rl1 + first ', phead, y
| rl1 + first ' = phead + rl0, ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), rl1 + first ' ≠ [], vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][r].deqID ≠ None, vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, r ≠ phead, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[r].deqID ≠ None → vretRefs0(vs[r].deqID.tid) ≠ null ∧ pretRefs0(vs[r].deqID.tid) ≠ null, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), r ∈ rl1 ∨ r = first ∨ r = vs[first].next ∨ r ∈ rl, phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦ vretRefs0(vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][r].deqID.tid) ≠ null ∧ pretRefs0(vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][r].deqID.tid) ≠ null |
rl1 + first ' = phead ' + rl0, ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][r].deqID ≠ None, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, r ≠ phead, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, ¬ first ∈ rl1, vs[r].deqID ≠ None → vretRefs0(vs[r].deqID.tid) ≠ null ∧ pretRefs0(vs[r].deqID.tid) ≠ null, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), r ∈ rl1 ∨ r = first ∨ r = vs[first].next ∨ r ∈ rl, phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl, first = phead ∨ first ∈ rl0, phead ∈ rl1 ∨ phead = first ⊦ vretRefs0(vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][r].deqID.tid) ≠ null ∧ pretRefs0(vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][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) 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)
| rl1 + first ' = phead ' + rl0, ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][r].deqID ≠ None, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, r ≠ phead, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, ¬ first ∈ rl1, vs[r].deqID ≠ None → vretRefs0(vs[r].deqID.tid) ≠ null ∧ pretRefs0(vs[r].deqID.tid) ≠ null, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), r ∈ rl1 ∨ r = first ∨ r = vs[first].next ∨ r ∈ rl, phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl, first = phead ∨ first ∈ rl0, phead ∈ rl1 ∨ phead = first ⊦ vretRefs0(vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][r].deqID.tid) ≠ null ∧ pretRefs0(vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][r].deqID.tid) ≠ null |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ None ≠ Some(tid); (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).deqID = opttid; (s) ⊦ Some(tid).tid = tid; (s) Used terms: vs, vs[first].next, vs[vs[first].next].deqID:= Some(tid), r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ rvownerok(pretRefs0, prvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[vs[first].next].val))), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦ |
⊦ rvownerok(vretRefs, vrvHp, rvowns) → ( rvownerok(vretRefs0, vrvHp0, rvowns0) ↔ (∀ tid. (vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid) → vretRefs0(tid) ≠ null → vretRefs0(tid) ∈ vrvHp0 ∧ rvowns0(vretRefs0(tid)).tid = tid))
(vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[first].next ' + rl, vs, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(rl, vs), lst ∈ ps0, lst ∈ vs, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), ∃ tid0. ¬ ( (pretRefs0(tid0) ≠ null → pretRefs0(tid0) ∈ prvHp0 ∧ rvowns(pretRefs0(tid0)).tid = tid0) → pretRefs0(tid0) ≠ null → pretRefs0(tid0) ∈ prvHp0 ∧ rvowns(vretRefs0(tid); Claimed(tid, vs[vs[first].next].val))(pretRefs0(tid0)).tid = tid0), lst = vs[first].next ∨ lst ∈ rl, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, phead0 ∈ rl1 ∨ phead0 = first ⊦
Used terms: prvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[vs[first].next].val)), pretRefs0, rvowns, prvHp0, pretRefs0
| ⊦ rvownerok(vretRefs, vrvHp, rvowns) → ( rvownerok(vretRefs0, vrvHp0, rvowns0) ↔ (∀ tid. (vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid) → vretRefs0(tid) ≠ null → vretRefs0(tid) ∈ vrvHp0 ∧ rvowns0(vretRefs0(tid)).tid = tid)) |
| (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[first].next ' + rl, vs, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(rl, vs), lst ∈ ps0, lst ∈ vs, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), ∃ tid0. ¬ ( (pretRefs0(tid0) ≠ null → pretRefs0(tid0) ∈ prvHp0 ∧ rvowns(pretRefs0(tid0)).tid = tid0) → pretRefs0(tid0) ≠ null → pretRefs0(tid0) ∈ prvHp0 ∧ rvowns(vretRefs0(tid); Claimed(tid, vs[vs[first].next].val))(pretRefs0(tid0)).tid = tid0), lst = vs[first].next ∨ lst ∈ rl, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, phead0 ∈ rl1 ∨ phead0 = first ⊦ |
ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, rvowns(pretRefs0(tid0)).tid = tid0, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, (vretRefs0(tid) = pretRefs0(tid0) ⊃ Claimed(tid, vs[vs[first].next].val);rvowns(pretRefs0(tid0))).tid ≠ tid0, first ≠ lst, first ≠ null, first ≠ vs[first].next, pretRefs0(tid0) ≠ null, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, pretRefs0(tid0) ∈ prvHp0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦
| ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, rvowns(pretRefs0(tid0)).tid = tid0, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, (vretRefs0(tid) = pretRefs0(tid0) ⊃ Claimed(tid, vs[vs[first].next].val);rvowns(pretRefs0(tid0))).tid ≠ tid0, first ≠ lst, first ≠ null, first ≠ vs[first].next, pretRefs0(tid0) ≠ null, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, pretRefs0(tid0) ∈ prvHp0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦ |
Used simplifier rules: ⊦ Claimed(tid, val).tid = tid; (s) ⊦ rvownerok(vretRefs, vrvHp, rvowns) ∧ tid ≠ tid0 → ( vretRefs(tid) = vretRefs(tid0) ↔ vretRefs(tid) = null ∧ vretRefs(tid0) = null); (as)
| ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, vtail0 ≠ (vs[first].next ' + rl).last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs[first].next ' + rl).last ∨ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦ vtail0 = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][(vs[first].next ' + rl).last].deqID = None ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][(vs[first].next ' + rl).last].next = null |
vs[(vs[first].next ' + rl).last].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, vs[(vs[first].next ' + rl).last].next = null, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), (first ' + (vs[first].next ' + rl).butlast).last ≠ (vs[first].next ' + rl).last, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, (first ' + (vs[first].next ' + rl).butlast).last ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, ¬ first ∈ rl1, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), lst = vs[first].next ∨ lst ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ⊦ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][(vs[first].next ' + rl).last].deqID = None ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][(vs[first].next ' + rl).last].next = null
| vs[(vs[first].next ' + rl).last].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, vs[(vs[first].next ' + rl).last].next = null, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), (first ' + (vs[first].next ' + rl).butlast).last ≠ (vs[first].next ' + rl).last, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), listp(vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, (first ' + (vs[first].next ' + rl).butlast).last ∈ rl1 + first ' + vs[first].next ' + rl from lst, lst ∈ vs, lst ∈ ps0, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, ¬ first ∈ rl1, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), lst = vs[first].next ∨ lst ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ⊦ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][(vs[first].next ' + rl).last].deqID = None ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][(vs[first].next ' + rl).last].next = null |
vs[first].next ' + rl = rl0 + phead ', (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, vs[phead].deqID = None, ps0[first].next = vs[first].next, vs[phead].next = null, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ' + rl ≠ [], (first ' + rl0).last ≠ phead, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[first].next ' + rl, vs, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(rl, vs), lst ∈ ps0, lst ∈ vs, (first ' + rl0).last ∈ rl1 + first ' + vs[first].next ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, ¬ first ∈ rl1, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, lst = vs[first].next ∨ lst ∈ rl ⊦ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][phead].deqID = None ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][phead].next = null
Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: vs[first].next ' + rl, phead, y
| vs[first].next ' + rl = rl0 + phead ', (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, vs[phead].deqID = None, ps0[first].next = vs[first].next, vs[phead].next = null, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ' + rl ≠ [], (first ' + rl0).last ≠ phead, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[first].next ' + rl, vs, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(rl, vs), lst ∈ ps0, lst ∈ vs, (first ' + rl0).last ∈ rl1 + first ' + vs[first].next ' + rl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, ¬ first ∈ rl1, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, lst = vs[first].next ∨ lst ∈ rl ⊦ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][phead].deqID = None ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][phead].next = null |
vs[first].next ' + rl = rl0 + phead ', (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, vs[phead].deqID = None, ps0[first].next = vs[first].next, vs[phead].next = null, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), (first ' + rl0).last ≠ phead, vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(rl0 + phead ', vs, ps0, owns0), listp(rl1 + first ' + rl0 + phead ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + rl0 + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl0 + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(rl, vs), lst ∈ ps0, lst ∈ vs, (first ' + rl0).last ∈ rl1 + first ' + rl0 + phead ' from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, lst = vs[first].next ∨ lst ∈ rl, vs[first].next ∈ rl0 ∨ vs[first].next = phead, phead = vs[first].next ∨ phead ∈ rl ⊦ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][phead].deqID = None ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][phead].next = null
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (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] ⊦ a ' + x ≠ []; (s)
| vs[first].next ' + rl = rl0 + phead ', (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[vs[first].next].deqID = None, ps0[first].deqID = vs[first].deqID, vs[phead].deqID = None, ps0[first].next = vs[first].next, vs[phead].next = null, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), (first ' + rl0).last ≠ phead, vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(rl0 + phead ', vs, ps0, owns0), listp(rl1 + first ' + rl0 + phead ', vs, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + rl0 + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl0 + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps0), unmarkedp(rl, vs), lst ∈ ps0, lst ∈ vs, (first ' + rl0).last ∈ rl1 + first ' + rl0 + phead ' from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, lst = vs[first].next ∨ lst ∈ rl, vs[first].next ∈ rl0 ∨ vs[first].next = phead, phead = vs[first].next ∨ phead ∈ rl ⊦ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][phead].deqID = None ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][phead].next = null |
⊦ y ≠ [] → (x + y).last = y.last
vs[first].next ' + rl = rl0 + phead ', vs[phead].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, vs[phead].next = null, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), rl0.last ≠ phead, vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, rl0 ≠ [], vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl0 + phead ', vs, ps0, owns0), listp(rl0 + phead ', vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + rl0 + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl0 + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, rl0.last ∈ rl1 + first ' + rl0 + phead ' from lst, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead = vs[first].next ∨ phead ∈ rl, vs[first].next ∈ rl0 ∨ vs[first].next = phead, lst = vs[first].next ∨ lst ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ⊦ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][phead].deqID = None ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][phead].next = null
Used simplifier rules: ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ a '.last = a; (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ [] + x = x; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).deqID = opttid; (s) ⊦ None ≠ Some(tid); (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ weak?(None); (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) Used terms: first ', rl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| vs[first].next ' + rl = rl0 + phead ', vs[phead].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, vs[phead].next = null, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), rl0.last ≠ phead, vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, rl0 ≠ [], vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl0 + phead ', vs, ps0, owns0), listp(rl0 + phead ', vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + rl0 + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl0 + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, rl0.last ∈ rl1 + first ' + rl0 + phead ' from lst, lst ∈ vs, lst ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl, vs[vs[first].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead = vs[first].next ∨ phead ∈ rl, vs[first].next ∈ rl0 ∨ vs[first].next = phead, lst = vs[first].next ∨ lst ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ⊦ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][phead].deqID = None ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][phead].next = null |
vs[first].next ' + rl = rl0 + phead ', vs[phead].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, vs[vs[first].next].deqID = None, vs[phead].next = null, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), rl0.last ≠ phead, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, rl0 ≠ [], vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl0 + phead ', vs, ps0, owns0), listp(rl0 + phead ', vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + rl0 + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl0 + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), vs[first].next ∈ rl0, phead ∈ rl, first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, rl0.last ∈ rl1 + first ' + rl0 + phead ' from lst, lst ∈ vs, lst ∈ ps0, vs[first].next ∈ vs, vs[first].next ∈ ps0, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, ¬ first ∈ rl1, lst = vs[first].next ∨ lst ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ⊦ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][phead].deqID = None ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][phead].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 inapp-08: ⊦ a ' + x = y + b ' ∧ y ≠ [] → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist]
| vs[first].next ' + rl = rl0 + phead ', vs[phead].deqID = None, ps0[first].deqID = vs[first].deqID, ps0[vs[first].next].deqID = None, vs[vs[first].next].deqID = None, vs[phead].next = null, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), rl0.last ≠ phead, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, rl0 ≠ [], vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl0 + phead ', vs, ps0, owns0), listp(rl0 + phead ', vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + rl0 + phead ', first, vs), nonullRetRefs(rl1 + first ' + rl0 + phead ', vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps0), vs[first].next ∈ rl0, phead ∈ rl, first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, rl0.last ∈ rl1 + first ' + rl0 + phead ' from lst, lst ∈ vs, lst ∈ ps0, vs[first].next ∈ vs, vs[first].next ∈ ps0, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, ¬ first ∈ rl1, lst = vs[first].next ∨ lst ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ⊦ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][phead].deqID = None ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][phead].next = null |
⊦ a ≠ b → st[b, d][a] = st[a]
Used terms: vs, vs[first].next, vs[vs[first].next].deqID:= Some(tid), phead
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| (ps0[first].next ∈ vs ⊃ vs[ps0[first].next];ps0[ps0[first].next]).deqID = None, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = first0 + rl, rvowns(vretRefs0(tid)) = Pending(tid), ps0[first].next ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[first].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs) ⊦ (qrl0 ≠ [] ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.head].deqID = Some(tid) → vhead0 = first) ∧ (ps0[ps0[first].next].deqID = None → vhead0 = first) ∧ noid(tid, (rl1 + first ' + rl2) + qrl0, ps0[first].next, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ listp((rl1 + first ' + rl2) + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], ps0, owns0) ∧ markedp(rl1, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ some?(vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][first].deqID) ∧ markedp(rl2, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)]) ∧ rvownerok(vretRefs0, vrvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))) ∧ nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)], vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[ps0[first].next].val))) ∧ ( vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next ≠ null ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID ≠ None → ( vretRefs0(tid) = vretRefs0 (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID .tid) ⊃ Claimed(tid, vs[ps0[first].next].val) ;rvowns (vretRefs0 (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID .tid)) ) = Claimed (vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].deqID .tid, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][vhead0].next].val)) ∧ ( (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])) ∧ ( vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].deqID = None ∧ vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)][qrl0.last].next = null) ∧ (vhead0 ≠ first → nextnottid(tid, vhead0, vs[ps0[first].next, vs[ps0[first].next].deqID:= Some(tid)])) |
(vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].deqID = vs[first].deqID, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, phead0 ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs, ps0, owns0), listp(vs[first].next ' + rl + qrl0, vs, ps0, owns0), markedp(rl, vs), markedp(rl1, vs), markedp(rl, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl0, first, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(vs[vs[first].next].deqID), some?(ps0[vs[first].next].deqID), unmarkedp(qrl0, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl0 from lst, ¬ dups(rl1 + rl + qrl0), ¬ dups(rl1), ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl + qrl0), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl0, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), (vs[first].next ' + rl).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead0 ∧ phead0 ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl0, vs), lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, vtail0 = (vs[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[first].next ' + rl + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, vhead0 = first ∨ vhead0 = vs[first].next ∨ vhead0 ∈ rl, phead0 ∈ rl ∨ phead0 = first ∨ phead0 ∈ rl1 ⊦ (qrl0 ≠ [] ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][qrl0.head].deqID = Some(tid) → vhead0 = first) ∧ noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs[first].next, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)]) ∧ listp(rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], ps0, owns0) ∧ rvownerok(vretRefs0, vrvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[vs[first].next].val))) ∧ nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[vs[first].next].val))) ∧ ( vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next ≠ null ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID ≠ None → ( vretRefs0(tid) = vretRefs0 (vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID.tid) ⊃ Claimed(tid, vs[vs[first].next].val) ;rvowns (vretRefs0 (vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID.tid)) ) = Claimed (vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID.tid, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].val)) ∧ ( (vs[first].next ' + rl).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)])) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead0 ∧ phead0 ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl0, vs)) ∧ ( vtail0 = (vs[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[first].next ' + rl + qrl0.butlast).last ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][qrl0.last].deqID = None ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][qrl0.last].next = null) ∧ (vhead0 ≠ first → nextnottid(tid, vhead0, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)]))
Used simplifier rules: ⊦ ¬ node ∈ rl → (unmarkedp(rl, vs[node, nd]) ↔ unmarkedp(rl, vs)); (s) ⊦ ¬ node ∈ rl → (markedp(rl, vs[node, nd]) ↔ markedp(rl, vs)); (s) ⊦ a ≠ b → st[b, d][a] = st[a]; (s) ⊦ some?(opttid) → opttid ≠ None; (as) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a + x = a ' + x; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ some?(Some(tid)); (s) ⊦ (nd.deqID:= opttid).deqID = opttid; (s) ⊦ a = b → st[b, d][a] = d; (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) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s)
| (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].deqID = vs[first].deqID, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, phead0 ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs, ps0, owns0), listp(vs[first].next ' + rl + qrl0, vs, ps0, owns0), markedp(rl, vs), markedp(rl1, vs), markedp(rl, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl0, first, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(vs[vs[first].next].deqID), some?(ps0[vs[first].next].deqID), unmarkedp(qrl0, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl0 from lst, ¬ dups(rl1 + rl + qrl0), ¬ dups(rl1), ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl + qrl0), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl0, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), (vs[first].next ' + rl).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead0 ∧ phead0 ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl0, vs), lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, vtail0 = (vs[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[first].next ' + rl + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, vhead0 = first ∨ vhead0 = vs[first].next ∨ vhead0 ∈ rl, phead0 ∈ rl ∨ phead0 = first ∨ phead0 ∈ rl1 ⊦ (qrl0 ≠ [] ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][qrl0.head].deqID = Some(tid) → vhead0 = first) ∧ noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs[first].next, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)]) ∧ listp(rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], ps0, owns0) ∧ rvownerok(vretRefs0, vrvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[vs[first].next].val))) ∧ nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[vs[first].next].val))) ∧ ( vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next ≠ null ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID ≠ None → ( vretRefs0(tid) = vretRefs0 (vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID.tid) ⊃ Claimed(tid, vs[vs[first].next].val) ;rvowns (vretRefs0 (vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID.tid)) ) = Claimed (vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID.tid, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].val)) ∧ ( (vs[first].next ' + rl).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)])) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead0 ∧ phead0 ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl0, vs)) ∧ ( vtail0 = (vs[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[first].next ' + rl + qrl0.butlast).last ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][qrl0.last].deqID = None ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][qrl0.last].next = null) ∧ (vhead0 ≠ first → nextnottid(tid, vhead0, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)])) |
ps0[first].deqID = vs[first].deqID, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rl = [], rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, phead0 ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[first].next ' + rl + qrl0, vs, ps0, owns0), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl, ps0), markedp(rl1, vs), markedp(rl, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl0, first, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[vs[first].next].deqID), some?(vs[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl + qrl0), ¬ dups(rl1), ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl + qrl0), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl0, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl ∨ phead0 = first ∨ phead0 ∈ rl1, vhead0 = first ∨ vhead0 = vs[first].next ∨ vhead0 ∈ rl, vtail0 = (vs[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[first].next ' + rl + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, (vs[first].next ' + rl).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead0 ∧ phead0 ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl0, vs) ⊦ (qrl0 ≠ [] ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][qrl0.head].deqID = Some(tid) → vhead0 = first) ∧ noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs[first].next, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)]) ∧ listp(rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], ps0, owns0) ∧ rvownerok(vretRefs0, vrvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[vs[first].next].val))) ∧ nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[vs[first].next].val))) ∧ ( vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next ≠ null ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID ≠ None → ( vretRefs0(tid) = vretRefs0 (vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID.tid) ⊃ Claimed(tid, vs[vs[first].next].val) ;rvowns (vretRefs0 (vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID.tid)) ) = Claimed (vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID.tid, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].val)) ∧ ( (vs[first].next ' + rl).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)])) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead0 ∧ phead0 ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl0, vs)) ∧ ( vtail0 = (vs[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[first].next ' + rl + qrl0.butlast).last ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][qrl0.last].deqID = None ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][qrl0.last].next = null) ∧ (vhead0 ≠ first → nextnottid(tid, vhead0, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)]))
Used simplifier rules: reflist freely generated by [], +;; ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ a + x = a ' + x; (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ some?(opttid) → opttid ≠ None; (as)
| ps0[first].deqID = vs[first].deqID, (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rl = [], rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, phead0 ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[first].next ' + rl + qrl0, vs, ps0, owns0), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs, ps0, owns0), markedp(rl1, ps0), markedp(rl, ps0), markedp(rl1, vs), markedp(rl, vs), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl0, first, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs0, prvHp0, rvowns), some?(ps0[vs[first].next].deqID), some?(vs[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs, phead0 ∈ ps0, first ∈ vs, first ∈ ps0, ¬ dups(rl1 + rl + qrl0), ¬ dups(rl1), ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl + qrl0), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl0, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl ∨ phead0 = first ∨ phead0 ∈ rl1, vhead0 = first ∨ vhead0 = vs[first].next ∨ vhead0 ∈ rl, vtail0 = (vs[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[first].next ' + rl + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, (vs[first].next ' + rl).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead0 ∧ phead0 ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl0, vs) ⊦ (qrl0 ≠ [] ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][qrl0.head].deqID = Some(tid) → vhead0 = first) ∧ noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs[first].next, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)]) ∧ listp(rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], ps0, owns0) ∧ rvownerok(vretRefs0, vrvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[vs[first].next].val))) ∧ nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl0, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[vs[first].next].val))) ∧ ( vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next ≠ null ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID ≠ None → ( vretRefs0(tid) = vretRefs0 (vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID.tid) ⊃ Claimed(tid, vs[vs[first].next].val) ;rvowns (vretRefs0 (vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID.tid)) ) = Claimed (vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID.tid, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].val)) ∧ ( (vs[first].next ' + rl).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)])) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead0 ∧ phead0 ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl0, vs)) ∧ ( vtail0 = (vs[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[first].next ' + rl + qrl0.butlast).last ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][qrl0.last].deqID = None ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][qrl0.last].next = null) ∧ (vhead0 ≠ first → nextnottid(tid, vhead0, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)])) |
(vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].deqID = vs[first].deqID, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, phead0 ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + qrl0, vs, ps0, owns0), listp(vs[first].next ' + qrl0, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + vs[first].next ' + qrl0, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(vs[vs[first].next].deqID), some?(ps0[vs[first].next].deqID), unmarkedp(qrl0, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + qrl0 from lst, ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl0, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl0, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vs[first].next = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ first = vhead0 ∧ unmarkedp(qrl0, vs), lst = vs[first].next ∨ lst ∈ qrl0, vtail0 = (vs[first].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[first].next ' + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, vhead0 = first ∨ vhead0 = vs[first].next, phead0 = first ∨ phead0 ∈ rl1 ⊦ (qrl0 ≠ [] ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][qrl0.head].deqID = Some(tid) → vhead0 = first) ∧ noid(tid, rl1 + first ' + vs[first].next ' + qrl0, vs[first].next, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)]) ∧ listp(rl1 + first ' + vs[first].next ' + qrl0, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], ps0, owns0) ∧ rvownerok(vretRefs0, vrvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[vs[first].next].val))) ∧ nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl0, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[vs[first].next].val))) ∧ ( vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next ≠ null ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID ≠ None → ( vretRefs0(tid) = vretRefs0 (vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID.tid) ⊃ Claimed(tid, vs[vs[first].next].val) ;rvowns (vretRefs0 (vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID.tid)) ) = Claimed (vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID.tid, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].val)) ∧ ( vs[first].next = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)])) ∨ first = vhead0 ∧ unmarkedp(qrl0, vs)) ∧ ( vtail0 = (vs[first].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[first].next ' + qrl0.butlast).last ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][qrl0.last].deqID = None ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][qrl0.last].next = null) ∧ (vhead0 ≠ first → nextnottid(tid, vhead0, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)]))
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ [] + x = x; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)
| (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps0[vs[first].next]).deqID = None, ps0[first].deqID = vs[first].deqID, ps0[first].next = vs[first].next, ps0[first].val = vs[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, phead0 ≠ vs[first].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs[first].next ' + qrl0, vs, ps0, owns0), listp(vs[first].next ' + qrl0, vs, ps0, owns0), markedp(rl1, vs), markedp(rl1, ps0), nextnottid(tid, vhead0, vs), noid(tid, rl1 + first ' + vs[first].next ' + qrl0, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl0, vs, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), some?(vs[first].deqID), some?(vs[vs[first].next].deqID), some?(ps0[vs[first].next].deqID), unmarkedp(qrl0, ps0), first ∈ ps0, first ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs[first].next ' + qrl0 from lst, ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl0, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl0, ¬ first ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vs[first].next = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ first = vhead0 ∧ unmarkedp(qrl0, vs), lst = vs[first].next ∨ lst ∈ qrl0, vtail0 = (vs[first].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[first].next ' + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, vhead0 = first ∨ vhead0 = vs[first].next, phead0 = first ∨ phead0 ∈ rl1 ⊦ (qrl0 ≠ [] ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][qrl0.head].deqID = Some(tid) → vhead0 = first) ∧ noid(tid, rl1 + first ' + vs[first].next ' + qrl0, vs[first].next, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)]) ∧ listp(rl1 + first ' + vs[first].next ' + qrl0, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], ps0, owns0) ∧ rvownerok(vretRefs0, vrvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[vs[first].next].val))) ∧ nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl0, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)], vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns(vretRefs0(tid); Claimed(tid, vs[vs[first].next].val))) ∧ ( vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next ≠ null ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID ≠ None → ( vretRefs0(tid) = vretRefs0 (vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID.tid) ⊃ Claimed(tid, vs[vs[first].next].val) ;rvowns (vretRefs0 (vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID.tid)) ) = Claimed (vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].deqID.tid, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][vhead0].next].val)) ∧ ( vs[first].next = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)])) ∨ first = vhead0 ∧ unmarkedp(qrl0, vs)) ∧ ( vtail0 = (vs[first].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[first].next ' + qrl0.butlast).last ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][qrl0.last].deqID = None ∧ vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)][qrl0.last].next = null) ∧ (vhead0 ≠ first → nextnottid(tid, vhead0, vs[vs[first].next, vs[vs[first].next].deqID:= Some(tid)])) |
Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ a + x = a ' + x; (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ unmarkedp([], vs); (s) ⊦ x + [] = x; (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl0, vtail, y
| dom vrvHp = dom prvHp, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, rl1 + first ' + rl2, owns, rvowns) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (ps ⊕ vs)[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, 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 ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs) ⊦ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ≠ null ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt = ps0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ] .next ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .optval = Val (vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .val) ∧ ( qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) → vhead0 = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .success) ∧ (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .success ⊃ vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID = Some (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) ∧ rvowns0 (vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid)) = Claimed (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .optval .val) ∧ ( ps0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID = None → vhead0 = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first) ∧ noid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, orl0 + qrl0, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt, vs0) ; vs0 [((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .nxt ] .deqID ≠ None ∧ noid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, orl0 + qrl0, ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first, vs0) ∧ rvowns0 (vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid)) = Pending (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) ) ∧ listp(orl0 + qrl0, vs0, ps0, owns0) ∧ ¬ dups(orl0 + qrl0) ∧ markedp(orl0, ps0) ∧ markedp(orl0, vs0) ∧ unmarkedp(qrl0, ps0) ∧ orl0 ≠ [] ∧ phead0 ∈ orl0 ∧ rvownerok(vretRefs0, vrvHp0, rvowns0) ∧ allocrv(vretRefs0, vrvHp0) ∧ nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns0) ∧ allocrv(pretRefs0, prvHp0) ∧ dom vrvHp0 = dom prvHp0 ∧ ( vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val)) ∧ ( orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0)) ∧ (vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null) ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∈ orl0 ∧ vhead0 ∈ orl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ≠ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∧ vtail0 ∈ orl0 + qrl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∧ ( ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∈ orl0 from ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first ∨ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .lst ∈ qrl0) ∧ vretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∧ pretRefs0 (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid) = ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ∈ vrvHp0 ∧ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .rvref ≠ null ∧ ( vhead0 ≠ ((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .first → nextnottid (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, vhead0, vs0)) ∧ noowns (((ps ⊕ vs)[ps[first].next].deqID = None ⊃ mkls(tid, value, Val(vs[ps[first].next].val), node, nd, true, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ;mkls(tid, value, Val(vs[ps[first].next].val), node, nd, false, lst, ps[first].next, vretRefs(tid), optval0, first, othertid, addr) ) .tid, owns0) |
dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0 ⊕ vs0)[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs0), markedp(rl2, vs0), nextnottid(tid, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0) ⊦ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)) ∧ vs0[ps0[first].next].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] ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .first = node2; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .rvref = rvref; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ x = y + a ' + z → a ∈ x; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ Val(val) = Val(val0) ↔ val = val0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) = mkgs (ps1, ps2, phead2, phead3, phead4, vretRefs1, vretRefs2, vrvHp1, vrvHp2, qrl1, qrl2, owns0, rvowns0) ↔ ps = ps1 ∧ ps0 = ps2 ∧ phead = phead2 ∧ phead0 = phead3 ∧ phead1 = phead4 ∧ vretRefs = vretRefs1 ∧ vretRefs0 = vretRefs2 ∧ vrvHp = vrvHp1 ∧ vrvHp0 = vrvHp2 ∧ qrl = qrl1 ∧ qrl0 = qrl2 ∧ owns = owns0 ∧ rvowns = rvowns0; (ws)
| dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0 ⊕ vs0)[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs0), markedp(rl2, vs0), nextnottid(tid, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0) ⊦ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)) ∧ vs0[ps0[first].next].deqID ≠ None |
⊦ (ps ⊕ vs)[r] = (r ∈ vs ⊃ vs[r];ps[r])
dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0[first].next ∈ vs0 ⊃ vs0[ps0[first].next];ps0[ps0[first].next]).deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + rl2) + qrl0, vs0, ps0, owns0), listp(first ' + rl2 + qrl0, vs0, ps0, owns0), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0), lst ∈ rl2 ∨ lst ∈ qrl0, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)) ∧ vs0[ps0[first].next].deqID ≠ None
Used terms: ps0, vs0, ps0[first].next
| ⊦ (ps ⊕ vs)[r] = (r ∈ vs ⊃ vs[r];ps[r]) |
| dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0[first].next ∈ vs0 ⊃ vs0[ps0[first].next];ps0[ps0[first].next]).deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + rl2) + qrl0, vs0, ps0, owns0), listp(first ' + rl2 + qrl0, vs0, ps0, owns0), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0), lst ∈ rl2 ∨ lst ∈ qrl0, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vhead0 = first ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)) ∧ vs0[ps0[first].next].deqID ≠ None |
dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = [], rvowns0(vretRefs0(tid)) = Pending(tid), (ps0[first].next ∈ vs0 ⊃ vs0[ps0[first].next];ps0[ps0[first].next]).deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs0), markedp(rl2, vs0), nextnottid(tid, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0) ⊦ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)) ∧ vs0[ps0[first].next].deqID ≠ None
dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = first0 + rl, rvowns0(vretRefs0(tid)) = Pending(tid), (ps0[first].next ∈ vs0 ⊃ vs0[ps0[first].next];ps0[ps0[first].next]).deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs0), markedp(rl2, vs0), nextnottid(tid, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0) ⊦ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)) ∧ vs0[ps0[first].next].deqID ≠ None
Used simplifier rules: reflist freely generated by [], +;;
| dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = [], rvowns0(vretRefs0(tid)) = Pending(tid), (ps0[first].next ∈ vs0 ⊃ vs0[ps0[first].next];ps0[ps0[first].next]).deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs0), markedp(rl2, vs0), nextnottid(tid, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0) ⊦ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)) ∧ vs0[ps0[first].next].deqID ≠ None |
dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0[first].next ∈ vs0 ⊃ vs0[ps0[first].next];ps0[ps0[first].next]).deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), lst ∈ ps0, lst ∈ vs0, lst ∈ qrl0, vtail0 ∈ rl1 + first ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl1, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead0 ≠ rl1.last ∧ unmarkedp(qrl0, vs0) ⊦ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)) ∧ vs0[ps0[first].next].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-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 ∈ []; (s) ⊦ [] + x = x; (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)
| dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (ps0[first].next ∈ vs0 ⊃ vs0[ps0[first].next];ps0[ps0[first].next]).deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), lst ∈ ps0, lst ∈ vs0, lst ∈ qrl0, vtail0 ∈ rl1 + first ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl1, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead0 ≠ rl1.last ∧ unmarkedp(qrl0, vs0) ⊦ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)) ∧ vs0[ps0[first].next].deqID ≠ None |
dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl0 = phead + rl, rvowns0(vretRefs0(tid)) = Pending(tid), (ps0[first].next ∈ vs0 ⊃ vs0[ps0[first].next];ps0[ps0[first].next]).deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, qrl0 ≠ [], vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + qrl0, vs0, ps0, owns0), listp(first ' + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl1, ps0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + qrl0 from lst, lst ∈ qrl0, lst ∈ vs0, lst ∈ ps0, ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl1, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), (qrl0 ≠ [] → unmarkedp(rl, vs0)) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead0 ≠ rl1.last ∧ unmarkedp(qrl0, vs0), vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ⊦ (qrl0 = [] ∨ vs0[phead].deqID ≠ Some(tid)) ∧ vs0[ps0[first].next].deqID ≠ None
Used simplifier rules: ⊦ ¬ a ∈ []; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl0, phead, y
| dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl0 = phead + rl, rvowns0(vretRefs0(tid)) = Pending(tid), (ps0[first].next ∈ vs0 ⊃ vs0[ps0[first].next];ps0[ps0[first].next]).deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, qrl0 ≠ [], vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + qrl0, vs0, ps0, owns0), listp(first ' + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl1, ps0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + qrl0 from lst, lst ∈ qrl0, lst ∈ vs0, lst ∈ ps0, ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl1, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), (qrl0 ≠ [] → unmarkedp(rl, vs0)) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead0 ≠ rl1.last ∧ unmarkedp(qrl0, vs0), vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ⊦ (qrl0 = [] ∨ vs0[phead].deqID ≠ Some(tid)) ∧ vs0[ps0[first].next].deqID ≠ None |
ps0[first].deqID = vs0[first].deqID, ps0[vs0[first].next].deqID = None, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (vs0[first].next ∈ vs0 ⊃ vs0[vs0[first].next];ps0[vs0[first].next]).deqID ≠ None, vs0[first].next ≠ null, first ≠ vs0[first].next, first ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs0[first].next ' + rl, vs0, ps0, owns0), listp(vs0[first].next ' + rl, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl1, ps0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + rl, first, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), unmarkedp(rl, vs0), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs0[first].next ' + rl from lst, lst ∈ vs0, lst ∈ ps0, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl, ¬ vs0[first].next ∈ rl1, ¬ vs0[first].next ∈ rl, ¬ first ∈ rl1, vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs0[first].next ' + rl).last ∨ vtail0 = (first ' + (vs0[first].next ' + rl).butlast).last ∧ vs0[(vs0[first].next ' + rl).last].deqID = None ∧ vs0[(vs0[first].next ' + rl).last].next = null, lst = vs0[first].next ∨ lst ∈ rl ⊦ vs0[vs0[first].next].deqID ≠ Some(tid) ∧ vs0[vs0[first].next].deqID ≠ None
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ' + x ≠ []; (s) ⊦ a + x = a ' + 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(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s)
| ps0[first].deqID = vs0[first].deqID, ps0[vs0[first].next].deqID = None, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (vs0[first].next ∈ vs0 ⊃ vs0[vs0[first].next];ps0[vs0[first].next]).deqID ≠ None, vs0[first].next ≠ null, first ≠ vs0[first].next, first ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs0[first].next ' + rl, vs0, ps0, owns0), listp(vs0[first].next ' + rl, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl1, ps0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + rl, first, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), unmarkedp(rl, vs0), unmarkedp(rl, ps0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs0[first].next ' + rl from lst, lst ∈ vs0, lst ∈ ps0, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl, ¬ vs0[first].next ∈ rl1, ¬ vs0[first].next ∈ rl, ¬ first ∈ rl1, vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs0[first].next ' + rl).last ∨ vtail0 = (first ' + (vs0[first].next ' + rl).butlast).last ∧ vs0[(vs0[first].next ' + rl).last].deqID = None ∧ vs0[(vs0[first].next ' + rl).last].next = null, lst = vs0[first].next ∨ lst ∈ rl ⊦ vs0[vs0[first].next].deqID ≠ Some(tid) ∧ vs0[vs0[first].next].deqID ≠ None |
Used simplifier rules: reflist freely generated by [], +;; ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ 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 ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ Some(tid).tid = tid; (s) ⊦ None ≠ Some(tid); (s) ⊦ ¬ weak?(Some(tid)); (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ Pending(tid) ≠ Claimed(tid0, val); (s) ⊦ unmarkedp([], vs); (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ ¬ dups([]); (s) ⊦ a '.butlast = []; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ b ' ↔ a = b; (s)
| dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = first0 + rl, rvowns0(vretRefs0(tid)) = Pending(tid), (ps0[first].next ∈ vs0 ⊃ vs0[ps0[first].next];ps0[ps0[first].next]).deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs0), markedp(rl2, vs0), nextnottid(tid, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + rl2) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 = first ∨ vhead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl0, (first ' + rl2).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0) ⊦ (qrl0 = [] ∨ vs0[qrl0.head].deqID ≠ Some(tid)) ∧ vs0[ps0[first].next].deqID ≠ None |
ps0[first].deqID = vs0[first].deqID, vs0[qrl0.head].deqID = Some(tid), ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (vs0[first].next ∈ vs0 ⊃ vs0[vs0[first].next];ps0[vs0[first].next]).deqID ≠ None, vs0[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs0[first].next, qrl0 ≠ [], vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, ps0, owns0), listp(vs0[first].next ' + rl + qrl0, vs0, ps0, owns0), markedp(rl, vs0), markedp(rl1, vs0), markedp(rl, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(vs0[vs0[first].next].deqID), some?(ps0[vs0[first].next].deqID), unmarkedp(qrl0, ps0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + (vs0[first].next ' + rl) + qrl0 from lst, ¬ dups(rl1 + rl + qrl0), ¬ dups(rl1), ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl + qrl0), ¬ dups(rl1 + rl), ¬ weak?(vs0[first].deqID), ¬ first ∈ qrl0, ¬ vs0[first].next ∈ rl1, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, vhead0 = first ∨ vhead0 = vs0[first].next ∨ vhead0 ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl, (vs0[first].next ' + rl).last = vhead0 ∧ unmarkedp(qrl0.tail, vs0) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = vhead0 ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0), vtail0 = qrl0.last ∨ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ y ≠ [] → (a ' + x + y).last = y.last; (s) ⊦ some?(opttid) → opttid ≠ None; (as) 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 ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s)
| ps0[first].deqID = vs0[first].deqID, vs0[qrl0.head].deqID = Some(tid), ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (vs0[first].next ∈ vs0 ⊃ vs0[vs0[first].next];ps0[vs0[first].next]).deqID ≠ None, vs0[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs0[first].next, qrl0 ≠ [], vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, ps0, owns0), listp(vs0[first].next ' + rl + qrl0, vs0, ps0, owns0), markedp(rl, vs0), markedp(rl1, vs0), markedp(rl, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(vs0[vs0[first].next].deqID), some?(ps0[vs0[first].next].deqID), unmarkedp(qrl0, ps0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + (vs0[first].next ' + rl) + qrl0 from lst, ¬ dups(rl1 + rl + qrl0), ¬ dups(rl1), ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl + qrl0), ¬ dups(rl1 + rl), ¬ weak?(vs0[first].deqID), ¬ first ∈ qrl0, ¬ vs0[first].next ∈ rl1, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, vhead0 = first ∨ vhead0 = vs0[first].next ∨ vhead0 ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl, (vs0[first].next ' + rl).last = vhead0 ∧ unmarkedp(qrl0.tail, vs0) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = vhead0 ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0), vtail0 = qrl0.last ∨ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ |
vs0[vtail].deqID = Some(tid), ps0[first].deqID = vs0[first].deqID, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), qrl0 = vtail + rl0, rvowns0(vretRefs0(tid)) = Pending(tid), (vs0[first].next ∈ vs0 ⊃ vs0[vs0[first].next];ps0[vs0[first].next]).deqID ≠ None, vs0[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs0[first].next, qrl0 ≠ [], vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[first].next ' + rl + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl, ps0), markedp(rl1, vs0), markedp(rl, vs0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vs0[first].next].deqID), some?(vs0[vs0[first].next].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ rl1 + first ' + (vs0[first].next ' + rl) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, ¬ dups(rl1 + rl + qrl0), ¬ dups(rl1), ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl + qrl0), ¬ dups(rl1 + rl), ¬ weak?(vs0[first].deqID), ¬ first ∈ qrl0, ¬ vs0[first].next ∈ rl1, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = qrl0.last ∨ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (vs0[first].next ' + rl).last = vhead0 ∧ unmarkedp(rl0, vs0) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = vhead0 ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl, vhead0 = first ∨ vhead0 = vs0[first].next ∨ vhead0 ∈ rl, lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0 ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl0, head, tail
| vs0[vtail].deqID = Some(tid), ps0[first].deqID = vs0[first].deqID, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), qrl0 = vtail + rl0, rvowns0(vretRefs0(tid)) = Pending(tid), (vs0[first].next ∈ vs0 ⊃ vs0[vs0[first].next];ps0[vs0[first].next]).deqID ≠ None, vs0[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs0[first].next, qrl0 ≠ [], vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[first].next ' + rl + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl, ps0), markedp(rl1, vs0), markedp(rl, vs0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vs0[first].next].deqID), some?(vs0[vs0[first].next].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ rl1 + first ' + (vs0[first].next ' + rl) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, ¬ dups(rl1 + rl + qrl0), ¬ dups(rl1), ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl + qrl0), ¬ dups(rl1 + rl), ¬ weak?(vs0[first].deqID), ¬ first ∈ qrl0, ¬ vs0[first].next ∈ rl1, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = qrl0.last ∨ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (vs0[first].next ' + rl).last = vhead0 ∧ unmarkedp(rl0, vs0) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = vhead0 ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl, vhead0 = first ∨ vhead0 = vs0[first].next ∨ vhead0 ∈ rl, lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0 ⊦ |
ps0[first].deqID = vs0[first].deqID, vs0[vtail].deqID = Some(tid), ps0[vtail].deqID = None, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (vs0[first].next ∈ vs0 ⊃ vs0[vs0[first].next];ps0[vs0[first].next]).deqID ≠ None, vs0[first].next ≠ null, vs0[first].next ≠ vtail, first ≠ lst, first ≠ null, first ≠ vs0[first].next, first ≠ vtail, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs0[first].next ' + rl + vtail ' + rl0, vs0, ps0, owns0), listp(vs0[first].next ' + rl + vtail ' + rl0, vs0, ps0, owns0), markedp(rl, vs0), markedp(rl1, vs0), markedp(rl, ps0), markedp(rl1, ps0), nextnottid(tid, (vs0[first].next ' + rl).last, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + rl + vtail ' + rl0, first, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + rl + vtail ' + rl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(vs0[vs0[first].next].deqID), some?(ps0[vs0[first].next].deqID), unmarkedp(rl0, vs0), unmarkedp(rl0, ps0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs0[first].next ' + rl + vtail ' + rl0 from lst, ¬ dups((rl1 + rl) + rl0), ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl + rl0), ¬ dups(rl1 + rl), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl1, ¬ first ∈ rl, ¬ vtail ∈ rl1, ¬ vtail ∈ rl, ¬ vtail ∈ rl0, ¬ first ∈ rl0, ¬ vs0[first].next ∈ rl1, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ rl0, vs0[(vs0[first].next ' + rl).last].next ≠ null ∧ vs0[vs0[(vs0[first].next ' + rl).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(vs0[first].next ' + rl).last].next].deqID.tid)) = Claimed(vs0[vs0[(vs0[first].next ' + rl).last].next].deqID.tid, vs0[vs0[(vs0[first].next ' + rl).last].next].val), vtail0 = (vtail ' + rl0).last ∨ vtail0 = (vs0[first].next ' + rl + (vtail ' + rl0).butlast).last ∧ vs0[(vtail ' + rl0).last].deqID = None ∧ vs0[(vtail ' + rl0).last].next = null, (vs0[first].next ' + rl).last = first ∨ (vs0[first].next ' + rl).last = vs0[first].next ∨ (vs0[first].next ' + rl).last ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl, lst = vs0[first].next ∨ lst ∈ rl ∨ lst = vtail ∨ lst ∈ rl0 ⊦
Used simplifier rules: ⊦ None ≠ Some(tid); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a + x = a ' + 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; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ' + x ≠ []; (s)
| ps0[first].deqID = vs0[first].deqID, vs0[vtail].deqID = Some(tid), ps0[vtail].deqID = None, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (vs0[first].next ∈ vs0 ⊃ vs0[vs0[first].next];ps0[vs0[first].next]).deqID ≠ None, vs0[first].next ≠ null, vs0[first].next ≠ vtail, first ≠ lst, first ≠ null, first ≠ vs0[first].next, first ≠ vtail, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs0[first].next ' + rl + vtail ' + rl0, vs0, ps0, owns0), listp(vs0[first].next ' + rl + vtail ' + rl0, vs0, ps0, owns0), markedp(rl, vs0), markedp(rl1, vs0), markedp(rl, ps0), markedp(rl1, ps0), nextnottid(tid, (vs0[first].next ' + rl).last, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + rl + vtail ' + rl0, first, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + rl + vtail ' + rl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(vs0[vs0[first].next].deqID), some?(ps0[vs0[first].next].deqID), unmarkedp(rl0, vs0), unmarkedp(rl0, ps0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs0[first].next ' + rl + vtail ' + rl0 from lst, ¬ dups((rl1 + rl) + rl0), ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl + rl0), ¬ dups(rl1 + rl), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl1, ¬ first ∈ rl, ¬ vtail ∈ rl1, ¬ vtail ∈ rl, ¬ vtail ∈ rl0, ¬ first ∈ rl0, ¬ vs0[first].next ∈ rl1, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ rl0, vs0[(vs0[first].next ' + rl).last].next ≠ null ∧ vs0[vs0[(vs0[first].next ' + rl).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(vs0[first].next ' + rl).last].next].deqID.tid)) = Claimed(vs0[vs0[(vs0[first].next ' + rl).last].next].deqID.tid, vs0[vs0[(vs0[first].next ' + rl).last].next].val), vtail0 = (vtail ' + rl0).last ∨ vtail0 = (vs0[first].next ' + rl + (vtail ' + rl0).butlast).last ∧ vs0[(vtail ' + rl0).last].deqID = None ∧ vs0[(vtail ' + rl0).last].next = null, (vs0[first].next ' + rl).last = first ∨ (vs0[first].next ' + rl).last = vs0[first].next ∨ (vs0[first].next ' + rl).last ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl, lst = vs0[first].next ∨ lst ∈ rl ∨ lst = vtail ∨ lst ∈ rl0 ⊦ |
⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid))
ps0[vtail].deqID = None, vs0[vtail].deqID = Some(tid), ps0[first].deqID = vs0[first].deqID, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (vs0[first].next ∈ vs0 ⊃ vs0[vs0[first].next];ps0[vs0[first].next]).deqID ≠ None, vs0[first].next ≠ null, vs0[first].next ≠ vtail, first ≠ lst, first ≠ null, first ≠ vs0[first].next, first ≠ vtail, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[first].next ' + rl + vtail ' + rl0, vs0, ps0, owns0), listp(rl1 + first ' + vs0[first].next ' + rl + vtail ' + rl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl, ps0), markedp(rl1, vs0), markedp(rl, vs0), nextnottid(tid, (vs0[first].next ' + rl).last, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + rl + vtail ' + rl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vs0[first].next].deqID), some?(vs0[vs0[first].next].deqID), some?(vs0[first].deqID), unmarkedp(rl0, ps0), unmarkedp(rl0, vs0), vtail0 ∈ rl1 + first ' + vs0[first].next ' + rl + vtail ' + rl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, ¬ dups((rl1 + rl) + rl0), ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl + rl0), ¬ dups(rl1 + rl), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl1, ¬ first ∈ rl, ¬ vtail ∈ rl1, ¬ vtail ∈ rl, ¬ vtail ∈ rl0, ¬ first ∈ rl0, ¬ vs0[first].next ∈ rl1, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ rl0, vs0[(vs0[first].next ' + rl).last].next ≠ null ∧ vs0[vs0[(vs0[first].next ' + rl).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(vs0[first].next ' + rl).last].next].deqID.tid)) = Claimed(vs0[vs0[(vs0[first].next ' + rl).last].next].deqID.tid, vs0[vs0[(vs0[first].next ' + rl).last].next].val), ∀ r0. r0 ≠ first ∧ r0 ∈ rl1 + first ' + vs0[first].next ' + rl + vtail ' + rl0 from first → vs0[r0].deqID ≠ Some(tid), lst = vs0[first].next ∨ lst ∈ rl ∨ lst = vtail ∨ lst ∈ rl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl, (vs0[first].next ' + rl).last = first ∨ (vs0[first].next ' + rl).last = vs0[first].next ∨ (vs0[first].next ' + rl).last ∈ rl, vtail0 = (vtail ' + rl0).last ∨ vtail0 = (vs0[first].next ' + rl + (vtail ' + rl0).butlast).last ∧ vs0[(vtail ' + rl0).last].deqID = None ∧ vs0[(vtail ' + rl0).last].next = null ⊦
Used terms: tid, rl1 + first ' + vs0[first].next ' + rl + vtail ' + rl0, first, vs0
| ⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) |
| ps0[vtail].deqID = None, vs0[vtail].deqID = Some(tid), ps0[first].deqID = vs0[first].deqID, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (vs0[first].next ∈ vs0 ⊃ vs0[vs0[first].next];ps0[vs0[first].next]).deqID ≠ None, vs0[first].next ≠ null, vs0[first].next ≠ vtail, first ≠ lst, first ≠ null, first ≠ vs0[first].next, first ≠ vtail, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[first].next ' + rl + vtail ' + rl0, vs0, ps0, owns0), listp(rl1 + first ' + vs0[first].next ' + rl + vtail ' + rl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl, ps0), markedp(rl1, vs0), markedp(rl, vs0), nextnottid(tid, (vs0[first].next ' + rl).last, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + rl + vtail ' + rl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vs0[first].next].deqID), some?(vs0[vs0[first].next].deqID), some?(vs0[first].deqID), unmarkedp(rl0, ps0), unmarkedp(rl0, vs0), vtail0 ∈ rl1 + first ' + vs0[first].next ' + rl + vtail ' + rl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, ¬ dups((rl1 + rl) + rl0), ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl + rl0), ¬ dups(rl1 + rl), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl1, ¬ first ∈ rl, ¬ vtail ∈ rl1, ¬ vtail ∈ rl, ¬ vtail ∈ rl0, ¬ first ∈ rl0, ¬ vs0[first].next ∈ rl1, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ rl0, vs0[(vs0[first].next ' + rl).last].next ≠ null ∧ vs0[vs0[(vs0[first].next ' + rl).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(vs0[first].next ' + rl).last].next].deqID.tid)) = Claimed(vs0[vs0[(vs0[first].next ' + rl).last].next].deqID.tid, vs0[vs0[(vs0[first].next ' + rl).last].next].val), ∀ r0. r0 ≠ first ∧ r0 ∈ rl1 + first ' + vs0[first].next ' + rl + vtail ' + rl0 from first → vs0[r0].deqID ≠ Some(tid), lst = vs0[first].next ∨ lst ∈ rl ∨ lst = vtail ∨ lst ∈ rl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl, (vs0[first].next ' + rl).last = first ∨ (vs0[first].next ' + rl).last = vs0[first].next ∨ (vs0[first].next ' + rl).last ∈ rl, vtail0 = (vtail ' + rl0).last ∨ vtail0 = (vs0[first].next ' + rl + (vtail ' + rl0).butlast).last ∧ vs0[(vtail ' + rl0).last].deqID = None ∧ vs0[(vtail ' + rl0).last].next = null ⊦ |
ps0[first].deqID = vs0[first].deqID, vs0[vtail].deqID = Some(tid), ps0[vtail].deqID = None, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (vs0[first].next ∈ vs0 ⊃ vs0[vs0[first].next];ps0[vs0[first].next]).deqID ≠ None, vs0[first].next ≠ null, vs0[first].next ≠ vtail, first ≠ lst, first ≠ null, first ≠ vs0[first].next, first ≠ vtail, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs0[first].next ' + rl + vtail ' + rl0, vs0, ps0, owns0), listp(vs0[first].next ' + rl + vtail ' + rl0, vs0, ps0, owns0), markedp(rl, vs0), markedp(rl1, vs0), markedp(rl, ps0), markedp(rl1, ps0), nextnottid(tid, (vs0[first].next ' + rl).last, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + rl + vtail ' + rl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(vs0[vs0[first].next].deqID), some?(ps0[vs0[first].next].deqID), unmarkedp(rl0, vs0), unmarkedp(rl0, ps0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs0[first].next ' + rl + vtail ' + rl0 from lst, ¬ dups((rl1 + rl) + rl0), ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl + rl0), ¬ dups(rl1 + rl), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl1, ¬ first ∈ rl, ¬ vtail ∈ rl1, ¬ vtail ∈ rl, ¬ vtail ∈ rl0, ¬ first ∈ rl0, ¬ vs0[first].next ∈ rl1, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ rl0, vs0[(vs0[first].next ' + rl).last].next ≠ null ∧ vs0[vs0[(vs0[first].next ' + rl).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(vs0[first].next ' + rl).last].next].deqID.tid)) = Claimed(vs0[vs0[(vs0[first].next ' + rl).last].next].deqID.tid, vs0[vs0[(vs0[first].next ' + rl).last].next].val), ∀ r0. r0 ≠ first ∧ (r0 = vs0[first].next ∨ r0 ∈ rl ∨ r0 = vtail ∨ r0 ∈ rl0) → vs0[r0].deqID ≠ Some(tid), vtail0 = (vtail ' + rl0).last ∨ vtail0 = (vs0[first].next ' + rl + (vtail ' + rl0).butlast).last ∧ vs0[(vtail ' + rl0).last].deqID = None ∧ vs0[(vtail ' + rl0).last].next = null, (vs0[first].next ' + rl).last = first ∨ (vs0[first].next ' + rl).last = vs0[first].next ∨ (vs0[first].next ' + rl).last ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl, lst = vs0[first].next ∨ lst ∈ rl ∨ lst = vtail ∨ lst ∈ rl0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| ps0[first].deqID = vs0[first].deqID, vs0[vtail].deqID = Some(tid), ps0[vtail].deqID = None, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), (vs0[first].next ∈ vs0 ⊃ vs0[vs0[first].next];ps0[vs0[first].next]).deqID ≠ None, vs0[first].next ≠ null, vs0[first].next ≠ vtail, first ≠ lst, first ≠ null, first ≠ vs0[first].next, first ≠ vtail, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs0[first].next ' + rl + vtail ' + rl0, vs0, ps0, owns0), listp(vs0[first].next ' + rl + vtail ' + rl0, vs0, ps0, owns0), markedp(rl, vs0), markedp(rl1, vs0), markedp(rl, ps0), markedp(rl1, ps0), nextnottid(tid, (vs0[first].next ' + rl).last, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + rl + vtail ' + rl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(vs0[vs0[first].next].deqID), some?(ps0[vs0[first].next].deqID), unmarkedp(rl0, vs0), unmarkedp(rl0, ps0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs0[first].next ' + rl + vtail ' + rl0 from lst, ¬ dups((rl1 + rl) + rl0), ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl + rl0), ¬ dups(rl1 + rl), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl1, ¬ first ∈ rl, ¬ vtail ∈ rl1, ¬ vtail ∈ rl, ¬ vtail ∈ rl0, ¬ first ∈ rl0, ¬ vs0[first].next ∈ rl1, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ rl0, vs0[(vs0[first].next ' + rl).last].next ≠ null ∧ vs0[vs0[(vs0[first].next ' + rl).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(vs0[first].next ' + rl).last].next].deqID.tid)) = Claimed(vs0[vs0[(vs0[first].next ' + rl).last].next].deqID.tid, vs0[vs0[(vs0[first].next ' + rl).last].next].val), ∀ r0. r0 ≠ first ∧ (r0 = vs0[first].next ∨ r0 ∈ rl ∨ r0 = vtail ∨ r0 ∈ rl0) → vs0[r0].deqID ≠ Some(tid), vtail0 = (vtail ' + rl0).last ∨ vtail0 = (vs0[first].next ' + rl + (vtail ' + rl0).butlast).last ∧ vs0[(vtail ' + rl0).last].deqID = None ∧ vs0[(vtail ' + rl0).last].next = null, (vs0[first].next ' + rl).last = first ∨ (vs0[first].next ' + rl).last = vs0[first].next ∨ (vs0[first].next ' + rl).last ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl, lst = vs0[first].next ∨ lst ∈ rl ∨ lst = vtail ∨ lst ∈ rl0 ⊦ |
Used terms: vtail
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.