| ⊦ ( ( gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( 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.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) ∧ ( ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D24, a) ∧ pcstepf(gs, ls, D24, a) = D6 → ( ( lstepf(gs, ls, D24, a).success → lstepf(gs, ls, D24, a).optval = gstepf(gs, ls, D24, a).vrvHp[lstepf(gs, ls, D24, a).rvref] ∧ lstepf(gs, ls, D24, a).optval = gstepf(gs, ls, D24, a).prvHp[lstepf(gs, ls, D24, a).rvref]) ∧ gstepf(gs, ls, D24, a).rvowns(gstepf(gs, ls, D24, a).vretRefs(lstepf(gs, ls, D24, a).tid)) = (lstepf(gs, ls, D24, a).optval = Empty ∨ ¬ lstepf(gs, ls, D24, a).success ⊃ Pending(lstepf(gs, ls, D24, a).tid) ;Claimed(lstepf(gs, ls, D24, a).tid, lstepf(gs, ls, D24, a).optval.val) )) ∧ ( listp (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs, gstepf(gs, ls, D24, a).ps, gstepf(gs, ls, D24, a).owns) ∧ ¬ dups(gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl) ∧ markedp(gstepf(gs, ls, D24, a).orl, gstepf(gs, ls, D24, a).ps) ∧ markedp(gstepf(gs, ls, D24, a).orl, gstepf(gs, ls, D24, a).vs) ∧ unmarkedp(gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).ps) ∧ gstepf(gs, ls, D24, a).orl ≠ [] ∧ gstepf(gs, ls, D24, a).phead ∈ gstepf(gs, ls, D24, a).orl ∧ rvownerok(gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).vrvHp, gstepf(gs, ls, D24, a).rvowns) ∧ allocrv(gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs, gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D24, a).pretRefs, gstepf(gs, ls, D24, a).prvHp, gstepf(gs, ls, D24, a).rvowns) ∧ allocrv(gstepf(gs, ls, D24, a).pretRefs, gstepf(gs, ls, D24, a).prvHp) ∧ dom gstepf(gs, ls, D24, a).vrvHp = dom gstepf(gs, ls, D24, a).prvHp ∧ ( gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next ≠ null ∧ gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D24, a).rvowns (gstepf(gs, ls, D24, a).vretRefs(gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].deqID.tid, gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D24, a).orl.last = gstepf(gs, ls, D24, a).vhead ∧ (gstepf(gs, ls, D24, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D24, a).qrl.tail, gstepf(gs, ls, D24, a).vs)) ∨ gstepf(gs, ls, D24, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D24, a).orl.butlast.last = gstepf(gs, ls, D24, a).vhead ∧ gstepf(gs, ls, D24, a).phead ≠ gstepf(gs, ls, D24, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs)) ∧ ( gstepf(gs, ls, D24, a).vtail = (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl).last ∨ gstepf(gs, ls, D24, a).qrl ≠ [] ∧ gstepf(gs, ls, D24, a).vtail = (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl.butlast).last ∧ gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D24, a).vs[(gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl).last].next = null)) ∧ ( gstepf(gs, ls, D24, a).vretRefs(lstepf(gs, ls, D24, a).tid) = lstepf(gs, ls, D24, a).rvref ∧ gstepf(gs, ls, D24, a).pretRefs(lstepf(gs, ls, D24, a).tid) = lstepf(gs, ls, D24, a).rvref ∧ lstepf(gs, ls, D24, a).rvref ∈ gstepf(gs, ls, D24, a).vrvHp ∧ lstepf(gs, ls, D24, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D24, a).tid, gstepf(gs, ls, D24, a).vhead, gstepf(gs, ls, D24, a).vs) ∧ noid (lstepf(gs, ls, D24, a).tid, gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vhead, gstepf(gs, ls, D24, a).vs) ∧ noowns(lstepf(gs, ls, D24, a).tid, gstepf(gs, ls, D24, a).owns) |
ls.nxt = gs.ps[ls.first].next, ls.optval = gs.vrvHp[ls.rvref], ls.optval = gs.prvHp[ls.rvref], ls.optval = Val(gs.vs[ls.nxt].val), gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, D24, a) = D6, gs.ps[ls.nxt].deqID ≠ None, ls.first ≠ ls.lst, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, gs.vretRefs(ls.tid) ≠ null, ls.success, 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), noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), pre(gs, ls, D24, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.first ∈ gs.orl, gs.phead ∈ gs.orl, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, ls.lst ∈ gs.orl + gs.qrl from ls.first, ls.rvref ∈ gs.vrvHp, gs.vretRefs(ls.tid) ∈ gs.vrvHp, ¬ 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.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs), 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, D24, a).success → lstepf(gs, ls, D24, a).optval = gstepf(gs, ls, D24, a).vrvHp[lstepf(gs, ls, D24, a).rvref] ∧ lstepf(gs, ls, D24, a).optval = gstepf(gs, ls, D24, a).prvHp[lstepf(gs, ls, D24, a).rvref]) ∧ gstepf(gs, ls, D24, a).rvowns(gstepf(gs, ls, D24, a).vretRefs(lstepf(gs, ls, D24, a).tid)) = (lstepf(gs, ls, D24, a).optval = Empty ∨ ¬ lstepf(gs, ls, D24, a).success ⊃ Pending(lstepf(gs, ls, D24, a).tid) ;Claimed(lstepf(gs, ls, D24, a).tid, lstepf(gs, ls, D24, a).optval.val) )) ∧ ( listp (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs, gstepf(gs, ls, D24, a).ps, gstepf(gs, ls, D24, a).owns) ∧ ¬ dups(gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl) ∧ markedp(gstepf(gs, ls, D24, a).orl, gstepf(gs, ls, D24, a).ps) ∧ markedp(gstepf(gs, ls, D24, a).orl, gstepf(gs, ls, D24, a).vs) ∧ unmarkedp(gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).ps) ∧ gstepf(gs, ls, D24, a).orl ≠ [] ∧ gstepf(gs, ls, D24, a).phead ∈ gstepf(gs, ls, D24, a).orl ∧ rvownerok(gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).vrvHp, gstepf(gs, ls, D24, a).rvowns) ∧ allocrv(gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs, gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D24, a).pretRefs, gstepf(gs, ls, D24, a).prvHp, gstepf(gs, ls, D24, a).rvowns) ∧ allocrv(gstepf(gs, ls, D24, a).pretRefs, gstepf(gs, ls, D24, a).prvHp) ∧ dom gstepf(gs, ls, D24, a).vrvHp = dom gstepf(gs, ls, D24, a).prvHp ∧ ( gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next ≠ null ∧ gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D24, a).rvowns (gstepf(gs, ls, D24, a).vretRefs(gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].deqID.tid, gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D24, a).orl.last = gstepf(gs, ls, D24, a).vhead ∧ (gstepf(gs, ls, D24, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D24, a).qrl.tail, gstepf(gs, ls, D24, a).vs)) ∨ gstepf(gs, ls, D24, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D24, a).orl.butlast.last = gstepf(gs, ls, D24, a).vhead ∧ gstepf(gs, ls, D24, a).phead ≠ gstepf(gs, ls, D24, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs)) ∧ ( gstepf(gs, ls, D24, a).vtail = (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl).last ∨ gstepf(gs, ls, D24, a).qrl ≠ [] ∧ gstepf(gs, ls, D24, a).vtail = (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl.butlast).last ∧ gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D24, a).vs[(gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl).last].next = null)) ∧ ( gstepf(gs, ls, D24, a).vretRefs(lstepf(gs, ls, D24, a).tid) = lstepf(gs, ls, D24, a).rvref ∧ gstepf(gs, ls, D24, a).pretRefs(lstepf(gs, ls, D24, a).tid) = lstepf(gs, ls, D24, a).rvref ∧ lstepf(gs, ls, D24, a).rvref ∈ gstepf(gs, ls, D24, a).vrvHp ∧ lstepf(gs, ls, D24, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D24, a).tid, gstepf(gs, ls, D24, a).vhead, gstepf(gs, ls, D24, a).vs) ∧ noid(lstepf(gs, ls, D24, a).tid, gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vhead, gstepf(gs, ls, D24, a).vs) ∧ noowns(lstepf(gs, ls, D24, a).tid, gstepf(gs, ls, D24, a).owns)
| ls.nxt = gs.ps[ls.first].next, ls.optval = gs.vrvHp[ls.rvref], ls.optval = gs.prvHp[ls.rvref], ls.optval = Val(gs.vs[ls.nxt].val), gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, D24, a) = D6, gs.ps[ls.nxt].deqID ≠ None, ls.first ≠ ls.lst, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, gs.vretRefs(ls.tid) ≠ null, ls.success, 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), noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), pre(gs, ls, D24, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.first ∈ gs.orl, gs.phead ∈ gs.orl, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, ls.lst ∈ gs.orl + gs.qrl from ls.first, ls.rvref ∈ gs.vrvHp, gs.vretRefs(ls.tid) ∈ gs.vrvHp, ¬ 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.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs), 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, D24, a).success → lstepf(gs, ls, D24, a).optval = gstepf(gs, ls, D24, a).vrvHp[lstepf(gs, ls, D24, a).rvref] ∧ lstepf(gs, ls, D24, a).optval = gstepf(gs, ls, D24, a).prvHp[lstepf(gs, ls, D24, a).rvref]) ∧ gstepf(gs, ls, D24, a).rvowns(gstepf(gs, ls, D24, a).vretRefs(lstepf(gs, ls, D24, a).tid)) = (lstepf(gs, ls, D24, a).optval = Empty ∨ ¬ lstepf(gs, ls, D24, a).success ⊃ Pending(lstepf(gs, ls, D24, a).tid) ;Claimed(lstepf(gs, ls, D24, a).tid, lstepf(gs, ls, D24, a).optval.val) )) ∧ ( listp (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs, gstepf(gs, ls, D24, a).ps, gstepf(gs, ls, D24, a).owns) ∧ ¬ dups(gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl) ∧ markedp(gstepf(gs, ls, D24, a).orl, gstepf(gs, ls, D24, a).ps) ∧ markedp(gstepf(gs, ls, D24, a).orl, gstepf(gs, ls, D24, a).vs) ∧ unmarkedp(gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).ps) ∧ gstepf(gs, ls, D24, a).orl ≠ [] ∧ gstepf(gs, ls, D24, a).phead ∈ gstepf(gs, ls, D24, a).orl ∧ rvownerok(gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).vrvHp, gstepf(gs, ls, D24, a).rvowns) ∧ allocrv(gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs, gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D24, a).pretRefs, gstepf(gs, ls, D24, a).prvHp, gstepf(gs, ls, D24, a).rvowns) ∧ allocrv(gstepf(gs, ls, D24, a).pretRefs, gstepf(gs, ls, D24, a).prvHp) ∧ dom gstepf(gs, ls, D24, a).vrvHp = dom gstepf(gs, ls, D24, a).prvHp ∧ ( gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next ≠ null ∧ gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D24, a).rvowns (gstepf(gs, ls, D24, a).vretRefs(gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].deqID.tid, gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D24, a).orl.last = gstepf(gs, ls, D24, a).vhead ∧ (gstepf(gs, ls, D24, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D24, a).qrl.tail, gstepf(gs, ls, D24, a).vs)) ∨ gstepf(gs, ls, D24, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D24, a).orl.butlast.last = gstepf(gs, ls, D24, a).vhead ∧ gstepf(gs, ls, D24, a).phead ≠ gstepf(gs, ls, D24, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs)) ∧ ( gstepf(gs, ls, D24, a).vtail = (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl).last ∨ gstepf(gs, ls, D24, a).qrl ≠ [] ∧ gstepf(gs, ls, D24, a).vtail = (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl.butlast).last ∧ gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D24, a).vs[(gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl).last].next = null)) ∧ ( gstepf(gs, ls, D24, a).vretRefs(lstepf(gs, ls, D24, a).tid) = lstepf(gs, ls, D24, a).rvref ∧ gstepf(gs, ls, D24, a).pretRefs(lstepf(gs, ls, D24, a).tid) = lstepf(gs, ls, D24, a).rvref ∧ lstepf(gs, ls, D24, a).rvref ∈ gstepf(gs, ls, D24, a).vrvHp ∧ lstepf(gs, ls, D24, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D24, a).tid, gstepf(gs, ls, D24, a).vhead, gstepf(gs, ls, D24, a).vs) ∧ noid(lstepf(gs, ls, D24, a).tid, gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vhead, gstepf(gs, ls, D24, a).vs) ∧ noowns(lstepf(gs, ls, D24, a).tid, gstepf(gs, ls, D24, 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) = Claimed(ls.tid, gs.vs[ls.nxt].val), gs.vretRefs(ls.tid) = ls.rvref, Val(gs.vs[ls.nxt].val) = gs.vrvHp[ls.rvref], Val(gs.vs[ls.nxt].val) = gs.prvHp[ls.rvref], dom gs.vrvHp = dom gs.prvHp, gs.ps[ls.nxt].deqID ≠ None, ls.first ≠ ls.lst, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, ls.success, 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), noid(ls.tid, gs.orl + gs.qrl, ls.nxt, 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), ls.first ∈ gs.ps, gs.phead ∈ gs.ps, ls.first ∈ gs.vs, gs.phead ∈ gs.vs, ls.first ∈ gs.orl, gs.phead ∈ gs.orl, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, ls.rvref ∈ gs.vrvHp, ¬ 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.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null, 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) ⊦ Val(gs.vs[ls.nxt].val) = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp[ls.rvref] ∧ Val(gs.vs[ls.nxt].val) = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).prvHp[ls.rvref] ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).rvowns((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs(ls.tid)) = Claimed(ls.tid, gs.vs[ls.nxt].val) ∧ listp ((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).ps, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).owns) ∧ ¬ dups((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl) ∧ markedp((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).ps) ∧ markedp((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs) ∧ unmarkedp((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).ps) ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl ≠ [] ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).phead ∈ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl ∧ rvownerok ((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).rvowns) ∧ allocrv((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp) ∧ nonullRetRefs ((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).pretRefs) ∧ rvownerok ((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).pretRefs, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).prvHp, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).rvowns) ∧ allocrv((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).pretRefs, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).prvHp) ∧ dom (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp = dom (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).prvHp ∧ ( (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead].next ≠ null ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs [(gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead].next ] .deqID ≠ None → (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).rvowns ((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs ((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs [(gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead].next ] .deqID .tid)) = Claimed ((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs [(gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead].next ] .deqID .tid, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs [(gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead].next ] .val)) ∧ ( (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl.last = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead ∧ ( (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl ≠ [] → unmarkedp((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl.tail, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs)) ∨ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl.butlast ≠ [] ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl.butlast.last = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).phead ≠ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl.last ∧ unmarkedp((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs)) ∧ ( (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vtail = ((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl).last ∨ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl ≠ [] ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vtail = ((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl.butlast).last ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl.last].deqID = None ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl.last].next = null) ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs(ls.tid) = ls.rvref ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp ∧ nextnottid(ls.tid, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs) ∧ noid (ls.tid, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs) ∧ noowns(ls.tid, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).owns)
Used simplifier rules: ⊦ Val(val).val = val; (s) ⊦ Empty ≠ 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, D24, a) = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs); (s) ⊦ lstepf(gs, ls, D24, a) = ls; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ pre(gs, ls, D24, a) ↔ a = τ; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ pcstepf(gs, ls, D24, a) = D6; (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) = Claimed(ls.tid, gs.vs[ls.nxt].val), gs.vretRefs(ls.tid) = ls.rvref, Val(gs.vs[ls.nxt].val) = gs.vrvHp[ls.rvref], Val(gs.vs[ls.nxt].val) = gs.prvHp[ls.rvref], dom gs.vrvHp = dom gs.prvHp, gs.ps[ls.nxt].deqID ≠ None, ls.first ≠ ls.lst, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, ls.success, 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), noid(ls.tid, gs.orl + gs.qrl, ls.nxt, 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), ls.first ∈ gs.ps, gs.phead ∈ gs.ps, ls.first ∈ gs.vs, gs.phead ∈ gs.vs, ls.first ∈ gs.orl, gs.phead ∈ gs.orl, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, ls.rvref ∈ gs.vrvHp, ¬ 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.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null, 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) ⊦ Val(gs.vs[ls.nxt].val) = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp[ls.rvref] ∧ Val(gs.vs[ls.nxt].val) = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).prvHp[ls.rvref] ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).rvowns((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs(ls.tid)) = Claimed(ls.tid, gs.vs[ls.nxt].val) ∧ listp ((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).ps, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).owns) ∧ ¬ dups((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl) ∧ markedp((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).ps) ∧ markedp((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs) ∧ unmarkedp((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).ps) ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl ≠ [] ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).phead ∈ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl ∧ rvownerok ((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).rvowns) ∧ allocrv((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp) ∧ nonullRetRefs ((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).pretRefs) ∧ rvownerok ((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).pretRefs, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).prvHp, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).rvowns) ∧ allocrv((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).pretRefs, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).prvHp) ∧ dom (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp = dom (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).prvHp ∧ ( (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead].next ≠ null ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs [(gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead].next ] .deqID ≠ None → (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).rvowns ((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs ((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs [(gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead].next ] .deqID .tid)) = Claimed ((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs [(gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead].next ] .deqID .tid, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs [(gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead].next ] .val)) ∧ ( (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl.last = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead ∧ ( (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl ≠ [] → unmarkedp((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl.tail, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs)) ∨ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl.butlast ≠ [] ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl.butlast.last = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).phead ≠ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl.last ∧ unmarkedp((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs)) ∧ ( (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vtail = ((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl).last ∨ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl ≠ [] ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vtail = ((gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl.butlast).last ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl.last].deqID = None ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl.last].next = null) ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs(ls.tid) = ls.rvref ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp ∧ nextnottid(ls.tid, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs) ∧ noid (ls.tid, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs) ∧ noowns(ls.tid, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).owns) |
ls.nxt = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), Val(vs[ls.nxt].val) = prvHp[ls.rvref], Val(vs[ls.nxt].val) = vrvHp[ls.rvref], 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) = Claimed(ls.tid, vs[ls.nxt].val), vretRefs(ls.tid) = ls.rvref, ps[ls.nxt].deqID ≠ None, ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ null, orl ≠ [], ls.success, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(ls.tid, orl + qrl, ls.nxt, 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, phead ∈ orl, ls.first ∈ orl, phead ∈ vs, ls.first ∈ vs, phead ∈ ps, ls.first ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vhead ≠ ls.first → nextnottid(ls.tid, vhead, vs), 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 ⊦ Val(vs[ls.nxt].val) = (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp[ls.rvref] ∧ Val(vs[ls.nxt].val) = (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).prvHp[ls.rvref] ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).rvowns((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs(ls.tid)) = Claimed(ls.tid, vs[ls.nxt].val) ∧ listp ((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).ps, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).owns) ∧ ¬ dups((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl) ∧ markedp((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).ps) ∧ markedp((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs) ∧ unmarkedp((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).ps) ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl ≠ [] ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).phead ∈ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl ∧ rvownerok ((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).rvowns) ∧ allocrv((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp) ∧ nonullRetRefs ((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).pretRefs) ∧ rvownerok ((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).pretRefs, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).prvHp, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).rvowns) ∧ allocrv((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).pretRefs, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).prvHp) ∧ dom (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp = dom (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).prvHp ∧ ( (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead].next ≠ null ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs [(vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead].next ] .deqID ≠ None → (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).rvowns ((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs ((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs [(vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead].next ] .deqID .tid)) = Claimed ((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs [(vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead].next ] .deqID .tid, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs [(vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead].next ] .val)) ∧ ( (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl.last = (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead ∧ ( (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl ≠ [] → unmarkedp((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl.tail, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs)) ∨ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl.butlast ≠ [] ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl.butlast.last = (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).phead ≠ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl.last ∧ unmarkedp((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs)) ∧ ( (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vtail = ((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl).last ∨ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl ≠ [] ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vtail = ((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl.butlast).last ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl.last].deqID = None ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl.last].next = null) ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs(ls.tid) = ls.rvref ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp ∧ nextnottid(ls.tid, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs) ∧ noid (ls.tid, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs) ∧ noowns(ls.tid, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;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), Val(vs[ls.nxt].val) = prvHp[ls.rvref], Val(vs[ls.nxt].val) = vrvHp[ls.rvref], 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) = Claimed(ls.tid, vs[ls.nxt].val), vretRefs(ls.tid) = ls.rvref, ps[ls.nxt].deqID ≠ None, ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ null, orl ≠ [], ls.success, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(ls.tid, orl + qrl, ls.nxt, 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, phead ∈ orl, ls.first ∈ orl, phead ∈ vs, ls.first ∈ vs, phead ∈ ps, ls.first ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vhead ≠ ls.first → nextnottid(ls.tid, vhead, vs), 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 ⊦ Val(vs[ls.nxt].val) = (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp[ls.rvref] ∧ Val(vs[ls.nxt].val) = (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).prvHp[ls.rvref] ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).rvowns((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs(ls.tid)) = Claimed(ls.tid, vs[ls.nxt].val) ∧ listp ((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).ps, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).owns) ∧ ¬ dups((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl) ∧ markedp((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).ps) ∧ markedp((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs) ∧ unmarkedp((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).ps) ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl ≠ [] ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).phead ∈ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl ∧ rvownerok ((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).rvowns) ∧ allocrv((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp) ∧ nonullRetRefs ((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).pretRefs) ∧ rvownerok ((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).pretRefs, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).prvHp, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).rvowns) ∧ allocrv((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).pretRefs, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).prvHp) ∧ dom (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp = dom (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).prvHp ∧ ( (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead].next ≠ null ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs [(vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead].next ] .deqID ≠ None → (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).rvowns ((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs ((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs [(vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead].next ] .deqID .tid)) = Claimed ((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs [(vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead].next ] .deqID .tid, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs [(vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead].next ] .val)) ∧ ( (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl.last = (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead ∧ ( (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl ≠ [] → unmarkedp((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl.tail, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs)) ∨ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl.butlast ≠ [] ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl.butlast.last = (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).phead ≠ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl.last ∧ unmarkedp((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs)) ∧ ( (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vtail = ((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl).last ∨ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl ≠ [] ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vtail = ((vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl.butlast).last ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl.last].deqID = None ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs[(vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl.last].next = null) ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs(ls.tid) = ls.rvref ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp ∧ nextnottid(ls.tid, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs) ∧ noid (ls.tid, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs) ∧ noowns(ls.tid, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).owns) |
ls.nxt = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), Val(vs[ls.nxt].val) = vrvHp[ls.rvref], Val(vs[ls.nxt].val) = prvHp[ls.rvref], dom vrvHp = dom prvHp, pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Claimed(ls.tid, vs[ls.nxt].val), vretRefs(ls.tid) = ls.rvref, ps[ls.nxt].deqID ≠ None, ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ null, orl ≠ [], ls.success, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(ls.tid, orl + qrl, ls.nxt, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), ls.first ∈ orl, phead ∈ orl, vtail ∈ orl + qrl from ls.lst, ls.rvref ∈ vrvHp, ls.first ∈ vs, phead ∈ vs, ls.first ∈ ps, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ ls.first → nextnottid(ls.tid, vhead, vs), 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) ⊦ Val(vs[ls.nxt].val) = (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [ls.rvref ] ∧ Val(vs[ls.nxt].val) = (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp [ls.rvref ] ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns ((vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (ls.tid)) = Claimed(ls.tid, vs[ls.nxt].val) ∧ listp ( (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ ¬ dups ( (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ markedp ((vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ markedp ((vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ unmarkedp ((vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ≠ [] ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∧ rvownerok ((vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv ((vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ nonullRetRefs ( (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs) ∧ rvownerok ((vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv ((vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ dom (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp = dom (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp ∧ ( (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ≠ null ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID ≠ None → (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns ((vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs ((vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid)) = Claimed ((vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .val)) ∧ ( (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last = (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ ( (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] → unmarkedp ((vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .tail, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∨ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast ≠ [] ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast .last = (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ≠ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last ∧ unmarkedp ((vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∧ ( (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ).last ∨ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .butlast ).last ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .deqID = None ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .next = null) ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (ls.tid) = ls.rvref ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (ls.tid) = ls.rvref ∧ ls.rvref ∈ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ nextnottid (ls.tid, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ noid (ls.tid, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ noowns (ls.tid, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;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) .vhead:= phead3 = mkgs (ps, ps0, phead, phead3, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns); (s)
| ls.nxt = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), Val(vs[ls.nxt].val) = vrvHp[ls.rvref], Val(vs[ls.nxt].val) = prvHp[ls.rvref], dom vrvHp = dom prvHp, pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Claimed(ls.tid, vs[ls.nxt].val), vretRefs(ls.tid) = ls.rvref, ps[ls.nxt].deqID ≠ None, ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ null, orl ≠ [], ls.success, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(ls.tid, orl + qrl, ls.nxt, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), ls.first ∈ orl, phead ∈ orl, vtail ∈ orl + qrl from ls.lst, ls.rvref ∈ vrvHp, ls.first ∈ vs, phead ∈ vs, ls.first ∈ ps, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ ls.first → nextnottid(ls.tid, vhead, vs), 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) ⊦ Val(vs[ls.nxt].val) = (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [ls.rvref ] ∧ Val(vs[ls.nxt].val) = (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp [ls.rvref ] ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns ((vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (ls.tid)) = Claimed(ls.tid, vs[ls.nxt].val) ∧ listp ( (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ ¬ dups ( (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ markedp ((vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ markedp ((vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ unmarkedp ((vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ≠ [] ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∧ rvownerok ((vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv ((vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ nonullRetRefs ( (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs) ∧ rvownerok ((vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv ((vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ dom (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp = dom (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp ∧ ( (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ≠ null ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID ≠ None → (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns ((vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs ((vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid)) = Claimed ((vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .val)) ∧ ( (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last = (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ ( (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] → unmarkedp ((vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .tail, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∨ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast ≠ [] ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast .last = (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ≠ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last ∧ unmarkedp ((vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∧ ( (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ).last ∨ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .butlast ).last ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .deqID = None ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .next = null) ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (ls.tid) = ls.rvref ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (ls.tid) = ls.rvref ∧ ls.rvref ∈ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ nextnottid (ls.tid, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ noid (ls.tid, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ noowns (ls.tid, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) |
Val(vs[nxt].val) = prvHp[rvref], Val(vs[nxt].val) = vrvHp[rvref], 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) = Claimed(tid, vs[nxt].val), success, vretRefs(tid) = rvref, ps[nxt].deqID ≠ None, 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), noid(tid, orl + qrl, nxt, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, first ∈ ps, phead ∈ vs, first ∈ vs, rvref ∈ vrvHp, vtail ∈ orl + qrl from lst, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vhead ≠ first → nextnottid(tid, vhead, vs), 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 ⊦ Val(vs[nxt].val) = (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [rvref ] ∧ Val(vs[nxt].val) = (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp [rvref ] ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns ((vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid)) = Claimed(tid, vs[nxt].val) ∧ listp ( (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ ¬ dups ( (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ markedp ((vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ markedp ((vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ unmarkedp ((vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ≠ [] ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∧ rvownerok ((vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv ((vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ nonullRetRefs ( (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs) ∧ rvownerok ((vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv ((vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ dom (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp = dom (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp ∧ ( (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ≠ null ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID ≠ None → (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns ((vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs ((vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid)) = Claimed ((vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .val)) ∧ ( (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last = (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ ( (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] → unmarkedp ((vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .tail, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∨ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast ≠ [] ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast .last = (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ≠ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last ∧ unmarkedp ((vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∧ ( (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ).last ∨ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .butlast ).last ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .deqID = None ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .next = null) ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid) = rvref ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid) = rvref ∧ rvref ∈ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ nextnottid (tid, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ noid (tid, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ noowns (tid, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;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
| Val(vs[nxt].val) = prvHp[rvref], Val(vs[nxt].val) = vrvHp[rvref], 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) = Claimed(tid, vs[nxt].val), success, vretRefs(tid) = rvref, ps[nxt].deqID ≠ None, 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), noid(tid, orl + qrl, nxt, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, first ∈ ps, phead ∈ vs, first ∈ vs, rvref ∈ vrvHp, vtail ∈ orl + qrl from lst, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vhead ≠ first → nextnottid(tid, vhead, vs), 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 ⊦ Val(vs[nxt].val) = (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [rvref ] ∧ Val(vs[nxt].val) = (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp [rvref ] ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns ((vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid)) = Claimed(tid, vs[nxt].val) ∧ listp ( (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ ¬ dups ( (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ markedp ((vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ markedp ((vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ unmarkedp ((vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ≠ [] ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∧ rvownerok ((vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv ((vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ nonullRetRefs ( (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs) ∧ rvownerok ((vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv ((vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ dom (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp = dom (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp ∧ ( (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ≠ null ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID ≠ None → (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns ((vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs ((vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid)) = Claimed ((vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .val)) ∧ ( (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last = (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ ( (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] → unmarkedp ((vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .tail, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∨ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast ≠ [] ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast .last = (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ≠ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last ∧ unmarkedp ((vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∧ ( (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ).last ∨ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .butlast ).last ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .deqID = None ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .next = null) ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid) = rvref ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid) = rvref ∧ rvref ∈ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ nextnottid (tid, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ noid (tid, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ noowns (tid, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) |
Val(vs[ps[first].next].val) = vrvHp[vretRefs(tid)], Val(vs[ps[first].next].val) = prvHp[vretRefs(tid)], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, 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), noid(tid, orl + qrl, ps[first].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ orl, phead ∈ orl, 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), vhead ≠ first → nextnottid(tid, vhead, vs), 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) ⊦ Val(vs[ps[first].next].val) = (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [vretRefs(tid) ] ∧ Val(vs[ps[first].next].val) = (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp [vretRefs(tid) ] ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns ((vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid)) = Claimed(tid, vs[ps[first].next].val) ∧ listp ( (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ ¬ dups ( (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ markedp ((vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ markedp ((vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ unmarkedp ((vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ≠ [] ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∧ rvownerok ((vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv ((vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ nonullRetRefs ( (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs) ∧ rvownerok ((vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv ((vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ dom (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp = dom (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp ∧ ( (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ≠ null ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID ≠ None → (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns ((vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs ((vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid)) = Claimed ((vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .val)) ∧ ( (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last = (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ ( (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] → unmarkedp ((vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .tail, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∨ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast ≠ [] ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast .last = (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ≠ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last ∧ unmarkedp ((vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∧ ( (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ).last ∨ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .butlast ).last ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .deqID = None ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .next = null) ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid) = vretRefs(tid) ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ nextnottid (tid, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ noid (tid, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ noowns (tid, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;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
| Val(vs[ps[first].next].val) = vrvHp[vretRefs(tid)], Val(vs[ps[first].next].val) = prvHp[vretRefs(tid)], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, 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), noid(tid, orl + qrl, ps[first].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ orl, phead ∈ orl, 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), vhead ≠ first → nextnottid(tid, vhead, vs), 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) ⊦ Val(vs[ps[first].next].val) = (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [vretRefs(tid) ] ∧ Val(vs[ps[first].next].val) = (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp [vretRefs(tid) ] ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns ((vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid)) = Claimed(tid, vs[ps[first].next].val) ∧ listp ( (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ ¬ dups ( (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ markedp ((vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ markedp ((vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ unmarkedp ((vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ≠ [] ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∧ rvownerok ((vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv ((vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ nonullRetRefs ( (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs) ∧ rvownerok ((vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv ((vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ dom (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp = dom (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp ∧ ( (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ≠ null ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID ≠ None → (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns ((vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs ((vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid)) = Claimed ((vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .val)) ∧ ( (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last = (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ ( (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] → unmarkedp ((vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .tail, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∨ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast ≠ [] ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast .last = (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ≠ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last ∧ unmarkedp ((vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∧ ( (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ).last ∨ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .butlast ).last ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .deqID = None ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .next = null) ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid) = vretRefs(tid) ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ nextnottid (tid, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ noid (tid, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ noowns (tid, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) |
(vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;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), Val(vs[ps[first].next].val) = prvHp[vretRefs(tid)], Val(vs[ps[first].next].val) = vrvHp[vretRefs(tid)], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, 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), noid(tid, orl + qrl, ps[first].next, 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, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vhead ≠ first → nextnottid(tid, vhead, vs), 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 ⊦ Val(vs[ps[first].next].val) = vrvHp0[vretRefs(tid)] ∧ Val(vs[ps[first].next].val) = prvHp0[vretRefs(tid)] ∧ rvowns0(vretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ 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) ∧ vretRefs0(tid) = vretRefs(tid) ∧ pretRefs0(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp0 ∧ nextnottid(tid, vhead0, vs0) ∧ noid(tid, orl0 + qrl0, vhead0, vs0) ∧ noowns(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, (vhead = first ⊃ mkgs (ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0
| (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;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), Val(vs[ps[first].next].val) = prvHp[vretRefs(tid)], Val(vs[ps[first].next].val) = vrvHp[vretRefs(tid)], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, 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), noid(tid, orl + qrl, ps[first].next, 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, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vhead ≠ first → nextnottid(tid, vhead, vs), 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 ⊦ Val(vs[ps[first].next].val) = vrvHp0[vretRefs(tid)] ∧ Val(vs[ps[first].next].val) = prvHp0[vretRefs(tid)] ∧ rvowns0(vretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ 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) ∧ vretRefs0(tid) = vretRefs(tid) ∧ pretRefs0(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp0 ∧ nextnottid(tid, vhead0, vs0) ∧ noid(tid, orl0 + qrl0, vhead0, vs0) ∧ noowns(tid, owns0) |
⊦ listp(rl + rl0, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + rl0, vs, ps, owns))
(vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;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), Val(vs[ps[first].next].val) = vrvHp[vretRefs(tid)], Val(vs[ps[first].next].val) = prvHp[vretRefs(tid)], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, 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), noid(tid, orl + qrl, ps[first].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ orl, phead ∈ orl, 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), vhead ≠ first → nextnottid(tid, vhead, vs), 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) ⊦ Val(vs[ps[first].next].val) = vrvHp0[vretRefs(tid)] ∧ Val(vs[ps[first].next].val) = prvHp0[vretRefs(tid)] ∧ rvowns0(vretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ 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) ∧ vretRefs0(tid) = vretRefs(tid) ∧ pretRefs0(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp0 ∧ nextnottid(tid, vhead0, vs0) ∧ noid(tid, orl0 + qrl0, vhead0, vs0) ∧ noowns(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)) |
| (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;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), Val(vs[ps[first].next].val) = vrvHp[vretRefs(tid)], Val(vs[ps[first].next].val) = prvHp[vretRefs(tid)], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, 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), noid(tid, orl + qrl, ps[first].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ orl, phead ∈ orl, 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), vhead ≠ first → nextnottid(tid, vhead, vs), 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) ⊦ Val(vs[ps[first].next].val) = vrvHp0[vretRefs(tid)] ∧ Val(vs[ps[first].next].val) = prvHp0[vretRefs(tid)] ∧ rvowns0(vretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ 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) ∧ vretRefs0(tid) = vretRefs(tid) ∧ pretRefs0(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp0 ∧ nextnottid(tid, vhead0, vs0) ∧ noid(tid, orl0 + qrl0, vhead0, vs0) ∧ noowns(tid, owns0) |
(vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, rl1 + first ' + rl2, owns, rvowns) ;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), Val(vs[ps[first].next].val) = prvHp[vretRefs(tid)], Val(vs[ps[first].next].val) = vrvHp[vretRefs(tid)], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, 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), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, vhead ≠ first → nextnottid(tid, vhead, vs), 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, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦ Val(vs[ps[first].next].val) = vrvHp0[vretRefs(tid)] ∧ Val(vs[ps[first].next].val) = prvHp0[vretRefs(tid)] ∧ rvowns0(vretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ 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) ∧ vretRefs0(tid) = vretRefs(tid) ∧ pretRefs0(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp0 ∧ nextnottid(tid, vhead0, vs0) ∧ noid(tid, orl0 + qrl0, vhead0, vs0) ∧ noowns(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)
| (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, rl1 + first ' + rl2, owns, rvowns) ;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), Val(vs[ps[first].next].val) = prvHp[vretRefs(tid)], Val(vs[ps[first].next].val) = vrvHp[vretRefs(tid)], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, 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), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, vhead ≠ first → nextnottid(tid, vhead, vs), 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, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦ Val(vs[ps[first].next].val) = vrvHp0[vretRefs(tid)] ∧ Val(vs[ps[first].next].val) = prvHp0[vretRefs(tid)] ∧ rvowns0(vretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ 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) ∧ vretRefs0(tid) = vretRefs(tid) ∧ pretRefs0(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp0 ∧ nextnottid(tid, vhead0, vs0) ∧ noid(tid, orl0 + qrl0, vhead0, vs0) ∧ noowns(tid, owns0) |
Val(vs[ps[first].next].val) = vrvHp[vretRefs(tid)], Val(vs[ps[first].next].val) = prvHp[vretRefs(tid)], dom vrvHp = dom prvHp, mkgs(ps, vs, phead, ps[first].next, 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)) = Claimed(tid, vs[ps[first].next].val), vhead = first, ps[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), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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), vhead ≠ first → nextnottid(tid, vhead, vs), phead ∈ rl1 ∨ phead = first ∨ phead ∈ 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) ⊦ Val(vs[ps[first].next].val) = vrvHp0[vretRefs(tid)] ∧ Val(vs[ps[first].next].val) = prvHp0[vretRefs(tid)] ∧ rvowns0(vretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ 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) ∧ vretRefs0(tid) = vretRefs(tid) ∧ pretRefs0(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp0 ∧ nextnottid(tid, vhead0, vs0) ∧ noid(tid, orl0 + qrl0, vhead0, vs0) ∧ noowns(tid, owns0)
Val(vs[ps[first].next].val) = vrvHp[vretRefs(tid)], Val(vs[ps[first].next].val) = prvHp[vretRefs(tid)], 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)) = Claimed(tid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, vhead ≠ first, 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), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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), vhead ≠ first → nextnottid(tid, vhead, vs), phead ∈ rl1 ∨ phead = first ∨ phead ∈ 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) ⊦ Val(vs[ps[first].next].val) = vrvHp0[vretRefs(tid)] ∧ Val(vs[ps[first].next].val) = prvHp0[vretRefs(tid)] ∧ rvowns0(vretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ 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) ∧ vretRefs0(tid) = vretRefs(tid) ∧ pretRefs0(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp0 ∧ nextnottid(tid, vhead0, vs0) ∧ noid(tid, orl0 + qrl0, vhead0, vs0) ∧ noowns(tid, owns0)
| Val(vs[ps[first].next].val) = vrvHp[vretRefs(tid)], Val(vs[ps[first].next].val) = prvHp[vretRefs(tid)], dom vrvHp = dom prvHp, mkgs(ps, vs, phead, ps[first].next, 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)) = Claimed(tid, vs[ps[first].next].val), vhead = first, ps[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), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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), vhead ≠ first → nextnottid(tid, vhead, vs), phead ∈ rl1 ∨ phead = first ∨ phead ∈ 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) ⊦ Val(vs[ps[first].next].val) = vrvHp0[vretRefs(tid)] ∧ Val(vs[ps[first].next].val) = prvHp0[vretRefs(tid)] ∧ rvowns0(vretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ 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) ∧ vretRefs0(tid) = vretRefs(tid) ∧ pretRefs0(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp0 ∧ nextnottid(tid, vhead0, vs0) ∧ noid(tid, orl0 + qrl0, vhead0, vs0) ∧ noowns(tid, owns0) |
Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), 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), noid(tid, (rl1 + first ' + rl2) + qrl0, ps0[first].next, 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[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 ∨ phead0 ∈ 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 = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = first ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0) ⊦ ( vs0[ps0[first].next].next ≠ null ∧ vs0[vs0[ps0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[ps0[first].next].next].deqID.tid, vs0[vs0[ps0[first].next].next].val)) ∧ ( (first ' + rl2).last = ps0[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = ps0[first].next ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0)) ∧ nextnottid(tid, ps0[first].next, vs0)
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 ' + x ↔ a = b ∨ a ∈ x; (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) ⊦ 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)
| Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), 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), noid(tid, (rl1 + first ' + rl2) + qrl0, ps0[first].next, 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[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 ∨ phead0 ∈ 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 = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = first ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0) ⊦ ( vs0[ps0[first].next].next ≠ null ∧ vs0[vs0[ps0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[ps0[first].next].next].deqID.tid, vs0[vs0[ps0[first].next].next].val)) ∧ ( (first ' + rl2).last = ps0[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = ps0[first].next ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0)) ∧ nextnottid(tid, ps0[first].next, vs0) |
Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = [], rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), 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), noid(tid, (rl1 + first ' + rl2) + qrl0, ps0[first].next, 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[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), (first ' + rl2).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = first ∧ 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ ( vs0[ps0[first].next].next ≠ null ∧ vs0[vs0[ps0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[ps0[first].next].next].deqID.tid, vs0[vs0[ps0[first].next].next].val)) ∧ ( (first ' + rl2).last = ps0[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = ps0[first].next ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0)) ∧ nextnottid(tid, ps0[first].next, vs0)
Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = first0 + rl, rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), 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), noid(tid, (rl1 + first ' + rl2) + qrl0, ps0[first].next, 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[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), (first ' + rl2).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = first ∧ 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ ( vs0[ps0[first].next].next ≠ null ∧ vs0[vs0[ps0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[ps0[first].next].next].deqID.tid, vs0[vs0[ps0[first].next].next].val)) ∧ ( (first ' + rl2).last = ps0[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = ps0[first].next ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0)) ∧ nextnottid(tid, ps0[first].next, vs0)
Used simplifier rules: reflist freely generated by [], +;;
| Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = [], rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), 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), noid(tid, (rl1 + first ' + rl2) + qrl0, ps0[first].next, 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[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), (first ' + rl2).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = first ∧ 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ ( vs0[ps0[first].next].next ≠ null ∧ vs0[vs0[ps0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[ps0[first].next].next].deqID.tid, vs0[vs0[ps0[first].next].next].val)) ∧ ( (first ' + rl2).last = ps0[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = ps0[first].next ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0)) ∧ nextnottid(tid, ps0[first].next, vs0) |
Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), 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), noid(tid, rl1 + first ' + qrl0, ps0[first].next, 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), vtail0 ∈ rl1 + first ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, lst ∈ qrl0, lst ∈ vs0, lst ∈ ps0, ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ first ∈ rl1, ¬ first ∈ qrl0, 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, (qrl0 ≠ [] → unmarkedp(qrl0.tail, 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 ⊦ ( vs0[ps0[first].next].next ≠ null ∧ vs0[vs0[ps0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[ps0[first].next].next].deqID.tid, vs0[vs0[ps0[first].next].next].val)) ∧ (first = ps0[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 ≠ [] ∧ rl1.last = ps0[first].next ∧ phead0 ≠ first ∧ unmarkedp(qrl0, vs0)) ∧ nextnottid(tid, ps0[first].next, vs0)
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 '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)
| Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), 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), noid(tid, rl1 + first ' + qrl0, ps0[first].next, 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), vtail0 ∈ rl1 + first ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, lst ∈ qrl0, lst ∈ vs0, lst ∈ ps0, ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ first ∈ rl1, ¬ first ∈ qrl0, 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, (qrl0 ≠ [] → unmarkedp(qrl0.tail, 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 ⊦ ( vs0[ps0[first].next].next ≠ null ∧ vs0[vs0[ps0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[ps0[first].next].next].deqID.tid, vs0[vs0[ps0[first].next].next].val)) ∧ (first = ps0[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 ≠ [] ∧ rl1.last = ps0[first].next ∧ phead0 ≠ first ∧ unmarkedp(qrl0, vs0)) ∧ nextnottid(tid, ps0[first].next, vs0) |
Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ 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] ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl0, phead, y
| Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = first0 + rl, rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), 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), noid(tid, (rl1 + first ' + rl2) + qrl0, ps0[first].next, 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[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), (first ' + rl2).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = first ∧ 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ ( vs0[ps0[first].next].next ≠ null ∧ vs0[vs0[ps0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[ps0[first].next].next].deqID.tid, vs0[vs0[ps0[first].next].next].val)) ∧ ( (first ' + rl2).last = ps0[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = ps0[first].next ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0)) ∧ nextnottid(tid, ps0[first].next, vs0) |
ps0[first].deqID = vs0[first].deqID, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs0[first].next, 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), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[first].next].deqID), some?(vs0[vs0[first].next].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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl, vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, (vs0[first].next ' + rl).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = first ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0) ⊦ ( vs0[vs0[first].next].next ≠ null ∧ vs0[vs0[vs0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs0[first].next].next].deqID.tid, vs0[vs0[vs0[first].next].next].val)) ∧ ( (vs0[first].next ' + rl).last = vs0[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = vs0[first].next ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0)) ∧ nextnottid(tid, vs0[first].next, vs0)
Used simplifier rules: ⊦ 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) ⊦ 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) ⊦ 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, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs0[first].next, 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), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[first].next].deqID), some?(vs0[vs0[first].next].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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl, vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, (vs0[first].next ' + rl).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = first ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0) ⊦ ( vs0[vs0[first].next].next ≠ null ∧ vs0[vs0[vs0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs0[first].next].next].deqID.tid, vs0[vs0[vs0[first].next].next].val)) ∧ ( (vs0[first].next ' + rl).last = vs0[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = vs0[first].next ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0)) ∧ nextnottid(tid, vs0[first].next, vs0) |
ps0[first].deqID = vs0[first].deqID, vs0[vs0[first].next].deqID = Some(tid0), ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs0[first].next, 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), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0[first].next, 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[vs0[first].next].deqID), some?(ps0[vs0[first].next].deqID), some?(vs0[first].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[first].next ' + rl).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = first ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0), lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl ⊦ ( vs0[vs0[first].next].next ≠ null ∧ vs0[vs0[vs0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs0[first].next].next].deqID.tid, vs0[vs0[vs0[first].next].next].val)) ∧ ( (vs0[first].next ' + rl).last = vs0[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = vs0[first].next ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0)) ∧ nextnottid(tid, vs0[first].next, vs0)
Used simplifier rules: ⊦ some?(opttid) → (tid = opttid.tid ↔ opttid = Some(tid)); (elim) Used terms: vs0[vs0[first].next].deqID, tid0
| ps0[first].deqID = vs0[first].deqID, vs0[vs0[first].next].deqID = Some(tid0), ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs0[first].next, 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), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0[first].next, 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[vs0[first].next].deqID), some?(ps0[vs0[first].next].deqID), some?(vs0[first].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[first].next ' + rl).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = first ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0), lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl ⊦ ( vs0[vs0[first].next].next ≠ null ∧ vs0[vs0[vs0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs0[first].next].next].deqID.tid, vs0[vs0[vs0[first].next].next].val)) ∧ ( (vs0[first].next ' + rl).last = vs0[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = vs0[first].next ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0)) ∧ nextnottid(tid, vs0[first].next, vs0) |
ps0[first].deqID = vs0[first].deqID, vs0[vs0[first].next].deqID = Some(tid0), ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), 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) + 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), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(ps0[vs0[first].next].deqID), some?(vs0[first].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), ¬ dups(rl + qrl0), ¬ dups(qrl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl0), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vs0[first].next ∈ qrl0, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ rl1, ¬ first ∈ qrl0, (vs0[first].next ' + rl).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = first ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0), lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl ⊦ ( vs0[vs0[first].next].next ≠ null ∧ vs0[vs0[vs0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs0[first].next].next].deqID.tid, vs0[vs0[vs0[first].next].next].val)) ∧ ( (vs0[first].next ' + rl).last = vs0[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = vs0[first].next ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0)) ∧ nextnottid(tid, vs0[first].next, vs0)
Used simplifier rules: ⊦ some?(Some(tid)); (s)
| ps0[first].deqID = vs0[first].deqID, vs0[vs0[first].next].deqID = Some(tid0), ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), 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) + 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), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(ps0[vs0[first].next].deqID), some?(vs0[first].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), ¬ dups(rl + qrl0), ¬ dups(qrl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl0), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vs0[first].next ∈ qrl0, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ rl1, ¬ first ∈ qrl0, (vs0[first].next ' + rl).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = first ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0), lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl ⊦ ( vs0[vs0[first].next].next ≠ null ∧ vs0[vs0[vs0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs0[first].next].next].deqID.tid, vs0[vs0[vs0[first].next].next].val)) ∧ ( (vs0[first].next ' + rl).last = vs0[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = vs0[first].next ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0)) ∧ nextnottid(tid, vs0[first].next, vs0) |
⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid)
vs0[vs0[first].next].deqID = Some(tid0), ps0[first].deqID = vs0[first].deqID, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[first].next ≠ null, first ≠ vs0[first].next, first ≠ null, first ≠ lst, 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), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[first].next].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), ¬ dups(rl + qrl0), ¬ dups(qrl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl0), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vs0[first].next ∈ qrl0, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ rl1, ¬ first ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl, vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, (vs0[first].next ' + rl).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = first ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0) ⊦ ( vs0[vs0[first].next].next ≠ null ∧ vs0[vs0[vs0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs0[first].next].next].deqID.tid, vs0[vs0[vs0[first].next].next].val)) ∧ ( (vs0[first].next ' + rl).last = vs0[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = vs0[first].next ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0)) ∧ (vs0[vs0[first].next].next ≠ null → vs0[vs0[vs0[first].next].next].deqID ≠ Some(tid))
Used terms: tid, vs0[first].next, vs0
| ⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid) |
| vs0[vs0[first].next].deqID = Some(tid0), ps0[first].deqID = vs0[first].deqID, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[first].next ≠ null, first ≠ vs0[first].next, first ≠ null, first ≠ lst, 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), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[first].next].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), ¬ dups(rl + qrl0), ¬ dups(qrl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl0), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vs0[first].next ∈ qrl0, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ rl1, ¬ first ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl, vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, (vs0[first].next ' + rl).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = first ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0) ⊦ ( vs0[vs0[first].next].next ≠ null ∧ vs0[vs0[vs0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs0[first].next].next].deqID.tid, vs0[vs0[vs0[first].next].next].val)) ∧ ( (vs0[first].next ' + rl).last = vs0[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = vs0[first].next ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0)) ∧ (vs0[vs0[first].next].next ≠ null → vs0[vs0[vs0[first].next].next].deqID ≠ Some(tid)) |
ps0[first].deqID = vs0[first].deqID, vs0[vs0[first].next].deqID = Some(tid0), (vs0[first].next ' + rl).last = first, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), 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) + 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), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(ps0[vs0[first].next].deqID), some?(vs0[first].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), ¬ dups(rl + qrl0), ¬ dups(qrl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl0), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vs0[first].next ∈ qrl0, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ rl1, ¬ first ∈ qrl0, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl ⊦ ( vs0[vs0[first].next].next ≠ null ∧ vs0[vs0[vs0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs0[first].next].next].deqID.tid, vs0[vs0[vs0[first].next].next].val)) ∧ ( (vs0[first].next ' + rl).last = vs0[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = vs0[first].next ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0)) ∧ (vs0[vs0[first].next].next ≠ null → vs0[vs0[vs0[first].next].next].deqID ≠ Some(tid))
ps0[first].deqID = vs0[first].deqID, vs0[vs0[first].next].deqID = Some(tid0), (first ' + (vs0[first].next ' + rl).butlast).last = first, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[first].next ≠ null, first ≠ vs0[first].next, first ≠ null, first ≠ lst, phead0 ≠ (vs0[first].next ' + rl).last, 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), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(ps0[vs0[first].next].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + (vs0[first].next ' + rl) + qrl0 from lst, ¬ dups(rl1 + rl), ¬ dups(rl + qrl0), ¬ dups(qrl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl0), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vs0[first].next ∈ qrl0, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ rl1, ¬ first ∈ qrl0, lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl ⊦ ( vs0[vs0[first].next].next ≠ null ∧ vs0[vs0[vs0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs0[first].next].next].deqID.tid, vs0[vs0[vs0[first].next].next].val)) ∧ ( (vs0[first].next ' + rl).last = vs0[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = vs0[first].next ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0)) ∧ (vs0[vs0[first].next].next ≠ null → vs0[vs0[vs0[first].next].next].deqID ≠ Some(tid))
| ps0[first].deqID = vs0[first].deqID, vs0[vs0[first].next].deqID = Some(tid0), (vs0[first].next ' + rl).last = first, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), 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) + 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), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(ps0[vs0[first].next].deqID), some?(vs0[first].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), ¬ dups(rl + qrl0), ¬ dups(qrl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl0), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vs0[first].next ∈ qrl0, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ rl1, ¬ first ∈ qrl0, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl ⊦ ( vs0[vs0[first].next].next ≠ null ∧ vs0[vs0[vs0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs0[first].next].next].deqID.tid, vs0[vs0[vs0[first].next].next].val)) ∧ ( (vs0[first].next ' + rl).last = vs0[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = vs0[first].next ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0)) ∧ (vs0[vs0[first].next].next ≠ null → vs0[vs0[vs0[first].next].next].deqID ≠ Some(tid)) |
ps0[first].deqID = vs0[first].deqID, vs0[vs0[first].next].deqID = Some(tid0), (vs0[first].next ' + rl).last = first, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs0[first].next, 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), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(ps0[vs0[first].next].deqID), some?(vs0[first].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, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl ⊦ ( vs0[vs0[first].next].next ≠ null ∧ vs0[vs0[vs0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs0[first].next].next].deqID.tid, vs0[vs0[vs0[first].next].next].val)) ∧ (first ' + (vs0[first].next ' + rl).butlast).last = vs0[first].next ∧ phead0 ≠ first ∧ unmarkedp(qrl0, vs0) ∧ (vs0[vs0[first].next].next ≠ null → vs0[vs0[vs0[first].next].next].deqID ≠ Some(tid))
| ps0[first].deqID = vs0[first].deqID, vs0[vs0[first].next].deqID = Some(tid0), (vs0[first].next ' + rl).last = first, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs0[first].next, 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), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(ps0[vs0[first].next].deqID), some?(vs0[first].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, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl ⊦ ( vs0[vs0[first].next].next ≠ null ∧ vs0[vs0[vs0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs0[first].next].next].deqID.tid, vs0[vs0[vs0[first].next].next].val)) ∧ (first ' + (vs0[first].next ' + rl).butlast).last = vs0[first].next ∧ phead0 ≠ first ∧ unmarkedp(qrl0, vs0) ∧ (vs0[vs0[first].next].next ≠ null → vs0[vs0[vs0[first].next].next].deqID ≠ Some(tid)) |
⊦ y ≠ [] → (x + y).last = y.last
Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: vs0[first].next ', rl
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps0[first].deqID = vs0[first].deqID, vs0[vs0[first].next].deqID = Some(tid0), (first ' + (vs0[first].next ' + rl).butlast).last = first, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[first].next ≠ null, first ≠ vs0[first].next, first ≠ null, first ≠ lst, phead0 ≠ (vs0[first].next ' + rl).last, 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), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(ps0[vs0[first].next].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + (vs0[first].next ' + rl) + qrl0 from lst, ¬ dups(rl1 + rl), ¬ dups(rl + qrl0), ¬ dups(qrl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl0), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vs0[first].next ∈ qrl0, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ rl1, ¬ first ∈ qrl0, lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl ⊦ ( vs0[vs0[first].next].next ≠ null ∧ vs0[vs0[vs0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs0[first].next].next].deqID.tid, vs0[vs0[vs0[first].next].next].val)) ∧ ( (vs0[first].next ' + rl).last = vs0[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = vs0[first].next ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0)) ∧ (vs0[vs0[first].next].next ≠ null → vs0[vs0[vs0[first].next].next].deqID ≠ Some(tid)) |
ps0[first].deqID = vs0[first].deqID, vs0[vs0[first].next].deqID = Some(tid0), (first ' + (vs0[first].next ' + rl).butlast).last = first, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs0[first].next, phead0 ≠ (vs0[first].next ' + rl).last, 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), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(ps0[vs0[first].next].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), 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, lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl ⊦ ( vs0[vs0[first].next].next ≠ null ∧ vs0[vs0[vs0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs0[first].next].next].deqID.tid, vs0[vs0[vs0[first].next].next].val)) ∧ (vs0[first].next ' + rl).last = vs0[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∧ (vs0[vs0[first].next].next ≠ null → vs0[vs0[vs0[first].next].next].deqID ≠ Some(tid))
| ps0[first].deqID = vs0[first].deqID, vs0[vs0[first].next].deqID = Some(tid0), (first ' + (vs0[first].next ' + rl).butlast).last = first, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs0[first].next, phead0 ≠ (vs0[first].next ' + rl).last, 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), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(ps0[vs0[first].next].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), 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, lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl ⊦ ( vs0[vs0[first].next].next ≠ null ∧ vs0[vs0[vs0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs0[first].next].next].deqID.tid, vs0[vs0[vs0[first].next].next].val)) ∧ (vs0[first].next ' + rl).last = vs0[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∧ (vs0[vs0[first].next].next ≠ null → vs0[vs0[vs0[first].next].next].deqID ≠ Some(tid)) |
⊦ y ≠ [] → (x + y).butlast = x + y.butlast
vs0[vs0[first].next].deqID = Some(tid0), ps0[first].deqID = vs0[first].deqID, (first ' + (vs0[first].next ' + rl).butlast).last = first, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rl = [], rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs0[first].next, phead0 ≠ (vs0[first].next ' + rl).last, 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), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[first].next].deqID), unmarkedp(qrl0, vs0), 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl, vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0 ⊦ ( vs0[vs0[first].next].next ≠ null ∧ vs0[vs0[vs0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs0[first].next].next].deqID.tid, vs0[vs0[vs0[first].next].next].val)) ∧ (vs0[first].next ' + rl).last = vs0[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∧ (vs0[vs0[first].next].next ≠ null → vs0[vs0[vs0[first].next].next].deqID ≠ Some(tid))
vs0[vs0[first].next].deqID = Some(tid0), ps0[first].deqID = vs0[first].deqID, (first ' + vs0[first].next ' + rl.butlast).last = first, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs0[first].next, phead0 ≠ (vs0[first].next ' + rl).last, rl ≠ [], 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), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[first].next].deqID), unmarkedp(qrl0, vs0), 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl, vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0 ⊦ ( vs0[vs0[first].next].next ≠ null ∧ vs0[vs0[vs0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs0[first].next].next].deqID.tid, vs0[vs0[vs0[first].next].next].val)) ∧ (vs0[first].next ' + rl).last = vs0[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∧ (vs0[vs0[first].next].next ≠ null → vs0[vs0[vs0[first].next].next].deqID ≠ Some(tid))
Used terms: vs0[first].next ', rl
| ⊦ y ≠ [] → (x + y).butlast = x + y.butlast |
| vs0[vs0[first].next].deqID = Some(tid0), ps0[first].deqID = vs0[first].deqID, (first ' + (vs0[first].next ' + rl).butlast).last = first, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rl = [], rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs0[first].next, phead0 ≠ (vs0[first].next ' + rl).last, 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), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[first].next].deqID), unmarkedp(qrl0, vs0), 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl, vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0 ⊦ ( vs0[vs0[first].next].next ≠ null ∧ vs0[vs0[vs0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs0[first].next].next].deqID.tid, vs0[vs0[vs0[first].next].next].val)) ∧ (vs0[first].next ' + rl).last = vs0[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∧ (vs0[vs0[first].next].next ≠ null → vs0[vs0[vs0[first].next].next].deqID ≠ Some(tid)) |
ps0[first].deqID = vs0[first].deqID, vs0[vs0[first].next].deqID = Some(tid0), ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs0[first].next, phead0 ≠ vs0[first].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs0[first].next ' + qrl0, vs0, ps0, owns0), listp(vs0[first].next ' + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl1, ps0), noid(tid, rl1 + first ' + vs0[first].next ' + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(ps0[vs0[first].next].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs0[first].next ' + qrl0 from lst, ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ weak?(vs0[first].deqID), ¬ first ∈ qrl0, ¬ vs0[first].next ∈ rl1, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ rl1, lst = vs0[first].next ∨ lst ∈ qrl0, vtail0 = (vs0[first].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ⊦ ( vs0[vs0[first].next].next ≠ null ∧ vs0[vs0[vs0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs0[first].next].next].deqID.tid, vs0[vs0[vs0[first].next].next].val)) ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∧ (vs0[vs0[first].next].next ≠ null → vs0[vs0[vs0[first].next].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 '.last = a; (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s) ⊦ a '.butlast = []; (s)
| ps0[first].deqID = vs0[first].deqID, vs0[vs0[first].next].deqID = Some(tid0), ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs0[first].next, phead0 ≠ vs0[first].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs0[first].next ' + qrl0, vs0, ps0, owns0), listp(vs0[first].next ' + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl1, ps0), noid(tid, rl1 + first ' + vs0[first].next ' + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(ps0[vs0[first].next].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs0[first].next ' + qrl0 from lst, ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ weak?(vs0[first].deqID), ¬ first ∈ qrl0, ¬ vs0[first].next ∈ rl1, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ rl1, lst = vs0[first].next ∨ lst ∈ qrl0, vtail0 = (vs0[first].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ⊦ ( vs0[vs0[first].next].next ≠ null ∧ vs0[vs0[vs0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs0[first].next].next].deqID.tid, vs0[vs0[vs0[first].next].next].val)) ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∧ (vs0[vs0[first].next].next ≠ null → vs0[vs0[vs0[first].next].next].deqID ≠ Some(tid)) |
vs0[vs0[first].next].deqID = Some(tid0), ps0[first].deqID = vs0[first].deqID, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), vs0[vs0[vs0[first].next].next].deqID ≠ None, ps0[vs0[first].next].deqID ≠ None, vs0[vs0[first].next].next ≠ null, vs0[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs0[first].next, phead0 ≠ vs0[first].next, rvowns0(vretRefs0(vs0[vs0[vs0[first].next].next].deqID.tid)) ≠ Claimed(vs0[vs0[vs0[first].next].next].deqID.tid, vs0[vs0[vs0[first].next].next].val), vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[first].next ' + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + vs0[first].next ' + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[first].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), vtail0 ∈ rl1 + first ' + vs0[first].next ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ weak?(vs0[first].deqID), ¬ first ∈ qrl0, ¬ vs0[first].next ∈ rl1, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ rl1, phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs0[first].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst = vs0[first].next ∨ lst ∈ qrl0 ⊦
vs0[vs0[first].next].deqID = Some(tid0), ps0[first].deqID = vs0[first].deqID, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs0[first].next, phead0 ≠ vs0[first].next, qrl0 ≠ [], vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[first].next ' + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + vs0[first].next ' + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[first].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), vtail0 ∈ rl1 + first ' + vs0[first].next ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ unmarkedp(qrl0.tail, vs0), ¬ weak?(vs0[first].deqID), ¬ first ∈ qrl0, ¬ vs0[first].next ∈ rl1, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ rl1, phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs0[first].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst = vs0[first].next ∨ lst ∈ qrl0 ⊦
vs0[vs0[vs0[first].next].next].deqID = Some(tid), vs0[vs0[first].next].deqID = Some(tid0), ps0[first].deqID = vs0[first].deqID, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[vs0[first].next].next ≠ null, vs0[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs0[first].next, phead0 ≠ vs0[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[first].next ' + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + vs0[first].next ' + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[first].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), vtail0 ∈ rl1 + first ' + vs0[first].next ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ weak?(vs0[first].deqID), ¬ first ∈ qrl0, ¬ vs0[first].next ∈ rl1, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ rl1, phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs0[first].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst = vs0[first].next ∨ lst ∈ qrl0 ⊦
| vs0[vs0[first].next].deqID = Some(tid0), ps0[first].deqID = vs0[first].deqID, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), vs0[vs0[vs0[first].next].next].deqID ≠ None, ps0[vs0[first].next].deqID ≠ None, vs0[vs0[first].next].next ≠ null, vs0[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs0[first].next, phead0 ≠ vs0[first].next, rvowns0(vretRefs0(vs0[vs0[vs0[first].next].next].deqID.tid)) ≠ Claimed(vs0[vs0[vs0[first].next].next].deqID.tid, vs0[vs0[vs0[first].next].next].val), vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[first].next ' + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + vs0[first].next ' + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[first].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), vtail0 ∈ rl1 + first ' + vs0[first].next ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ weak?(vs0[first].deqID), ¬ first ∈ qrl0, ¬ vs0[first].next ∈ rl1, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ rl1, phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs0[first].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst = vs0[first].next ∨ lst ∈ qrl0 ⊦ |
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(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a ' + x ≠ []; (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] ⊦ None ≠ Some(tid); (s) ⊦ some?(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] ⊦ 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) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ a ∈ []; (s)
| vs0[vs0[first].next].deqID = Some(tid0), ps0[first].deqID = vs0[first].deqID, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs0[first].next, phead0 ≠ vs0[first].next, qrl0 ≠ [], vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[first].next ' + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + vs0[first].next ' + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[first].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), vtail0 ∈ rl1 + first ' + vs0[first].next ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ unmarkedp(qrl0.tail, vs0), ¬ weak?(vs0[first].deqID), ¬ first ∈ qrl0, ¬ vs0[first].next ∈ rl1, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ rl1, phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs0[first].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst = vs0[first].next ∨ lst ∈ qrl0 ⊦ |
ps0[first].deqID = vs0[first].deqID, vs0[vs0[first].next].deqID = Some(tid0), ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs0[first].next, phead0 ≠ vs0[first].next, qrl0 ≠ [], vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs0[first].next ' + qrl0, vs0, ps0, owns0), listp(vs0[first].next ' + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl1, ps0), noid(tid, rl1 + first ' + vs0[first].next ' + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(ps0[vs0[first].next].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs0[first].next ' + qrl0 from lst, ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ unmarkedp(qrl0.tail, vs0), ¬ weak?(vs0[first].deqID), ¬ first ∈ qrl0, ¬ vs0[first].next ∈ rl1, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ rl1, lst = vs0[first].next ∨ lst ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first, vtail0 = qrl0.last ∨ vtail0 = (vs0[first].next ' + 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] ⊦ x ≠ [] → (a ' + x).last = x.last; (s)
| ps0[first].deqID = vs0[first].deqID, vs0[vs0[first].next].deqID = Some(tid0), ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs0[first].next, phead0 ≠ vs0[first].next, qrl0 ≠ [], vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs0[first].next ' + qrl0, vs0, ps0, owns0), listp(vs0[first].next ' + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl1, ps0), noid(tid, rl1 + first ' + vs0[first].next ' + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(ps0[vs0[first].next].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + vs0[first].next ' + qrl0 from lst, ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ unmarkedp(qrl0.tail, vs0), ¬ weak?(vs0[first].deqID), ¬ first ∈ qrl0, ¬ vs0[first].next ∈ rl1, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ rl1, lst = vs0[first].next ∨ lst ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first, vtail0 = qrl0.last ∨ vtail0 = (vs0[first].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ |
Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ a + x = a ' + x; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl0, head, tail
| vs0[vs0[vs0[first].next].next].deqID = Some(tid), vs0[vs0[first].next].deqID = Some(tid0), ps0[first].deqID = vs0[first].deqID, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[vs0[first].next].next ≠ null, vs0[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs0[first].next, phead0 ≠ vs0[first].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[first].next ' + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + vs0[first].next ' + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[first].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), vtail0 ∈ rl1 + first ' + vs0[first].next ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ weak?(vs0[first].deqID), ¬ first ∈ qrl0, ¬ vs0[first].next ∈ rl1, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ rl1, phead0 ∈ rl1 ∨ phead0 = first, vtail0 = (vs0[first].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst = vs0[first].next ∨ lst ∈ qrl0 ⊦ |
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(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a ' + x ≠ []; (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?(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] ⊦ None ≠ Some(tid); (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) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ a ∈ []; (s)
| vs0[vs0[first].next].deqID = Some(tid0), ps0[first].deqID = vs0[first].deqID, (first ' + vs0[first].next ' + rl.butlast).last = first, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs0[first].next, phead0 ≠ (vs0[first].next ' + rl).last, rl ≠ [], 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), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[first].next].deqID), unmarkedp(qrl0, vs0), 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl, vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0 ⊦ ( vs0[vs0[first].next].next ≠ null ∧ vs0[vs0[vs0[first].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vs0[first].next].next].deqID.tid)) = Claimed(vs0[vs0[vs0[first].next].next].deqID.tid, vs0[vs0[vs0[first].next].next].val)) ∧ (vs0[first].next ' + rl).last = vs0[first].next ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∧ (vs0[vs0[first].next].next ≠ null → vs0[vs0[vs0[first].next].next].deqID ≠ Some(tid)) |
vs0[vs0[first].next].deqID = Some(tid0), ps0[first].deqID = vs0[first].deqID, (vs0[first].next ' + rl.butlast).last = first, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, rl.last ≠ vs0[first].next, vs0[first].next ≠ null, first ≠ vs0[first].next, first ≠ null, first ≠ lst, phead0 ≠ rl.last, rl ≠ [], 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), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[first].next].deqID), unmarkedp(qrl0, vs0), 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), ¬ dups(rl + qrl0), ¬ dups(qrl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl0), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vs0[first].next ∈ qrl0, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ rl1, ¬ first ∈ qrl0, vtail0 = (rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl, lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0 ⊦
Used simplifier rules: ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s)
| vs0[vs0[first].next].deqID = Some(tid0), ps0[first].deqID = vs0[first].deqID, (vs0[first].next ' + rl.butlast).last = first, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, rl.last ≠ vs0[first].next, vs0[first].next ≠ null, first ≠ vs0[first].next, first ≠ null, first ≠ lst, phead0 ≠ rl.last, rl ≠ [], 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), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[first].next].deqID), unmarkedp(qrl0, vs0), 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), ¬ dups(rl + qrl0), ¬ dups(qrl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl0), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vs0[first].next ∈ qrl0, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ rl1, ¬ first ∈ qrl0, vtail0 = (rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl, lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0 ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
ps0[first].deqID = vs0[first].deqID, vs0[vs0[first].next].deqID = Some(tid0), rl.butlast.last = first, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), rl.butlast ≠ [], ps0[vs0[first].next].deqID ≠ None, rl.last ≠ vs0[first].next, vs0[first].next ≠ null, first ≠ vs0[first].next, first ≠ null, first ≠ lst, phead0 ≠ rl.last, rl ≠ [], 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), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(ps0[vs0[first].next].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + (vs0[first].next ' + rl) + qrl0 from lst, ¬ dups(rl1 + rl), ¬ dups(rl + qrl0), ¬ dups(qrl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl0), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vs0[first].next ∈ qrl0, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ rl1, ¬ first ∈ qrl0, lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl, vtail0 = (rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦
Used simplifier rules: ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: vs0[first].next ', rl.butlast
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps0[first].deqID = vs0[first].deqID, vs0[vs0[first].next].deqID = Some(tid0), rl.butlast.last = first, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, Val(vs0[vs0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[vs0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[first].next].val), rl.butlast ≠ [], ps0[vs0[first].next].deqID ≠ None, rl.last ≠ vs0[first].next, vs0[first].next ≠ null, first ≠ vs0[first].next, first ≠ null, first ≠ lst, phead0 ≠ rl.last, rl ≠ [], 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), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0[first].next, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(ps0[vs0[first].next].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + (vs0[first].next ' + rl) + qrl0 from lst, ¬ dups(rl1 + rl), ¬ dups(rl + qrl0), ¬ dups(qrl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl0), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vs0[first].next ∈ qrl0, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ rl1, ¬ first ∈ qrl0, lst = vs0[first].next ∨ lst ∈ rl ∨ lst ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl, vtail0 = (rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ |
vs0[vs0[rl.butlast.last].next].deqID = Some(tid0), ps0[rl.butlast.last].deqID = vs0[rl.butlast.last].deqID, ps0[rl.butlast.last].next = vs0[rl.butlast.last].next, ps0[rl.butlast.last].val = vs0[rl.butlast.last].val, Val(vs0[vs0[rl.butlast.last].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[vs0[rl.butlast.last].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(rl.butlast.last) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[rl.butlast.last].next].val), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[rl.butlast.last].next].val), ps0[vs0[rl.butlast.last].next].deqID ≠ None, rl.last ≠ vs0[rl.butlast.last].next, rl.butlast.last ≠ vs0[rl.butlast.last].next, rl.butlast.last ≠ null, rl.butlast.last ≠ lst, vs0[rl.butlast.last].next ≠ null, phead0 ≠ rl.last, rl ≠ [], rl ≠ rl.head ', vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[rl.butlast.last].next ' + rl + qrl0, vs0, ps0, owns0), listp(rl1 + rl.butlast.last ' + (vs0[rl.butlast.last].next ' + rl) + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl, ps0), markedp(rl1, vs0), markedp(rl, vs0), noid(tid, rl1 + rl.butlast.last ' + (vs0[rl.butlast.last].next ' + rl) + qrl0, vs0[rl.butlast.last].next, vs0), nonullRetRefs(rl1 + rl.butlast.last ' + (vs0[rl.butlast.last].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[rl.butlast.last].deqID), some?(ps0[vs0[rl.butlast.last].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), vtail0 ∈ rl1 + rl.butlast.last ' + (vs0[rl.butlast.last].next ' + rl) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, rl.butlast.last ∈ vs0, rl.butlast.last ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl + qrl0), ¬ dups(qrl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl0), ¬ weak?(vs0[rl.butlast.last].deqID), ¬ rl.butlast.last ∈ rl, ¬ rl.butlast.last ∈ rl1, ¬ vs0[rl.butlast.last].next ∈ qrl0, ¬ vs0[rl.butlast.last].next ∈ rl, ¬ vs0[rl.butlast.last].next ∈ rl1, ¬ rl.butlast.last ∈ qrl0, vtail0 = (rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = rl.butlast.last ∨ phead0 = vs0[rl.butlast.last].next ∨ phead0 ∈ rl, lst = vs0[rl.butlast.last].next ∨ lst ∈ rl ∨ lst ∈ qrl0 ⊦
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 ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss)
| vs0[vs0[rl.butlast.last].next].deqID = Some(tid0), ps0[rl.butlast.last].deqID = vs0[rl.butlast.last].deqID, ps0[rl.butlast.last].next = vs0[rl.butlast.last].next, ps0[rl.butlast.last].val = vs0[rl.butlast.last].val, Val(vs0[vs0[rl.butlast.last].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[vs0[rl.butlast.last].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(rl.butlast.last) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[rl.butlast.last].next].val), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[rl.butlast.last].next].val), ps0[vs0[rl.butlast.last].next].deqID ≠ None, rl.last ≠ vs0[rl.butlast.last].next, rl.butlast.last ≠ vs0[rl.butlast.last].next, rl.butlast.last ≠ null, rl.butlast.last ≠ lst, vs0[rl.butlast.last].next ≠ null, phead0 ≠ rl.last, rl ≠ [], rl ≠ rl.head ', vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[rl.butlast.last].next ' + rl + qrl0, vs0, ps0, owns0), listp(rl1 + rl.butlast.last ' + (vs0[rl.butlast.last].next ' + rl) + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl, ps0), markedp(rl1, vs0), markedp(rl, vs0), noid(tid, rl1 + rl.butlast.last ' + (vs0[rl.butlast.last].next ' + rl) + qrl0, vs0[rl.butlast.last].next, vs0), nonullRetRefs(rl1 + rl.butlast.last ' + (vs0[rl.butlast.last].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[rl.butlast.last].deqID), some?(ps0[vs0[rl.butlast.last].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), vtail0 ∈ rl1 + rl.butlast.last ' + (vs0[rl.butlast.last].next ' + rl) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, rl.butlast.last ∈ vs0, rl.butlast.last ∈ ps0, ¬ dups(rl1 + rl), ¬ dups(rl + qrl0), ¬ dups(qrl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl0), ¬ weak?(vs0[rl.butlast.last].deqID), ¬ rl.butlast.last ∈ rl, ¬ rl.butlast.last ∈ rl1, ¬ vs0[rl.butlast.last].next ∈ qrl0, ¬ vs0[rl.butlast.last].next ∈ rl, ¬ vs0[rl.butlast.last].next ∈ rl1, ¬ rl.butlast.last ∈ qrl0, vtail0 = (rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = rl.butlast.last ∨ phead0 = vs0[rl.butlast.last].next ∨ phead0 ∈ rl, lst = vs0[rl.butlast.last].next ∨ lst ∈ rl ∨ lst ∈ qrl0 ⊦ |
ps0[rl.butlast.last].deqID = vs0[rl.butlast.last].deqID, vs0[vs0[rl.butlast.last].next].deqID = Some(tid0), ps0[rl.butlast.last].next = vs0[rl.butlast.last].next, ps0[rl.butlast.last].val = vs0[rl.butlast.last].val, Val(vs0[vs0[rl.butlast.last].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[vs0[rl.butlast.last].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(rl.butlast.last) = None, pretRefs0(tid) = vretRefs0(tid), rl = vtail + qrl, rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[rl.butlast.last].next].val), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[rl.butlast.last].next].val), ps0[vs0[rl.butlast.last].next].deqID ≠ None, rl.last ≠ vs0[rl.butlast.last].next, rl.butlast.last ≠ vs0[rl.butlast.last].next, rl.butlast.last ≠ null, rl.butlast.last ≠ lst, vs0[rl.butlast.last].next ≠ null, phead0 ≠ rl.last, rl ≠ [], rl ≠ vtail ', vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + rl.butlast.last ' + (vs0[rl.butlast.last].next ' + rl) + qrl0, vs0, ps0, owns0), listp(vs0[rl.butlast.last].next ' + rl + qrl0, vs0, ps0, owns0), markedp(rl, vs0), markedp(rl1, vs0), markedp(rl, ps0), markedp(rl1, ps0), noid(tid, rl1 + rl.butlast.last ' + (vs0[rl.butlast.last].next ' + rl) + qrl0, vs0[rl.butlast.last].next, vs0), nonullRetRefs(rl1 + rl.butlast.last ' + (vs0[rl.butlast.last].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(ps0[vs0[rl.butlast.last].next].deqID), some?(vs0[rl.butlast.last].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), rl.butlast.last ∈ ps0, rl.butlast.last ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + rl.butlast.last ' + (vs0[rl.butlast.last].next ' + rl) + qrl0 from lst, ¬ dups(rl1 + rl), ¬ dups(rl + qrl0), ¬ dups(qrl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl0), ¬ weak?(vs0[rl.butlast.last].deqID), ¬ rl.butlast.last ∈ rl, ¬ rl.butlast.last ∈ rl1, ¬ vs0[rl.butlast.last].next ∈ qrl0, ¬ vs0[rl.butlast.last].next ∈ rl, ¬ vs0[rl.butlast.last].next ∈ rl1, ¬ rl.butlast.last ∈ qrl0, lst = vs0[rl.butlast.last].next ∨ lst ∈ rl ∨ lst ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = rl.butlast.last ∨ phead0 = vs0[rl.butlast.last].next ∨ phead0 ∈ rl, vtail0 = (rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: rl, head, tail
| ps0[rl.butlast.last].deqID = vs0[rl.butlast.last].deqID, vs0[vs0[rl.butlast.last].next].deqID = Some(tid0), ps0[rl.butlast.last].next = vs0[rl.butlast.last].next, ps0[rl.butlast.last].val = vs0[rl.butlast.last].val, Val(vs0[vs0[rl.butlast.last].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[vs0[rl.butlast.last].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(rl.butlast.last) = None, pretRefs0(tid) = vretRefs0(tid), rl = vtail + qrl, rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[rl.butlast.last].next].val), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[rl.butlast.last].next].val), ps0[vs0[rl.butlast.last].next].deqID ≠ None, rl.last ≠ vs0[rl.butlast.last].next, rl.butlast.last ≠ vs0[rl.butlast.last].next, rl.butlast.last ≠ null, rl.butlast.last ≠ lst, vs0[rl.butlast.last].next ≠ null, phead0 ≠ rl.last, rl ≠ [], rl ≠ vtail ', vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + rl.butlast.last ' + (vs0[rl.butlast.last].next ' + rl) + qrl0, vs0, ps0, owns0), listp(vs0[rl.butlast.last].next ' + rl + qrl0, vs0, ps0, owns0), markedp(rl, vs0), markedp(rl1, vs0), markedp(rl, ps0), markedp(rl1, ps0), noid(tid, rl1 + rl.butlast.last ' + (vs0[rl.butlast.last].next ' + rl) + qrl0, vs0[rl.butlast.last].next, vs0), nonullRetRefs(rl1 + rl.butlast.last ' + (vs0[rl.butlast.last].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(ps0[vs0[rl.butlast.last].next].deqID), some?(vs0[rl.butlast.last].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), rl.butlast.last ∈ ps0, rl.butlast.last ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + rl.butlast.last ' + (vs0[rl.butlast.last].next ' + rl) + qrl0 from lst, ¬ dups(rl1 + rl), ¬ dups(rl + qrl0), ¬ dups(qrl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl0), ¬ weak?(vs0[rl.butlast.last].deqID), ¬ rl.butlast.last ∈ rl, ¬ rl.butlast.last ∈ rl1, ¬ vs0[rl.butlast.last].next ∈ qrl0, ¬ vs0[rl.butlast.last].next ∈ rl, ¬ vs0[rl.butlast.last].next ∈ rl1, ¬ rl.butlast.last ∈ qrl0, lst = vs0[rl.butlast.last].next ∨ lst ∈ rl ∨ lst ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = rl.butlast.last ∨ phead0 = vs0[rl.butlast.last].next ∨ phead0 ∈ rl, vtail0 = (rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ |
ps0[vs0[(vtail ' + qrl.butlast).last].next].deqID = Some(tid0), ps0[(vtail ' + qrl.butlast).last].deqID = vs0[(vtail ' + qrl.butlast).last].deqID, vs0[vs0[(vtail ' + qrl.butlast).last].next].deqID = Some(tid0), ps0[vs0[(vtail ' + qrl.butlast).last].next].next = vtail, ps0[(vtail ' + qrl.butlast).last].next = vs0[(vtail ' + qrl.butlast).last].next, ps0[vs0[(vtail ' + qrl.butlast).last].next].val = vs0[vs0[(vtail ' + qrl.butlast).last].next].val, ps0[(vtail ' + qrl.butlast).last].val = vs0[(vtail ' + qrl.butlast).last].val, Val(vs0[vs0[(vtail ' + qrl.butlast).last].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[vs0[(vtail ' + qrl.butlast).last].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(vs0[(vtail ' + qrl.butlast).last].next) = None, owns0((vtail ' + qrl.butlast).last) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[(vtail ' + qrl.butlast).last].next].val), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[(vtail ' + qrl.butlast).last].next].val), vtail = vs0[vs0[(vtail ' + qrl.butlast).last].next].next, (vtail ' + qrl.butlast).last ≠ vtail, (vtail ' + qrl.butlast).last ≠ lst, (vtail ' + qrl.butlast).last ≠ null, (vtail ' + qrl.butlast).last ≠ vs0[(vtail ' + qrl.butlast).last].next, qrl.last ≠ vs0[(vtail ' + qrl.butlast).last].next, vs0[(vtail ' + qrl.butlast).last].next ≠ vtail, vs0[(vtail ' + qrl.butlast).last].next ≠ null, phead0 ≠ qrl.last, qrl ≠ [], vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + (vtail ' + qrl.butlast).last ' + vs0[(vtail ' + qrl.butlast).last].next ' + (vtail ' + qrl) + qrl0, vs0, ps0, owns0), listp(vtail ' + qrl + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(rl1, vs0), markedp(qrl, ps0), markedp(rl1, ps0), noid (tid, rl1 + (vtail ' + qrl.butlast).last ' + vs0[(vtail ' + qrl.butlast).last].next ' + (vtail ' + qrl) + qrl0, vs0[(vtail ' + qrl.butlast).last].next, vs0), nonullRetRefs(rl1 + (vtail ' + qrl.butlast).last ' + vs0[(vtail ' + qrl.butlast).last].next ' + (vtail ' + qrl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[vtail].deqID), some?(ps0[vtail].deqID), some?(vs0[(vtail ' + qrl.butlast).last].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), vs0[(vtail ' + qrl.butlast).last].next ∈ ps0, vs0[(vtail ' + qrl.butlast).last].next ∈ vs0, (vtail ' + qrl.butlast).last ∈ ps0, (vtail ' + qrl.butlast).last ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + (vtail ' + qrl.butlast).last ' + vs0[(vtail ' + qrl.butlast).last].next ' + (vtail ' + qrl) + qrl0 from lst, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl1 + qrl), ¬ dups(qrl + qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl + qrl0), ¬ weak?(vs0[(vtail ' + qrl.butlast).last].deqID), ¬ (vtail ' + qrl.butlast).last ∈ qrl0, ¬ vs0[(vtail ' + qrl.butlast).last].next ∈ rl1, ¬ vs0[(vtail ' + qrl.butlast).last].next ∈ qrl, ¬ vs0[(vtail ' + qrl.butlast).last].next ∈ qrl0, ¬ (vtail ' + qrl.butlast).last ∈ rl1, ¬ (vtail ' + qrl.butlast).last ∈ qrl, ¬ vtail ∈ qrl0, ¬ vtail ∈ qrl, ¬ vtail ∈ rl1, lst = vs0[(vtail ' + qrl.butlast).last].next ∨ lst = vtail ∨ lst ∈ qrl ∨ lst ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = (vtail ' + qrl.butlast).last ∨ phead0 = vs0[(vtail ' + qrl.butlast).last].next ∨ phead0 = vtail ∨ phead0 ∈ qrl, vtail0 = (qrl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (qrl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦
Used simplifier rules: ⊦ ¬ weak?(Some(tid)); (s) ⊦ some?(Some(tid)); (s) ⊦ 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] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(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) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ a ' + x ≠ []; (s)
| ps0[vs0[(vtail ' + qrl.butlast).last].next].deqID = Some(tid0), ps0[(vtail ' + qrl.butlast).last].deqID = vs0[(vtail ' + qrl.butlast).last].deqID, vs0[vs0[(vtail ' + qrl.butlast).last].next].deqID = Some(tid0), ps0[vs0[(vtail ' + qrl.butlast).last].next].next = vtail, ps0[(vtail ' + qrl.butlast).last].next = vs0[(vtail ' + qrl.butlast).last].next, ps0[vs0[(vtail ' + qrl.butlast).last].next].val = vs0[vs0[(vtail ' + qrl.butlast).last].next].val, ps0[(vtail ' + qrl.butlast).last].val = vs0[(vtail ' + qrl.butlast).last].val, Val(vs0[vs0[(vtail ' + qrl.butlast).last].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[vs0[(vtail ' + qrl.butlast).last].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(vs0[(vtail ' + qrl.butlast).last].next) = None, owns0((vtail ' + qrl.butlast).last) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[(vtail ' + qrl.butlast).last].next].val), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[(vtail ' + qrl.butlast).last].next].val), vtail = vs0[vs0[(vtail ' + qrl.butlast).last].next].next, (vtail ' + qrl.butlast).last ≠ vtail, (vtail ' + qrl.butlast).last ≠ lst, (vtail ' + qrl.butlast).last ≠ null, (vtail ' + qrl.butlast).last ≠ vs0[(vtail ' + qrl.butlast).last].next, qrl.last ≠ vs0[(vtail ' + qrl.butlast).last].next, vs0[(vtail ' + qrl.butlast).last].next ≠ vtail, vs0[(vtail ' + qrl.butlast).last].next ≠ null, phead0 ≠ qrl.last, qrl ≠ [], vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + (vtail ' + qrl.butlast).last ' + vs0[(vtail ' + qrl.butlast).last].next ' + (vtail ' + qrl) + qrl0, vs0, ps0, owns0), listp(vtail ' + qrl + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(rl1, vs0), markedp(qrl, ps0), markedp(rl1, ps0), noid (tid, rl1 + (vtail ' + qrl.butlast).last ' + vs0[(vtail ' + qrl.butlast).last].next ' + (vtail ' + qrl) + qrl0, vs0[(vtail ' + qrl.butlast).last].next, vs0), nonullRetRefs(rl1 + (vtail ' + qrl.butlast).last ' + vs0[(vtail ' + qrl.butlast).last].next ' + (vtail ' + qrl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[vtail].deqID), some?(ps0[vtail].deqID), some?(vs0[(vtail ' + qrl.butlast).last].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), vs0[(vtail ' + qrl.butlast).last].next ∈ ps0, vs0[(vtail ' + qrl.butlast).last].next ∈ vs0, (vtail ' + qrl.butlast).last ∈ ps0, (vtail ' + qrl.butlast).last ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + (vtail ' + qrl.butlast).last ' + vs0[(vtail ' + qrl.butlast).last].next ' + (vtail ' + qrl) + qrl0 from lst, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl1 + qrl), ¬ dups(qrl + qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl + qrl0), ¬ weak?(vs0[(vtail ' + qrl.butlast).last].deqID), ¬ (vtail ' + qrl.butlast).last ∈ qrl0, ¬ vs0[(vtail ' + qrl.butlast).last].next ∈ rl1, ¬ vs0[(vtail ' + qrl.butlast).last].next ∈ qrl, ¬ vs0[(vtail ' + qrl.butlast).last].next ∈ qrl0, ¬ (vtail ' + qrl.butlast).last ∈ rl1, ¬ (vtail ' + qrl.butlast).last ∈ qrl, ¬ vtail ∈ qrl0, ¬ vtail ∈ qrl, ¬ vtail ∈ rl1, lst = vs0[(vtail ' + qrl.butlast).last].next ∨ lst = vtail ∨ lst ∈ qrl ∨ lst ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = (vtail ' + qrl.butlast).last ∨ phead0 = vs0[(vtail ' + qrl.butlast).last].next ∨ phead0 = vtail ∨ phead0 ∈ qrl, vtail0 = (qrl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (qrl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ |
vs0[vs0[(vtail ' + rl).last].next].deqID = Some(tid0), ps0[(vtail ' + rl).last].deqID = vs0[(vtail ' + rl).last].deqID, ps0[vs0[(vtail ' + rl).last].next].deqID = Some(tid0), ps0[(vtail ' + rl).last].next = vs0[(vtail ' + rl).last].next, ps0[vs0[(vtail ' + rl).last].next].next = vtail, ps0[(vtail ' + rl).last].val = vs0[(vtail ' + rl).last].val, ps0[vs0[(vtail ' + rl).last].next].val = vs0[vs0[(vtail ' + rl).last].next].val, Val(vs0[vs0[(vtail ' + rl).last].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[vs0[(vtail ' + rl).last].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0((vtail ' + rl).last) = None, owns0(vs0[(vtail ' + rl).last].next) = None, pretRefs0(tid) = vretRefs0(tid), qrl = rl + phead ', rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[(vtail ' + rl).last].next].val), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[(vtail ' + rl).last].next].val), vtail = vs0[vs0[(vtail ' + rl).last].next].next, (vtail ' + rl).last ≠ vtail, (vtail ' + rl).last ≠ lst, (vtail ' + rl).last ≠ null, (vtail ' + rl).last ≠ vs0[(vtail ' + rl).last].next, vs0[(vtail ' + rl).last].next ≠ vtail, vs0[(vtail ' + rl).last].next ≠ null, phead ≠ vs0[(vtail ' + rl).last].next, phead0 ≠ phead, qrl ≠ [], vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vtail ' + qrl + qrl0, vs0, ps0, owns0), listp(rl1 + (vtail ' + rl).last ' + vs0[(vtail ' + rl).last].next ' + (vtail ' + qrl) + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(qrl, ps0), markedp(rl1, vs0), markedp(qrl, vs0), noid(tid, rl1 + (vtail ' + rl).last ' + vs0[(vtail ' + rl).last].next ' + (vtail ' + qrl) + qrl0, vs0[(vtail ' + rl).last].next, vs0), nonullRetRefs(rl1 + (vtail ' + rl).last ' + vs0[(vtail ' + rl).last].next ' + (vtail ' + qrl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[(vtail ' + rl).last].deqID), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), vtail0 ∈ rl1 + (vtail ' + rl).last ' + vs0[(vtail ' + rl).last].next ' + (vtail ' + qrl) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, (vtail ' + rl).last ∈ vs0, (vtail ' + rl).last ∈ ps0, vs0[(vtail ' + rl).last].next ∈ vs0, vs0[(vtail ' + rl).last].next ∈ ps0, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl1 + qrl), ¬ dups(qrl + qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl + qrl0), ¬ weak?(vs0[(vtail ' + rl).last].deqID), ¬ (vtail ' + rl).last ∈ qrl0, ¬ vs0[(vtail ' + rl).last].next ∈ rl1, ¬ vs0[(vtail ' + rl).last].next ∈ qrl, ¬ vs0[(vtail ' + rl).last].next ∈ qrl0, ¬ (vtail ' + rl).last ∈ rl1, ¬ (vtail ' + rl).last ∈ qrl, ¬ vtail ∈ qrl0, ¬ vtail ∈ qrl, ¬ vtail ∈ rl1, vtail0 = (qrl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (qrl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = (vtail ' + rl).last ∨ phead0 = vs0[(vtail ' + rl).last].next ∨ phead0 = vtail ∨ phead0 ∈ qrl, lst = vs0[(vtail ' + rl).last].next ∨ lst = vtail ∨ lst ∈ qrl ∨ lst ∈ qrl0 ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl, phead, y
| vs0[vs0[(vtail ' + rl).last].next].deqID = Some(tid0), ps0[(vtail ' + rl).last].deqID = vs0[(vtail ' + rl).last].deqID, ps0[vs0[(vtail ' + rl).last].next].deqID = Some(tid0), ps0[(vtail ' + rl).last].next = vs0[(vtail ' + rl).last].next, ps0[vs0[(vtail ' + rl).last].next].next = vtail, ps0[(vtail ' + rl).last].val = vs0[(vtail ' + rl).last].val, ps0[vs0[(vtail ' + rl).last].next].val = vs0[vs0[(vtail ' + rl).last].next].val, Val(vs0[vs0[(vtail ' + rl).last].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[vs0[(vtail ' + rl).last].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0((vtail ' + rl).last) = None, owns0(vs0[(vtail ' + rl).last].next) = None, pretRefs0(tid) = vretRefs0(tid), qrl = rl + phead ', rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[(vtail ' + rl).last].next].val), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[(vtail ' + rl).last].next].val), vtail = vs0[vs0[(vtail ' + rl).last].next].next, (vtail ' + rl).last ≠ vtail, (vtail ' + rl).last ≠ lst, (vtail ' + rl).last ≠ null, (vtail ' + rl).last ≠ vs0[(vtail ' + rl).last].next, vs0[(vtail ' + rl).last].next ≠ vtail, vs0[(vtail ' + rl).last].next ≠ null, phead ≠ vs0[(vtail ' + rl).last].next, phead0 ≠ phead, qrl ≠ [], vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vtail ' + qrl + qrl0, vs0, ps0, owns0), listp(rl1 + (vtail ' + rl).last ' + vs0[(vtail ' + rl).last].next ' + (vtail ' + qrl) + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(qrl, ps0), markedp(rl1, vs0), markedp(qrl, vs0), noid(tid, rl1 + (vtail ' + rl).last ' + vs0[(vtail ' + rl).last].next ' + (vtail ' + qrl) + qrl0, vs0[(vtail ' + rl).last].next, vs0), nonullRetRefs(rl1 + (vtail ' + rl).last ' + vs0[(vtail ' + rl).last].next ' + (vtail ' + qrl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[(vtail ' + rl).last].deqID), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), vtail0 ∈ rl1 + (vtail ' + rl).last ' + vs0[(vtail ' + rl).last].next ' + (vtail ' + qrl) + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, (vtail ' + rl).last ∈ vs0, (vtail ' + rl).last ∈ ps0, vs0[(vtail ' + rl).last].next ∈ vs0, vs0[(vtail ' + rl).last].next ∈ ps0, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl1 + qrl), ¬ dups(qrl + qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl + qrl0), ¬ weak?(vs0[(vtail ' + rl).last].deqID), ¬ (vtail ' + rl).last ∈ qrl0, ¬ vs0[(vtail ' + rl).last].next ∈ rl1, ¬ vs0[(vtail ' + rl).last].next ∈ qrl, ¬ vs0[(vtail ' + rl).last].next ∈ qrl0, ¬ (vtail ' + rl).last ∈ rl1, ¬ (vtail ' + rl).last ∈ qrl, ¬ vtail ∈ qrl0, ¬ vtail ∈ qrl, ¬ vtail ∈ rl1, vtail0 = (qrl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (qrl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = (vtail ' + rl).last ∨ phead0 = vs0[(vtail ' + rl).last].next ∨ phead0 = vtail ∨ phead0 ∈ qrl, lst = vs0[(vtail ' + rl).last].next ∨ lst = vtail ∨ lst ∈ qrl ∨ lst ∈ qrl0 ⊦ |
ps0[vs0[(vtail ' + rl).last].next].deqID = Some(tid0), ps0[(vtail ' + rl).last].deqID = vs0[(vtail ' + rl).last].deqID, vs0[vs0[(vtail ' + rl).last].next].deqID = Some(tid0), ps0[vs0[(vtail ' + rl).last].next].next = vtail, ps0[(vtail ' + rl).last].next = vs0[(vtail ' + rl).last].next, ps0[vs0[(vtail ' + rl).last].next].val = vs0[vs0[(vtail ' + rl).last].next].val, ps0[(vtail ' + rl).last].val = vs0[(vtail ' + rl).last].val, Val(vs0[vs0[(vtail ' + rl).last].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[vs0[(vtail ' + rl).last].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(vs0[(vtail ' + rl).last].next) = None, owns0((vtail ' + rl).last) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[(vtail ' + rl).last].next].val), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[(vtail ' + rl).last].next].val), vtail = vs0[vs0[(vtail ' + rl).last].next].next, (vtail ' + rl).last ≠ vtail, (vtail ' + rl).last ≠ lst, (vtail ' + rl).last ≠ null, (vtail ' + rl).last ≠ vs0[(vtail ' + rl).last].next, (vtail ' + rl).last ≠ phead, vs0[(vtail ' + rl).last].next ≠ vtail, vs0[(vtail ' + rl).last].next ≠ null, phead ≠ vs0[(vtail ' + rl).last].next, phead0 ≠ phead, vretRefs0(tid) ≠ null, vtail ≠ phead, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + (vtail ' + rl).last ' + vs0[(vtail ' + rl).last].next ' + (vtail ' + rl + phead ') + qrl0, vs0, ps0, owns0), listp(vtail ' + (rl + phead ') + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl, vs0), markedp(rl1, vs0), markedp(rl, ps0), noid(tid, rl1 + (vtail ' + rl).last ' + vs0[(vtail ' + rl).last].next ' + (vtail ' + rl + phead ') + qrl0, vs0[(vtail ' + rl).last].next, vs0), nonullRetRefs(rl1 + (vtail ' + rl).last ' + vs0[(vtail ' + rl).last].next ' + (vtail ' + rl + phead ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[vtail].deqID), some?(ps0[vtail].deqID), some?(vs0[(vtail ' + rl).last].deqID), some?(vs0[phead].deqID), some?(ps0[phead].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), vs0[(vtail ' + rl).last].next ∈ ps0, vs0[(vtail ' + rl).last].next ∈ vs0, (vtail ' + rl).last ∈ ps0, (vtail ' + rl).last ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + (vtail ' + rl).last ' + vs0[(vtail ' + rl).last].next ' + (vtail ' + rl + phead ') + qrl0 from lst, ¬ dups((rl1 + rl) + qrl0), ¬ dups(rl1), ¬ dups(rl + qrl0), ¬ dups(rl1 + rl), ¬ dups(qrl0), ¬ dups(rl), ¬ weak?(vs0[(vtail ' + rl).last].deqID), ¬ vtail ∈ rl1, ¬ phead ∈ rl, ¬ phead ∈ rl1, ¬ phead ∈ qrl0, ¬ (vtail ' + rl).last ∈ qrl0, ¬ vs0[(vtail ' + rl).last].next ∈ rl1, ¬ vs0[(vtail ' + rl).last].next ∈ rl, ¬ vs0[(vtail ' + rl).last].next ∈ qrl0, ¬ (vtail ' + rl).last ∈ rl1, ¬ (vtail ' + rl).last ∈ rl, ¬ vtail ∈ qrl0, ¬ vtail ∈ rl, phead0 ∈ rl1 ∨ phead0 = (vtail ' + rl).last ∨ phead0 = vs0[(vtail ' + rl).last].next ∨ phead0 = vtail ∨ phead0 ∈ rl, vtail0 = (phead ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (phead ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst = vs0[(vtail ' + rl).last].next ∨ lst = vtail ∨ lst ∈ rl ∨ lst = phead ∨ lst ∈ qrl0 ⊦
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] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| ps0[vs0[(vtail ' + rl).last].next].deqID = Some(tid0), ps0[(vtail ' + rl).last].deqID = vs0[(vtail ' + rl).last].deqID, vs0[vs0[(vtail ' + rl).last].next].deqID = Some(tid0), ps0[vs0[(vtail ' + rl).last].next].next = vtail, ps0[(vtail ' + rl).last].next = vs0[(vtail ' + rl).last].next, ps0[vs0[(vtail ' + rl).last].next].val = vs0[vs0[(vtail ' + rl).last].next].val, ps0[(vtail ' + rl).last].val = vs0[(vtail ' + rl).last].val, Val(vs0[vs0[(vtail ' + rl).last].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[vs0[(vtail ' + rl).last].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, owns0(vs0[(vtail ' + rl).last].next) = None, owns0((vtail ' + rl).last) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs0[(vtail ' + rl).last].next].val), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[vs0[(vtail ' + rl).last].next].val), vtail = vs0[vs0[(vtail ' + rl).last].next].next, (vtail ' + rl).last ≠ vtail, (vtail ' + rl).last ≠ lst, (vtail ' + rl).last ≠ null, (vtail ' + rl).last ≠ vs0[(vtail ' + rl).last].next, (vtail ' + rl).last ≠ phead, vs0[(vtail ' + rl).last].next ≠ vtail, vs0[(vtail ' + rl).last].next ≠ null, phead ≠ vs0[(vtail ' + rl).last].next, phead0 ≠ phead, vretRefs0(tid) ≠ null, vtail ≠ phead, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + (vtail ' + rl).last ' + vs0[(vtail ' + rl).last].next ' + (vtail ' + rl + phead ') + qrl0, vs0, ps0, owns0), listp(vtail ' + (rl + phead ') + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl, vs0), markedp(rl1, vs0), markedp(rl, ps0), noid(tid, rl1 + (vtail ' + rl).last ' + vs0[(vtail ' + rl).last].next ' + (vtail ' + rl + phead ') + qrl0, vs0[(vtail ' + rl).last].next, vs0), nonullRetRefs(rl1 + (vtail ' + rl).last ' + vs0[(vtail ' + rl).last].next ' + (vtail ' + rl + phead ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[vtail].deqID), some?(ps0[vtail].deqID), some?(vs0[(vtail ' + rl).last].deqID), some?(vs0[phead].deqID), some?(ps0[phead].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), vs0[(vtail ' + rl).last].next ∈ ps0, vs0[(vtail ' + rl).last].next ∈ vs0, (vtail ' + rl).last ∈ ps0, (vtail ' + rl).last ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + (vtail ' + rl).last ' + vs0[(vtail ' + rl).last].next ' + (vtail ' + rl + phead ') + qrl0 from lst, ¬ dups((rl1 + rl) + qrl0), ¬ dups(rl1), ¬ dups(rl + qrl0), ¬ dups(rl1 + rl), ¬ dups(qrl0), ¬ dups(rl), ¬ weak?(vs0[(vtail ' + rl).last].deqID), ¬ vtail ∈ rl1, ¬ phead ∈ rl, ¬ phead ∈ rl1, ¬ phead ∈ qrl0, ¬ (vtail ' + rl).last ∈ qrl0, ¬ vs0[(vtail ' + rl).last].next ∈ rl1, ¬ vs0[(vtail ' + rl).last].next ∈ rl, ¬ vs0[(vtail ' + rl).last].next ∈ qrl0, ¬ (vtail ' + rl).last ∈ rl1, ¬ (vtail ' + rl).last ∈ rl, ¬ vtail ∈ qrl0, ¬ vtail ∈ rl, phead0 ∈ rl1 ∨ phead0 = (vtail ' + rl).last ∨ phead0 = vs0[(vtail ' + rl).last].next ∨ phead0 = vtail ∨ phead0 ∈ rl, vtail0 = (phead ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (phead ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst = vs0[(vtail ' + rl).last].next ∨ lst = vtail ∨ lst ∈ rl ∨ lst = phead ∨ lst ∈ qrl0 ⊦ |
Used simplifier rules: ⊦ a ' + x ≠ []; (s) lapp-04: ⊦ a ' + x = y + b ' ∧ a ≠ b → x.last = b; (forward) from specification list-last[reflist] inapp-10: ⊦ a ' + x = y + b ' ∧ a ≠ b → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: vtail ' + rl, phead1, y
| Val(vs[ps[first].next].val) = vrvHp[vretRefs(tid)], Val(vs[ps[first].next].val) = prvHp[vretRefs(tid)], 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)) = Claimed(tid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, vhead ≠ first, 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), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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), vhead ≠ first → nextnottid(tid, vhead, vs), phead ∈ rl1 ∨ phead = first ∨ phead ∈ 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) ⊦ Val(vs[ps[first].next].val) = vrvHp0[vretRefs(tid)] ∧ Val(vs[ps[first].next].val) = prvHp0[vretRefs(tid)] ∧ rvowns0(vretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val) ∧ 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) ∧ vretRefs0(tid) = vretRefs(tid) ∧ pretRefs0(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp0 ∧ nextnottid(tid, vhead0, vs0) ∧ noid(tid, orl0 + qrl0, vhead0, vs0) ∧ noowns(tid, owns0) |
Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, vhead0 ≠ first, 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, ps0[first].next, 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), ¬ noid(tid, (rl1 + first ' + rl2) + qrl0, vhead0, vs0), ¬ 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, 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) ⊦
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 ' + x ↔ a = b ∨ a ∈ x; (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) ⊦ 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)
| Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, vhead0 ≠ first, 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, ps0[first].next, 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), ¬ noid(tid, (rl1 + first ' + rl2) + qrl0, vhead0, vs0), ¬ 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, 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) ⊦ |
⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid))
Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, vhead0 ≠ first, 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), 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), ¬ noid(tid, (rl1 + first ' + rl2) + qrl0, vhead0, vs0), ¬ 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), ∀ r0. r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next → vs0[r0].deqID ≠ Some(tid), (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: tid, (rl1 + first ' + rl2) + qrl0, ps0[first].next, vs0
| ⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) |
| Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, vhead0 ≠ first, 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), 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), ¬ noid(tid, (rl1 + first ' + rl2) + qrl0, vhead0, vs0), ¬ 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), ∀ r0. r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next → vs0[r0].deqID ≠ Some(tid), (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ |
⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid))
Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, vhead0 ≠ first, 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), 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), ∀ r0. r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next → vs0[r0].deqID ≠ Some(tid), ∃ r0. ¬(r0 ≠ vhead0 ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from vhead0 → vs0[r0].deqID ≠ Some(tid)), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ 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) ⊦
Used terms: tid, (rl1 + first ' + rl2) + qrl0, vhead0, vs0
| ⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) |
| Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, vhead0 ≠ first, 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), 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), ∀ r0. r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next → vs0[r0].deqID ≠ Some(tid), ∃ r0. ¬(r0 ≠ vhead0 ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from vhead0 → vs0[r0].deqID ≠ Some(tid)), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ 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) ⊦ |
vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, r0 ≠ vhead0, vhead0 ≠ first, 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), 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), r0 ∈ (rl1 + first ' + rl2) + qrl0 from vhead0, 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), ∀ r0. r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next → vs0[r0].deqID ≠ Some(tid), (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, r0 ≠ vhead0, vhead0 ≠ first, 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), 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), r0 ∈ (rl1 + first ' + rl2) + qrl0 from vhead0, 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), ∀ r0. r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next → vs0[r0].deqID ≠ Some(tid), (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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ |
vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, r0 ≠ vhead0, vhead0 ≠ first, 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), 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, r0 ∈ (rl1 + first ' + rl2) + qrl0 from vhead0, ¬ 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), r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ 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) ⊦
Used terms: r0
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, r0 ≠ vhead0, vhead0 ≠ first, 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), 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, r0 ∈ (rl1 + first ' + rl2) + qrl0 from vhead0, ¬ 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), r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ 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) ⊦ |
vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, r0 ≠ vhead0, vhead0 ≠ first, 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), 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), r0 ∈ (rl1 + first ' + rl2) + qrl0 from vhead0, 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, r0 ≠ vhead0, vhead0 ≠ first, 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), 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), r0 ∈ (rl1 + first ' + rl2) + qrl0 from vhead0, 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, r0 ≠ vhead0, vhead0 ≠ first, 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), 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, r0 ∈ (rl1 + first ' + rl2) + qrl0 from vhead0, ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ vhead0 ∈ rl1 + first ' + 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, 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) ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next
vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, r0 ≠ vhead0, vhead0 ≠ first, 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), 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, r0 ∈ (rl1 + first ' + rl2 from vhead0) + qrl0, vhead0 ∈ rl1 + first ' + rl2, ¬ 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, 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) ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl1 + first ' + rl2, qrl0, vhead0
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, r0 ≠ vhead0, vhead0 ≠ first, 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), 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, r0 ∈ (rl1 + first ' + rl2) + qrl0 from vhead0, ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ vhead0 ∈ rl1 + first ' + 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, 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) ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next |
vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, r0 ≠ vhead0, vhead0 ≠ first, 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), 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, r0 ∈ qrl0 from vhead0, ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl2, 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, r0 ≠ vhead0, vhead0 ≠ first, 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), 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, r0 ∈ qrl0 from vhead0, ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl2 + qrl0), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl2, 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next |
vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl0 = vtail + qrl, rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, qrl0 ≠ [], r0 ≠ vhead0, vhead0 ≠ first, 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), 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), r0 ∈ qrl0 from vhead0, 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, ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl2, 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, 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(qrl, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0) ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next
Used simplifier rules: ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ [] from r = []; (s) ⊦ ¬ a ∈ []; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl0, vtail, y
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl0 = vtail + qrl, rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, qrl0 ≠ [], r0 ≠ vhead0, vhead0 ≠ first, 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), 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), r0 ∈ qrl0 from vhead0, 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, ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl2, 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, 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(qrl, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0) ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next |
vs0[r0].deqID = Some(tid), ps0[vtail].deqID = None, Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, first ≠ vtail, r0 ≠ vhead0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + vtail ' + qrl, vs0, ps0, owns0), listp(first ' + rl2 + vtail ' + qrl, vs0, ps0, owns0), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs0), nonullRetRefs(rl1 + first ' + rl2 + vtail ' + qrl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl, ps0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + rl2 + vtail ' + qrl from lst, r0 ∈ vtail ' + qrl from vhead0, ¬ dups((rl1 + rl2) + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl2, ¬ vtail ∈ rl1, ¬ vtail ∈ rl2, ¬ vtail ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl, 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, (first ' + rl2).last = vhead0 ∧ unmarkedp(qrl, vs0) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs0[vtail].deqID = None ∧ unmarkedp(qrl, vs0), lst ∈ rl2 ∨ lst = vtail ∨ lst ∈ qrl, vtail0 = (vtail ' + qrl).last ∨ vtail0 = (first ' + rl2 + (vtail ' + qrl).butlast).last ∧ vs0[(vtail ' + qrl).last].deqID = None ∧ vs0[(vtail ' + qrl).last].next = null ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ rl1 + first ' + rl2 + vtail ' + qrl from ps0[first].next
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a + x = a ' + x; (s) ⊦ a ' + x ≠ []; (s) ⊦ (a ' + x + b ' + y).last = (b ' + y).last; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ 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)
| vs0[r0].deqID = Some(tid), ps0[vtail].deqID = None, Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, first ≠ vtail, r0 ≠ vhead0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + vtail ' + qrl, vs0, ps0, owns0), listp(first ' + rl2 + vtail ' + qrl, vs0, ps0, owns0), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs0), nonullRetRefs(rl1 + first ' + rl2 + vtail ' + qrl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl, ps0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + rl2 + vtail ' + qrl from lst, r0 ∈ vtail ' + qrl from vhead0, ¬ dups((rl1 + rl2) + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl2, ¬ vtail ∈ rl1, ¬ vtail ∈ rl2, ¬ vtail ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl, 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, (first ' + rl2).last = vhead0 ∧ unmarkedp(qrl, vs0) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2).last ∧ vs0[vtail].deqID = None ∧ unmarkedp(qrl, vs0), lst ∈ rl2 ∨ lst = vtail ∨ lst ∈ qrl, vtail0 = (vtail ' + qrl).last ∨ vtail0 = (first ' + rl2 + (vtail ' + qrl).butlast).last ∧ vs0[(vtail ' + qrl).last].deqID = None ∧ vs0[(vtail ' + qrl).last].next = null ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ rl1 + first ' + rl2 + vtail ' + qrl from ps0[first].next |
⊦ y ≠ [] → (x + y).last = y.last
ps0[vtail].deqID = None, vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, first ≠ vtail, r0 ≠ vhead0, rl2 ≠ [], vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + vtail ' + qrl, vs0, ps0, owns0), listp(rl1 + first ' + rl2 + vtail ' + qrl, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs0), markedp(rl2, vs0), nextnottid(tid, vhead0, vs0), nonullRetRefs(rl1 + first ' + rl2 + vtail ' + qrl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl, ps0), r0 ∈ vtail ' + qrl from vhead0, vtail0 ∈ rl1 + first ' + rl2 + vtail ' + qrl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, ¬ dups((rl1 + rl2) + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl2, ¬ vtail ∈ rl1, ¬ vtail ∈ rl2, ¬ vtail ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl, 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 = (vtail ' + qrl).last ∨ vtail0 = (first ' + rl2 + (vtail ' + qrl).butlast).last ∧ vs0[(vtail ' + qrl).last].deqID = None ∧ vs0[(vtail ' + qrl).last].next = null, lst ∈ rl2 ∨ lst = vtail ∨ lst ∈ qrl, rl2.last = vhead0 ∧ unmarkedp(qrl, vs0) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ rl2.last ∧ vs0[vtail].deqID = None ∧ unmarkedp(qrl, vs0), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ rl1 + first ' + rl2 + vtail ' + qrl from ps0[first].next
Used simplifier rules: ⊦ markedp([], vs); (s) ⊦ [] + x = 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] Used terms: first ', rl2
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps0[vtail].deqID = None, vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, first ≠ vtail, r0 ≠ vhead0, rl2 ≠ [], vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + vtail ' + qrl, vs0, ps0, owns0), listp(rl1 + first ' + rl2 + vtail ' + qrl, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs0), markedp(rl2, vs0), nextnottid(tid, vhead0, vs0), nonullRetRefs(rl1 + first ' + rl2 + vtail ' + qrl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl, ps0), r0 ∈ vtail ' + qrl from vhead0, vtail0 ∈ rl1 + first ' + rl2 + vtail ' + qrl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, ¬ dups((rl1 + rl2) + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl2, ¬ vtail ∈ rl1, ¬ vtail ∈ rl2, ¬ vtail ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl, 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 = (vtail ' + qrl).last ∨ vtail0 = (first ' + rl2 + (vtail ' + qrl).butlast).last ∧ vs0[(vtail ' + qrl).last].deqID = None ∧ vs0[(vtail ' + qrl).last].next = null, lst ∈ rl2 ∨ lst = vtail ∨ lst ∈ qrl, rl2.last = vhead0 ∧ unmarkedp(qrl, vs0) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ rl2.last ∧ vs0[vtail].deqID = None ∧ unmarkedp(qrl, vs0), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ rl1 + first ' + rl2 + vtail ' + qrl from ps0[first].next |
vs0[r0].deqID = Some(tid), ps0[vtail].deqID = None, Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, first ≠ vtail, r0 ≠ vhead0, rl2 ≠ [], vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + vtail ' + qrl, vs0, ps0, owns0), listp(first ' + rl2 + vtail ' + qrl, vs0, ps0, owns0), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs0), nonullRetRefs(rl1 + first ' + rl2 + vtail ' + qrl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl, ps0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + rl2 + vtail ' + qrl from lst, r0 ∈ vtail ' + qrl from vhead0, ¬ dups((rl1 + rl2) + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl2, ¬ vtail ∈ rl1, ¬ vtail ∈ rl2, ¬ vtail ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl, 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, lst ∈ rl2 ∨ lst = vtail ∨ lst ∈ qrl, rl2.last = vhead0 ∧ unmarkedp(qrl, vs0) ∨ (first ' + rl2.butlast).last = vhead0 ∧ phead0 ≠ rl2.last ∧ vs0[vtail].deqID = None ∧ unmarkedp(qrl, vs0), vtail0 = (vtail ' + qrl).last ∨ vtail0 = (rl2 + (vtail ' + qrl).butlast).last ∧ vs0[(vtail ' + qrl).last].deqID = None ∧ vs0[(vtail ' + qrl).last].next = null ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ rl1 + first ' + rl2 + vtail ' + qrl from ps0[first].next
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ x + a ' + y ≠ []; (s)
| vs0[r0].deqID = Some(tid), ps0[vtail].deqID = None, Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, first ≠ vtail, r0 ≠ vhead0, rl2 ≠ [], vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + rl2 + vtail ' + qrl, vs0, ps0, owns0), listp(first ' + rl2 + vtail ' + qrl, vs0, ps0, owns0), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs0), nonullRetRefs(rl1 + first ' + rl2 + vtail ' + qrl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl, ps0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + rl2 + vtail ' + qrl from lst, r0 ∈ vtail ' + qrl from vhead0, ¬ dups((rl1 + rl2) + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl2, ¬ vtail ∈ rl1, ¬ vtail ∈ rl2, ¬ vtail ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl, 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, lst ∈ rl2 ∨ lst = vtail ∨ lst ∈ qrl, rl2.last = vhead0 ∧ unmarkedp(qrl, vs0) ∨ (first ' + rl2.butlast).last = vhead0 ∧ phead0 ≠ rl2.last ∧ vs0[vtail].deqID = None ∧ unmarkedp(qrl, vs0), vtail0 = (vtail ' + qrl).last ∨ vtail0 = (rl2 + (vtail ' + qrl).butlast).last ∧ vs0[(vtail ' + qrl).last].deqID = None ∧ vs0[(vtail ' + qrl).last].next = null ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ rl1 + first ' + rl2 + vtail ' + qrl from ps0[first].next |
ps0[vtail].deqID = None, vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = qrl0 + phead ', rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, first ≠ vtail, r0 ≠ vhead0, rl2 ≠ [], vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + vtail ' + qrl, vs0, ps0, owns0), listp(rl1 + first ' + rl2 + vtail ' + qrl, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs0), markedp(rl2, vs0), nextnottid(tid, vhead0, vs0), nonullRetRefs(rl1 + first ' + rl2 + vtail ' + qrl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl, ps0), r0 ∈ vtail ' + qrl from vhead0, vtail0 ∈ rl1 + first ' + rl2 + vtail ' + qrl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, ¬ dups((rl1 + rl2) + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl2, ¬ vtail ∈ rl1, ¬ vtail ∈ rl2, ¬ vtail ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl, 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 = (vtail ' + qrl).last ∨ vtail0 = (rl2 + (vtail ' + qrl).butlast).last ∧ vs0[(vtail ' + qrl).last].deqID = None ∧ vs0[(vtail ' + qrl).last].next = null, phead = vhead0 ∧ unmarkedp(qrl, vs0) ∨ (first ' + qrl0).last = vhead0 ∧ phead0 ≠ phead ∧ vs0[vtail].deqID = None ∧ unmarkedp(qrl, vs0), lst ∈ rl2 ∨ lst = vtail ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ rl1 + first ' + rl2 + vtail ' + qrl from ps0[first].next
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl2, phead, y
| ps0[vtail].deqID = None, vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = qrl0 + phead ', rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, first ≠ vtail, r0 ≠ vhead0, rl2 ≠ [], vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + vtail ' + qrl, vs0, ps0, owns0), listp(rl1 + first ' + rl2 + vtail ' + qrl, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs0), markedp(rl2, vs0), nextnottid(tid, vhead0, vs0), nonullRetRefs(rl1 + first ' + rl2 + vtail ' + qrl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl, ps0), r0 ∈ vtail ' + qrl from vhead0, vtail0 ∈ rl1 + first ' + rl2 + vtail ' + qrl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, ¬ dups((rl1 + rl2) + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl2, ¬ vtail ∈ rl1, ¬ vtail ∈ rl2, ¬ vtail ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl, 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 = (vtail ' + qrl).last ∨ vtail0 = (rl2 + (vtail ' + qrl).butlast).last ∧ vs0[(vtail ' + qrl).last].deqID = None ∧ vs0[(vtail ' + qrl).last].next = null, phead = vhead0 ∧ unmarkedp(qrl, vs0) ∨ (first ' + qrl0).last = vhead0 ∧ phead0 ≠ phead ∧ vs0[vtail].deqID = None ∧ unmarkedp(qrl, vs0), lst ∈ rl2 ∨ lst = vtail ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ rl1 + first ' + rl2 + vtail ' + qrl from ps0[first].next |
vs0[ps0[phead].next].deqID = None, ps0[ps0[phead].next].deqID = None, vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, (first ' + qrl0).last ≠ phead, (first ' + qrl0).last ≠ first, ps0[phead].next ≠ phead, ps0[first].next ≠ null, first ≠ phead, first ≠ ps0[phead].next, first ≠ lst, phead0 ≠ phead, r0 ≠ (first ' + qrl0).last, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + (qrl0 + phead ') + ps0[phead].next ' + qrl, vs0, ps0, owns0), listp(rl1 + first ' + (qrl0 + phead ') + ps0[phead].next ' + qrl, vs0, ps0, owns0), markedp(qrl0, ps0), markedp(rl1, vs0), markedp(qrl0, vs0), markedp(rl1, ps0), nextnottid(tid, (first ' + qrl0).last, vs0), nonullRetRefs(rl1 + first ' + (qrl0 + phead ') + ps0[phead].next ' + qrl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[phead].deqID), some?(vs0[phead].deqID), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl, vs0), unmarkedp(qrl, ps0), r0 ∈ ps0[phead].next ' + qrl from (first ' + qrl0).last, vtail0 ∈ rl1 + first ' + (qrl0 + phead ') + ps0[phead].next ' + qrl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + qrl), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups((rl1 + qrl0) + qrl), ¬ first ∈ qrl0, ¬ first ∈ rl1, ¬ ps0[phead].next ∈ qrl, ¬ ps0[phead].next ∈ qrl0, ¬ ps0[phead].next ∈ rl1, ¬ (first ' + qrl0).last ∈ qrl0, ¬ (first ' + qrl0).last ∈ rl1, ¬ phead ∈ qrl, ¬ phead ∈ qrl0, ¬ phead ∈ rl1, ¬ first ∈ qrl, vs0[(first ' + qrl0).last].next ≠ null ∧ vs0[vs0[(first ' + qrl0).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(first ' + qrl0).last].next].deqID.tid)) = Claimed(vs0[vs0[(first ' + qrl0).last].next].deqID.tid, vs0[vs0[(first ' + qrl0).last].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0, vtail0 = (ps0[phead].next ' + qrl).last ∨ vtail0 = (phead ' + (ps0[phead].next ' + qrl).butlast).last ∧ vs0[(ps0[phead].next ' + qrl).last].deqID = None ∧ vs0[(ps0[phead].next ' + qrl).last].next = null, lst ∈ qrl0 ∨ lst = phead ∨ lst = ps0[phead].next ∨ lst ∈ qrl ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ rl1 + first ' + (qrl0 + phead ') + ps0[phead].next ' + qrl from ps0[first].next
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| vs0[ps0[phead].next].deqID = None, ps0[ps0[phead].next].deqID = None, vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, (first ' + qrl0).last ≠ phead, (first ' + qrl0).last ≠ first, ps0[phead].next ≠ phead, ps0[first].next ≠ null, first ≠ phead, first ≠ ps0[phead].next, first ≠ lst, phead0 ≠ phead, r0 ≠ (first ' + qrl0).last, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + (qrl0 + phead ') + ps0[phead].next ' + qrl, vs0, ps0, owns0), listp(rl1 + first ' + (qrl0 + phead ') + ps0[phead].next ' + qrl, vs0, ps0, owns0), markedp(qrl0, ps0), markedp(rl1, vs0), markedp(qrl0, vs0), markedp(rl1, ps0), nextnottid(tid, (first ' + qrl0).last, vs0), nonullRetRefs(rl1 + first ' + (qrl0 + phead ') + ps0[phead].next ' + qrl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[phead].deqID), some?(vs0[phead].deqID), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl, vs0), unmarkedp(qrl, ps0), r0 ∈ ps0[phead].next ' + qrl from (first ' + qrl0).last, vtail0 ∈ rl1 + first ' + (qrl0 + phead ') + ps0[phead].next ' + qrl from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + qrl), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups((rl1 + qrl0) + qrl), ¬ first ∈ qrl0, ¬ first ∈ rl1, ¬ ps0[phead].next ∈ qrl, ¬ ps0[phead].next ∈ qrl0, ¬ ps0[phead].next ∈ rl1, ¬ (first ' + qrl0).last ∈ qrl0, ¬ (first ' + qrl0).last ∈ rl1, ¬ phead ∈ qrl, ¬ phead ∈ qrl0, ¬ phead ∈ rl1, ¬ first ∈ qrl, vs0[(first ' + qrl0).last].next ≠ null ∧ vs0[vs0[(first ' + qrl0).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(first ' + qrl0).last].next].deqID.tid)) = Claimed(vs0[vs0[(first ' + qrl0).last].next].deqID.tid, vs0[vs0[(first ' + qrl0).last].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl0, vtail0 = (ps0[phead].next ' + qrl).last ∨ vtail0 = (phead ' + (ps0[phead].next ' + qrl).butlast).last ∧ vs0[(ps0[phead].next ' + qrl).last].deqID = None ∧ vs0[(ps0[phead].next ' + qrl).last].next = null, lst ∈ qrl0 ∨ lst = phead ∨ lst = ps0[phead].next ∨ lst ∈ qrl ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ rl1 + first ' + (qrl0 + phead ') + ps0[phead].next ' + qrl from ps0[first].next |
⊦ y ≠ [] → (x + y).last = y.last
Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: first ', qrl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, r0 ≠ vhead0, vhead0 ≠ first, 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), 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, r0 ∈ (rl1 + first ' + rl2 from vhead0) + qrl0, vhead0 ∈ rl1 + first ' + rl2, ¬ 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, 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) ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next |
vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, r0 ≠ vhead0, vhead0 ≠ first, 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), 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 ∈ rl1 ∨ vhead0 ∈ rl2, r0 ∈ rl1 + first ' + rl2 from vhead0 ∨ r0 ∈ qrl0 ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s)
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, r0 ≠ vhead0, vhead0 ≠ first, 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), 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 ∈ rl1 ∨ vhead0 ∈ rl2, r0 ∈ rl1 + first ' + rl2 from vhead0 ∨ r0 ∈ qrl0 ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next |
⊦ y ≠ [] → (x + y).last = y.last
vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = [], rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, r0 ≠ vhead0, vhead0 ≠ first, 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), 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), r0 ∈ rl1 + first ' + rl2 from vhead0 ∨ r0 ∈ qrl0, vhead0 ∈ rl1 ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ 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) ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next
vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, r0 ≠ vhead0, rl2 ≠ [], vhead0 ≠ first, 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), 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), r0 ∈ rl1 + first ' + rl2 from vhead0 ∨ r0 ∈ qrl0, vhead0 ∈ rl1 ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ 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, rl2.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ rl2.last ∧ unmarkedp(qrl0, vs0) ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next
Used terms: first ', rl2
| ⊦ y ≠ [] → (x + y).last = y.last |
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = [], rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, r0 ≠ vhead0, vhead0 ≠ first, 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), 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), r0 ∈ rl1 + first ' + rl2 from vhead0 ∨ r0 ∈ qrl0, vhead0 ∈ rl1 ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ 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) ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next |
vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, rl1.last ≠ first, ps0[first].next ≠ null, first ≠ lst, phead0 ≠ first, r0 ≠ rl1.last, rl1 ≠ [], 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, rl1.last, 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, vs0), unmarkedp(qrl0, ps0), lst ∈ ps0, lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ rl1, lst ∈ qrl0, vtail0 ∈ rl1 + first ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl1, vs0[rl1.last].next ≠ null ∧ vs0[vs0[rl1.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[rl1.last].next].deqID.tid)) = Claimed(vs0[vs0[rl1.last].next].deqID.tid, vs0[vs0[rl1.last].next].val), r0 ∈ rl1 + first ' from rl1.last ∨ r0 ∈ qrl0, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ rl1 + first ' + qrl0 from ps0[first].next
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] 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 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) ⊦ x + [] = x; (s) ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) ⊦ ¬ a ∈ []; (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ a '.last = a; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, rl1.last ≠ first, ps0[first].next ≠ null, first ≠ lst, phead0 ≠ first, r0 ≠ rl1.last, rl1 ≠ [], 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, rl1.last, 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, vs0), unmarkedp(qrl0, ps0), lst ∈ ps0, lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ rl1, lst ∈ qrl0, vtail0 ∈ rl1 + first ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, first ∈ ps0, ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl1, vs0[rl1.last].next ≠ null ∧ vs0[vs0[rl1.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[rl1.last].next].deqID.tid)) = Claimed(vs0[vs0[rl1.last].next].deqID.tid, vs0[vs0[rl1.last].next].val), r0 ∈ rl1 + first ' from rl1.last ∨ r0 ∈ qrl0, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ rl1 + first ' + qrl0 from ps0[first].next |
vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl1 = qrl + vtail ', rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, phead0 ≠ first, r0 ≠ vtail, rl1 ≠ [], vretRefs0(tid) ≠ null, vtail ≠ first, 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, vtail, 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), unmarkedp(qrl0, vs0), first ∈ ps0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + qrl0 from lst, lst ∈ qrl0, phead0 ∈ rl1, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, lst ∈ ps0, ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl1, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, r0 ∈ rl1 + first ' from vtail ∨ r0 ∈ qrl0 ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ rl1 + first ' + qrl0 from ps0[first].next
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl1, vtail, y
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl1 = qrl + vtail ', rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, phead0 ≠ first, r0 ≠ vtail, rl1 ≠ [], vretRefs0(tid) ≠ null, vtail ≠ first, 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, vtail, 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), unmarkedp(qrl0, vs0), first ∈ ps0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ rl1 + first ' + qrl0 from lst, lst ∈ qrl0, phead0 ∈ rl1, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, lst ∈ ps0, ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl1, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, r0 ∈ rl1 + first ' from vtail ∨ r0 ∈ qrl0 ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ rl1 + first ' + qrl0 from ps0[first].next |
vs0[r0].deqID = Some(tid), Val(vs0[ps0[ps0[vtail].next].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[ps0[vtail].next].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[ps0[vtail].next].next].val), ps0[ps0[ps0[vtail].next].next].deqID ≠ None, ps0[vtail].next ≠ lst, ps0[ps0[vtail].next].next ≠ null, phead0 ≠ ps0[vtail].next, r0 ≠ vtail, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, ps0, owns0), listp(ps0[vtail].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(qrl, ps0), nextnottid(tid, vtail, vs0), nonullRetRefs((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[vtail].deqID), some?(ps0[vtail].deqID), some?(vs0[ps0[vtail].next].deqID), some?(ps0[ps0[vtail].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), ps0[vtail].next ∈ ps0, ps0[vtail].next ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from lst, lst ∈ qrl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, lst ∈ ps0, ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl + qrl0), ¬ ps0[vtail].next ∈ qrl, ¬ ps0[vtail].next ∈ qrl0, ¬ vtail ∈ qrl0, ¬ vtail ∈ qrl, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), r0 = ps0[vtail].next ∨ r0 ∈ qrl0, phead0 ∈ qrl ∨ phead0 = vtail, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vtail].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ r0 ≠ ps0[ps0[vtail].next].next ∧ r0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from ps0[ps0[vtail].next].next
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 ∈ b ' ↔ a = b; (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) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[ps0[vtail].next].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[ps0[vtail].next].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[ps0[vtail].next].next].val), ps0[ps0[ps0[vtail].next].next].deqID ≠ None, ps0[vtail].next ≠ lst, ps0[ps0[vtail].next].next ≠ null, phead0 ≠ ps0[vtail].next, r0 ≠ vtail, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, ps0, owns0), listp(ps0[vtail].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(qrl, ps0), nextnottid(tid, vtail, vs0), nonullRetRefs((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[vtail].deqID), some?(ps0[vtail].deqID), some?(vs0[ps0[vtail].next].deqID), some?(ps0[ps0[vtail].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), ps0[vtail].next ∈ ps0, ps0[vtail].next ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from lst, lst ∈ qrl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, lst ∈ ps0, ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl + qrl0), ¬ ps0[vtail].next ∈ qrl, ¬ ps0[vtail].next ∈ qrl0, ¬ vtail ∈ qrl0, ¬ vtail ∈ qrl, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), r0 = ps0[vtail].next ∨ r0 ∈ qrl0, phead0 ∈ qrl ∨ phead0 = vtail, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vtail].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ r0 ≠ ps0[ps0[vtail].next].next ∧ r0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from ps0[ps0[vtail].next].next |
vs0[r0].deqID = Some(tid), Val(vs0[ps0[ps0[vtail].next].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[ps0[vtail].next].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), r0 = ps0[vtail].next, rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[ps0[vtail].next].next].val), ps0[ps0[ps0[vtail].next].next].deqID ≠ None, ps0[vtail].next ≠ lst, ps0[ps0[vtail].next].next ≠ null, phead0 ≠ ps0[vtail].next, r0 ≠ vtail, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(ps0[vtail].next ' + qrl0, vs0, ps0, owns0), listp((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, ps0), markedp(qrl, vs0), nextnottid(tid, vtail, vs0), nonullRetRefs((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[ps0[vtail].next].deqID), some?(vs0[ps0[vtail].next].deqID), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), lst ∈ ps0, lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, lst ∈ qrl0, vtail0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, ps0[vtail].next ∈ vs0, ps0[vtail].next ∈ ps0, ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl + qrl0), ¬ ps0[vtail].next ∈ qrl, ¬ ps0[vtail].next ∈ qrl0, ¬ vtail ∈ qrl0, ¬ vtail ∈ qrl, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vtail].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ qrl ∨ phead0 = vtail ⊦ r0 ≠ ps0[ps0[vtail].next].next ∧ r0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from ps0[ps0[vtail].next].next
vs0[r0].deqID = Some(tid), Val(vs0[ps0[ps0[vtail].next].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[ps0[vtail].next].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[ps0[vtail].next].next].val), ps0[ps0[ps0[vtail].next].next].deqID ≠ None, ps0[vtail].next ≠ lst, ps0[ps0[vtail].next].next ≠ null, phead0 ≠ ps0[vtail].next, r0 ≠ vtail, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(ps0[vtail].next ' + qrl0, vs0, ps0, owns0), listp((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, ps0), markedp(qrl, vs0), nextnottid(tid, vtail, vs0), nonullRetRefs((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[ps0[vtail].next].deqID), some?(vs0[ps0[vtail].next].deqID), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), lst ∈ ps0, lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, lst ∈ qrl0, vtail0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, ps0[vtail].next ∈ vs0, ps0[vtail].next ∈ ps0, r0 ∈ qrl0, ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl + qrl0), ¬ ps0[vtail].next ∈ qrl, ¬ ps0[vtail].next ∈ qrl0, ¬ vtail ∈ qrl0, ¬ vtail ∈ qrl, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vtail].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ qrl ∨ phead0 = vtail ⊦ r0 ≠ ps0[ps0[vtail].next].next ∧ r0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from ps0[ps0[vtail].next].next
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[ps0[vtail].next].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[ps0[vtail].next].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), r0 = ps0[vtail].next, rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[ps0[vtail].next].next].val), ps0[ps0[ps0[vtail].next].next].deqID ≠ None, ps0[vtail].next ≠ lst, ps0[ps0[vtail].next].next ≠ null, phead0 ≠ ps0[vtail].next, r0 ≠ vtail, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(ps0[vtail].next ' + qrl0, vs0, ps0, owns0), listp((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, ps0), markedp(qrl, vs0), nextnottid(tid, vtail, vs0), nonullRetRefs((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[ps0[vtail].next].deqID), some?(vs0[ps0[vtail].next].deqID), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), lst ∈ ps0, lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, lst ∈ qrl0, vtail0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, ps0[vtail].next ∈ vs0, ps0[vtail].next ∈ ps0, ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl + qrl0), ¬ ps0[vtail].next ∈ qrl, ¬ ps0[vtail].next ∈ qrl0, ¬ vtail ∈ qrl0, ¬ vtail ∈ qrl, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vtail].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ qrl ∨ phead0 = vtail ⊦ r0 ≠ ps0[ps0[vtail].next].next ∧ r0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from ps0[ps0[vtail].next].next |
vs0[ps0[vtail].next].deqID = Some(tid), Val(vs0[ps0[ps0[vtail].next].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[ps0[vtail].next].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[ps0[vtail].next].next].val), ps0[ps0[ps0[vtail].next].next].deqID ≠ None, ps0[ps0[vtail].next].next ≠ null, ps0[vtail].next ≠ lst, phead0 ≠ ps0[vtail].next, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(ps0[vtail].next ' + qrl0, vs0, ps0, owns0), listp((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, ps0), markedp(qrl, vs0), nextnottid(tid, vtail, vs0), nonullRetRefs((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[ps0[vtail].next].deqID), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), lst ∈ ps0, lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, lst ∈ qrl0, vtail0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, ps0[vtail].next ∈ vs0, ps0[vtail].next ∈ ps0, ¬ dups(qrl + qrl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ vtail ∈ qrl, ¬ vtail ∈ qrl0, ¬ ps0[vtail].next ∈ qrl0, ¬ ps0[vtail].next ∈ qrl, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vtail].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ qrl ∨ phead0 = vtail ⊦ ps0[vtail].next ≠ ps0[ps0[vtail].next].next ∧ ps0[vtail].next ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from ps0[ps0[vtail].next].next
Used simplifier rules: ⊦ some?(Some(tid)); (s)
| vs0[ps0[vtail].next].deqID = Some(tid), Val(vs0[ps0[ps0[vtail].next].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[ps0[vtail].next].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[ps0[vtail].next].next].val), ps0[ps0[ps0[vtail].next].next].deqID ≠ None, ps0[ps0[vtail].next].next ≠ null, ps0[vtail].next ≠ lst, phead0 ≠ ps0[vtail].next, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(ps0[vtail].next ' + qrl0, vs0, ps0, owns0), listp((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, ps0), markedp(qrl, vs0), nextnottid(tid, vtail, vs0), nonullRetRefs((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[ps0[vtail].next].deqID), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), lst ∈ ps0, lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, lst ∈ qrl0, vtail0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, ps0[vtail].next ∈ vs0, ps0[vtail].next ∈ ps0, ¬ dups(qrl + qrl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ vtail ∈ qrl, ¬ vtail ∈ qrl0, ¬ ps0[vtail].next ∈ qrl0, ¬ ps0[vtail].next ∈ qrl, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vtail].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ qrl ∨ phead0 = vtail ⊦ ps0[vtail].next ≠ ps0[ps0[vtail].next].next ∧ ps0[vtail].next ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from ps0[ps0[vtail].next].next |
⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid)
vs0[ps0[vtail].next].deqID = Some(tid), Val(vs0[ps0[ps0[vtail].next].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[ps0[vtail].next].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[ps0[vtail].next].next].val), ps0[ps0[ps0[vtail].next].next].deqID ≠ None, ps0[ps0[vtail].next].next ≠ null, ps0[vtail].next ≠ lst, phead0 ≠ ps0[vtail].next, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, ps0, owns0), listp(ps0[vtail].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(qrl, ps0), nonullRetRefs((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[vtail].deqID), some?(ps0[vtail].deqID), some?(ps0[ps0[vtail].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), ps0[vtail].next ∈ ps0, ps0[vtail].next ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from lst, lst ∈ qrl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, lst ∈ ps0, ¬ dups(qrl + qrl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ vtail ∈ qrl, ¬ vtail ∈ qrl0, ¬ ps0[vtail].next ∈ qrl0, ¬ ps0[vtail].next ∈ qrl, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), vs0[vtail].next ≠ null → vs0[vs0[vtail].next].deqID ≠ Some(tid), phead0 ∈ qrl ∨ phead0 = vtail, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vtail].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ ps0[vtail].next ≠ ps0[ps0[vtail].next].next ∧ ps0[vtail].next ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from ps0[ps0[vtail].next].next
Used terms: tid, vtail, vs0
| ⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid) |
| vs0[ps0[vtail].next].deqID = Some(tid), Val(vs0[ps0[ps0[vtail].next].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[ps0[vtail].next].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[ps0[vtail].next].next].val), ps0[ps0[ps0[vtail].next].next].deqID ≠ None, ps0[ps0[vtail].next].next ≠ null, ps0[vtail].next ≠ lst, phead0 ≠ ps0[vtail].next, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, ps0, owns0), listp(ps0[vtail].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(qrl, ps0), nonullRetRefs((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[vtail].deqID), some?(ps0[vtail].deqID), some?(ps0[ps0[vtail].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), ps0[vtail].next ∈ ps0, ps0[vtail].next ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from lst, lst ∈ qrl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, lst ∈ ps0, ¬ dups(qrl + qrl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ vtail ∈ qrl, ¬ vtail ∈ qrl0, ¬ ps0[vtail].next ∈ qrl0, ¬ ps0[vtail].next ∈ qrl, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), vs0[vtail].next ≠ null → vs0[vs0[vtail].next].deqID ≠ Some(tid), phead0 ∈ qrl ∨ phead0 = vtail, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vtail].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ ps0[vtail].next ≠ ps0[ps0[vtail].next].next ∧ ps0[vtail].next ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from ps0[ps0[vtail].next].next |
Used simplifier rules: reflist freely generated by [], +;; ⊦ a ∈ b ' + x ↔ a = b ∨ 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] ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s)
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[ps0[vtail].next].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[ps0[vtail].next].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[ps0[vtail].next].next].val), ps0[ps0[ps0[vtail].next].next].deqID ≠ None, ps0[vtail].next ≠ lst, ps0[ps0[vtail].next].next ≠ null, phead0 ≠ ps0[vtail].next, r0 ≠ vtail, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(ps0[vtail].next ' + qrl0, vs0, ps0, owns0), listp((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, ps0), markedp(qrl, vs0), nextnottid(tid, vtail, vs0), nonullRetRefs((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[ps0[vtail].next].deqID), some?(vs0[ps0[vtail].next].deqID), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), lst ∈ ps0, lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, lst ∈ qrl0, vtail0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, ps0[vtail].next ∈ vs0, ps0[vtail].next ∈ ps0, r0 ∈ qrl0, ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl + qrl0), ¬ ps0[vtail].next ∈ qrl, ¬ ps0[vtail].next ∈ qrl0, ¬ vtail ∈ qrl0, ¬ vtail ∈ qrl, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vtail].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ qrl ∨ phead0 = vtail ⊦ r0 ≠ ps0[ps0[vtail].next].next ∧ r0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from ps0[ps0[vtail].next].next |
vs0[r0].deqID = Some(tid), Val(vs0[ps0[ps0[vtail].next].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[ps0[vtail].next].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[ps0[vtail].next].next].val), ps0[ps0[ps0[vtail].next].next].deqID ≠ None, ps0[vtail].next ≠ lst, ps0[ps0[vtail].next].next ≠ null, phead0 ≠ ps0[vtail].next, r0 ≠ vtail, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, ps0, owns0), listp(ps0[vtail].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(qrl, ps0), nextnottid(tid, vtail, vs0), nonullRetRefs((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[vtail].deqID), some?(ps0[vtail].deqID), some?(vs0[ps0[vtail].next].deqID), some?(ps0[ps0[vtail].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), r0 ∈ qrl0, ps0[vtail].next ∈ ps0, ps0[vtail].next ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from lst, lst ∈ qrl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, lst ∈ ps0, r0 ∈ vs0, r0 ∈ ps0, ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl + qrl0), ¬ ps0[vtail].next ∈ qrl, ¬ ps0[vtail].next ∈ qrl0, ¬ vtail ∈ qrl0, ¬ vtail ∈ qrl, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), phead0 ∈ qrl ∨ phead0 = vtail, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vtail].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ r0 ≠ ps0[ps0[vtail].next].next ∧ r0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from ps0[ps0[vtail].next].next
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
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[ps0[vtail].next].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[ps0[vtail].next].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[ps0[vtail].next].next].val), ps0[ps0[ps0[vtail].next].next].deqID ≠ None, ps0[vtail].next ≠ lst, ps0[ps0[vtail].next].next ≠ null, phead0 ≠ ps0[vtail].next, r0 ≠ vtail, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, ps0, owns0), listp(ps0[vtail].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(qrl, ps0), nextnottid(tid, vtail, vs0), nonullRetRefs((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[vtail].deqID), some?(ps0[vtail].deqID), some?(vs0[ps0[vtail].next].deqID), some?(ps0[ps0[vtail].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), r0 ∈ qrl0, ps0[vtail].next ∈ ps0, ps0[vtail].next ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from lst, lst ∈ qrl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, lst ∈ ps0, r0 ∈ vs0, r0 ∈ ps0, ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl + qrl0), ¬ ps0[vtail].next ∈ qrl, ¬ ps0[vtail].next ∈ qrl0, ¬ vtail ∈ qrl0, ¬ vtail ∈ qrl, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), phead0 ∈ qrl ∨ phead0 = vtail, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vtail].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ r0 ≠ ps0[ps0[vtail].next].next ∧ r0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from ps0[ps0[vtail].next].next |
vs0[r0].deqID = Some(tid), Val(vs0[ps0[ps0[vtail].next].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[ps0[vtail].next].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), r0 = ps0[ps0[vtail].next].next, rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[ps0[vtail].next].next].val), ps0[ps0[ps0[vtail].next].next].deqID ≠ None, ps0[vtail].next ≠ lst, ps0[ps0[vtail].next].next ≠ null, phead0 ≠ ps0[vtail].next, r0 ≠ vtail, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(ps0[vtail].next ' + qrl0, vs0, ps0, owns0), listp((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, ps0), markedp(qrl, vs0), nextnottid(tid, vtail, vs0), nonullRetRefs((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[ps0[vtail].next].deqID), some?(vs0[ps0[vtail].next].deqID), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), r0 ∈ ps0, r0 ∈ vs0, lst ∈ ps0, lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, lst ∈ qrl0, vtail0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, ps0[vtail].next ∈ vs0, ps0[vtail].next ∈ ps0, r0 ∈ qrl0, ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl + qrl0), ¬ ps0[vtail].next ∈ qrl, ¬ ps0[vtail].next ∈ qrl0, ¬ vtail ∈ qrl0, ¬ vtail ∈ qrl, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vtail].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ qrl ∨ phead0 = vtail ⊦
vs0[r0].deqID = Some(tid), Val(vs0[ps0[ps0[vtail].next].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[ps0[vtail].next].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[ps0[vtail].next].next].val), ps0[ps0[ps0[vtail].next].next].deqID ≠ None, ps0[vtail].next ≠ lst, ps0[ps0[vtail].next].next ≠ null, phead0 ≠ ps0[vtail].next, r0 ≠ vtail, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(ps0[vtail].next ' + qrl0, vs0, ps0, owns0), listp((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, ps0), markedp(qrl, vs0), nextnottid(tid, vtail, vs0), nonullRetRefs((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[ps0[vtail].next].deqID), some?(vs0[ps0[vtail].next].deqID), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), r0 ∈ ps0, r0 ∈ vs0, lst ∈ ps0, lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, lst ∈ qrl0, vtail0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, ps0[vtail].next ∈ vs0, ps0[vtail].next ∈ ps0, r0 ∈ qrl0, ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl + qrl0), ¬ r0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from ps0[ps0[vtail].next].next, ¬ ps0[vtail].next ∈ qrl, ¬ ps0[vtail].next ∈ qrl0, ¬ vtail ∈ qrl0, ¬ vtail ∈ qrl, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vtail].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ qrl ∨ phead0 = vtail ⊦
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[ps0[vtail].next].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[ps0[vtail].next].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), r0 = ps0[ps0[vtail].next].next, rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[ps0[vtail].next].next].val), ps0[ps0[ps0[vtail].next].next].deqID ≠ None, ps0[vtail].next ≠ lst, ps0[ps0[vtail].next].next ≠ null, phead0 ≠ ps0[vtail].next, r0 ≠ vtail, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(ps0[vtail].next ' + qrl0, vs0, ps0, owns0), listp((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, ps0), markedp(qrl, vs0), nextnottid(tid, vtail, vs0), nonullRetRefs((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[ps0[vtail].next].deqID), some?(vs0[ps0[vtail].next].deqID), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), r0 ∈ ps0, r0 ∈ vs0, lst ∈ ps0, lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, lst ∈ qrl0, vtail0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, ps0[vtail].next ∈ vs0, ps0[vtail].next ∈ ps0, r0 ∈ qrl0, ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl + qrl0), ¬ ps0[vtail].next ∈ qrl, ¬ ps0[vtail].next ∈ qrl0, ¬ vtail ∈ qrl0, ¬ vtail ∈ qrl, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vtail].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ qrl ∨ phead0 = vtail ⊦ |
vs0[ps0[ps0[vtail].next].next].deqID = Some(tid), Val(vs0[ps0[ps0[vtail].next].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[ps0[vtail].next].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[ps0[vtail].next].next].val), ps0[ps0[ps0[vtail].next].next].deqID ≠ None, ps0[vtail].next ≠ lst, ps0[ps0[vtail].next].next ≠ null, ps0[ps0[vtail].next].next ≠ vtail, phead0 ≠ ps0[vtail].next, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, ps0, owns0), listp(ps0[vtail].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(qrl, ps0), nextnottid(tid, vtail, vs0), nonullRetRefs((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[vtail].deqID), some?(ps0[vtail].deqID), some?(vs0[ps0[vtail].next].deqID), some?(ps0[ps0[vtail].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), ps0[ps0[vtail].next].next ∈ qrl0, ps0[vtail].next ∈ ps0, ps0[vtail].next ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from lst, lst ∈ qrl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, lst ∈ ps0, ps0[ps0[vtail].next].next ∈ vs0, ps0[ps0[vtail].next].next ∈ ps0, ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl + qrl0), ¬ ps0[vtail].next ∈ qrl, ¬ ps0[vtail].next ∈ qrl0, ¬ vtail ∈ qrl0, ¬ vtail ∈ qrl, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), phead0 ∈ qrl ∨ phead0 = vtail, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vtail].next ' + 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] 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
| vs0[ps0[ps0[vtail].next].next].deqID = Some(tid), Val(vs0[ps0[ps0[vtail].next].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[ps0[vtail].next].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[ps0[vtail].next].next].val), ps0[ps0[ps0[vtail].next].next].deqID ≠ None, ps0[vtail].next ≠ lst, ps0[ps0[vtail].next].next ≠ null, ps0[ps0[vtail].next].next ≠ vtail, phead0 ≠ ps0[vtail].next, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, ps0, owns0), listp(ps0[vtail].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(qrl, ps0), nextnottid(tid, vtail, vs0), nonullRetRefs((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[vtail].deqID), some?(ps0[vtail].deqID), some?(vs0[ps0[vtail].next].deqID), some?(ps0[ps0[vtail].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), ps0[ps0[vtail].next].next ∈ qrl0, ps0[vtail].next ∈ ps0, ps0[vtail].next ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from lst, lst ∈ qrl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, lst ∈ ps0, ps0[ps0[vtail].next].next ∈ vs0, ps0[ps0[vtail].next].next ∈ ps0, ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl + qrl0), ¬ ps0[vtail].next ∈ qrl, ¬ ps0[vtail].next ∈ qrl0, ¬ vtail ∈ qrl0, ¬ vtail ∈ qrl, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), phead0 ∈ qrl ∨ phead0 = vtail, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vtail].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ |
Used simplifier rules: reflist freely generated by [], +;; ⊦ a ∈ b ' + x ↔ a = b ∨ 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] ⊦ ¬ a ∈ []; (s)
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[ps0[vtail].next].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[ps0[vtail].next].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[ps0[vtail].next].next].val), ps0[ps0[ps0[vtail].next].next].deqID ≠ None, ps0[vtail].next ≠ lst, ps0[ps0[vtail].next].next ≠ null, phead0 ≠ ps0[vtail].next, r0 ≠ vtail, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(ps0[vtail].next ' + qrl0, vs0, ps0, owns0), listp((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, ps0), markedp(qrl, vs0), nextnottid(tid, vtail, vs0), nonullRetRefs((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[ps0[vtail].next].deqID), some?(vs0[ps0[vtail].next].deqID), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), r0 ∈ ps0, r0 ∈ vs0, lst ∈ ps0, lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, lst ∈ qrl0, vtail0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, ps0[vtail].next ∈ vs0, ps0[vtail].next ∈ ps0, r0 ∈ qrl0, ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl + qrl0), ¬ r0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from ps0[ps0[vtail].next].next, ¬ ps0[vtail].next ∈ qrl, ¬ ps0[vtail].next ∈ qrl0, ¬ vtail ∈ qrl0, ¬ vtail ∈ qrl, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vtail].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ qrl ∨ phead0 = vtail ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
vs0[r0].deqID = Some(tid), Val(vs0[ps0[ps0[vtail].next].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[ps0[vtail].next].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[ps0[vtail].next].next].val), ps0[ps0[ps0[vtail].next].next].deqID ≠ None, ps0[vtail].next ≠ lst, ps0[ps0[vtail].next].next ≠ null, phead0 ≠ ps0[vtail].next, r0 ≠ vtail, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, ps0, owns0), listp(ps0[vtail].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(qrl, ps0), nextnottid(tid, vtail, vs0), nonullRetRefs((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[vtail].deqID), some?(ps0[vtail].deqID), some?(vs0[ps0[vtail].next].deqID), some?(ps0[ps0[vtail].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), r0 ∈ qrl0, ps0[vtail].next ∈ ps0, ps0[vtail].next ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from lst, lst ∈ qrl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, lst ∈ ps0, r0 ∈ vs0, r0 ∈ ps0, ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl + qrl0), ¬ ps0[ps0[vtail].next].next ∈ qrl + vtail ', ¬ r0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from ps0[ps0[vtail].next].next, ¬ ps0[vtail].next ∈ qrl, ¬ ps0[vtail].next ∈ qrl0, ¬ vtail ∈ qrl0, ¬ vtail ∈ qrl, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), phead0 ∈ qrl ∨ phead0 = vtail, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vtail].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦
Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ y → a ∈ x + y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: qrl + vtail ', ps0[vtail].next ' + qrl0, ps0[ps0[vtail].next].next
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[ps0[vtail].next].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[ps0[vtail].next].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[ps0[vtail].next].next].val), ps0[ps0[ps0[vtail].next].next].deqID ≠ None, ps0[vtail].next ≠ lst, ps0[ps0[vtail].next].next ≠ null, phead0 ≠ ps0[vtail].next, r0 ≠ vtail, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, ps0, owns0), listp(ps0[vtail].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(qrl, ps0), nextnottid(tid, vtail, vs0), nonullRetRefs((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[vtail].deqID), some?(ps0[vtail].deqID), some?(vs0[ps0[vtail].next].deqID), some?(ps0[ps0[vtail].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), r0 ∈ qrl0, ps0[vtail].next ∈ ps0, ps0[vtail].next ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from lst, lst ∈ qrl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, lst ∈ ps0, r0 ∈ vs0, r0 ∈ ps0, ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl + qrl0), ¬ ps0[ps0[vtail].next].next ∈ qrl + vtail ', ¬ r0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from ps0[ps0[vtail].next].next, ¬ ps0[vtail].next ∈ qrl, ¬ ps0[vtail].next ∈ qrl0, ¬ vtail ∈ qrl0, ¬ vtail ∈ qrl, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), phead0 ∈ qrl ∨ phead0 = vtail, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vtail].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ |
vs0[r0].deqID = Some(tid), Val(vs0[ps0[ps0[vtail].next].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[ps0[vtail].next].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[ps0[vtail].next].next].val), ps0[ps0[ps0[vtail].next].next].deqID ≠ None, ps0[vtail].next ≠ lst, ps0[ps0[vtail].next].next ≠ null, ps0[ps0[vtail].next].next ≠ vtail, phead0 ≠ ps0[vtail].next, r0 ≠ vtail, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(ps0[vtail].next ' + qrl0, vs0, ps0, owns0), listp((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, ps0), markedp(qrl, vs0), nextnottid(tid, vtail, vs0), nonullRetRefs((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[ps0[vtail].next].deqID), some?(vs0[ps0[vtail].next].deqID), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), r0 ∈ ps0, r0 ∈ vs0, lst ∈ ps0, lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, lst ∈ qrl0, vtail0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, ps0[vtail].next ∈ vs0, ps0[vtail].next ∈ ps0, r0 ∈ qrl0, ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl + qrl0), ¬ ps0[vtail].next ∈ qrl, ¬ ps0[vtail].next ∈ qrl0, ¬ vtail ∈ qrl0, ¬ vtail ∈ qrl, ¬ ps0[ps0[vtail].next].next ∈ qrl, ¬ r0 ∈ ps0[vtail].next ' + qrl0 from ps0[ps0[vtail].next].next, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vtail].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ qrl ∨ phead0 = vtail ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[ps0[vtail].next].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[ps0[vtail].next].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[ps0[vtail].next].next].val), ps0[ps0[ps0[vtail].next].next].deqID ≠ None, ps0[vtail].next ≠ lst, ps0[ps0[vtail].next].next ≠ null, ps0[ps0[vtail].next].next ≠ vtail, phead0 ≠ ps0[vtail].next, r0 ≠ vtail, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(ps0[vtail].next ' + qrl0, vs0, ps0, owns0), listp((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, ps0), markedp(qrl, vs0), nextnottid(tid, vtail, vs0), nonullRetRefs((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[ps0[vtail].next].deqID), some?(vs0[ps0[vtail].next].deqID), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), r0 ∈ ps0, r0 ∈ vs0, lst ∈ ps0, lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, lst ∈ qrl0, vtail0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, ps0[vtail].next ∈ vs0, ps0[vtail].next ∈ ps0, r0 ∈ qrl0, ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl + qrl0), ¬ ps0[vtail].next ∈ qrl, ¬ ps0[vtail].next ∈ qrl0, ¬ vtail ∈ qrl0, ¬ vtail ∈ qrl, ¬ ps0[ps0[vtail].next].next ∈ qrl, ¬ r0 ∈ ps0[vtail].next ' + qrl0 from ps0[ps0[vtail].next].next, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vtail].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ qrl ∨ phead0 = vtail ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
vs0[r0].deqID = Some(tid), Val(vs0[ps0[ps0[vtail].next].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[ps0[vtail].next].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[ps0[vtail].next].next].val), ps0[ps0[ps0[vtail].next].next].deqID ≠ None, ps0[vtail].next ≠ lst, ps0[ps0[vtail].next].next ≠ null, ps0[ps0[vtail].next].next ≠ vtail, phead0 ≠ ps0[vtail].next, r0 ≠ vtail, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, ps0, owns0), listp(ps0[vtail].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(qrl, ps0), nextnottid(tid, vtail, vs0), nonullRetRefs((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[vtail].deqID), some?(ps0[vtail].deqID), some?(vs0[ps0[vtail].next].deqID), some?(ps0[ps0[vtail].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), r0 ∈ qrl0, ps0[vtail].next ∈ ps0, ps0[vtail].next ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from lst, lst ∈ qrl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, lst ∈ ps0, r0 ∈ vs0, r0 ∈ ps0, ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl + qrl0), ¬ ps0[ps0[vtail].next].next ∈ ps0[vtail].next ', ¬ ps0[vtail].next ∈ qrl, ¬ ps0[vtail].next ∈ qrl0, ¬ vtail ∈ qrl0, ¬ vtail ∈ qrl, ¬ ps0[ps0[vtail].next].next ∈ qrl, ¬ r0 ∈ ps0[vtail].next ' + qrl0 from ps0[ps0[vtail].next].next, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), phead0 ∈ qrl ∨ phead0 = vtail, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vtail].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ y → a ∈ x + y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps0[vtail].next ', qrl0, ps0[ps0[vtail].next].next
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[ps0[vtail].next].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[ps0[vtail].next].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[ps0[vtail].next].next].val), ps0[ps0[ps0[vtail].next].next].deqID ≠ None, ps0[vtail].next ≠ lst, ps0[ps0[vtail].next].next ≠ null, ps0[ps0[vtail].next].next ≠ vtail, phead0 ≠ ps0[vtail].next, r0 ≠ vtail, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, ps0, owns0), listp(ps0[vtail].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(qrl, ps0), nextnottid(tid, vtail, vs0), nonullRetRefs((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[vtail].deqID), some?(ps0[vtail].deqID), some?(vs0[ps0[vtail].next].deqID), some?(ps0[ps0[vtail].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), r0 ∈ qrl0, ps0[vtail].next ∈ ps0, ps0[vtail].next ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from lst, lst ∈ qrl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, lst ∈ ps0, r0 ∈ vs0, r0 ∈ ps0, ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl + qrl0), ¬ ps0[ps0[vtail].next].next ∈ ps0[vtail].next ', ¬ ps0[vtail].next ∈ qrl, ¬ ps0[vtail].next ∈ qrl0, ¬ vtail ∈ qrl0, ¬ vtail ∈ qrl, ¬ ps0[ps0[vtail].next].next ∈ qrl, ¬ r0 ∈ ps0[vtail].next ' + qrl0 from ps0[ps0[vtail].next].next, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), phead0 ∈ qrl ∨ phead0 = vtail, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vtail].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ |
vs0[r0].deqID = Some(tid), Val(vs0[ps0[ps0[vtail].next].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[ps0[vtail].next].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[ps0[vtail].next].next].val), ps0[ps0[ps0[vtail].next].next].deqID ≠ None, ps0[vtail].next ≠ lst, ps0[ps0[vtail].next].next ≠ null, ps0[ps0[vtail].next].next ≠ vtail, ps0[ps0[vtail].next].next ≠ ps0[vtail].next, phead0 ≠ ps0[vtail].next, r0 ≠ vtail, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(ps0[vtail].next ' + qrl0, vs0, ps0, owns0), listp((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, ps0), markedp(qrl, vs0), nextnottid(tid, vtail, vs0), nonullRetRefs((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[ps0[vtail].next].deqID), some?(vs0[ps0[vtail].next].deqID), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), r0 ∈ ps0, r0 ∈ vs0, lst ∈ ps0, lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, lst ∈ qrl0, vtail0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, ps0[vtail].next ∈ vs0, ps0[vtail].next ∈ ps0, r0 ∈ qrl0, ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl + qrl0), ¬ ps0[vtail].next ∈ qrl, ¬ ps0[vtail].next ∈ qrl0, ¬ vtail ∈ qrl0, ¬ vtail ∈ qrl, ¬ ps0[ps0[vtail].next].next ∈ qrl, ¬ r0 ∈ qrl0 from ps0[ps0[vtail].next].next, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vtail].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ qrl ∨ phead0 = vtail ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ a ∈ b ' ↔ a = b; (s)
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[ps0[vtail].next].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[ps0[vtail].next].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[ps0[vtail].next].next].val), ps0[ps0[ps0[vtail].next].next].deqID ≠ None, ps0[vtail].next ≠ lst, ps0[ps0[vtail].next].next ≠ null, ps0[ps0[vtail].next].next ≠ vtail, ps0[ps0[vtail].next].next ≠ ps0[vtail].next, phead0 ≠ ps0[vtail].next, r0 ≠ vtail, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(ps0[vtail].next ' + qrl0, vs0, ps0, owns0), listp((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, ps0), markedp(qrl, vs0), nextnottid(tid, vtail, vs0), nonullRetRefs((qrl + vtail ') + ps0[vtail].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[ps0[vtail].next].deqID), some?(vs0[ps0[vtail].next].deqID), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), r0 ∈ ps0, r0 ∈ vs0, lst ∈ ps0, lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, lst ∈ qrl0, vtail0 ∈ (qrl + vtail ') + ps0[vtail].next ' + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, ps0[vtail].next ∈ vs0, ps0[vtail].next ∈ ps0, r0 ∈ qrl0, ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl + qrl0), ¬ ps0[vtail].next ∈ qrl, ¬ ps0[vtail].next ∈ qrl0, ¬ vtail ∈ qrl0, ¬ vtail ∈ qrl, ¬ ps0[ps0[vtail].next].next ∈ qrl, ¬ r0 ∈ qrl0 from ps0[ps0[vtail].next].next, vs0[vtail].next ≠ null ∧ vs0[vs0[vtail].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vtail].next].deqID.tid)) = Claimed(vs0[vs0[vtail].next].deqID.tid, vs0[vs0[vtail].next].val), vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vtail].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ qrl ∨ phead0 = vtail ⊦ |
Used simplifier rules: reflist freely generated by [], +;; ⊦ a ∈ b ' + x ↔ a = b ∨ 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] ⊦ ¬ a ∈ []; (s)
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, r0 ≠ vhead0, rl2 ≠ [], vhead0 ≠ first, 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), 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), r0 ∈ rl1 + first ' + rl2 from vhead0 ∨ r0 ∈ qrl0, vhead0 ∈ rl1 ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ 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, rl2.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead0 ∧ phead0 ≠ rl2.last ∧ unmarkedp(qrl0, vs0) ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next |
vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, r0 ≠ vhead0, rl2 ≠ [], vhead0 ≠ first, 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), 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), lst ∈ rl2 ∨ lst ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 ∈ rl1 ∨ vhead0 ∈ rl2, r0 ∈ rl1 + first ' + rl2 from vhead0 ∨ r0 ∈ qrl0, rl2.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + rl2.butlast).last = vhead0 ∧ phead0 ≠ rl2.last ∧ unmarkedp(qrl0, vs0), vtail0 = (rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl2 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ x + a ' + y ≠ []; (s)
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, r0 ≠ vhead0, rl2 ≠ [], vhead0 ≠ first, 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), 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), lst ∈ rl2 ∨ lst ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vhead0 ∈ rl1 ∨ vhead0 ∈ rl2, r0 ∈ rl1 + first ' + rl2 from vhead0 ∨ r0 ∈ qrl0, rl2.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + rl2.butlast).last = vhead0 ∧ phead0 ≠ rl2.last ∧ unmarkedp(qrl0, vs0), vtail0 = (rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl2 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next |
vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = qrl + vtail ', rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, r0 ≠ vhead0, rl2 ≠ [], vhead0 ≠ first, 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), 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), vtail0 = (rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl2 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + qrl).last = vhead0 ∧ phead0 ≠ vtail ∧ unmarkedp(qrl0, vs0), r0 ∈ rl1 + first ' + rl2 from vhead0 ∨ r0 ∈ qrl0, vhead0 ∈ rl1 ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl0 ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl2, vtail, y
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = qrl + vtail ', rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, r0 ≠ vhead0, rl2 ≠ [], vhead0 ≠ first, 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), 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), vtail0 = (rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl2 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + qrl).last = vhead0 ∧ phead0 ≠ vtail ∧ unmarkedp(qrl0, vs0), r0 ∈ rl1 + first ' + rl2 from vhead0 ∨ r0 ∈ qrl0, vhead0 ∈ rl1 ∨ vhead0 ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl0 ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + rl2) + qrl0 from ps0[first].next |
vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, first ≠ vtail, r0 ≠ vhead0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + qrl + vtail ') + qrl0, vs0, ps0, owns0), listp(first ' + (qrl + vtail ') + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(qrl, vs0), markedp(rl1, vs0), markedp(qrl, ps0), nextnottid(tid, vhead0, vs0), nonullRetRefs((rl1 + first ' + qrl + vtail ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[first].deqID), some?(vs0[vtail].deqID), some?(ps0[vtail].deqID), unmarkedp(qrl0, ps0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from lst, ¬ dups((rl1 + qrl) + qrl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl + qrl0), ¬ dups(rl1 + qrl), ¬ first ∈ qrl0, ¬ vtail ∈ rl1, ¬ vtail ∈ qrl, ¬ vtail ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ qrl, 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), r0 ∈ rl1 + first ' + qrl + vtail ' from vhead0 ∨ r0 ∈ qrl0, vtail = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + qrl).last = vhead0 ∧ phead0 ≠ vtail ∧ unmarkedp(qrl0, vs0), lst ∈ qrl ∨ lst = vtail ∨ lst ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl ∨ phead0 = vtail, vhead0 ∈ rl1 ∨ vhead0 ∈ qrl ∨ vhead0 = vtail, vtail0 = (vtail ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from ps0[first].next
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, first ≠ vtail, r0 ≠ vhead0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + qrl + vtail ') + qrl0, vs0, ps0, owns0), listp(first ' + (qrl + vtail ') + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(qrl, vs0), markedp(rl1, vs0), markedp(qrl, ps0), nextnottid(tid, vhead0, vs0), nonullRetRefs((rl1 + first ' + qrl + vtail ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[first].deqID), some?(vs0[vtail].deqID), some?(ps0[vtail].deqID), unmarkedp(qrl0, ps0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from lst, ¬ dups((rl1 + qrl) + qrl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl + qrl0), ¬ dups(rl1 + qrl), ¬ first ∈ qrl0, ¬ vtail ∈ rl1, ¬ vtail ∈ qrl, ¬ vtail ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ qrl, 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), r0 ∈ rl1 + first ' + qrl + vtail ' from vhead0 ∨ r0 ∈ qrl0, vtail = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + qrl).last = vhead0 ∧ phead0 ≠ vtail ∧ unmarkedp(qrl0, vs0), lst ∈ qrl ∨ lst = vtail ∨ lst ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl ∨ phead0 = vtail, vhead0 ∈ rl1 ∨ vhead0 ∈ qrl ∨ vhead0 = vtail, vtail0 = (vtail ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from ps0[first].next |
vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, first ≠ vtail, r0 ≠ vhead0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + (qrl + vtail ') + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl + vtail ') + qrl0, vs0, ps0, owns0), markedp(qrl, ps0), markedp(rl1, vs0), markedp(qrl, vs0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs0), nonullRetRefs((rl1 + first ' + qrl + vtail ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, r0 ∈ rl1 + first ' + qrl + vtail ' from vhead0, ¬ dups((rl1 + qrl) + qrl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl + qrl0), ¬ dups(rl1 + qrl), ¬ first ∈ qrl0, ¬ vtail ∈ rl1, ¬ vtail ∈ qrl, ¬ vtail ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ qrl, 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 = (vtail ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vhead0 ∈ rl1 ∨ vhead0 ∈ qrl ∨ vhead0 = vtail, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl ∨ phead0 = vtail, lst ∈ qrl ∨ lst = vtail ∨ lst ∈ qrl0, vtail = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + qrl).last = vhead0 ∧ phead0 ≠ vtail ∧ unmarkedp(qrl0, vs0) ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from ps0[first].next
vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, first ≠ vtail, r0 ≠ vhead0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + (qrl + vtail ') + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl + vtail ') + qrl0, vs0, ps0, owns0), markedp(qrl, ps0), markedp(rl1, vs0), markedp(qrl, vs0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs0), nonullRetRefs((rl1 + first ' + qrl + vtail ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, r0 ∈ qrl0, ¬ dups((rl1 + qrl) + qrl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl + qrl0), ¬ dups(rl1 + qrl), ¬ first ∈ qrl0, ¬ vtail ∈ rl1, ¬ vtail ∈ qrl, ¬ vtail ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ qrl, 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 = (vtail ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vhead0 ∈ rl1 ∨ vhead0 ∈ qrl ∨ vhead0 = vtail, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl ∨ phead0 = vtail, lst ∈ qrl ∨ lst = vtail ∨ lst ∈ qrl0, vtail = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + qrl).last = vhead0 ∧ phead0 ≠ vtail ∧ unmarkedp(qrl0, vs0) ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from ps0[first].next
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, first ≠ vtail, r0 ≠ vhead0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + (qrl + vtail ') + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl + vtail ') + qrl0, vs0, ps0, owns0), markedp(qrl, ps0), markedp(rl1, vs0), markedp(qrl, vs0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs0), nonullRetRefs((rl1 + first ' + qrl + vtail ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, r0 ∈ rl1 + first ' + qrl + vtail ' from vhead0, ¬ dups((rl1 + qrl) + qrl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl + qrl0), ¬ dups(rl1 + qrl), ¬ first ∈ qrl0, ¬ vtail ∈ rl1, ¬ vtail ∈ qrl, ¬ vtail ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ qrl, 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 = (vtail ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vhead0 ∈ rl1 ∨ vhead0 ∈ qrl ∨ vhead0 = vtail, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl ∨ phead0 = vtail, lst ∈ qrl ∨ lst = vtail ∨ lst ∈ qrl0, vtail = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + qrl).last = vhead0 ∧ phead0 ≠ vtail ∧ unmarkedp(qrl0, vs0) ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from ps0[first].next |
vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, (first ' + qrl).last ≠ vtail, (first ' + qrl).last ≠ first, ps0[first].next ≠ null, first ≠ lst, first ≠ vtail, phead0 ≠ vtail, r0 ≠ (first ' + qrl).last, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + qrl + vtail ') + qrl0, vs0, ps0, owns0), listp(first ' + (qrl + vtail ') + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(qrl, vs0), markedp(rl1, vs0), markedp(qrl, ps0), nextnottid(tid, (first ' + qrl).last, vs0), nonullRetRefs((rl1 + first ' + qrl + vtail ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[first].deqID), some?(vs0[vtail].deqID), some?(ps0[vtail].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), r0 ∈ rl1 + first ' + qrl + vtail ' from (first ' + qrl).last, first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from lst, ¬ dups((rl1 + qrl) + qrl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl + qrl0), ¬ dups(rl1 + qrl), ¬ first ∈ qrl0, ¬ vtail ∈ rl1, ¬ vtail ∈ qrl, ¬ vtail ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ qrl, vs0[(first ' + qrl).last].next ≠ null ∧ vs0[vs0[(first ' + qrl).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(first ' + qrl).last].next].deqID.tid)) = Claimed(vs0[vs0[(first ' + qrl).last].next].deqID.tid, vs0[vs0[(first ' + qrl).last].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl, lst ∈ qrl ∨ lst = vtail ∨ lst ∈ qrl0, (first ' + qrl).last ∈ qrl ∨ (first ' + qrl).last ∈ rl1, vtail0 = (vtail ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from ps0[first].next
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s)
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, (first ' + qrl).last ≠ vtail, (first ' + qrl).last ≠ first, ps0[first].next ≠ null, first ≠ lst, first ≠ vtail, phead0 ≠ vtail, r0 ≠ (first ' + qrl).last, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + qrl + vtail ') + qrl0, vs0, ps0, owns0), listp(first ' + (qrl + vtail ') + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(qrl, vs0), markedp(rl1, vs0), markedp(qrl, ps0), nextnottid(tid, (first ' + qrl).last, vs0), nonullRetRefs((rl1 + first ' + qrl + vtail ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[first].deqID), some?(vs0[vtail].deqID), some?(ps0[vtail].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), r0 ∈ rl1 + first ' + qrl + vtail ' from (first ' + qrl).last, first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from lst, ¬ dups((rl1 + qrl) + qrl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl + qrl0), ¬ dups(rl1 + qrl), ¬ first ∈ qrl0, ¬ vtail ∈ rl1, ¬ vtail ∈ qrl, ¬ vtail ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ qrl, vs0[(first ' + qrl).last].next ≠ null ∧ vs0[vs0[(first ' + qrl).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(first ' + qrl).last].next].deqID.tid)) = Claimed(vs0[vs0[(first ' + qrl).last].next].deqID.tid, vs0[vs0[(first ' + qrl).last].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl, lst ∈ qrl ∨ lst = vtail ∨ lst ∈ qrl0, (first ' + qrl).last ∈ qrl ∨ (first ' + qrl).last ∈ rl1, vtail0 = (vtail ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from ps0[first].next |
⊦ y ≠ [] → (x + y).last = y.last
vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, qrl.last ≠ vtail, qrl.last ≠ first, ps0[first].next ≠ null, first ≠ lst, first ≠ vtail, phead0 ≠ vtail, qrl ≠ [], r0 ≠ qrl.last, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + (qrl + vtail ') + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl + vtail ') + qrl0, vs0, ps0, owns0), markedp(qrl, ps0), markedp(rl1, vs0), markedp(qrl, vs0), markedp(rl1, ps0), nextnottid(tid, qrl.last, vs0), nonullRetRefs((rl1 + first ' + qrl + vtail ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), vtail0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, r0 ∈ rl1 + first ' + qrl + vtail ' from qrl.last, ¬ dups((rl1 + qrl) + qrl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl + qrl0), ¬ dups(rl1 + qrl), ¬ first ∈ qrl0, ¬ vtail ∈ rl1, ¬ vtail ∈ qrl, ¬ vtail ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ qrl, vs0[qrl.last].next ≠ null ∧ vs0[vs0[qrl.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[qrl.last].next].deqID.tid)) = Claimed(vs0[vs0[qrl.last].next].deqID.tid, vs0[vs0[qrl.last].next].val), vtail0 = (vtail ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, qrl.last ∈ qrl ∨ qrl.last ∈ rl1, lst ∈ qrl ∨ lst = vtail ∨ lst ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from ps0[first].next
Used simplifier rules: ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: first ', qrl
| ⊦ y ≠ [] → (x + y).last = y.last |
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, qrl.last ≠ vtail, qrl.last ≠ first, ps0[first].next ≠ null, first ≠ lst, first ≠ vtail, phead0 ≠ vtail, qrl ≠ [], r0 ≠ qrl.last, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + (qrl + vtail ') + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl + vtail ') + qrl0, vs0, ps0, owns0), markedp(qrl, ps0), markedp(rl1, vs0), markedp(qrl, vs0), markedp(rl1, ps0), nextnottid(tid, qrl.last, vs0), nonullRetRefs((rl1 + first ' + qrl + vtail ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), vtail0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, r0 ∈ rl1 + first ' + qrl + vtail ' from qrl.last, ¬ dups((rl1 + qrl) + qrl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl + qrl0), ¬ dups(rl1 + qrl), ¬ first ∈ qrl0, ¬ vtail ∈ rl1, ¬ vtail ∈ qrl, ¬ vtail ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ qrl, vs0[qrl.last].next ≠ null ∧ vs0[vs0[qrl.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[qrl.last].next].deqID.tid)) = Claimed(vs0[vs0[qrl.last].next].deqID.tid, vs0[vs0[qrl.last].next].val), vtail0 = (vtail ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, qrl.last ∈ qrl ∨ qrl.last ∈ rl1, lst ∈ qrl ∨ lst = vtail ∨ lst ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from ps0[first].next |
vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, qrl.last ≠ vtail, qrl.last ≠ first, ps0[first].next ≠ null, first ≠ lst, first ≠ vtail, phead0 ≠ vtail, qrl ≠ [], r0 ≠ qrl.last, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + qrl + vtail ') + qrl0, vs0, ps0, owns0), listp(first ' + (qrl + vtail ') + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(qrl, vs0), markedp(rl1, vs0), markedp(qrl, ps0), nextnottid(tid, qrl.last, vs0), nonullRetRefs((rl1 + first ' + qrl + vtail ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[first].deqID), some?(vs0[vtail].deqID), some?(ps0[vtail].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), r0 ∈ rl1 + first ' + qrl + vtail ' from qrl.last, first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from lst, ¬ dups((rl1 + qrl) + qrl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl + qrl0), ¬ dups(rl1 + qrl), ¬ first ∈ qrl0, ¬ vtail ∈ rl1, ¬ vtail ∈ qrl, ¬ vtail ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ qrl, vs0[qrl.last].next ≠ null ∧ vs0[vs0[qrl.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[qrl.last].next].deqID.tid)) = Claimed(vs0[vs0[qrl.last].next].deqID.tid, vs0[vs0[qrl.last].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl, lst ∈ qrl ∨ lst = vtail ∨ lst ∈ qrl0, vtail0 = (vtail ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from ps0[first].next
Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s)
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, qrl.last ≠ vtail, qrl.last ≠ first, ps0[first].next ≠ null, first ≠ lst, first ≠ vtail, phead0 ≠ vtail, qrl ≠ [], r0 ≠ qrl.last, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + qrl + vtail ') + qrl0, vs0, ps0, owns0), listp(first ' + (qrl + vtail ') + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(qrl, vs0), markedp(rl1, vs0), markedp(qrl, ps0), nextnottid(tid, qrl.last, vs0), nonullRetRefs((rl1 + first ' + qrl + vtail ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[first].deqID), some?(vs0[vtail].deqID), some?(ps0[vtail].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), r0 ∈ rl1 + first ' + qrl + vtail ' from qrl.last, first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from lst, ¬ dups((rl1 + qrl) + qrl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl + qrl0), ¬ dups(rl1 + qrl), ¬ first ∈ qrl0, ¬ vtail ∈ rl1, ¬ vtail ∈ qrl, ¬ vtail ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ qrl, vs0[qrl.last].next ≠ null ∧ vs0[vs0[qrl.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[qrl.last].next].deqID.tid)) = Claimed(vs0[vs0[qrl.last].next].deqID.tid, vs0[vs0[qrl.last].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl, lst ∈ qrl ∨ lst = vtail ∨ lst ∈ qrl0, vtail0 = (vtail ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from ps0[first].next |
vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl = rl + phead ', rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, first ≠ vtail, phead ≠ vtail, phead ≠ first, phead0 ≠ vtail, qrl ≠ [], r0 ≠ phead, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + (qrl + vtail ') + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl + vtail ') + qrl0, vs0, ps0, owns0), markedp(qrl, ps0), markedp(rl1, vs0), markedp(qrl, vs0), markedp(rl1, ps0), nextnottid(tid, phead, vs0), nonullRetRefs((rl1 + first ' + qrl + vtail ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), vtail0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, r0 ∈ rl1 + first ' + qrl + vtail ' from phead, ¬ dups((rl1 + qrl) + qrl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl + qrl0), ¬ dups(rl1 + qrl), ¬ first ∈ qrl0, ¬ vtail ∈ rl1, ¬ vtail ∈ qrl, ¬ vtail ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ qrl, vs0[phead].next ≠ null ∧ vs0[vs0[phead].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead].next].deqID.tid)) = Claimed(vs0[vs0[phead].next].deqID.tid, vs0[vs0[phead].next].val), vtail0 = (vtail ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ qrl ∨ lst = vtail ∨ lst ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from ps0[first].next
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl, phead, y
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl = rl + phead ', rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, first ≠ vtail, phead ≠ vtail, phead ≠ first, phead0 ≠ vtail, qrl ≠ [], r0 ≠ phead, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + (qrl + vtail ') + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl + vtail ') + qrl0, vs0, ps0, owns0), markedp(qrl, ps0), markedp(rl1, vs0), markedp(qrl, vs0), markedp(rl1, ps0), nextnottid(tid, phead, vs0), nonullRetRefs((rl1 + first ' + qrl + vtail ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), vtail0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, r0 ∈ rl1 + first ' + qrl + vtail ' from phead, ¬ dups((rl1 + qrl) + qrl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl + qrl0), ¬ dups(rl1 + qrl), ¬ first ∈ qrl0, ¬ vtail ∈ rl1, ¬ vtail ∈ qrl, ¬ vtail ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ qrl, vs0[phead].next ≠ null ∧ vs0[vs0[phead].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead].next].deqID.tid)) = Claimed(vs0[vs0[phead].next].deqID.tid, vs0[vs0[phead].next].val), vtail0 = (vtail ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ qrl ∨ lst = vtail ∨ lst ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from ps0[first].next |
vs0[ps0[phead].next].deqID = Some(tid), Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, first ≠ ps0[phead].next, phead ≠ ps0[phead].next, phead ≠ first, phead0 ≠ ps0[phead].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + (rl + phead ') + ps0[phead].next ') + qrl0, vs0, ps0, owns0), listp(first ' + ((rl + phead ') + ps0[phead].next ') + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl, vs0), markedp(rl1, vs0), markedp(rl, ps0), nextnottid(tid, phead, vs0), nonullRetRefs((rl1 + first ' + (rl + phead ') + ps0[phead].next ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[first].deqID), some?(ps0[ps0[phead].next].deqID), some?(vs0[phead].deqID), some?(ps0[phead].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + (rl + phead ') + ps0[phead].next ') + qrl0 from lst, ¬ dups((rl1 + rl) + qrl0), ¬ dups(rl1), ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl + qrl0), ¬ dups(rl1 + rl), ¬ phead ∈ rl1, ¬ phead ∈ rl, ¬ phead ∈ qrl0, ¬ first ∈ qrl0, ¬ ps0[phead].next ∈ rl1, ¬ ps0[phead].next ∈ rl, ¬ ps0[phead].next ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ rl, vs0[phead].next ≠ null ∧ vs0[vs0[phead].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead].next].deqID.tid)) = Claimed(vs0[vs0[phead].next].deqID.tid, vs0[vs0[phead].next].val), vtail0 = (ps0[phead].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[phead].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl ∨ phead0 = phead, lst ∈ rl ∨ lst = phead ∨ lst = ps0[phead].next ∨ lst ∈ qrl0 ⊦ ps0[phead].next ≠ ps0[first].next ∧ ps0[phead].next ∈ (rl1 + first ' + (rl + phead ') + ps0[phead].next ') + qrl0 from ps0[first].next
Used simplifier rules: ⊦ some?(Some(tid)); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(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) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| vs0[ps0[phead].next].deqID = Some(tid), Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, first ≠ ps0[phead].next, phead ≠ ps0[phead].next, phead ≠ first, phead0 ≠ ps0[phead].next, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + (rl + phead ') + ps0[phead].next ') + qrl0, vs0, ps0, owns0), listp(first ' + ((rl + phead ') + ps0[phead].next ') + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl, vs0), markedp(rl1, vs0), markedp(rl, ps0), nextnottid(tid, phead, vs0), nonullRetRefs((rl1 + first ' + (rl + phead ') + ps0[phead].next ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[first].deqID), some?(ps0[ps0[phead].next].deqID), some?(vs0[phead].deqID), some?(ps0[phead].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + (rl + phead ') + ps0[phead].next ') + qrl0 from lst, ¬ dups((rl1 + rl) + qrl0), ¬ dups(rl1), ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl + qrl0), ¬ dups(rl1 + rl), ¬ phead ∈ rl1, ¬ phead ∈ rl, ¬ phead ∈ qrl0, ¬ first ∈ qrl0, ¬ ps0[phead].next ∈ rl1, ¬ ps0[phead].next ∈ rl, ¬ ps0[phead].next ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ rl, vs0[phead].next ≠ null ∧ vs0[vs0[phead].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead].next].deqID.tid)) = Claimed(vs0[vs0[phead].next].deqID.tid, vs0[vs0[phead].next].val), vtail0 = (ps0[phead].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[phead].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl ∨ phead0 = phead, lst ∈ rl ∨ lst = phead ∨ lst = ps0[phead].next ∨ lst ∈ qrl0 ⊦ ps0[phead].next ≠ ps0[first].next ∧ ps0[phead].next ∈ (rl1 + first ' + (rl + phead ') + ps0[phead].next ') + qrl0 from ps0[first].next |
⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid)
vs0[ps0[phead].next].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, first ≠ ps0[phead].next, phead ≠ ps0[phead].next, phead ≠ first, phead0 ≠ ps0[phead].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + ((rl + phead ') + ps0[phead].next ') + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + (rl + phead ') + ps0[phead].next ') + qrl0, vs0, ps0, owns0), markedp(rl, ps0), markedp(rl1, vs0), markedp(rl, vs0), markedp(rl1, ps0), nonullRetRefs((rl1 + first ' + (rl + phead ') + ps0[phead].next ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[phead].deqID), some?(vs0[phead].deqID), some?(ps0[ps0[phead].next].deqID), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), vtail0 ∈ (rl1 + first ' + (rl + phead ') + ps0[phead].next ') + 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), ¬ phead ∈ rl1, ¬ phead ∈ rl, ¬ phead ∈ qrl0, ¬ first ∈ qrl0, ¬ ps0[phead].next ∈ rl1, ¬ ps0[phead].next ∈ rl, ¬ ps0[phead].next ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ rl, vs0[phead].next ≠ null ∧ vs0[vs0[phead].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead].next].deqID.tid)) = Claimed(vs0[vs0[phead].next].deqID.tid, vs0[vs0[phead].next].val), vs0[phead].next ≠ null → vs0[vs0[phead].next].deqID ≠ Some(tid), lst ∈ rl ∨ lst = phead ∨ lst = ps0[phead].next ∨ lst ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl ∨ phead0 = phead, vtail0 = (ps0[phead].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[phead].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ ps0[phead].next ≠ ps0[first].next ∧ ps0[phead].next ∈ (rl1 + first ' + (rl + phead ') + ps0[phead].next ') + qrl0 from ps0[first].next
Used terms: tid, phead, vs0
| ⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid) |
| vs0[ps0[phead].next].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, first ≠ ps0[phead].next, phead ≠ ps0[phead].next, phead ≠ first, phead0 ≠ ps0[phead].next, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + ((rl + phead ') + ps0[phead].next ') + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + (rl + phead ') + ps0[phead].next ') + qrl0, vs0, ps0, owns0), markedp(rl, ps0), markedp(rl1, vs0), markedp(rl, vs0), markedp(rl1, ps0), nonullRetRefs((rl1 + first ' + (rl + phead ') + ps0[phead].next ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[phead].deqID), some?(vs0[phead].deqID), some?(ps0[ps0[phead].next].deqID), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), vtail0 ∈ (rl1 + first ' + (rl + phead ') + ps0[phead].next ') + 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), ¬ phead ∈ rl1, ¬ phead ∈ rl, ¬ phead ∈ qrl0, ¬ first ∈ qrl0, ¬ ps0[phead].next ∈ rl1, ¬ ps0[phead].next ∈ rl, ¬ ps0[phead].next ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ rl, vs0[phead].next ≠ null ∧ vs0[vs0[phead].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[phead].next].deqID.tid)) = Claimed(vs0[vs0[phead].next].deqID.tid, vs0[vs0[phead].next].val), vs0[phead].next ≠ null → vs0[vs0[phead].next].deqID ≠ Some(tid), lst ∈ rl ∨ lst = phead ∨ lst = ps0[phead].next ∨ lst ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl ∨ phead0 = phead, vtail0 = (ps0[phead].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[phead].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ ps0[phead].next ≠ ps0[first].next ∧ ps0[phead].next ∈ (rl1 + first ' + (rl + phead ') + ps0[phead].next ') + qrl0 from ps0[first].next |
⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])
Used simplifier rules: ⊦ 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) ⊦ some?(opttid) → opttid ≠ None; (as) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ ¬ listp(rl + null ' + rl0, vs, ps, owns); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps0, rl1 + first ' + rl, owns0, phead ' + ps0[phead].next ' + qrl0, vs0
| ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []) |
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, first ≠ vtail, r0 ≠ vhead0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + (qrl + vtail ') + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl + vtail ') + qrl0, vs0, ps0, owns0), markedp(qrl, ps0), markedp(rl1, vs0), markedp(qrl, vs0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs0), nonullRetRefs((rl1 + first ' + qrl + vtail ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), vtail0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, r0 ∈ qrl0, ¬ dups((rl1 + qrl) + qrl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl + qrl0), ¬ dups(rl1 + qrl), ¬ first ∈ qrl0, ¬ vtail ∈ rl1, ¬ vtail ∈ qrl, ¬ vtail ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ qrl, 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 = (vtail ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vhead0 ∈ rl1 ∨ vhead0 ∈ qrl ∨ vhead0 = vtail, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl ∨ phead0 = vtail, lst ∈ qrl ∨ lst = vtail ∨ lst ∈ qrl0, vtail = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + qrl).last = vhead0 ∧ phead0 ≠ vtail ∧ unmarkedp(qrl0, vs0) ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from ps0[first].next |
vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, first ≠ vtail, r0 ≠ vhead0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + qrl + vtail ') + qrl0, vs0, ps0, owns0), listp(first ' + (qrl + vtail ') + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(qrl, vs0), markedp(rl1, vs0), markedp(qrl, ps0), nextnottid(tid, vhead0, vs0), nonullRetRefs((rl1 + first ' + qrl + vtail ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[first].deqID), some?(vs0[vtail].deqID), some?(ps0[vtail].deqID), unmarkedp(qrl0, ps0), r0 ∈ qrl0, first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from lst, r0 ∈ vs0, r0 ∈ ps0, ¬ dups((rl1 + qrl) + qrl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl + qrl0), ¬ dups(rl1 + qrl), ¬ first ∈ qrl0, ¬ vtail ∈ rl1, ¬ vtail ∈ qrl, ¬ vtail ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ qrl, 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), vtail = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + qrl).last = vhead0 ∧ phead0 ≠ vtail ∧ unmarkedp(qrl0, vs0), lst ∈ qrl ∨ lst = vtail ∨ lst ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl ∨ phead0 = vtail, vhead0 ∈ rl1 ∨ vhead0 ∈ qrl ∨ vhead0 = vtail, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from ps0[first].next
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)
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, first ≠ vtail, r0 ≠ vhead0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + qrl + vtail ') + qrl0, vs0, ps0, owns0), listp(first ' + (qrl + vtail ') + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(qrl, vs0), markedp(rl1, vs0), markedp(qrl, ps0), nextnottid(tid, vhead0, vs0), nonullRetRefs((rl1 + first ' + qrl + vtail ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[first].deqID), some?(vs0[vtail].deqID), some?(ps0[vtail].deqID), unmarkedp(qrl0, ps0), r0 ∈ qrl0, first ∈ ps0, first ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, vretRefs0(tid) ∈ vrvHp0, vtail0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from lst, r0 ∈ vs0, r0 ∈ ps0, ¬ dups((rl1 + qrl) + qrl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl + qrl0), ¬ dups(rl1 + qrl), ¬ first ∈ qrl0, ¬ vtail ∈ rl1, ¬ vtail ∈ qrl, ¬ vtail ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ qrl, 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), vtail = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + qrl).last = vhead0 ∧ phead0 ≠ vtail ∧ unmarkedp(qrl0, vs0), lst ∈ qrl ∨ lst = vtail ∨ lst ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl ∨ phead0 = vtail, vhead0 ∈ rl1 ∨ vhead0 ∈ qrl ∨ vhead0 = vtail, vtail0 = qrl0.last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from ps0[first].next |
vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl0 = phead + qrl1, rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, first ≠ vtail, qrl0 ≠ [], r0 ≠ vhead0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + (qrl + vtail ') + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl + vtail ') + qrl0, vs0, ps0, owns0), markedp(qrl, ps0), markedp(rl1, vs0), markedp(qrl, vs0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs0), nonullRetRefs((rl1 + first ' + qrl + vtail ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), r0 ∈ ps0, r0 ∈ vs0, vtail0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, r0 ∈ qrl0, ¬ dups((rl1 + qrl) + qrl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl + qrl0), ¬ dups(rl1 + qrl), ¬ first ∈ qrl0, ¬ vtail ∈ rl1, ¬ vtail ∈ qrl, ¬ vtail ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ qrl, 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 ∨ qrl0 ≠ [] ∧ vtail0 = (vtail ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vhead0 ∈ rl1 ∨ vhead0 ∈ qrl ∨ vhead0 = vtail, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl ∨ phead0 = vtail, lst ∈ qrl ∨ lst = vtail ∨ lst ∈ qrl0, vtail = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl1, vs0)) ∨ (first ' + qrl).last = vhead0 ∧ phead0 ≠ vtail ∧ unmarkedp(qrl0, vs0) ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from ps0[first].next
Used simplifier rules: ⊦ ¬ a ∈ []; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl0, phead, y
| vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl0 = phead + qrl1, rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ lst, first ≠ vtail, qrl0 ≠ [], r0 ≠ vhead0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + (qrl + vtail ') + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + qrl + vtail ') + qrl0, vs0, ps0, owns0), markedp(qrl, ps0), markedp(rl1, vs0), markedp(qrl, vs0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs0), nonullRetRefs((rl1 + first ' + qrl + vtail ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), r0 ∈ ps0, r0 ∈ vs0, vtail0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, r0 ∈ qrl0, ¬ dups((rl1 + qrl) + qrl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl + qrl0), ¬ dups(rl1 + qrl), ¬ first ∈ qrl0, ¬ vtail ∈ rl1, ¬ vtail ∈ qrl, ¬ vtail ∈ qrl0, ¬ first ∈ rl1, ¬ first ∈ qrl, 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 ∨ qrl0 ≠ [] ∧ vtail0 = (vtail ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vhead0 ∈ rl1 ∨ vhead0 ∈ qrl ∨ vhead0 = vtail, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl ∨ phead0 = vtail, lst ∈ qrl ∨ lst = vtail ∨ lst ∈ qrl0, vtail = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl1, vs0)) ∨ (first ' + qrl).last = vhead0 ∧ phead0 ≠ vtail ∧ unmarkedp(qrl0, vs0) ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ (rl1 + first ' + qrl + vtail ') + qrl0 from ps0[first].next |
ps0[ps0[vtail].next].deqID = None, vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ ps0[vtail].next, first ≠ vtail, first ≠ lst, r0 ≠ vhead0, vhead0 ≠ first, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + qrl + vtail ' + ps0[vtail].next ' + qrl1, vs0, ps0, owns0), listp(rl1 + first ' + qrl + vtail ' + ps0[vtail].next ' + qrl1, vs0, ps0, owns0), markedp(qrl, ps0), markedp(rl1, vs0), markedp(qrl, vs0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs0), nonullRetRefs(rl1 + first ' + qrl + vtail ' + ps0[vtail].next ' + qrl1, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl1, ps0), r0 ∈ ps0, r0 ∈ vs0, vtail0 ∈ rl1 + first ' + qrl + vtail ' + ps0[vtail].next ' + qrl1 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, ¬ dups(rl1 + qrl), ¬ dups(qrl + qrl1), ¬ dups(rl1), ¬ dups(qrl1), ¬ dups(qrl), ¬ dups((rl1 + qrl) + qrl1), ¬ vtail ∈ qrl1, ¬ vtail ∈ qrl, ¬ vtail ∈ rl1, ¬ first ∈ qrl1, ¬ ps0[vtail].next ∈ qrl1, ¬ ps0[vtail].next ∈ qrl, ¬ ps0[vtail].next ∈ rl1, ¬ first ∈ qrl, ¬ first ∈ rl1, 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 = (ps0[vtail].next ' + qrl1).last ∨ vtail0 = (vtail ' + (ps0[vtail].next ' + qrl1).butlast).last ∧ vs0[(ps0[vtail].next ' + qrl1).last].deqID = None ∧ vs0[(ps0[vtail].next ' + qrl1).last].next = null, lst ∈ qrl ∨ lst = vtail ∨ lst = ps0[vtail].next ∨ lst ∈ qrl1, vtail = vhead0 ∧ unmarkedp(qrl1, vs0) ∨ (first ' + qrl).last = vhead0 ∧ phead0 ≠ vtail ∧ vs0[ps0[vtail].next].deqID = None ∧ unmarkedp(qrl1, vs0), r0 = ps0[vtail].next ∨ r0 ∈ qrl1, vhead0 ∈ rl1 ∨ vhead0 ∈ qrl ∨ vhead0 = vtail, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl ∨ phead0 = vtail ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ rl1 + first ' + qrl + vtail ' + ps0[vtail].next ' + qrl1 from ps0[first].next
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 = a ' + x; (s) ⊦ a ' + x ≠ []; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ 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)
| ps0[ps0[vtail].next].deqID = None, vs0[r0].deqID = Some(tid), Val(vs0[ps0[first].next].val) = vrvHp0[vretRefs0(tid)], Val(vs0[ps0[first].next].val) = prvHp0[vretRefs0(tid)], dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Claimed(tid, vs0[ps0[first].next].val), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, first ≠ ps0[vtail].next, first ≠ vtail, first ≠ lst, r0 ≠ vhead0, vhead0 ≠ first, vretRefs0(tid) ≠ null, vtail ≠ ps0[vtail].next, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + qrl + vtail ' + ps0[vtail].next ' + qrl1, vs0, ps0, owns0), listp(rl1 + first ' + qrl + vtail ' + ps0[vtail].next ' + qrl1, vs0, ps0, owns0), markedp(qrl, ps0), markedp(rl1, vs0), markedp(qrl, vs0), markedp(rl1, ps0), nextnottid(tid, vhead0, vs0), nonullRetRefs(rl1 + first ' + qrl + vtail ' + ps0[vtail].next ' + qrl1, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl1, ps0), r0 ∈ ps0, r0 ∈ vs0, vtail0 ∈ rl1 + first ' + qrl + vtail ' + ps0[vtail].next ' + qrl1 from lst, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ vs0, phead0 ∈ ps0, first ∈ vs0, first ∈ ps0, ¬ dups(rl1 + qrl), ¬ dups(qrl + qrl1), ¬ dups(rl1), ¬ dups(qrl1), ¬ dups(qrl), ¬ dups((rl1 + qrl) + qrl1), ¬ vtail ∈ qrl1, ¬ vtail ∈ qrl, ¬ vtail ∈ rl1, ¬ first ∈ qrl1, ¬ ps0[vtail].next ∈ qrl1, ¬ ps0[vtail].next ∈ qrl, ¬ ps0[vtail].next ∈ rl1, ¬ first ∈ qrl, ¬ first ∈ rl1, 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 = (ps0[vtail].next ' + qrl1).last ∨ vtail0 = (vtail ' + (ps0[vtail].next ' + qrl1).butlast).last ∧ vs0[(ps0[vtail].next ' + qrl1).last].deqID = None ∧ vs0[(ps0[vtail].next ' + qrl1).last].next = null, lst ∈ qrl ∨ lst = vtail ∨ lst = ps0[vtail].next ∨ lst ∈ qrl1, vtail = vhead0 ∧ unmarkedp(qrl1, vs0) ∨ (first ' + qrl).last = vhead0 ∧ phead0 ≠ vtail ∧ vs0[ps0[vtail].next].deqID = None ∧ unmarkedp(qrl1, vs0), r0 = ps0[vtail].next ∨ r0 ∈ qrl1, vhead0 ∈ rl1 ∨ vhead0 ∈ qrl ∨ vhead0 = vtail, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ qrl ∨ phead0 = vtail ⊦ r0 ≠ ps0[first].next ∧ r0 ∈ rl1 + first ' + qrl + vtail ' + ps0[vtail].next ' + qrl1 from ps0[first].next |
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) ⊦ 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) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ 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) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a + x = a ' + x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ markedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s)
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.