| ⊦ ( ( ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D25, a) ∧ pcstepf(gs, ls, D25, a) = D26 → ( lstepf(gs, ls, D25, a).first ∈ gstepf(gs, ls, D25, a).orl ∧ lstepf(gs, ls, D25, a).nxt ≠ null ∧ lstepf(gs, ls, D25, a).nxt = gstepf(gs, ls, D25, a).ps[lstepf(gs, ls, D25, a).first].next ∧ gstepf(gs, ls, D25, a).vs[lstepf(gs, ls, D25, a).nxt].deqID ≠ None ∧ gstepf(gs, ls, D25, a).vs[lstepf(gs, ls, D25, a).nxt].deqID = Some(lstepf(gs, ls, D25, a).othertid) ∧ lstepf(gs, ls, D25, a).optval = Val(gstepf(gs, ls, D25, a).vs[lstepf(gs, ls, D25, a).nxt].val) ∧ ( gstepf(gs, ls, D25, a).vhead = lstepf(gs, ls, D25, a).first → gstepf(gs, ls, D25, a).rvowns(gstepf(gs, ls, D25, a).vretRefs(lstepf(gs, ls, D25, a).othertid)) = Claimed(lstepf(gs, ls, D25, a).othertid, lstepf(gs, ls, D25, a).optval.val))) ∧ ( listp (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vs, gstepf(gs, ls, D25, a).ps, gstepf(gs, ls, D25, a).owns) ∧ ¬ dups(gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl) ∧ markedp(gstepf(gs, ls, D25, a).orl, gstepf(gs, ls, D25, a).ps) ∧ markedp(gstepf(gs, ls, D25, a).orl, gstepf(gs, ls, D25, a).vs) ∧ unmarkedp(gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).ps) ∧ gstepf(gs, ls, D25, a).orl ≠ [] ∧ gstepf(gs, ls, D25, a).phead ∈ gstepf(gs, ls, D25, a).orl ∧ rvownerok(gstepf(gs, ls, D25, a).vretRefs, gstepf(gs, ls, D25, a).vrvHp, gstepf(gs, ls, D25, a).rvowns) ∧ allocrv(gstepf(gs, ls, D25, a).vretRefs, gstepf(gs, ls, D25, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vs, gstepf(gs, ls, D25, a).vretRefs, gstepf(gs, ls, D25, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D25, a).pretRefs, gstepf(gs, ls, D25, a).prvHp, gstepf(gs, ls, D25, a).rvowns) ∧ allocrv(gstepf(gs, ls, D25, a).pretRefs, gstepf(gs, ls, D25, a).prvHp) ∧ dom gstepf(gs, ls, D25, a).vrvHp = dom gstepf(gs, ls, D25, a).prvHp ∧ ( gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next ≠ null ∧ gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D25, a).rvowns (gstepf(gs, ls, D25, a).vretRefs(gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].deqID.tid, gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D25, a).orl.last = gstepf(gs, ls, D25, a).vhead ∧ (gstepf(gs, ls, D25, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D25, a).qrl.tail, gstepf(gs, ls, D25, a).vs)) ∨ gstepf(gs, ls, D25, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D25, a).orl.butlast.last = gstepf(gs, ls, D25, a).vhead ∧ gstepf(gs, ls, D25, a).phead ≠ gstepf(gs, ls, D25, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vs)) ∧ ( gstepf(gs, ls, D25, a).vtail = (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl).last ∨ gstepf(gs, ls, D25, a).qrl ≠ [] ∧ gstepf(gs, ls, D25, a).vtail = (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl.butlast).last ∧ gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D25, a).vs[(gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D25, a).success ∧ gstepf(gs, ls, D25, a).rvowns(gstepf(gs, ls, D25, a).vretRefs(lstepf(gs, ls, D25, a).tid)) = Pending(lstepf(gs, ls, D25, a).tid)) ∧ ( lstepf(gs, ls, D25, a).first ≠ lstepf(gs, ls, D25, a).lst ∧ gstepf(gs, ls, D25, a).vtail ∈ gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl from lstepf(gs, ls, D25, a).lst) ∧ lstepf(gs, ls, D25, a).lst ∈ gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl from lstepf(gs, ls, D25, a).first ∧ ( gstepf(gs, ls, D25, a).vretRefs(lstepf(gs, ls, D25, a).tid) = lstepf(gs, ls, D25, a).rvref ∧ gstepf(gs, ls, D25, a).pretRefs(lstepf(gs, ls, D25, a).tid) = lstepf(gs, ls, D25, a).rvref ∧ lstepf(gs, ls, D25, a).rvref ∈ gstepf(gs, ls, D25, a).vrvHp ∧ lstepf(gs, ls, D25, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D25, a).tid, gstepf(gs, ls, D25, a).vhead, gstepf(gs, ls, D25, a).vs) ∧ noid (lstepf(gs, ls, D25, a).tid, gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vhead, gstepf(gs, ls, D25, a).vs) ∧ noowns(lstepf(gs, ls, D25, a).tid, gstepf(gs, ls, D25, a).owns) |
ls.nxt = gs.ps[ls.first].next, ls.optval = Val(gs.vs[ls.nxt].val), gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, D25, a) = D26, gs.vs[ls.nxt].deqID ≠ None, ls.first ≠ ls.lst, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), pre(gs, ls, D25, 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, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( lstepf(gs, ls, D25, a).first ∈ gstepf(gs, ls, D25, a).orl ∧ lstepf(gs, ls, D25, a).nxt ≠ null ∧ lstepf(gs, ls, D25, a).nxt = gstepf(gs, ls, D25, a).ps[lstepf(gs, ls, D25, a).first].next ∧ gstepf(gs, ls, D25, a).vs[lstepf(gs, ls, D25, a).nxt].deqID ≠ None ∧ gstepf(gs, ls, D25, a).vs[lstepf(gs, ls, D25, a).nxt].deqID = Some(lstepf(gs, ls, D25, a).othertid) ∧ lstepf(gs, ls, D25, a).optval = Val(gstepf(gs, ls, D25, a).vs[lstepf(gs, ls, D25, a).nxt].val) ∧ ( gstepf(gs, ls, D25, a).vhead = lstepf(gs, ls, D25, a).first → gstepf(gs, ls, D25, a).rvowns(gstepf(gs, ls, D25, a).vretRefs(lstepf(gs, ls, D25, a).othertid)) = Claimed(lstepf(gs, ls, D25, a).othertid, lstepf(gs, ls, D25, a).optval.val))) ∧ ( listp (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vs, gstepf(gs, ls, D25, a).ps, gstepf(gs, ls, D25, a).owns) ∧ ¬ dups(gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl) ∧ markedp(gstepf(gs, ls, D25, a).orl, gstepf(gs, ls, D25, a).ps) ∧ markedp(gstepf(gs, ls, D25, a).orl, gstepf(gs, ls, D25, a).vs) ∧ unmarkedp(gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).ps) ∧ gstepf(gs, ls, D25, a).orl ≠ [] ∧ gstepf(gs, ls, D25, a).phead ∈ gstepf(gs, ls, D25, a).orl ∧ rvownerok(gstepf(gs, ls, D25, a).vretRefs, gstepf(gs, ls, D25, a).vrvHp, gstepf(gs, ls, D25, a).rvowns) ∧ allocrv(gstepf(gs, ls, D25, a).vretRefs, gstepf(gs, ls, D25, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vs, gstepf(gs, ls, D25, a).vretRefs, gstepf(gs, ls, D25, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D25, a).pretRefs, gstepf(gs, ls, D25, a).prvHp, gstepf(gs, ls, D25, a).rvowns) ∧ allocrv(gstepf(gs, ls, D25, a).pretRefs, gstepf(gs, ls, D25, a).prvHp) ∧ dom gstepf(gs, ls, D25, a).vrvHp = dom gstepf(gs, ls, D25, a).prvHp ∧ ( gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next ≠ null ∧ gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D25, a).rvowns (gstepf(gs, ls, D25, a).vretRefs(gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].deqID.tid, gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D25, a).orl.last = gstepf(gs, ls, D25, a).vhead ∧ (gstepf(gs, ls, D25, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D25, a).qrl.tail, gstepf(gs, ls, D25, a).vs)) ∨ gstepf(gs, ls, D25, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D25, a).orl.butlast.last = gstepf(gs, ls, D25, a).vhead ∧ gstepf(gs, ls, D25, a).phead ≠ gstepf(gs, ls, D25, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vs)) ∧ ( gstepf(gs, ls, D25, a).vtail = (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl).last ∨ gstepf(gs, ls, D25, a).qrl ≠ [] ∧ gstepf(gs, ls, D25, a).vtail = (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl.butlast).last ∧ gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D25, a).vs[(gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D25, a).success ∧ gstepf(gs, ls, D25, a).rvowns(gstepf(gs, ls, D25, a).vretRefs(lstepf(gs, ls, D25, a).tid)) = Pending(lstepf(gs, ls, D25, a).tid)) ∧ ( lstepf(gs, ls, D25, a).first ≠ lstepf(gs, ls, D25, a).lst ∧ gstepf(gs, ls, D25, a).vtail ∈ gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl from lstepf(gs, ls, D25, a).lst) ∧ lstepf(gs, ls, D25, a).lst ∈ gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl from lstepf(gs, ls, D25, a).first ∧ ( gstepf(gs, ls, D25, a).vretRefs(lstepf(gs, ls, D25, a).tid) = lstepf(gs, ls, D25, a).rvref ∧ gstepf(gs, ls, D25, a).pretRefs(lstepf(gs, ls, D25, a).tid) = lstepf(gs, ls, D25, a).rvref ∧ lstepf(gs, ls, D25, a).rvref ∈ gstepf(gs, ls, D25, a).vrvHp ∧ lstepf(gs, ls, D25, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D25, a).tid, gstepf(gs, ls, D25, a).vhead, gstepf(gs, ls, D25, a).vs) ∧ noid(lstepf(gs, ls, D25, a).tid, gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vhead, gstepf(gs, ls, D25, a).vs) ∧ noowns(lstepf(gs, ls, D25, a).tid, gstepf(gs, ls, D25, a).owns)
| ls.nxt = gs.ps[ls.first].next, ls.optval = Val(gs.vs[ls.nxt].val), gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, D25, a) = D26, gs.vs[ls.nxt].deqID ≠ None, ls.first ≠ ls.lst, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), pre(gs, ls, D25, 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, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( lstepf(gs, ls, D25, a).first ∈ gstepf(gs, ls, D25, a).orl ∧ lstepf(gs, ls, D25, a).nxt ≠ null ∧ lstepf(gs, ls, D25, a).nxt = gstepf(gs, ls, D25, a).ps[lstepf(gs, ls, D25, a).first].next ∧ gstepf(gs, ls, D25, a).vs[lstepf(gs, ls, D25, a).nxt].deqID ≠ None ∧ gstepf(gs, ls, D25, a).vs[lstepf(gs, ls, D25, a).nxt].deqID = Some(lstepf(gs, ls, D25, a).othertid) ∧ lstepf(gs, ls, D25, a).optval = Val(gstepf(gs, ls, D25, a).vs[lstepf(gs, ls, D25, a).nxt].val) ∧ ( gstepf(gs, ls, D25, a).vhead = lstepf(gs, ls, D25, a).first → gstepf(gs, ls, D25, a).rvowns(gstepf(gs, ls, D25, a).vretRefs(lstepf(gs, ls, D25, a).othertid)) = Claimed(lstepf(gs, ls, D25, a).othertid, lstepf(gs, ls, D25, a).optval.val))) ∧ ( listp (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vs, gstepf(gs, ls, D25, a).ps, gstepf(gs, ls, D25, a).owns) ∧ ¬ dups(gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl) ∧ markedp(gstepf(gs, ls, D25, a).orl, gstepf(gs, ls, D25, a).ps) ∧ markedp(gstepf(gs, ls, D25, a).orl, gstepf(gs, ls, D25, a).vs) ∧ unmarkedp(gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).ps) ∧ gstepf(gs, ls, D25, a).orl ≠ [] ∧ gstepf(gs, ls, D25, a).phead ∈ gstepf(gs, ls, D25, a).orl ∧ rvownerok(gstepf(gs, ls, D25, a).vretRefs, gstepf(gs, ls, D25, a).vrvHp, gstepf(gs, ls, D25, a).rvowns) ∧ allocrv(gstepf(gs, ls, D25, a).vretRefs, gstepf(gs, ls, D25, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vs, gstepf(gs, ls, D25, a).vretRefs, gstepf(gs, ls, D25, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D25, a).pretRefs, gstepf(gs, ls, D25, a).prvHp, gstepf(gs, ls, D25, a).rvowns) ∧ allocrv(gstepf(gs, ls, D25, a).pretRefs, gstepf(gs, ls, D25, a).prvHp) ∧ dom gstepf(gs, ls, D25, a).vrvHp = dom gstepf(gs, ls, D25, a).prvHp ∧ ( gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next ≠ null ∧ gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D25, a).rvowns (gstepf(gs, ls, D25, a).vretRefs(gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].deqID.tid, gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D25, a).orl.last = gstepf(gs, ls, D25, a).vhead ∧ (gstepf(gs, ls, D25, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D25, a).qrl.tail, gstepf(gs, ls, D25, a).vs)) ∨ gstepf(gs, ls, D25, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D25, a).orl.butlast.last = gstepf(gs, ls, D25, a).vhead ∧ gstepf(gs, ls, D25, a).phead ≠ gstepf(gs, ls, D25, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vs)) ∧ ( gstepf(gs, ls, D25, a).vtail = (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl).last ∨ gstepf(gs, ls, D25, a).qrl ≠ [] ∧ gstepf(gs, ls, D25, a).vtail = (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl.butlast).last ∧ gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D25, a).vs[(gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D25, a).success ∧ gstepf(gs, ls, D25, a).rvowns(gstepf(gs, ls, D25, a).vretRefs(lstepf(gs, ls, D25, a).tid)) = Pending(lstepf(gs, ls, D25, a).tid)) ∧ ( lstepf(gs, ls, D25, a).first ≠ lstepf(gs, ls, D25, a).lst ∧ gstepf(gs, ls, D25, a).vtail ∈ gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl from lstepf(gs, ls, D25, a).lst) ∧ lstepf(gs, ls, D25, a).lst ∈ gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl from lstepf(gs, ls, D25, a).first ∧ ( gstepf(gs, ls, D25, a).vretRefs(lstepf(gs, ls, D25, a).tid) = lstepf(gs, ls, D25, a).rvref ∧ gstepf(gs, ls, D25, a).pretRefs(lstepf(gs, ls, D25, a).tid) = lstepf(gs, ls, D25, a).rvref ∧ lstepf(gs, ls, D25, a).rvref ∈ gstepf(gs, ls, D25, a).vrvHp ∧ lstepf(gs, ls, D25, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D25, a).tid, gstepf(gs, ls, D25, a).vhead, gstepf(gs, ls, D25, a).vs) ∧ noid(lstepf(gs, ls, D25, a).tid, gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vhead, gstepf(gs, ls, D25, a).vs) ∧ noowns(lstepf(gs, ls, D25, a).tid, gstepf(gs, ls, D25, a).owns) |
ls.nxt = gs.ps[ls.first].next, ls.optval = Val(gs.vs[ls.nxt].val), gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(ls.rvref) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, gs.vs[ls.nxt].deqID ≠ None, gs.vs[ls.nxt].deqID ≠ Some((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid), ls.first ≠ ls.lst, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.rvref ∈ gs.vrvHp, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, gs.phead ∈ gs.orl, ls.first ∈ gs.orl, gs.phead ∈ gs.vs, ls.first ∈ gs.vs, gs.phead ∈ gs.ps, ls.first ∈ gs.ps, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, gs.vs[ls.nxt].val), 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), ls.lst ∈ gs.orl from ls.first ∨ ls.lst ∈ gs.qrl, 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 ⊦
Used simplifier rules: ⊦ Val(val).val = val; (s) ⊦ gstepf(gs, ls, D25, τ) = gs; (s) ⊦ (ls.othertid:= tid0).tid = ls.tid; (s) ⊦ lstepf(gs, ls, D25, τ) = ls.othertid:= (gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid; (s) ⊦ (ls.othertid:= tid0).rvref = ls.rvref; (s) ⊦ (ls.othertid:= tid0).lst = ls.lst; (s) ⊦ (ls.othertid:= tid0).first = ls.first; (s) ⊦ (ls.othertid:= tid0).success ↔ ls.success; (s) ⊦ (ls.othertid:= tid0).optval = ls.optval; (s) ⊦ (ls.othertid:= tid0).othertid = tid0; (s) ⊦ (ls.othertid:= tid0).nxt = ls.nxt; (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 ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ pre(gs, ls, D25, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D25, a) = D26; (s)
| ls.nxt = gs.ps[ls.first].next, ls.optval = Val(gs.vs[ls.nxt].val), gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(ls.rvref) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, gs.vs[ls.nxt].deqID ≠ None, gs.vs[ls.nxt].deqID ≠ Some((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid), ls.first ≠ ls.lst, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.rvref ∈ gs.vrvHp, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, gs.phead ∈ gs.orl, ls.first ∈ gs.orl, gs.phead ∈ gs.vs, ls.first ∈ gs.vs, gs.phead ∈ gs.ps, ls.first ∈ gs.ps, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, gs.vs[ls.nxt].val), 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), ls.lst ∈ gs.orl from ls.first ∨ ls.lst ∈ gs.qrl, 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.nxt = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, vs[ls.nxt].deqID ≠ None, vs[ls.nxt].deqID ≠ Some((ps ⊕ vs)[ls.nxt].deqID.tid), ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), ls.first ∈ ps, phead ∈ ps, ls.first ∈ vs, phead ∈ vs, ls.first ∈ orl, phead ∈ orl, vtail ∈ orl + qrl from ls.lst, ls.rvref ∈ vrvHp, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = ls.first → rvowns(vretRefs((ps ⊕ vs)[ls.nxt].deqID.tid)) = Claimed((ps ⊕ vs)[ls.nxt].deqID.tid, vs[ls.nxt].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ls.lst ∈ orl from ls.first ∨ ls.lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ((ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns); (elim) Used terms: qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs
| ls.nxt = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, vs[ls.nxt].deqID ≠ None, vs[ls.nxt].deqID ≠ Some((ps ⊕ vs)[ls.nxt].deqID.tid), ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), ls.first ∈ ps, phead ∈ ps, ls.first ∈ vs, phead ∈ vs, ls.first ∈ orl, phead ∈ orl, vtail ∈ orl + qrl from ls.lst, ls.rvref ∈ vrvHp, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = ls.first → rvowns(vretRefs((ps ⊕ vs)[ls.nxt].deqID.tid)) = Claimed((ps ⊕ vs)[ls.nxt].deqID.tid, vs[ls.nxt].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ls.lst ∈ orl from ls.first ∨ ls.lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
ls.nxt = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), dom vrvHp = dom prvHp, pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, vs[ls.nxt].deqID ≠ None, vs[ls.nxt].deqID ≠ Some((ps ⊕ vs)[ls.nxt].deqID.tid), ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), ls.rvref ∈ vrvHp, vtail ∈ orl + qrl from ls.lst, phead ∈ orl, ls.first ∈ orl, phead ∈ vs, ls.first ∈ vs, phead ∈ ps, ls.first ∈ ps, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vhead = ls.first → rvowns(vretRefs((ps ⊕ vs)[ls.nxt].deqID.tid)) = Claimed((ps ⊕ vs)[ls.nxt].deqID.tid, vs[ls.nxt].val), vs[vhead].next ≠ null ∧ vs[vs[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 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ
| ls.nxt = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), dom vrvHp = dom prvHp, pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, vs[ls.nxt].deqID ≠ None, vs[ls.nxt].deqID ≠ Some((ps ⊕ vs)[ls.nxt].deqID.tid), ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), ls.rvref ∈ vrvHp, vtail ∈ orl + qrl from ls.lst, phead ∈ orl, ls.first ∈ orl, phead ∈ vs, ls.first ∈ vs, phead ∈ ps, ls.first ∈ ps, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vhead = ls.first → rvowns(vretRefs((ps ⊕ vs)[ls.nxt].deqID.tid)) = Claimed((ps ⊕ vs)[ls.nxt].deqID.tid, vs[ls.nxt].val), vs[vhead].next ≠ null ∧ vs[vs[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 ⊦ |
dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), nxt = ps[first].next, optval = Val(vs[nxt].val), pretRefs(tid) = rvref, rvowns(rvref) = Pending(tid), ¬ success, vretRefs(tid) = rvref, vs[nxt].deqID ≠ None, vs[nxt].deqID ≠ Some((ps ⊕ vs)[nxt].deqID.tid), first ≠ lst, nxt ≠ null, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, phead ∈ ps, first ∈ vs, phead ∈ vs, first ∈ orl, phead ∈ orl, vtail ∈ orl + qrl from lst, rvref ∈ vrvHp, ¬ 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 → rvowns(vretRefs((ps ⊕ vs)[nxt].deqID.tid)) = Claimed((ps ⊕ vs)[nxt].deqID.tid, vs[nxt].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ( (tid = ls.tid ∧ value = ls.value) ∧ optval = ls.optval) ∧ node = ls.node) ∧ nd = ls.nd) ∧ (success ↔ ls.success)) ∧ lst = ls.lst) ∧ nxt = ls.nxt) ∧ rvref = ls.rvref) ∧ optval0 = ls.optval0) ∧ first = ls.first) ∧ othertid = ls.othertid) ∧ addr = ls.addr ↔ ls = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr); (elim) Used terms: value, nxt, optval, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval
| dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), nxt = ps[first].next, optval = Val(vs[nxt].val), pretRefs(tid) = rvref, rvowns(rvref) = Pending(tid), ¬ success, vretRefs(tid) = rvref, vs[nxt].deqID ≠ None, vs[nxt].deqID ≠ Some((ps ⊕ vs)[nxt].deqID.tid), first ≠ lst, nxt ≠ null, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, phead ∈ ps, first ∈ vs, phead ∈ vs, first ∈ orl, phead ∈ orl, vtail ∈ orl + qrl from lst, rvref ∈ vrvHp, ¬ 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 → rvowns(vretRefs((ps ⊕ vs)[nxt].deqID.tid)) = Claimed((ps ⊕ vs)[nxt].deqID.tid, vs[nxt].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps ⊕ vs)[ps[first].next].deqID.tid), ps[first].next ≠ null, first ≠ lst, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, phead ∈ orl, first ∈ orl, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vhead = first → rvowns(vretRefs((ps ⊕ vs)[ps[first].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[first].next].deqID.tid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[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 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps ⊕ vs)[ps[first].next].deqID.tid), ps[first].next ≠ null, first ≠ lst, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, phead ∈ orl, first ∈ orl, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vhead = first → rvowns(vretRefs((ps ⊕ vs)[ps[first].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[first].next].deqID.tid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
⊦ (ps ⊕ vs)[r] = (r ∈ vs ⊃ vs[r];ps[r])
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, first ∈ orl, phead ∈ orl, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ 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 → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used terms: ps, vs, ps[first].next
| ⊦ (ps ⊕ vs)[r] = (r ∈ vs ⊃ vs[r];ps[r]) |
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, first ∈ orl, phead ∈ orl, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ 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 → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ listp(rl + rl0, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + rl0, vs, ps, owns))
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, phead ∈ orl, first ∈ orl, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vhead = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp(orl + qrl, vs, ps, owns) ∧ first ∈ orl → (∃ rl1, rl2. orl = rl1 + first ' + rl2 ∧ listp(first ' + rl2 + qrl, vs, ps, owns)), 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 ⊦
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)) |
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, phead ∈ orl, first ∈ orl, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vhead = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp(orl + qrl, vs, ps, owns) ∧ first ∈ orl → (∃ rl1, rl2. orl = rl1 + first ' + rl2 ∧ listp(first ' + rl2 + qrl, vs, ps, owns)), 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 ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, 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), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ 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 → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), 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), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦
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 ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (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)
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, 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), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ 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 → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), 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), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦ |
(first ' + rl2).last = vhead, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, 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), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, 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, vhead = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, 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 ⊦
(rl1 + (first ' + rl2).butlast).last = vhead, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rl1 + (first ' + rl2).butlast ≠ [], vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, phead ≠ (first ' + rl2).last, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, 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), unmarkedp(qrl, vs), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, 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, vhead = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, 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 ⊦
| (first ' + rl2).last = vhead, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, 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), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, 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, vhead = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, 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 ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, (first ' + rl2).last, vs), noid(tid, (rl1 + first ' + rl2) + qrl, (first ' + rl2).last, 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), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[(first ' + rl2).last].next ≠ null ∧ vs[vs[(first ' + rl2).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + rl2).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + rl2).last].next].deqID.tid, vs[vs[(first ' + rl2).last].next].val), (first ' + rl2).last = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), 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, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, (first ' + rl2).last, vs), noid(tid, (rl1 + first ' + rl2) + qrl, (first ' + rl2).last, 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), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[(first ' + rl2).last].next ≠ null ∧ vs[vs[(first ' + rl2).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + rl2).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + rl2).last].next].deqID.tid, vs[vs[(first ' + rl2).last].next].val), (first ' + rl2).last = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), 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, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl2 = [], rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, (first ' + rl2).last, vs), noid(tid, (rl1 + first ' + rl2) + qrl, (first ' + rl2).last, 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), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, 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, (first ' + rl2).last = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vs[(first ' + rl2).last].next ≠ null ∧ vs[vs[(first ' + rl2).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + rl2).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + rl2).last].next].deqID.tid, vs[vs[(first ' + rl2).last].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, 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 ⊦
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, rl2 ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, rl2.last, vs), noid(tid, (rl1 + first ' + rl2) + qrl, rl2.last, 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), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, 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, rl2.last = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vs[rl2.last].next ≠ null ∧ vs[vs[rl2.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[rl2.last].next].deqID.tid)) = Claimed(vs[vs[rl2.last].next].deqID.tid, vs[vs[rl2.last].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, 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 ⊦
Used terms: first ', rl2
| ⊦ y ≠ [] → (x + y).last = y.last |
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl2 = [], rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, (first ' + rl2).last, vs), noid(tid, (rl1 + first ' + rl2) + qrl, (first ' + rl2).last, 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), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, 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, (first ' + rl2).last = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vs[(first ' + rl2).last].next ≠ null ∧ vs[vs[(first ' + rl2).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + rl2).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + rl2).last].next].deqID.tid, vs[vs[(first ' + rl2).last].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, 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 ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, qrl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + qrl, vs, ps, owns), listp(rl1 + first ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + qrl, first, vs), nonullRetRefs(rl1 + first ' + 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), unmarkedp(qrl.tail, vs), lst ∈ ps, lst ∈ vs, lst ∈ qrl, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl1 + qrl), ¬ first ∈ rl1, ¬ first ∈ qrl, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead ∈ rl1 ∨ phead = first, vtail = qrl.last ∨ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ 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) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ unmarkedp([], vs); (s) 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 ∈ x → (b ' + x).last = x.last; (s) ⊦ a '.last = a; (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, qrl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + qrl, vs, ps, owns), listp(rl1 + first ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + qrl, first, vs), nonullRetRefs(rl1 + first ' + 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), unmarkedp(qrl.tail, vs), lst ∈ ps, lst ∈ vs, lst ∈ qrl, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl1 + qrl), ¬ first ∈ rl1, ¬ first ∈ qrl, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead ∈ rl1 ∨ phead = first, vtail = qrl.last ∨ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = phead0 + rl, rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, qrl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + qrl, vs, ps, owns), listp(first ' + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + qrl, first, vs), nonullRetRefs(rl1 + first ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + qrl from lst, vretRefs(tid) ∈ vrvHp, lst ∈ qrl, lst ∈ vs, lst ∈ ps, ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl1 + qrl), ¬ first ∈ rl1, ¬ first ∈ qrl, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), vtail = qrl.last ∨ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, tail
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = phead0 + rl, rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, qrl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + qrl, vs, ps, owns), listp(first ' + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + qrl, first, vs), nonullRetRefs(rl1 + first ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + qrl from lst, vretRefs(tid) ∈ vrvHp, lst ∈ qrl, lst ∈ vs, lst ∈ ps, ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl1 + qrl), ¬ first ∈ rl1, ¬ first ∈ qrl, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), vtail = qrl.last ∨ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ⊦ |
ps[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid)) = Claimed((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid, vs[vs[first].next].val), rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), vs[vs[first].next].deqID ≠ None, vs[vs[first].next].deqID ≠ Some((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid), vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps, owns), listp(vs[first].next ' + rl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + vs[first].next ' + rl from lst, vretRefs(tid) ∈ vrvHp, lst ∈ vs, lst ∈ ps, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, phead ∈ rl1 ∨ phead = first, vtail = (vs[first].next ' + rl).last ∨ vtail = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦
Used simplifier rules: 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 ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ' + x ≠ []; (s)
| ps[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid)) = Claimed((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid, vs[vs[first].next].val), rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), vs[vs[first].next].deqID ≠ None, vs[vs[first].next].deqID ≠ Some((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid), vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps, owns), listp(vs[first].next ' + rl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + vs[first].next ' + rl from lst, vretRefs(tid) ∈ vrvHp, lst ∈ vs, lst ∈ ps, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, phead ∈ rl1 ∨ phead = first, vtail = (vs[first].next ' + rl).last ∨ vtail = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦ |
ps[vs[first].next].deqID = None, ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid, vs[vs[first].next].val), vs[vs[first].next].deqID ≠ None, vs[vs[first].next].deqID ≠ Some((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid), vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps), unmarkedp(rl, vs), lst ∈ ps, lst ∈ vs, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + rl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, vs[first].next ∈ vs, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, lst = vs[first].next ∨ lst ∈ rl, vtail = (vs[first].next ' + rl).last ∨ vtail = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, phead ∈ rl1 ∨ phead = first ⊦
ps[vs[first].next].deqID = None, ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs(ps[vs[first].next].deqID.tid)) = Claimed((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid, vs[vs[first].next].val), vs[vs[first].next].deqID ≠ None, vs[vs[first].next].deqID ≠ Some((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid), vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps), unmarkedp(rl, vs), lst ∈ ps, lst ∈ vs, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + rl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ vs, ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, lst = vs[first].next ∨ lst ∈ rl, vtail = (vs[first].next ' + rl).last ∨ vtail = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, phead ∈ rl1 ∨ phead = first ⊦
| ps[vs[first].next].deqID = None, ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid, vs[vs[first].next].val), vs[vs[first].next].deqID ≠ None, vs[vs[first].next].deqID ≠ Some((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid), vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps), unmarkedp(rl, vs), lst ∈ ps, lst ∈ vs, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + rl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, vs[first].next ∈ vs, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, lst = vs[first].next ∨ lst ∈ rl, vtail = (vs[first].next ' + rl).last ∨ vtail = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, phead ∈ rl1 ∨ phead = first ⊦ |
ps[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), vs[vs[first].next].deqID ≠ None, vs[vs[first].next].deqID ≠ Some(vs[vs[first].next].deqID.tid), vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps, owns), listp(vs[first].next ' + rl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps), vs[first].next ∈ vs, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + vs[first].next ' + rl from lst, vretRefs(tid) ∈ vrvHp, lst ∈ vs, lst ∈ ps, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, phead ∈ rl1 ∨ phead = first, vtail = (vs[first].next ' + rl).last ∨ vtail = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦
| ps[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), vs[vs[first].next].deqID ≠ None, vs[vs[first].next].deqID ≠ Some(vs[vs[first].next].deqID.tid), vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps, owns), listp(vs[first].next ' + rl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps), vs[first].next ∈ vs, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + vs[first].next ' + rl from lst, vretRefs(tid) ∈ vrvHp, lst ∈ vs, lst ∈ ps, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, phead ∈ rl1 ∨ phead = first, vtail = (vs[first].next ' + rl).last ∨ vtail = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, lst = vs[first].next ∨ lst ∈ rl ⊦ |
ps[vs[first].next].deqID = None, ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, Weak(tid0) = vs[vs[first].next].deqID, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[vs[first].next].deqID ≠ Some(vs[vs[first].next].deqID.tid), vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps), unmarkedp(rl, vs), lst ∈ ps, lst ∈ vs, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + rl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, vs[first].next ∈ vs, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, lst = vs[first].next ∨ lst ∈ rl, vtail = (vs[first].next ' + rl).last ∨ vtail = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, phead ∈ rl1 ∨ phead = first ⊦
Used simplifier rules: OptTid freely generated by None, Some, Weak;; ⊦ Some(tid).tid = tid; (s) ⊦ Some(tid) = Some(tid0) ↔ tid = tid0; (s)
| ps[vs[first].next].deqID = None, ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, Weak(tid0) = vs[vs[first].next].deqID, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[vs[first].next].deqID ≠ Some(vs[vs[first].next].deqID.tid), vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps), unmarkedp(rl, vs), lst ∈ ps, lst ∈ vs, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + rl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, vs[first].next ∈ vs, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, lst = vs[first].next ∨ lst ∈ rl, vtail = (vs[first].next ' + rl).last ∨ vtail = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, phead ∈ rl1 ∨ phead = first ⊦ |
ps[vs[first].next].deqID = None, ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, Weak(tid0) = vs[vs[first].next].deqID, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[first].next].val), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps), unmarkedp(rl, vs), lst ∈ ps, lst ∈ vs, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + rl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, vs[first].next ∈ vs, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl, lst = vs[first].next ∨ lst ∈ rl, vtail = (vs[first].next ' + rl).last ∨ vtail = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, phead ∈ rl1 ∨ phead = first ⊦
Used simplifier rules: ⊦ None ≠ Weak(tid); (s) ⊦ Some(tid) ≠ Weak(tid0); (s) ⊦ Weak(tid).tid = tid; (s)
| ps[vs[first].next].deqID = None, ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, Weak(tid0) = vs[vs[first].next].deqID, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[first].next].val), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps), unmarkedp(rl, vs), lst ∈ ps, lst ∈ vs, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + rl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, vs[first].next ∈ vs, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl, lst = vs[first].next ∨ lst ∈ rl, vtail = (vs[first].next ' + rl).last ∨ vtail = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, phead ∈ rl1 ∨ phead = first ⊦ |
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) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ a + x = a ' + x; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ weak?(Weak(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) ⊦ ¬ a ∈ []; (s) ⊦ a '.butlast = []; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ b ' ↔ a = b; (s)
| ps[vs[first].next].deqID = None, ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs(ps[vs[first].next].deqID.tid)) = Claimed((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid, vs[vs[first].next].val), vs[vs[first].next].deqID ≠ None, vs[vs[first].next].deqID ≠ Some((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid), vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps), unmarkedp(rl, vs), lst ∈ ps, lst ∈ vs, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + rl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ vs, ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, lst = vs[first].next ∨ lst ∈ rl, vtail = (vs[first].next ' + rl).last ∨ vtail = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[(vs[first].next ' + rl).last].deqID = None ∧ vs[(vs[first].next ' + rl).last].next = null, phead ∈ rl1 ∨ phead = first ⊦ |
ps[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(None.tid)) = Claimed(None.tid, ∅[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs(∅[vs[first].next].deqID.tid)) = Claimed(∅[vs[first].next].deqID.tid, ∅[vs[first].next].val), ∅[vs[first].next].deqID ≠ None, ∅[vs[first].next].deqID ≠ Some(None.tid), vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps, owns), listp(vs[first].next ' + rl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + vs[first].next ' + rl from lst, vretRefs(tid) ∈ vrvHp, lst ∈ vs, lst ∈ ps, lst ∈ rl, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ vs, ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, phead ∈ rl1 ∨ phead = first, vtail = rl.last ∨ vtail = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[rl.last].deqID = None ∧ vs[rl.last].next = null ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s)
| ps[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = None, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(None.tid)) = Claimed(None.tid, ∅[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs(∅[vs[first].next].deqID.tid)) = Claimed(∅[vs[first].next].deqID.tid, ∅[vs[first].next].val), ∅[vs[first].next].deqID ≠ None, ∅[vs[first].next].deqID ≠ Some(None.tid), vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps, owns), listp(vs[first].next ' + rl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + vs[first].next ' + rl from lst, vretRefs(tid) ∈ vrvHp, lst ∈ vs, lst ∈ ps, lst ∈ rl, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ vs, ¬ first ∈ rl, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, phead ∈ rl1 ∨ phead = first, vtail = rl.last ∨ vtail = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[rl.last].deqID = None ∧ vs[rl.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] ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s)
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, rl2 ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, rl2.last, vs), noid(tid, (rl1 + first ' + rl2) + qrl, rl2.last, 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), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, 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, rl2.last = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vs[rl2.last].next ≠ null ∧ vs[vs[rl2.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[rl2.last].next].deqID.tid)) = Claimed(vs[vs[rl2.last].next].deqID.tid, vs[vs[rl2.last].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, 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 ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), vs[ps[first].next].deqID ≠ None, rl2.last ≠ first, ps[first].next ≠ null, first ≠ lst, rl2 ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, rl2.last, vs), noid(tid, (rl1 + first ' + rl2) + qrl, rl2.last, 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), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl, vs[rl2.last].next ≠ null ∧ vs[vs[rl2.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[rl2.last].next].deqID.tid)) = Claimed(vs[vs[rl2.last].next].deqID.tid, vs[vs[rl2.last].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl ⊦
Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s)
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), vs[ps[first].next].deqID ≠ None, rl2.last ≠ first, ps[first].next ≠ null, first ≠ lst, rl2 ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, rl2.last, vs), noid(tid, (rl1 + first ' + rl2) + qrl, rl2.last, 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), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl, vs[rl2.last].next ≠ null ∧ vs[vs[rl2.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[rl2.last].next].deqID.tid)) = Claimed(vs[vs[rl2.last].next].deqID.tid, vs[vs[rl2.last].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl2 = qrl0 + phead0 ', rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead0 ≠ first, rl2 ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, phead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl, phead0, 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), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(qrl), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), lst ∈ rl2 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl2, phead0, y
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl2 = qrl0 + phead0 ', rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead0 ≠ first, rl2 ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, phead0, vs), noid(tid, (rl1 + first ' + rl2) + qrl, phead0, 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), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(qrl), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), lst ∈ rl2 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead0 ≠ first, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + (qrl0 + phead0 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, ps, owns), markedp(rl1, vs), markedp(qrl0, vs), markedp(rl1, ps), markedp(qrl0, ps), nextnottid(tid, phead0, vs), noid(tid, (rl1 + first ' + qrl0 + phead0 ') + qrl, phead0, vs), nonullRetRefs((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl0 + phead0 ') + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups((rl1 + qrl0) + qrl), ¬ dups(rl1), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ first ∈ qrl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ rl1, ¬ phead0 ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ qrl0, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), vtail = (phead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead0, lst ∈ qrl0 ∨ lst = phead0 ∨ lst ∈ qrl ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (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)
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead0 ≠ first, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + (qrl0 + phead0 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, ps, owns), markedp(rl1, vs), markedp(qrl0, vs), markedp(rl1, ps), markedp(qrl0, ps), nextnottid(tid, phead0, vs), noid(tid, (rl1 + first ' + qrl0 + phead0 ') + qrl, phead0, vs), nonullRetRefs((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl0 + phead0 ') + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups((rl1 + qrl0) + qrl), ¬ dups(rl1), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ first ∈ qrl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ rl1, ¬ phead0 ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ qrl0, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), vtail = (phead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead0, lst ∈ qrl0 ∨ lst = phead0 ∨ lst ∈ qrl ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ Some(vs[ps[first].next].deqID.tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead0 ≠ first, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, ps, owns), listp(first ' + (qrl0 + phead0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs), markedp(rl1, vs), nextnottid(tid, phead0, vs), noid(tid, (rl1 + first ' + qrl0 + phead0 ') + qrl, phead0, vs), nonullRetRefs((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (rl1 + first ' + qrl0 + phead0 ') + qrl from lst, vretRefs(tid) ∈ vrvHp, ps[first].next ∈ vs, ¬ dups((rl1 + qrl0) + qrl), ¬ dups(rl1), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ first ∈ qrl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ rl1, ¬ phead0 ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ qrl0, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), lst ∈ qrl0 ∨ lst = phead0 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead0, vtail = (phead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ Some(ps[ps[first].next].deqID.tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead0 ≠ first, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, ps, owns), listp(first ' + (qrl0 + phead0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs), markedp(rl1, vs), nextnottid(tid, phead0, vs), noid(tid, (rl1 + first ' + qrl0 + phead0 ') + qrl, phead0, vs), nonullRetRefs((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (rl1 + first ' + qrl0 + phead0 ') + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups((rl1 + qrl0) + qrl), ¬ dups(rl1), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ ps[first].next ∈ vs, ¬ first ∈ qrl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ rl1, ¬ phead0 ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ qrl0, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), lst ∈ qrl0 ∨ lst = phead0 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead0, vtail = (phead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ Some(vs[ps[first].next].deqID.tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead0 ≠ first, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, ps, owns), listp(first ' + (qrl0 + phead0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs), markedp(rl1, vs), nextnottid(tid, phead0, vs), noid(tid, (rl1 + first ' + qrl0 + phead0 ') + qrl, phead0, vs), nonullRetRefs((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (rl1 + first ' + qrl0 + phead0 ') + qrl from lst, vretRefs(tid) ∈ vrvHp, ps[first].next ∈ vs, ¬ dups((rl1 + qrl0) + qrl), ¬ dups(rl1), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ first ∈ qrl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ rl1, ¬ phead0 ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ qrl0, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), lst ∈ qrl0 ∨ lst = phead0 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead0, vtail = (phead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
Weak(tid0) = vs[ps[first].next].deqID, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ Some(vs[ps[first].next].deqID.tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead0 ≠ first, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + (qrl0 + phead0 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, ps, owns), markedp(rl1, vs), markedp(qrl0, vs), markedp(rl1, ps), markedp(qrl0, ps), nextnottid(tid, phead0, vs), noid(tid, (rl1 + first ' + qrl0 + phead0 ') + qrl, phead0, vs), nonullRetRefs((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(qrl, ps), ps[first].next ∈ vs, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl0 + phead0 ') + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups((rl1 + qrl0) + qrl), ¬ dups(rl1), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ first ∈ qrl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ rl1, ¬ phead0 ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ qrl0, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), vtail = (phead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead0, lst ∈ qrl0 ∨ lst = phead0 ∨ lst ∈ qrl ⊦
Used simplifier rules: OptTid freely generated by None, Some, Weak;; ⊦ None ≠ Some(tid); (s) ⊦ Some(tid).tid = tid; (s) ⊦ Some(tid) = Some(tid0) ↔ tid = tid0; (s)
| Weak(tid0) = vs[ps[first].next].deqID, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ Some(vs[ps[first].next].deqID.tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead0 ≠ first, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + (qrl0 + phead0 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, ps, owns), markedp(rl1, vs), markedp(qrl0, vs), markedp(rl1, ps), markedp(qrl0, ps), nextnottid(tid, phead0, vs), noid(tid, (rl1 + first ' + qrl0 + phead0 ') + qrl, phead0, vs), nonullRetRefs((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(qrl, ps), ps[first].next ∈ vs, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl0 + phead0 ') + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups((rl1 + qrl0) + qrl), ¬ dups(rl1), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ first ∈ qrl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ rl1, ¬ phead0 ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ qrl0, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), vtail = (phead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead0, lst ∈ qrl0 ∨ lst = phead0 ∨ lst ∈ qrl ⊦ |
Weak(tid0) = vs[ps[first].next].deqID, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, first ≠ lst, phead0 ≠ first, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + (qrl0 + phead0 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, ps, owns), markedp(rl1, vs), markedp(qrl0, vs), markedp(rl1, ps), markedp(qrl0, ps), nextnottid(tid, phead0, vs), noid(tid, (rl1 + first ' + qrl0 + phead0 ') + qrl, phead0, vs), nonullRetRefs((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(qrl, ps), ps[first].next ∈ vs, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl0 + phead0 ') + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + qrl), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups((rl1 + qrl0) + qrl), ¬ first ∈ qrl0, ¬ first ∈ rl1, ¬ phead0 ∈ qrl, ¬ phead0 ∈ rl1, ¬ phead0 ∈ qrl0, ¬ first ∈ qrl, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), vtail = (phead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead0, lst ∈ qrl0 ∨ lst = phead0 ∨ lst ∈ qrl ⊦
Used simplifier rules: ⊦ Some(tid) ≠ Weak(tid0); (s) ⊦ Weak(tid).tid = tid; (s) ⊦ None ≠ Weak(tid); (s)
| Weak(tid0) = vs[ps[first].next].deqID, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, first ≠ lst, phead0 ≠ first, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + (qrl0 + phead0 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, ps, owns), markedp(rl1, vs), markedp(qrl0, vs), markedp(rl1, ps), markedp(qrl0, ps), nextnottid(tid, phead0, vs), noid(tid, (rl1 + first ' + qrl0 + phead0 ') + qrl, phead0, vs), nonullRetRefs((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(qrl, ps), ps[first].next ∈ vs, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl0 + phead0 ') + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + qrl), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl1), ¬ dups((rl1 + qrl0) + qrl), ¬ first ∈ qrl0, ¬ first ∈ rl1, ¬ phead0 ∈ qrl, ¬ phead0 ∈ rl1, ¬ phead0 ∈ qrl0, ¬ first ∈ qrl, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), vtail = (phead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead0, lst ∈ qrl0 ∨ lst = phead0 ∨ lst ∈ qrl ⊦ |
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 ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ 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] 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] ⊦ ¬ some?(Weak(tid)); (s) ⊦ markedp([], vs); (s) ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s) ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s)
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ Some(ps[ps[first].next].deqID.tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead0 ≠ first, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, ps, owns), listp(first ' + (qrl0 + phead0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs), markedp(rl1, vs), nextnottid(tid, phead0, vs), noid(tid, (rl1 + first ' + qrl0 + phead0 ') + qrl, phead0, vs), nonullRetRefs((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (rl1 + first ' + qrl0 + phead0 ') + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups((rl1 + qrl0) + qrl), ¬ dups(rl1), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ ps[first].next ∈ vs, ¬ first ∈ qrl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ rl1, ¬ phead0 ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ qrl0, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), lst ∈ qrl0 ∨ lst = phead0 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead0, vtail = (phead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ∅[ps[first].next].deqID ≠ Some(ps[ps[first].next].deqID.tid), ∅[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead0 ≠ first, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + (qrl0 + phead0 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, ps, owns), markedp(rl1, vs), markedp(qrl0, vs), markedp(rl1, ps), markedp(qrl0, ps), nextnottid(tid, phead0, vs), noid(tid, (rl1 + first ' + qrl0 + phead0 ') + qrl, phead0, vs), nonullRetRefs((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl0 + phead0 ') + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups((rl1 + qrl0) + qrl), ¬ dups(rl1), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ ps[first].next ∈ vs, ¬ first ∈ qrl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ rl1, ¬ phead0 ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ qrl0, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), vtail = (phead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead0, lst ∈ qrl0 ∨ lst = phead0 ∨ lst ∈ qrl ⊦
Used simplifier rules: ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s)
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ∅[ps[first].next].deqID ≠ Some(ps[ps[first].next].deqID.tid), ∅[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead0 ≠ first, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + (qrl0 + phead0 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, ps, owns), markedp(rl1, vs), markedp(qrl0, vs), markedp(rl1, ps), markedp(qrl0, ps), nextnottid(tid, phead0, vs), noid(tid, (rl1 + first ' + qrl0 + phead0 ') + qrl, phead0, vs), nonullRetRefs((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl0 + phead0 ') + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups((rl1 + qrl0) + qrl), ¬ dups(rl1), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ ps[first].next ∈ vs, ¬ first ∈ qrl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ rl1, ¬ phead0 ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ qrl0, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), vtail = (phead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead0, lst ∈ qrl0 ∨ lst = phead0 ∨ lst ∈ qrl ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl0 = [], rvowns(vretRefs(tid)) = Pending(tid), ∅[ps[first].next].deqID ≠ Some(ps[ps[first].next].deqID.tid), ∅[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead0 ≠ first, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, ps, owns), listp(first ' + (qrl0 + phead0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs), markedp(rl1, vs), nextnottid(tid, phead0, vs), noid(tid, (rl1 + first ' + qrl0 + phead0 ') + qrl, phead0, vs), nonullRetRefs((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (rl1 + first ' + qrl0 + phead0 ') + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups((rl1 + qrl0) + qrl), ¬ dups(rl1), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ ps[first].next ∈ vs, ¬ first ∈ qrl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ rl1, ¬ phead0 ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ qrl0, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), lst ∈ qrl0 ∨ lst = phead0 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead0, vtail = (phead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl0 = first0 + qrl1, rvowns(vretRefs(tid)) = Pending(tid), ∅[ps[first].next].deqID ≠ Some(ps[ps[first].next].deqID.tid), ∅[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead0 ≠ first, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, ps, owns), listp(first ' + (qrl0 + phead0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs), markedp(rl1, vs), nextnottid(tid, phead0, vs), noid(tid, (rl1 + first ' + qrl0 + phead0 ') + qrl, phead0, vs), nonullRetRefs((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (rl1 + first ' + qrl0 + phead0 ') + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups((rl1 + qrl0) + qrl), ¬ dups(rl1), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ ps[first].next ∈ vs, ¬ first ∈ qrl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ rl1, ¬ phead0 ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ qrl0, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), lst ∈ qrl0 ∨ lst = phead0 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead0, vtail = (phead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: reflist freely generated by [], +;;
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl0 = [], rvowns(vretRefs(tid)) = Pending(tid), ∅[ps[first].next].deqID ≠ Some(ps[ps[first].next].deqID.tid), ∅[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead0 ≠ first, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, ps, owns), listp(first ' + (qrl0 + phead0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs), markedp(rl1, vs), nextnottid(tid, phead0, vs), noid(tid, (rl1 + first ' + qrl0 + phead0 ') + qrl, phead0, vs), nonullRetRefs((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (rl1 + first ' + qrl0 + phead0 ') + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups((rl1 + qrl0) + qrl), ¬ dups(rl1), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ ps[first].next ∈ vs, ¬ first ∈ qrl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ rl1, ¬ phead0 ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ qrl0, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), lst ∈ qrl0 ∨ lst = phead0 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead0, vtail = (phead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ∅[vs[first].next].deqID ≠ Some(ps[vs[first].next].deqID.tid), ∅[vs[first].next].deqID ≠ None, vs[first].next ≠ null, vs[first].next ≠ first, first ≠ lst, first ≠ null, qrl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + qrl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, vs[first].next, vs), noid(tid, rl1 + first ' + vs[first].next ' + qrl, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), some?(∅[vs[first].next].deqID), unmarkedp(qrl.tail, vs), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ vs, ¬ first ∈ qrl, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl, ¬ first ∈ rl1, ∅[vs[first].next].next ≠ null ∧ vs[∅[vs[first].next].next].deqID ≠ None → rvowns(vretRefs(vs[∅[vs[first].next].next].deqID.tid)) = Claimed(vs[∅[vs[first].next].next].deqID.tid, vs[∅[vs[first].next].next].val), vtail = qrl.last ∨ vtail = (vs[first].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ⊦
Used simplifier rules: ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ x + [] = x; (s) ⊦ unmarkedp([], vs); (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ markedp([], vs); (s)
| ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ∅[vs[first].next].deqID ≠ Some(ps[vs[first].next].deqID.tid), ∅[vs[first].next].deqID ≠ None, vs[first].next ≠ null, vs[first].next ≠ first, first ≠ lst, first ≠ null, qrl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + qrl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, vs[first].next, vs), noid(tid, rl1 + first ' + vs[first].next ' + qrl, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), some?(∅[vs[first].next].deqID), unmarkedp(qrl.tail, vs), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ vs, ¬ first ∈ qrl, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl, ¬ first ∈ rl1, ∅[vs[first].next].next ≠ null ∧ vs[∅[vs[first].next].next].deqID ≠ None → rvowns(vretRefs(vs[∅[vs[first].next].next].deqID.tid)) = Claimed(vs[∅[vs[first].next].next].deqID.tid, vs[∅[vs[first].next].next].val), vtail = qrl.last ∨ vtail = (vs[first].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ⊦ |
Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ a + x = a ' + x; (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, tail
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl0 = first0 + qrl1, rvowns(vretRefs(tid)) = Pending(tid), ∅[ps[first].next].deqID ≠ Some(ps[ps[first].next].deqID.tid), ∅[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead0 ≠ first, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, ps, owns), listp(first ' + (qrl0 + phead0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs), markedp(rl1, vs), nextnottid(tid, phead0, vs), noid(tid, (rl1 + first ' + qrl0 + phead0 ') + qrl, phead0, vs), nonullRetRefs((rl1 + first ' + qrl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (rl1 + first ' + qrl0 + phead0 ') + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups((rl1 + qrl0) + qrl), ¬ dups(rl1), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ ps[first].next ∈ vs, ¬ first ∈ qrl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ rl1, ¬ phead0 ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ qrl0, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), lst ∈ qrl0 ∨ lst = phead0 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0 ∨ phead = phead0, vtail = (phead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ∅[vs[first].next].deqID ≠ Some(ps[vs[first].next].deqID.tid), ∅[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, phead0 ≠ first, phead0 ≠ vs[first].next, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + qrl1 + phead0 ' + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + qrl1) + phead0 ' + qrl, vs, ps, owns), markedp(qrl1, vs), markedp(rl1, ps), markedp(qrl1, ps), markedp(rl1, vs), nextnottid(tid, phead0, vs), noid(tid, rl1 + first ' + (vs[first].next ' + qrl1) + phead0 ' + qrl, phead0, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + qrl1) + phead0 ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), some?(vs[phead0].deqID), some?(ps[phead0].deqID), some?(∅[vs[first].next].deqID), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + qrl1) + phead0 ' + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + qrl1 + qrl), ¬ dups(rl1), ¬ dups(qrl1), ¬ dups(qrl), ¬ dups(qrl1 + qrl), ¬ dups(rl1 + qrl1), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl1, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ vs, ¬ first ∈ qrl, ¬ phead0 ∈ qrl1, ¬ phead0 ∈ rl1, ¬ phead0 ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ qrl1, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), vtail = (phead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ qrl1 ∨ lst = phead0 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = phead0 ⊦
Used simplifier rules: ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (s) ⊦ 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) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s)
| ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ∅[vs[first].next].deqID ≠ Some(ps[vs[first].next].deqID.tid), ∅[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, phead0 ≠ first, phead0 ≠ vs[first].next, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + qrl1 + phead0 ' + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + qrl1) + phead0 ' + qrl, vs, ps, owns), markedp(qrl1, vs), markedp(rl1, ps), markedp(qrl1, ps), markedp(rl1, vs), nextnottid(tid, phead0, vs), noid(tid, rl1 + first ' + (vs[first].next ' + qrl1) + phead0 ' + qrl, phead0, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + qrl1) + phead0 ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), some?(vs[phead0].deqID), some?(ps[phead0].deqID), some?(∅[vs[first].next].deqID), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + qrl1) + phead0 ' + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + qrl1 + qrl), ¬ dups(rl1), ¬ dups(qrl1), ¬ dups(qrl), ¬ dups(qrl1 + qrl), ¬ dups(rl1 + qrl1), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl1, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ vs, ¬ first ∈ qrl, ¬ phead0 ∈ qrl1, ¬ phead0 ∈ rl1, ¬ phead0 ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ qrl1, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), vtail = (phead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ qrl1 ∨ lst = phead0 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = phead0 ⊦ |
ps[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = Some(tid0), ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ∅[vs[first].next].deqID ≠ Some(tid0), ∅[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, phead0 ≠ first, phead0 ≠ vs[first].next, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + (vs[first].next ' + qrl1) + phead0 ' + qrl, vs, ps, owns), listp(vs[first].next ' + qrl1 + phead0 ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(qrl1, ps), markedp(rl1, ps), markedp(qrl1, vs), nextnottid(tid, phead0, vs), noid(tid, rl1 + first ' + (vs[first].next ' + qrl1) + phead0 ' + qrl, phead0, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + qrl1) + phead0 ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(∅[vs[first].next].deqID), some?(ps[phead0].deqID), some?(vs[phead0].deqID), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + (vs[first].next ' + qrl1) + phead0 ' + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl1 + qrl1 + qrl), ¬ dups(rl1), ¬ dups(qrl1), ¬ dups(qrl), ¬ dups(qrl1 + qrl), ¬ dups(rl1 + qrl1), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl1, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ vs, ¬ first ∈ qrl, ¬ phead0 ∈ qrl1, ¬ phead0 ∈ rl1, ¬ phead0 ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ qrl1, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = phead0, lst = vs[first].next ∨ lst ∈ qrl1 ∨ lst = phead0 ∨ lst ∈ qrl, vtail = (phead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: ⊦ some?(opttid) → (tid = opttid.tid ↔ opttid = Some(tid)); (elim) Used terms: ps[vs[first].next].deqID, tid0
| ps[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = Some(tid0), ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ∅[vs[first].next].deqID ≠ Some(tid0), ∅[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, phead0 ≠ first, phead0 ≠ vs[first].next, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + (vs[first].next ' + qrl1) + phead0 ' + qrl, vs, ps, owns), listp(vs[first].next ' + qrl1 + phead0 ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(qrl1, ps), markedp(rl1, ps), markedp(qrl1, vs), nextnottid(tid, phead0, vs), noid(tid, rl1 + first ' + (vs[first].next ' + qrl1) + phead0 ' + qrl, phead0, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + qrl1) + phead0 ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(∅[vs[first].next].deqID), some?(ps[phead0].deqID), some?(vs[phead0].deqID), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + (vs[first].next ' + qrl1) + phead0 ' + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl1 + qrl1 + qrl), ¬ dups(rl1), ¬ dups(qrl1), ¬ dups(qrl), ¬ dups(qrl1 + qrl), ¬ dups(rl1 + qrl1), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl1, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ vs, ¬ first ∈ qrl, ¬ phead0 ∈ qrl1, ¬ phead0 ∈ rl1, ¬ phead0 ∈ qrl, ¬ first ∈ rl1, ¬ first ∈ qrl1, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = phead0, lst = vs[first].next ∨ lst ∈ qrl1 ∨ lst = phead0 ∨ lst ∈ qrl, vtail = (phead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
ps[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = Some(tid0), ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ∅[vs[first].next].deqID ≠ None, ∅[vs[first].next].deqID ≠ Some(tid0), vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, phead0 ≠ vs[first].next, phead0 ≠ first, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + (vs[first].next ' + qrl1) + phead0 ' + qrl, vs, ps, owns), listp(vs[first].next ' + qrl1 + phead0 ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(qrl1, ps), markedp(rl1, ps), markedp(qrl1, vs), nextnottid(tid, phead0, vs), noid(tid, rl1 + first ' + (vs[first].next ' + qrl1) + phead0 ' + qrl, phead0, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + qrl1) + phead0 ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(∅[vs[first].next].deqID), some?(ps[phead0].deqID), some?(vs[phead0].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + (vs[first].next ' + qrl1) + phead0 ' + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl1 + qrl1), ¬ dups(qrl1 + qrl), ¬ dups(qrl), ¬ dups(qrl1), ¬ dups(rl1), ¬ dups(rl1 + qrl1 + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl1, ¬ first ∈ rl1, ¬ phead0 ∈ qrl, ¬ phead0 ∈ rl1, ¬ phead0 ∈ qrl1, ¬ first ∈ qrl, ¬ vs[first].next ∈ vs, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl1, ¬ vs[first].next ∈ rl1, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = phead0, lst = vs[first].next ∨ lst ∈ qrl1 ∨ lst = phead0 ∨ lst ∈ qrl, vtail = (phead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: ⊦ some?(Some(tid)); (s)
| ps[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = Some(tid0), ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ∅[vs[first].next].deqID ≠ None, ∅[vs[first].next].deqID ≠ Some(tid0), vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, phead0 ≠ vs[first].next, phead0 ≠ first, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + (vs[first].next ' + qrl1) + phead0 ' + qrl, vs, ps, owns), listp(vs[first].next ' + qrl1 + phead0 ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(qrl1, ps), markedp(rl1, ps), markedp(qrl1, vs), nextnottid(tid, phead0, vs), noid(tid, rl1 + first ' + (vs[first].next ' + qrl1) + phead0 ' + qrl, phead0, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + qrl1) + phead0 ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(∅[vs[first].next].deqID), some?(ps[phead0].deqID), some?(vs[phead0].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + (vs[first].next ' + qrl1) + phead0 ' + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl1 + qrl1), ¬ dups(qrl1 + qrl), ¬ dups(qrl), ¬ dups(qrl1), ¬ dups(rl1), ¬ dups(rl1 + qrl1 + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl1, ¬ first ∈ rl1, ¬ phead0 ∈ qrl, ¬ phead0 ∈ rl1, ¬ phead0 ∈ qrl1, ¬ first ∈ qrl, ¬ vs[first].next ∈ vs, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl1, ¬ vs[first].next ∈ rl1, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl1 ∨ phead = phead0, lst = vs[first].next ∨ lst ∈ qrl1 ∨ lst = phead0 ∨ lst ∈ qrl, vtail = (phead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
Used simplifier rules: reflist freely generated by [], +;; ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ a + x = a ' + x; (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ markedp([], vs); (s) ⊦ [] + x = x; (s)
| (rl1 + (first ' + rl2).butlast).last = vhead, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rl1 + (first ' + rl2).butlast ≠ [], vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, phead ≠ (first ' + rl2).last, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, 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), unmarkedp(qrl, vs), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, 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, vhead = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, 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 ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rl1 + (first ' + rl2).butlast ≠ [], vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, phead ≠ (first ' + rl2).last, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, (rl1 + (first ' + rl2).butlast).last, vs), noid(tid, (rl1 + first ' + rl2) + qrl, (rl1 + (first ' + rl2).butlast).last, 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, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[(rl1 + (first ' + rl2).butlast).last].next ≠ null ∧ vs[vs[(rl1 + (first ' + rl2).butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(rl1 + (first ' + rl2).butlast).last].next].deqID.tid)) = Claimed(vs[vs[(rl1 + (first ' + rl2).butlast).last].next].deqID.tid, vs[vs[(rl1 + (first ' + rl2).butlast).last].next].val), (rl1 + (first ' + rl2).butlast).last = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), 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, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rl1 + (first ' + rl2).butlast ≠ [], vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, phead ≠ (first ' + rl2).last, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, (rl1 + (first ' + rl2).butlast).last, vs), noid(tid, (rl1 + first ' + rl2) + qrl, (rl1 + (first ' + rl2).butlast).last, 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, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[(rl1 + (first ' + rl2).butlast).last].next ≠ null ∧ vs[vs[(rl1 + (first ' + rl2).butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(rl1 + (first ' + rl2).butlast).last].next].deqID.tid)) = Claimed(vs[vs[(rl1 + (first ' + rl2).butlast).last].next].deqID.tid, vs[vs[(rl1 + (first ' + rl2).butlast).last].next].val), (rl1 + (first ' + rl2).butlast).last = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), 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, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦ |
⊦ y ≠ [] → (x + y).butlast = x + y.butlast
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl2 = [], rvowns(vretRefs(tid)) = Pending(tid), rl1 + (first ' + rl2).butlast ≠ [], vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, phead ≠ (first ' + rl2).last, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, (rl1 + (first ' + rl2).butlast).last, vs), noid(tid, (rl1 + first ' + rl2) + qrl, (rl1 + (first ' + rl2).butlast).last, 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), unmarkedp(qrl, vs), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, 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, (rl1 + (first ' + rl2).butlast).last = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vs[(rl1 + (first ' + rl2).butlast).last].next ≠ null ∧ vs[vs[(rl1 + (first ' + rl2).butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(rl1 + (first ' + rl2).butlast).last].next].deqID.tid)) = Claimed(vs[vs[(rl1 + (first ' + rl2).butlast).last].next].deqID.tid, vs[vs[(rl1 + (first ' + rl2).butlast).last].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, 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 ⊦
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rl1 + first ' + rl2.butlast ≠ [], vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, phead ≠ (first ' + rl2).last, rl2 ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, (rl1 + first ' + rl2.butlast).last, vs), noid(tid, (rl1 + first ' + rl2) + qrl, (rl1 + first ' + rl2.butlast).last, 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), unmarkedp(qrl, vs), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, 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, (rl1 + first ' + rl2.butlast).last = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vs[(rl1 + first ' + rl2.butlast).last].next ≠ null ∧ vs[vs[(rl1 + first ' + rl2.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(rl1 + first ' + rl2.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(rl1 + first ' + rl2.butlast).last].next].deqID.tid, vs[vs[(rl1 + first ' + rl2.butlast).last].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, 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 ⊦
Used terms: first ', rl2
| ⊦ y ≠ [] → (x + y).butlast = x + y.butlast |
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl2 = [], rvowns(vretRefs(tid)) = Pending(tid), rl1 + (first ' + rl2).butlast ≠ [], vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, phead ≠ (first ' + rl2).last, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, (rl1 + (first ' + rl2).butlast).last, vs), noid(tid, (rl1 + first ' + rl2) + qrl, (rl1 + (first ' + rl2).butlast).last, 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), unmarkedp(qrl, vs), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, 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, (rl1 + (first ' + rl2).butlast).last = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vs[(rl1 + (first ' + rl2).butlast).last].next ≠ null ∧ vs[vs[(rl1 + (first ' + rl2).butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(rl1 + (first ' + rl2).butlast).last].next].deqID.tid)) = Claimed(vs[vs[(rl1 + (first ' + rl2).butlast).last].next].deqID.tid, vs[vs[(rl1 + (first ' + rl2).butlast).last].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, 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 ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), vs[ps[first].next].deqID ≠ None, rl1.last ≠ first, ps[first].next ≠ null, first ≠ lst, phead ≠ first, rl1 ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + qrl, vs, ps, owns), listp(rl1 + first ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, rl1.last, vs), noid(tid, rl1 + first ' + qrl, rl1.last, vs), nonullRetRefs(rl1 + first ' + 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), unmarkedp(qrl, vs), lst ∈ ps, lst ∈ vs, phead ∈ rl1, lst ∈ qrl, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl1 + qrl), ¬ first ∈ rl1, ¬ first ∈ qrl, vs[rl1.last].next ≠ null ∧ vs[vs[rl1.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[rl1.last].next].deqID.tid)) = Claimed(vs[vs[rl1.last].next].deqID.tid, vs[vs[rl1.last].next].val), vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (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-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) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s) ⊦ a '.last = a; (s)
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), vs[ps[first].next].deqID ≠ None, rl1.last ≠ first, ps[first].next ≠ null, first ≠ lst, phead ≠ first, rl1 ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + qrl, vs, ps, owns), listp(rl1 + first ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, rl1.last, vs), noid(tid, rl1 + first ' + qrl, rl1.last, vs), nonullRetRefs(rl1 + first ' + 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), unmarkedp(qrl, vs), lst ∈ ps, lst ∈ vs, phead ∈ rl1, lst ∈ qrl, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl1 + qrl), ¬ first ∈ rl1, ¬ first ∈ qrl, vs[rl1.last].next ≠ null ∧ vs[vs[rl1.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[rl1.last].next].deqID.tid)) = Claimed(vs[vs[rl1.last].next].deqID.tid, vs[vs[rl1.last].next].val), vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl1 = qrl0 + vtail0 ', rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead ≠ first, rl1 ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + qrl, vs, ps, owns), listp(first ' + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, vtail0, vs), noid(tid, rl1 + first ' + qrl, vtail0, vs), nonullRetRefs(rl1 + first ' + 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, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + qrl from lst, vretRefs(tid) ∈ vrvHp, lst ∈ qrl, phead ∈ rl1, lst ∈ vs, lst ∈ ps, ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl1 + qrl), ¬ first ∈ rl1, ¬ first ∈ qrl, vs[vtail0].next ≠ null ∧ vs[vs[vtail0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vtail0].next].deqID.tid)) = Claimed(vs[vs[vtail0].next].deqID.tid, vs[vs[vtail0].next].val), vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl1, vtail0, y
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl1 = qrl0 + vtail0 ', rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, phead ≠ first, rl1 ≠ [], vretRefs(tid) ≠ null, vtail0 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + qrl, vs, ps, owns), listp(first ' + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, vtail0, vs), noid(tid, rl1 + first ' + qrl, vtail0, vs), nonullRetRefs(rl1 + first ' + 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, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + qrl from lst, vretRefs(tid) ∈ vrvHp, lst ∈ qrl, phead ∈ rl1, lst ∈ vs, lst ∈ ps, ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl1 + qrl), ¬ first ∈ rl1, ¬ first ∈ qrl, vs[vtail0].next ≠ null ∧ vs[vs[vtail0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vtail0].next].deqID.tid)) = Claimed(vs[vs[vtail0].next].deqID.tid, vs[vs[vtail0].next].val), vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[ps[vtail0].next].next].deqID ≠ None, vs[ps[ps[vtail0].next].next].deqID ≠ Some((ps[ps[vtail0].next].next ∈ vs ⊃ vs[ps[ps[vtail0].next].next];ps[ps[ps[vtail0].next].next]).deqID.tid), ps[vtail0].next ≠ lst, ps[ps[vtail0].next].next ≠ null, phead ≠ ps[vtail0].next, vretRefs(tid) ≠ null, vtail0 ≠ ps[vtail0].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + ps[vtail0].next ' + qrl, vs, ps, owns), listp(ps[vtail0].next ' + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vtail0, vs), noid(tid, (qrl0 + vtail0 ') + ps[vtail0].next ' + qrl, vtail0, vs), nonullRetRefs((qrl0 + vtail0 ') + ps[vtail0].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), some?(ps[ps[vtail0].next].deqID), some?(vs[ps[vtail0].next].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), ps[vtail0].next ∈ ps, ps[vtail0].next ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (qrl0 + vtail0 ') + ps[vtail0].next ' + qrl from lst, vretRefs(tid) ∈ vrvHp, lst ∈ qrl, lst ∈ vs, lst ∈ ps, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl), ¬ ps[vtail0].next ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ ps[vtail0].next ∈ qrl, vs[vtail0].next ≠ null ∧ vs[vs[vtail0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vtail0].next].deqID.tid)) = Claimed(vs[vs[vtail0].next].deqID.tid, vs[vs[vtail0].next].val), phead ∈ qrl0 ∨ phead = vtail0, vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (ps[vtail0].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] 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 ' + 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)
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[ps[vtail0].next].next].deqID ≠ None, vs[ps[ps[vtail0].next].next].deqID ≠ Some((ps[ps[vtail0].next].next ∈ vs ⊃ vs[ps[ps[vtail0].next].next];ps[ps[ps[vtail0].next].next]).deqID.tid), ps[vtail0].next ≠ lst, ps[ps[vtail0].next].next ≠ null, phead ≠ ps[vtail0].next, vretRefs(tid) ≠ null, vtail0 ≠ ps[vtail0].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + ps[vtail0].next ' + qrl, vs, ps, owns), listp(ps[vtail0].next ' + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vtail0, vs), noid(tid, (qrl0 + vtail0 ') + ps[vtail0].next ' + qrl, vtail0, vs), nonullRetRefs((qrl0 + vtail0 ') + ps[vtail0].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), some?(ps[ps[vtail0].next].deqID), some?(vs[ps[vtail0].next].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), ps[vtail0].next ∈ ps, ps[vtail0].next ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (qrl0 + vtail0 ') + ps[vtail0].next ' + qrl from lst, vretRefs(tid) ∈ vrvHp, lst ∈ qrl, lst ∈ vs, lst ∈ ps, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl), ¬ ps[vtail0].next ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ ps[vtail0].next ∈ qrl, vs[vtail0].next ≠ null ∧ vs[vs[vtail0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vtail0].next].deqID.tid)) = Claimed(vs[vs[vtail0].next].deqID.tid, vs[vs[vtail0].next].val), phead ∈ qrl0 ∨ phead = vtail0, vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (ps[vtail0].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[ps[vtail0].next].next].deqID ≠ Some(vs[ps[ps[vtail0].next].next].deqID.tid), vs[ps[ps[vtail0].next].next].deqID ≠ None, ps[vtail0].next ≠ lst, ps[ps[vtail0].next].next ≠ null, phead ≠ ps[vtail0].next, vretRefs(tid) ≠ null, vtail0 ≠ ps[vtail0].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(ps[vtail0].next ' + qrl, vs, ps, owns), listp((qrl0 + vtail0 ') + ps[vtail0].next ' + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vtail0, vs), noid(tid, (qrl0 + vtail0 ') + ps[vtail0].next ' + qrl, vtail0, vs), nonullRetRefs((qrl0 + vtail0 ') + ps[vtail0].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[ps[vtail0].next].deqID), some?(ps[ps[vtail0].next].deqID), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), lst ∈ ps, lst ∈ vs, lst ∈ qrl, vretRefs(tid) ∈ vrvHp, vtail ∈ (qrl0 + vtail0 ') + ps[vtail0].next ' + qrl from lst, phead ∈ vs, phead ∈ ps, ps[vtail0].next ∈ vs, ps[vtail0].next ∈ ps, ps[ps[vtail0].next].next ∈ vs, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl), ¬ ps[vtail0].next ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ ps[vtail0].next ∈ qrl, vs[vtail0].next ≠ null ∧ vs[vs[vtail0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vtail0].next].deqID.tid)) = Claimed(vs[vs[vtail0].next].deqID.tid, vs[vs[vtail0].next].val), vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (ps[vtail0].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl0 ∨ phead = vtail0 ⊦
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[ps[vtail0].next].next].deqID ≠ Some(ps[ps[ps[vtail0].next].next].deqID.tid), vs[ps[ps[vtail0].next].next].deqID ≠ None, ps[vtail0].next ≠ lst, ps[ps[vtail0].next].next ≠ null, phead ≠ ps[vtail0].next, vretRefs(tid) ≠ null, vtail0 ≠ ps[vtail0].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(ps[vtail0].next ' + qrl, vs, ps, owns), listp((qrl0 + vtail0 ') + ps[vtail0].next ' + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vtail0, vs), noid(tid, (qrl0 + vtail0 ') + ps[vtail0].next ' + qrl, vtail0, vs), nonullRetRefs((qrl0 + vtail0 ') + ps[vtail0].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[ps[vtail0].next].deqID), some?(ps[ps[vtail0].next].deqID), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), lst ∈ ps, lst ∈ vs, lst ∈ qrl, vretRefs(tid) ∈ vrvHp, vtail ∈ (qrl0 + vtail0 ') + ps[vtail0].next ' + qrl from lst, phead ∈ vs, phead ∈ ps, ps[vtail0].next ∈ vs, ps[vtail0].next ∈ ps, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl), ¬ ps[ps[vtail0].next].next ∈ vs, ¬ ps[vtail0].next ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ ps[vtail0].next ∈ qrl, vs[vtail0].next ≠ null ∧ vs[vs[vtail0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vtail0].next].deqID.tid)) = Claimed(vs[vs[vtail0].next].deqID.tid, vs[vs[vtail0].next].val), vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (ps[vtail0].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl0 ∨ phead = vtail0 ⊦
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[ps[vtail0].next].next].deqID ≠ Some(vs[ps[ps[vtail0].next].next].deqID.tid), vs[ps[ps[vtail0].next].next].deqID ≠ None, ps[vtail0].next ≠ lst, ps[ps[vtail0].next].next ≠ null, phead ≠ ps[vtail0].next, vretRefs(tid) ≠ null, vtail0 ≠ ps[vtail0].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(ps[vtail0].next ' + qrl, vs, ps, owns), listp((qrl0 + vtail0 ') + ps[vtail0].next ' + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vtail0, vs), noid(tid, (qrl0 + vtail0 ') + ps[vtail0].next ' + qrl, vtail0, vs), nonullRetRefs((qrl0 + vtail0 ') + ps[vtail0].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[ps[vtail0].next].deqID), some?(ps[ps[vtail0].next].deqID), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), lst ∈ ps, lst ∈ vs, lst ∈ qrl, vretRefs(tid) ∈ vrvHp, vtail ∈ (qrl0 + vtail0 ') + ps[vtail0].next ' + qrl from lst, phead ∈ vs, phead ∈ ps, ps[vtail0].next ∈ vs, ps[vtail0].next ∈ ps, ps[ps[vtail0].next].next ∈ vs, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl), ¬ ps[vtail0].next ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ ps[vtail0].next ∈ qrl, vs[vtail0].next ≠ null ∧ vs[vs[vtail0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vtail0].next].deqID.tid)) = Claimed(vs[vs[vtail0].next].deqID.tid, vs[vs[vtail0].next].val), vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (ps[vtail0].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl0 ∨ phead = vtail0 ⊦ |
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)
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[ps[vtail0].next].next].deqID ≠ Some(ps[ps[ps[vtail0].next].next].deqID.tid), vs[ps[ps[vtail0].next].next].deqID ≠ None, ps[vtail0].next ≠ lst, ps[ps[vtail0].next].next ≠ null, phead ≠ ps[vtail0].next, vretRefs(tid) ≠ null, vtail0 ≠ ps[vtail0].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(ps[vtail0].next ' + qrl, vs, ps, owns), listp((qrl0 + vtail0 ') + ps[vtail0].next ' + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vtail0, vs), noid(tid, (qrl0 + vtail0 ') + ps[vtail0].next ' + qrl, vtail0, vs), nonullRetRefs((qrl0 + vtail0 ') + ps[vtail0].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[ps[vtail0].next].deqID), some?(ps[ps[vtail0].next].deqID), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), lst ∈ ps, lst ∈ vs, lst ∈ qrl, vretRefs(tid) ∈ vrvHp, vtail ∈ (qrl0 + vtail0 ') + ps[vtail0].next ' + qrl from lst, phead ∈ vs, phead ∈ ps, ps[vtail0].next ∈ vs, ps[vtail0].next ∈ ps, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl), ¬ ps[ps[vtail0].next].next ∈ vs, ¬ ps[vtail0].next ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ ps[vtail0].next ∈ qrl, vs[vtail0].next ≠ null ∧ vs[vs[vtail0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vtail0].next].deqID.tid)) = Claimed(vs[vs[vtail0].next].deqID.tid, vs[vs[vtail0].next].val), vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (ps[vtail0].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl0 ∨ phead = vtail0 ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ∅[ps[ps[vtail0].next].next].deqID ≠ Some(ps[ps[ps[vtail0].next].next].deqID.tid), ∅[ps[ps[vtail0].next].next].deqID ≠ None, ps[vtail0].next ≠ lst, ps[ps[vtail0].next].next ≠ null, phead ≠ ps[vtail0].next, vretRefs(tid) ≠ null, vtail0 ≠ ps[vtail0].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + ps[vtail0].next ' + qrl, vs, ps, owns), listp(ps[vtail0].next ' + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vtail0, vs), noid(tid, (qrl0 + vtail0 ') + ps[vtail0].next ' + qrl, vtail0, vs), nonullRetRefs((qrl0 + vtail0 ') + ps[vtail0].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), some?(ps[ps[vtail0].next].deqID), some?(vs[ps[vtail0].next].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), ps[vtail0].next ∈ ps, ps[vtail0].next ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (qrl0 + vtail0 ') + ps[vtail0].next ' + qrl from lst, vretRefs(tid) ∈ vrvHp, lst ∈ qrl, lst ∈ vs, lst ∈ ps, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl), ¬ ps[ps[vtail0].next].next ∈ vs, ¬ ps[vtail0].next ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ ps[vtail0].next ∈ qrl, vs[vtail0].next ≠ null ∧ vs[vs[vtail0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vtail0].next].deqID.tid)) = Claimed(vs[vs[vtail0].next].deqID.tid, vs[vs[vtail0].next].val), phead ∈ qrl0 ∨ phead = vtail0, vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (ps[vtail0].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s)
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ∅[ps[ps[vtail0].next].next].deqID ≠ Some(ps[ps[ps[vtail0].next].next].deqID.tid), ∅[ps[ps[vtail0].next].next].deqID ≠ None, ps[vtail0].next ≠ lst, ps[ps[vtail0].next].next ≠ null, phead ≠ ps[vtail0].next, vretRefs(tid) ≠ null, vtail0 ≠ ps[vtail0].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + ps[vtail0].next ' + qrl, vs, ps, owns), listp(ps[vtail0].next ' + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vtail0, vs), noid(tid, (qrl0 + vtail0 ') + ps[vtail0].next ' + qrl, vtail0, vs), nonullRetRefs((qrl0 + vtail0 ') + ps[vtail0].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), some?(ps[ps[vtail0].next].deqID), some?(vs[ps[vtail0].next].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), ps[vtail0].next ∈ ps, ps[vtail0].next ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (qrl0 + vtail0 ') + ps[vtail0].next ' + qrl from lst, vretRefs(tid) ∈ vrvHp, lst ∈ qrl, lst ∈ vs, lst ∈ ps, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl), ¬ ps[ps[vtail0].next].next ∈ vs, ¬ ps[vtail0].next ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ ps[vtail0].next ∈ qrl, vs[vtail0].next ≠ null ∧ vs[vs[vtail0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vtail0].next].deqID.tid)) = Claimed(vs[vs[vtail0].next].deqID.tid, vs[vs[vtail0].next].val), phead ∈ qrl0 ∨ phead = vtail0, vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (ps[vtail0].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.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) ⊦ 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) ⊦ a ' + x ≠ []; (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 a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s)
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rl1 + first ' + rl2.butlast ≠ [], vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, phead ≠ (first ' + rl2).last, rl2 ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, (rl1 + first ' + rl2.butlast).last, vs), noid(tid, (rl1 + first ' + rl2) + qrl, (rl1 + first ' + rl2.butlast).last, 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), unmarkedp(qrl, vs), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, 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, (rl1 + first ' + rl2.butlast).last = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vs[(rl1 + first ' + rl2.butlast).last].next ≠ null ∧ vs[vs[(rl1 + first ' + rl2.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(rl1 + first ' + rl2.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(rl1 + first ' + rl2.butlast).last].next].deqID.tid, vs[vs[(rl1 + first ' + rl2.butlast).last].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, 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 ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, phead ≠ rl2.last, rl2 ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, (first ' + rl2.butlast).last, vs), noid(tid, (rl1 + first ' + rl2) + qrl, (first ' + rl2.butlast).last, 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, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[(first ' + rl2.butlast).last].next ≠ null ∧ vs[vs[(first ' + rl2.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + rl2.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + rl2.butlast).last].next].deqID.tid, vs[vs[(first ' + rl2.butlast).last].next].val), (first ' + rl2.butlast).last = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), lst ∈ rl2 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ x + a ' + y ≠ []; (s)
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, phead ≠ rl2.last, rl2 ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, (first ' + rl2.butlast).last, vs), noid(tid, (rl1 + first ' + rl2) + qrl, (first ' + rl2.butlast).last, 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, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[(first ' + rl2.butlast).last].next ≠ null ∧ vs[vs[(first ' + rl2.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + rl2.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + rl2.butlast).last].next].deqID.tid, vs[vs[(first ' + rl2.butlast).last].next].val), (first ' + rl2.butlast).last = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), lst ∈ rl2 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl2 = qrl0 + vtail0 ', rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, phead ≠ vtail0, rl2 ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, (first ' + qrl0).last, vs), noid(tid, (rl1 + first ' + rl2) + qrl, (first ' + qrl0).last, 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), unmarkedp(qrl, vs), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, 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, (first ' + qrl0).last = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vs[(first ' + qrl0).last].next ≠ null ∧ vs[vs[(first ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + qrl0).last].next].deqID.tid, vs[vs[(first ' + qrl0).last].next].val), vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl2, vtail0, y
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl2 = qrl0 + vtail0 ', rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, phead ≠ vtail0, rl2 ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, (first ' + qrl0).last, vs), noid(tid, (rl1 + first ' + rl2) + qrl, (first ' + qrl0).last, 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), unmarkedp(qrl, vs), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, 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, (first ' + qrl0).last = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vs[(first ' + qrl0).last].next ≠ null ∧ vs[vs[(first ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + qrl0).last].next].deqID.tid, vs[vs[(first ' + qrl0).last].next].val), vtail = (rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, phead ≠ vtail0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + qrl0 + vtail0 ') + qrl, vs, ps, owns), listp(first ' + (qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(rl1, vs), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs), nextnottid(tid, (first ' + qrl0).last, vs), noid(tid, (rl1 + first ' + qrl0 + vtail0 ') + qrl, (first ' + qrl0).last, vs), nonullRetRefs((rl1 + first ' + qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (rl1 + first ' + qrl0 + vtail0 ') + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups((rl1 + qrl0) + qrl), ¬ dups(rl1), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ first ∈ rl1, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ qrl0, vs[(first ' + qrl0).last].next ≠ null ∧ vs[vs[(first ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + qrl0).last].next].deqID.tid, vs[vs[(first ' + qrl0).last].next].val), (first ' + qrl0).last = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, phead ≠ vtail0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + qrl0 + vtail0 ') + qrl, vs, ps, owns), listp(first ' + (qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(rl1, vs), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs), nextnottid(tid, (first ' + qrl0).last, vs), noid(tid, (rl1 + first ' + qrl0 + vtail0 ') + qrl, (first ' + qrl0).last, vs), nonullRetRefs((rl1 + first ' + qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (rl1 + first ' + qrl0 + vtail0 ') + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups((rl1 + qrl0) + qrl), ¬ dups(rl1), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ first ∈ rl1, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ qrl0, vs[(first ' + qrl0).last].next ≠ null ∧ vs[vs[(first ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + qrl0).last].next].deqID.tid, vs[vs[(first ' + qrl0).last].next].val), (first ' + qrl0).last = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl0 = [], rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, phead ≠ vtail0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + (qrl0 + vtail0 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(rl1, ps), markedp(qrl0, ps), markedp(rl1, vs), nextnottid(tid, (first ' + qrl0).last, vs), noid(tid, (rl1 + first ' + qrl0 + vtail0 ') + qrl, (first ' + qrl0).last, vs), nonullRetRefs((rl1 + first ' + qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl0 + vtail0 ') + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups((rl1 + qrl0) + qrl), ¬ dups(rl1), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ first ∈ rl1, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ qrl0, (first ' + qrl0).last = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vs[(first ' + qrl0).last].next ≠ null ∧ vs[vs[(first ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + qrl0).last].next].deqID.tid, vs[vs[(first ' + qrl0).last].next].val), vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl ⊦
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl0 = first0 + qrl1, rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, phead ≠ vtail0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + (qrl0 + vtail0 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(rl1, ps), markedp(qrl0, ps), markedp(rl1, vs), nextnottid(tid, (first ' + qrl0).last, vs), noid(tid, (rl1 + first ' + qrl0 + vtail0 ') + qrl, (first ' + qrl0).last, vs), nonullRetRefs((rl1 + first ' + qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl0 + vtail0 ') + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups((rl1 + qrl0) + qrl), ¬ dups(rl1), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ first ∈ rl1, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ qrl0, (first ' + qrl0).last = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vs[(first ' + qrl0).last].next ≠ null ∧ vs[vs[(first ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + qrl0).last].next].deqID.tid, vs[vs[(first ' + qrl0).last].next].val), vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl ⊦
Used simplifier rules: reflist freely generated by [], +;;
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl0 = [], rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, phead ≠ vtail0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + (qrl0 + vtail0 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(rl1, ps), markedp(qrl0, ps), markedp(rl1, vs), nextnottid(tid, (first ' + qrl0).last, vs), noid(tid, (rl1 + first ' + qrl0 + vtail0 ') + qrl, (first ' + qrl0).last, vs), nonullRetRefs((rl1 + first ' + qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl0 + vtail0 ') + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups((rl1 + qrl0) + qrl), ¬ dups(rl1), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ first ∈ rl1, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ qrl0, (first ' + qrl0).last = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vs[(first ' + qrl0).last].next ≠ null ∧ vs[vs[(first ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + qrl0).last].next].deqID.tid, vs[vs[(first ' + qrl0).last].next].val), vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl ⊦ |
ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid)) = Claimed((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), vs[vs[first].next].deqID ≠ Some((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ null, first ≠ vs[first].next, first ≠ lst, phead ≠ vs[first].next, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + qrl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + qrl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vs[first].next].deqID), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl1 + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, phead ∈ rl1 ∨ phead = first, lst = vs[first].next ∨ lst ∈ qrl, vtail = (vs[first].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] 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 '.last = a; (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ [] + x = x; (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ markedp([], vs); (s)
| ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid)) = Claimed((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), vs[vs[first].next].deqID ≠ Some((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ null, first ≠ vs[first].next, first ≠ lst, phead ≠ vs[first].next, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + qrl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + qrl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vs[first].next].deqID), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl1 + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, phead ∈ rl1 ∨ phead = first, lst = vs[first].next ∨ lst ∈ qrl, vtail = (vs[first].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
ps[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid0), ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid)) = Claimed((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid, vs[vs[first].next].val), vs[vs[first].next].deqID ≠ Some((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ null, first ≠ vs[first].next, first ≠ lst, phead ≠ vs[first].next, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + vs[first].next ' + qrl, vs, ps, owns), listp(vs[first].next ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + qrl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), some?(vs[vs[first].next].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + vs[first].next ' + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl1 + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vtail = (vs[first].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ⊦
Used simplifier rules: ⊦ some?(opttid) → (tid = opttid.tid ↔ opttid = Some(tid)); (elim) Used terms: vs[vs[first].next].deqID, tid0
| ps[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid0), ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid)) = Claimed((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid, vs[vs[first].next].val), vs[vs[first].next].deqID ≠ Some((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ null, first ≠ vs[first].next, first ≠ lst, phead ≠ vs[first].next, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + vs[first].next ' + qrl, vs, ps, owns), listp(vs[first].next ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + qrl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), some?(vs[vs[first].next].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + vs[first].next ' + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl1 + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vtail = (vs[first].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ⊦ |
ps[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid0), ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid)) = Claimed((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid, vs[vs[first].next].val), vs[first].next ≠ null, first ≠ lst, first ≠ vs[first].next, first ≠ null, phead ≠ vs[first].next, tid0 ≠ (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + vs[first].next ' + qrl, vs, ps, owns), listp(vs[first].next ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + qrl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + vs[first].next ' + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl, ¬ first ∈ qrl, vtail = (vs[first].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ⊦
Used simplifier rules: ⊦ some?(Some(tid)); (s) ⊦ Some(tid) = Some(tid0) ↔ tid = tid0; (s) ⊦ None ≠ Some(tid); (s)
| ps[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid0), ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid)) = Claimed((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid, vs[vs[first].next].val), vs[first].next ≠ null, first ≠ lst, first ≠ vs[first].next, first ≠ null, phead ≠ vs[first].next, tid0 ≠ (vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + vs[first].next ' + qrl, vs, ps, owns), listp(vs[first].next ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, first, vs), noid(tid, rl1 + first ' + vs[first].next ' + qrl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + vs[first].next ' + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ qrl, ¬ first ∈ qrl, vtail = (vs[first].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ⊦ |
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) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ 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) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ Some(tid).tid = 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)
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl0 = first0 + qrl1, rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[ps[first].next].deqID ≠ Some((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid), ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, phead ≠ vtail0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + (qrl0 + vtail0 ') + qrl, vs, ps, owns), listp((rl1 + first ' + qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(rl1, ps), markedp(qrl0, ps), markedp(rl1, vs), nextnottid(tid, (first ' + qrl0).last, vs), noid(tid, (rl1 + first ' + qrl0 + vtail0 ') + qrl, (first ' + qrl0).last, vs), nonullRetRefs((rl1 + first ' + qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + qrl0 + vtail0 ') + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups((rl1 + qrl0) + qrl), ¬ dups(rl1), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ first ∈ rl1, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ qrl0, (first ' + qrl0).last = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vs[(first ' + qrl0).last].next ≠ null ∧ vs[vs[(first ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + qrl0).last].next].deqID.tid, vs[vs[(first ' + qrl0).last].next].val), vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ qrl0, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl ⊦ |
ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ Some((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ vtail0, first ≠ lst, phead ≠ vtail0, vretRefs(tid) ≠ null, vtail0 ≠ vs[first].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + qrl1 + vtail0 ' + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + qrl1) + vtail0 ' + qrl, vs, ps, owns), markedp(qrl1, vs), markedp(rl1, ps), markedp(qrl1, ps), markedp(rl1, vs), nextnottid(tid, (vs[first].next ' + qrl1).last, vs), noid(tid, rl1 + first ' + (vs[first].next ' + qrl1) + vtail0 ' + qrl, (vs[first].next ' + qrl1).last, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + qrl1) + vtail0 ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vs[first].next].deqID), some?(ps[vs[first].next].deqID), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + qrl1) + vtail0 ' + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + qrl1), ¬ dups(qrl1 + qrl), ¬ dups(qrl), ¬ dups(qrl1), ¬ dups(rl1), ¬ dups(rl1 + qrl1 + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl1, ¬ first ∈ qrl, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl1, ¬ vtail0 ∈ rl1, ¬ first ∈ rl1, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl1, ¬ vs[first].next ∈ rl1, (vs[first].next ' + qrl1).last = first → rvowns (vretRefs ((ps[(vs[first].next ' + qrl1).last].next ∈ vs ⊃ vs[ps[(vs[first].next ' + qrl1).last].next];ps[ps[(vs[first].next ' + qrl1).last].next]).deqID .tid)) = Claimed ((ps[(vs[first].next ' + qrl1).last].next ∈ vs ⊃ vs[ps[(vs[first].next ' + qrl1).last].next];ps[ps[(vs[first].next ' + qrl1).last].next]).deqID .tid, vs[ps[(vs[first].next ' + qrl1).last].next].val), vs[(vs[first].next ' + qrl1).last].next ≠ null ∧ vs[vs[(vs[first].next ' + qrl1).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[first].next ' + qrl1).last].next].deqID.tid)) = Claimed(vs[vs[(vs[first].next ' + qrl1).last].next].deqID.tid, vs[vs[(vs[first].next ' + qrl1).last].next].val), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ qrl1, lst = vs[first].next ∨ lst ∈ qrl1 ∨ lst = vtail0 ∨ lst ∈ qrl, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] 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) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s)
| ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ Some((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ vtail0, first ≠ lst, phead ≠ vtail0, vretRefs(tid) ≠ null, vtail0 ≠ vs[first].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + qrl1 + vtail0 ' + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + qrl1) + vtail0 ' + qrl, vs, ps, owns), markedp(qrl1, vs), markedp(rl1, ps), markedp(qrl1, ps), markedp(rl1, vs), nextnottid(tid, (vs[first].next ' + qrl1).last, vs), noid(tid, rl1 + first ' + (vs[first].next ' + qrl1) + vtail0 ' + qrl, (vs[first].next ' + qrl1).last, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + qrl1) + vtail0 ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vs[first].next].deqID), some?(ps[vs[first].next].deqID), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + qrl1) + vtail0 ' + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + qrl1), ¬ dups(qrl1 + qrl), ¬ dups(qrl), ¬ dups(qrl1), ¬ dups(rl1), ¬ dups(rl1 + qrl1 + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl1, ¬ first ∈ qrl, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl1, ¬ vtail0 ∈ rl1, ¬ first ∈ rl1, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl1, ¬ vs[first].next ∈ rl1, (vs[first].next ' + qrl1).last = first → rvowns (vretRefs ((ps[(vs[first].next ' + qrl1).last].next ∈ vs ⊃ vs[ps[(vs[first].next ' + qrl1).last].next];ps[ps[(vs[first].next ' + qrl1).last].next]).deqID .tid)) = Claimed ((ps[(vs[first].next ' + qrl1).last].next ∈ vs ⊃ vs[ps[(vs[first].next ' + qrl1).last].next];ps[ps[(vs[first].next ' + qrl1).last].next]).deqID .tid, vs[ps[(vs[first].next ' + qrl1).last].next].val), vs[(vs[first].next ' + qrl1).last].next ≠ null ∧ vs[vs[(vs[first].next ' + qrl1).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[first].next ' + qrl1).last].next].deqID.tid)) = Claimed(vs[vs[(vs[first].next ' + qrl1).last].next].deqID.tid, vs[vs[(vs[first].next ' + qrl1).last].next].val), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ qrl1, lst = vs[first].next ∨ lst ∈ qrl1 ∨ lst = vtail0 ∨ lst ∈ qrl, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), qrl1 = [], rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ Some((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ vtail0, first ≠ lst, phead ≠ vtail0, vretRefs(tid) ≠ null, vtail0 ≠ vs[first].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + (vs[first].next ' + qrl1) + vtail0 ' + qrl, vs, ps, owns), listp(vs[first].next ' + qrl1 + vtail0 ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(qrl1, ps), markedp(rl1, ps), markedp(qrl1, vs), nextnottid(tid, (vs[first].next ' + qrl1).last, vs), noid(tid, rl1 + first ' + (vs[first].next ' + qrl1) + vtail0 ' + qrl, (vs[first].next ' + qrl1).last, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + qrl1) + vtail0 ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), some?(ps[vs[first].next].deqID), some?(vs[vs[first].next].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + (vs[first].next ' + qrl1) + vtail0 ' + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl1 + qrl1), ¬ dups(qrl1 + qrl), ¬ dups(qrl), ¬ dups(qrl1), ¬ dups(rl1), ¬ dups(rl1 + qrl1 + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl1, ¬ first ∈ qrl, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl1, ¬ vtail0 ∈ rl1, ¬ first ∈ rl1, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl1, ¬ vs[first].next ∈ rl1, vs[(vs[first].next ' + qrl1).last].next ≠ null ∧ vs[vs[(vs[first].next ' + qrl1).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[first].next ' + qrl1).last].next].deqID.tid)) = Claimed(vs[vs[(vs[first].next ' + qrl1).last].next].deqID.tid, vs[vs[(vs[first].next ' + qrl1).last].next].val), (vs[first].next ' + qrl1).last = first → rvowns (vretRefs ((ps[(vs[first].next ' + qrl1).last].next ∈ vs ⊃ vs[ps[(vs[first].next ' + qrl1).last].next];ps[ps[(vs[first].next ' + qrl1).last].next]).deqID .tid)) = Claimed ((ps[(vs[first].next ' + qrl1).last].next ∈ vs ⊃ vs[ps[(vs[first].next ' + qrl1).last].next];ps[ps[(vs[first].next ' + qrl1).last].next]).deqID .tid, vs[ps[(vs[first].next ' + qrl1).last].next].val), vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ qrl1 ∨ lst = vtail0 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ qrl1 ⊦
ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), qrl1 = first0 + qrl0, rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ Some((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ vtail0, first ≠ lst, phead ≠ vtail0, vretRefs(tid) ≠ null, vtail0 ≠ vs[first].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + (vs[first].next ' + qrl1) + vtail0 ' + qrl, vs, ps, owns), listp(vs[first].next ' + qrl1 + vtail0 ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(qrl1, ps), markedp(rl1, ps), markedp(qrl1, vs), nextnottid(tid, (vs[first].next ' + qrl1).last, vs), noid(tid, rl1 + first ' + (vs[first].next ' + qrl1) + vtail0 ' + qrl, (vs[first].next ' + qrl1).last, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + qrl1) + vtail0 ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), some?(ps[vs[first].next].deqID), some?(vs[vs[first].next].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + (vs[first].next ' + qrl1) + vtail0 ' + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl1 + qrl1), ¬ dups(qrl1 + qrl), ¬ dups(qrl), ¬ dups(qrl1), ¬ dups(rl1), ¬ dups(rl1 + qrl1 + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl1, ¬ first ∈ qrl, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl1, ¬ vtail0 ∈ rl1, ¬ first ∈ rl1, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl1, ¬ vs[first].next ∈ rl1, vs[(vs[first].next ' + qrl1).last].next ≠ null ∧ vs[vs[(vs[first].next ' + qrl1).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[first].next ' + qrl1).last].next].deqID.tid)) = Claimed(vs[vs[(vs[first].next ' + qrl1).last].next].deqID.tid, vs[vs[(vs[first].next ' + qrl1).last].next].val), (vs[first].next ' + qrl1).last = first → rvowns (vretRefs ((ps[(vs[first].next ' + qrl1).last].next ∈ vs ⊃ vs[ps[(vs[first].next ' + qrl1).last].next];ps[ps[(vs[first].next ' + qrl1).last].next]).deqID .tid)) = Claimed ((ps[(vs[first].next ' + qrl1).last].next ∈ vs ⊃ vs[ps[(vs[first].next ' + qrl1).last].next];ps[ps[(vs[first].next ' + qrl1).last].next]).deqID .tid, vs[ps[(vs[first].next ' + qrl1).last].next].val), vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ qrl1 ∨ lst = vtail0 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ qrl1 ⊦
Used simplifier rules: reflist freely generated by [], +;;
| ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), qrl1 = [], rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ Some((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ vtail0, first ≠ lst, phead ≠ vtail0, vretRefs(tid) ≠ null, vtail0 ≠ vs[first].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + (vs[first].next ' + qrl1) + vtail0 ' + qrl, vs, ps, owns), listp(vs[first].next ' + qrl1 + vtail0 ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(qrl1, ps), markedp(rl1, ps), markedp(qrl1, vs), nextnottid(tid, (vs[first].next ' + qrl1).last, vs), noid(tid, rl1 + first ' + (vs[first].next ' + qrl1) + vtail0 ' + qrl, (vs[first].next ' + qrl1).last, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + qrl1) + vtail0 ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), some?(ps[vs[first].next].deqID), some?(vs[vs[first].next].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + (vs[first].next ' + qrl1) + vtail0 ' + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl1 + qrl1), ¬ dups(qrl1 + qrl), ¬ dups(qrl), ¬ dups(qrl1), ¬ dups(rl1), ¬ dups(rl1 + qrl1 + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl1, ¬ first ∈ qrl, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl1, ¬ vtail0 ∈ rl1, ¬ first ∈ rl1, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl1, ¬ vs[first].next ∈ rl1, vs[(vs[first].next ' + qrl1).last].next ≠ null ∧ vs[vs[(vs[first].next ' + qrl1).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[first].next ' + qrl1).last].next].deqID.tid)) = Claimed(vs[vs[(vs[first].next ' + qrl1).last].next].deqID.tid, vs[vs[(vs[first].next ' + qrl1).last].next].val), (vs[first].next ' + qrl1).last = first → rvowns (vretRefs ((ps[(vs[first].next ' + qrl1).last].next ∈ vs ⊃ vs[ps[(vs[first].next ' + qrl1).last].next];ps[ps[(vs[first].next ' + qrl1).last].next]).deqID .tid)) = Claimed ((ps[(vs[first].next ' + qrl1).last].next ∈ vs ⊃ vs[ps[(vs[first].next ' + qrl1).last].next];ps[ps[(vs[first].next ' + qrl1).last].next]).deqID .tid, vs[ps[(vs[first].next ' + qrl1).last].next].val), vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ qrl1 ∨ lst = vtail0 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ qrl1 ⊦ |
ps[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = vs[vs[first].next].deqID, ps[first].next = vs[first].next, ps[vs[first].next].next = vs[vs[first].next].next, ps[first].val = vs[first].val, ps[vs[first].next].val = vs[vs[first].next].val, dom vrvHp = dom prvHp, owns(first) = None, owns(vs[first].next) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[vs[first].next].deqID ≠ Some(vs[vs[first].next].deqID.tid), vs[first].next ≠ null, vs[vs[first].next].next ≠ vs[first].next, first ≠ vs[first].next, first ≠ null, first ≠ vs[vs[first].next].next, first ≠ lst, phead ≠ vs[vs[first].next].next, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[vs[first].next].next ' + qrl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, vs[first].next, vs), noid(tid, rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + qrl, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vs[first].next].deqID), some?(vs[vs[vs[first].next].next].deqID), some?(ps[vs[vs[first].next].next].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, vs[first].next ∈ vs, vs[first].next ∈ ps, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ weak?(vs[first].deqID), ¬ weak?(vs[vs[first].next].deqID), ¬ first ∈ qrl, ¬ vs[vs[first].next].next ∈ qrl, ¬ vs[vs[first].next].next ∈ rl1, ¬ first ∈ rl1, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl1, vs[vs[first].next].next ≠ null → rvowns(vretRefs(vs[vs[vs[first].next].next].deqID.tid)) = Claimed(vs[vs[vs[first].next].next].deqID.tid, vs[vs[vs[first].next].next].val), vtail = (vs[vs[first].next].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[vs[first].next].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next, lst = vs[first].next ∨ lst = vs[vs[first].next].next ∨ lst ∈ qrl ⊦
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] ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (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([], vs); (s)
| ps[first].deqID = vs[first].deqID, ps[vs[first].next].deqID = vs[vs[first].next].deqID, ps[first].next = vs[first].next, ps[vs[first].next].next = vs[vs[first].next].next, ps[first].val = vs[first].val, ps[vs[first].next].val = vs[vs[first].next].val, dom vrvHp = dom prvHp, owns(first) = None, owns(vs[first].next) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[vs[first].next].deqID ≠ Some(vs[vs[first].next].deqID.tid), vs[first].next ≠ null, vs[vs[first].next].next ≠ vs[first].next, first ≠ vs[first].next, first ≠ null, first ≠ vs[vs[first].next].next, first ≠ lst, phead ≠ vs[vs[first].next].next, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[vs[first].next].next ' + qrl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, vs[first].next, vs), noid(tid, rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + qrl, vs[first].next, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vs[first].next].deqID), some?(vs[vs[vs[first].next].next].deqID), some?(ps[vs[vs[first].next].next].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, vs[first].next ∈ vs, vs[first].next ∈ ps, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ weak?(vs[first].deqID), ¬ weak?(vs[vs[first].next].deqID), ¬ first ∈ qrl, ¬ vs[vs[first].next].next ∈ qrl, ¬ vs[vs[first].next].next ∈ rl1, ¬ first ∈ rl1, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl1, vs[vs[first].next].next ≠ null → rvowns(vretRefs(vs[vs[vs[first].next].next].deqID.tid)) = Claimed(vs[vs[vs[first].next].next].deqID.tid, vs[vs[vs[first].next].next].val), vtail = (vs[vs[first].next].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[vs[first].next].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next, lst = vs[first].next ∨ lst = vs[vs[first].next].next ∨ lst ∈ qrl ⊦ |
Used simplifier rules: ⊦ some?(opttid) → (tid = opttid.tid ↔ opttid = Some(tid)); (elim) Used terms: vs[vs[first].next].deqID, tid0
| ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), qrl1 = first0 + qrl0, rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ Some((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ vtail0, first ≠ lst, phead ≠ vtail0, vretRefs(tid) ≠ null, vtail0 ≠ vs[first].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + (vs[first].next ' + qrl1) + vtail0 ' + qrl, vs, ps, owns), listp(vs[first].next ' + qrl1 + vtail0 ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(qrl1, ps), markedp(rl1, ps), markedp(qrl1, vs), nextnottid(tid, (vs[first].next ' + qrl1).last, vs), noid(tid, rl1 + first ' + (vs[first].next ' + qrl1) + vtail0 ' + qrl, (vs[first].next ' + qrl1).last, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + qrl1) + vtail0 ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), some?(ps[vs[first].next].deqID), some?(vs[vs[first].next].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + (vs[first].next ' + qrl1) + vtail0 ' + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl1 + qrl1), ¬ dups(qrl1 + qrl), ¬ dups(qrl), ¬ dups(qrl1), ¬ dups(rl1), ¬ dups(rl1 + qrl1 + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl1, ¬ first ∈ qrl, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl1, ¬ vtail0 ∈ rl1, ¬ first ∈ rl1, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl1, ¬ vs[first].next ∈ rl1, vs[(vs[first].next ' + qrl1).last].next ≠ null ∧ vs[vs[(vs[first].next ' + qrl1).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[first].next ' + qrl1).last].next].deqID.tid)) = Claimed(vs[vs[(vs[first].next ' + qrl1).last].next].deqID.tid, vs[vs[(vs[first].next ' + qrl1).last].next].val), (vs[first].next ' + qrl1).last = first → rvowns (vretRefs ((ps[(vs[first].next ' + qrl1).last].next ∈ vs ⊃ vs[ps[(vs[first].next ' + qrl1).last].next];ps[ps[(vs[first].next ' + qrl1).last].next]).deqID .tid)) = Claimed ((ps[(vs[first].next ' + qrl1).last].next ∈ vs ⊃ vs[ps[(vs[first].next ' + qrl1).last].next];ps[ps[(vs[first].next ' + qrl1).last].next]).deqID .tid, vs[ps[(vs[first].next ' + qrl1).last].next].val), vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ qrl1 ∨ lst = vtail0 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ qrl1 ⊦ |
ps[vs[first].next].deqID = vs[vs[first].next].deqID, ps[first].deqID = vs[first].deqID, ps[vs[first].next].next = vs[vs[first].next].next, ps[first].next = vs[first].next, ps[vs[first].next].val = vs[vs[first].next].val, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(vs[first].next) = None, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ Some(vs[vs[first].next].deqID.tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ vs[vs[first].next].next, vs[first].next ≠ null, first ≠ vs[vs[first].next].next, first ≠ lst, first ≠ vtail0, first ≠ null, first ≠ vs[first].next, phead ≠ vtail0, vretRefs(tid) ≠ null, vtail0 ≠ vs[vs[first].next].next, vtail0 ≠ vs[first].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + qrl0) + vtail0 ' + qrl, vs, ps, owns), listp(vs[vs[first].next].next ' + qrl0 + vtail0 ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs), nextnottid(tid, (vs[vs[first].next].next ' + qrl0).last, vs), noid(tid, rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + qrl0) + vtail0 ' + qrl, (vs[vs[first].next].next ' + qrl0).last, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + qrl0) + vtail0 ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vs[vs[first].next].next].deqID), some?(vs[vs[vs[first].next].next].deqID), some?(vs[first].deqID), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), some?(vs[vs[first].next].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), vs[first].next ∈ ps, vs[first].next ∈ vs, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + qrl0) + vtail0 ' + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + qrl), ¬ dups(rl1), ¬ dups(rl1 + qrl0 + qrl), ¬ weak?(vs[first].deqID), ¬ weak?(vs[vs[first].next].deqID), ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ qrl, ¬ first ∈ rl1, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vs[vs[first].next].next ∈ qrl, ¬ vs[vs[first].next].next ∈ qrl0, ¬ vs[vs[first].next].next ∈ rl1, ¬ vs[first].next ∈ rl1, vs[(vs[vs[first].next].next ' + qrl0).last].next ≠ null ∧ vs[vs[(vs[vs[first].next].next ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[vs[first].next].next ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(vs[vs[first].next].next ' + qrl0).last].next].deqID.tid, vs[vs[(vs[vs[first].next].next ' + qrl0).last].next].val), (vs[vs[first].next].next ' + qrl0).last = first → rvowns (vretRefs ((ps[(vs[vs[first].next].next ' + qrl0).last].next ∈ vs ⊃ vs[ps[(vs[vs[first].next].next ' + qrl0).last].next] ;ps[ps[(vs[vs[first].next].next ' + qrl0).last].next] ) .deqID .tid)) = Claimed ((ps[(vs[vs[first].next].next ' + qrl0).last].next ∈ vs ⊃ vs[ps[(vs[vs[first].next].next ' + qrl0).last].next] ;ps[ps[(vs[vs[first].next].next ' + qrl0).last].next] ) .deqID .tid, vs[ps[(vs[vs[first].next].next ' + qrl0).last].next].val), lst = vs[first].next ∨ lst = vs[vs[first].next].next ∨ lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead = vs[vs[first].next].next ∨ phead ∈ qrl0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] 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) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (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) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s)
| ps[vs[first].next].deqID = vs[vs[first].next].deqID, ps[first].deqID = vs[first].deqID, ps[vs[first].next].next = vs[vs[first].next].next, ps[first].next = vs[first].next, ps[vs[first].next].val = vs[vs[first].next].val, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(vs[first].next) = None, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ Some(vs[vs[first].next].deqID.tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ vs[vs[first].next].next, vs[first].next ≠ null, first ≠ vs[vs[first].next].next, first ≠ lst, first ≠ vtail0, first ≠ null, first ≠ vs[first].next, phead ≠ vtail0, vretRefs(tid) ≠ null, vtail0 ≠ vs[vs[first].next].next, vtail0 ≠ vs[first].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + qrl0) + vtail0 ' + qrl, vs, ps, owns), listp(vs[vs[first].next].next ' + qrl0 + vtail0 ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs), nextnottid(tid, (vs[vs[first].next].next ' + qrl0).last, vs), noid(tid, rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + qrl0) + vtail0 ' + qrl, (vs[vs[first].next].next ' + qrl0).last, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + qrl0) + vtail0 ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vs[vs[first].next].next].deqID), some?(vs[vs[vs[first].next].next].deqID), some?(vs[first].deqID), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), some?(vs[vs[first].next].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), vs[first].next ∈ ps, vs[first].next ∈ vs, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + qrl0) + vtail0 ' + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl1 + qrl0), ¬ dups(qrl0 + qrl), ¬ dups(rl1), ¬ dups(rl1 + qrl0 + qrl), ¬ weak?(vs[first].deqID), ¬ weak?(vs[vs[first].next].deqID), ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ qrl, ¬ first ∈ rl1, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ vs[vs[first].next].next ∈ qrl, ¬ vs[vs[first].next].next ∈ qrl0, ¬ vs[vs[first].next].next ∈ rl1, ¬ vs[first].next ∈ rl1, vs[(vs[vs[first].next].next ' + qrl0).last].next ≠ null ∧ vs[vs[(vs[vs[first].next].next ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[vs[first].next].next ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(vs[vs[first].next].next ' + qrl0).last].next].deqID.tid, vs[vs[(vs[vs[first].next].next ' + qrl0).last].next].val), (vs[vs[first].next].next ' + qrl0).last = first → rvowns (vretRefs ((ps[(vs[vs[first].next].next ' + qrl0).last].next ∈ vs ⊃ vs[ps[(vs[vs[first].next].next ' + qrl0).last].next] ;ps[ps[(vs[vs[first].next].next ' + qrl0).last].next] ) .deqID .tid)) = Claimed ((ps[(vs[vs[first].next].next ' + qrl0).last].next ∈ vs ⊃ vs[ps[(vs[vs[first].next].next ' + qrl0).last].next] ;ps[ps[(vs[vs[first].next].next ' + qrl0).last].next] ) .deqID .tid, vs[ps[(vs[vs[first].next].next ' + qrl0).last].next].val), lst = vs[first].next ∨ lst = vs[vs[first].next].next ∨ lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead = vs[vs[first].next].next ∨ phead ∈ qrl0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
Used simplifier rules: ⊦ some?(opttid) → (tid = opttid.tid ↔ opttid = Some(tid)); (elim) Used terms: vs[vs[first].next].deqID, tid0
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.