| ⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D2, a) ∧ pcstepf(gs, ls, D2, a) = D3 → ( gstepf(gs, ls, D2, a).rvowns(lstepf(gs, ls, D2, a).rvref) = Pending(lstepf(gs, ls, D2, a).tid) ∧ lstepf(gs, ls, D2, a).rvref ∈ gstepf(gs, ls, D2, a).vrvHp ∧ lstepf(gs, ls, D2, a).rvref ∈ gstepf(gs, ls, D2, a).prvHp ∧ lstepf(gs, ls, D2, a).rvref ≠ null) ∧ ( listp(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps, gstepf(gs, ls, D2, a).owns) ∧ ¬ dups(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl) ∧ markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).ps) ∧ markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).vs) ∧ unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).ps) ∧ gstepf(gs, ls, D2, a).orl ≠ [] ∧ gstepf(gs, ls, D2, a).phead ∈ gstepf(gs, ls, D2, a).orl ∧ rvownerok(gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp, gstepf(gs, ls, D2, a).rvowns) ∧ allocrv(gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp, gstepf(gs, ls, D2, a).rvowns) ∧ allocrv(gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp) ∧ dom gstepf(gs, ls, D2, a).vrvHp = dom gstepf(gs, ls, D2, a).prvHp ∧ ( gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next ≠ null ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D2, a).rvowns (gstepf(gs, ls, D2, a).vretRefs(gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID.tid, gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D2, a).orl.last = gstepf(gs, ls, D2, a).vhead ∧ (gstepf(gs, ls, D2, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D2, a).qrl.tail, gstepf(gs, ls, D2, a).vs)) ∨ gstepf(gs, ls, D2, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D2, a).orl.butlast.last = gstepf(gs, ls, D2, a).vhead ∧ gstepf(gs, ls, D2, a).phead ≠ gstepf(gs, ls, D2, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs)) ∧ ( gstepf(gs, ls, D2, a).vtail = (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl).last ∨ gstepf(gs, ls, D2, a).qrl ≠ [] ∧ gstepf(gs, ls, D2, a).vtail = (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl.butlast).last ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D2, a).vs[(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs) ∧ noid(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs) ∧ noowns(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).owns) |
dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, D2, a) = D3, gs.orl ≠ [], 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, D2, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( gstepf(gs, ls, D2, a).rvowns(lstepf(gs, ls, D2, a).rvref) = Pending(lstepf(gs, ls, D2, a).tid) ∧ lstepf(gs, ls, D2, a).rvref ∈ gstepf(gs, ls, D2, a).vrvHp ∧ lstepf(gs, ls, D2, a).rvref ∈ gstepf(gs, ls, D2, a).prvHp ∧ lstepf(gs, ls, D2, a).rvref ≠ null) ∧ ( listp(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps, gstepf(gs, ls, D2, a).owns) ∧ ¬ dups(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl) ∧ markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).ps) ∧ markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).vs) ∧ unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).ps) ∧ gstepf(gs, ls, D2, a).orl ≠ [] ∧ gstepf(gs, ls, D2, a).phead ∈ gstepf(gs, ls, D2, a).orl ∧ rvownerok(gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp, gstepf(gs, ls, D2, a).rvowns) ∧ allocrv(gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp, gstepf(gs, ls, D2, a).rvowns) ∧ allocrv(gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp) ∧ dom gstepf(gs, ls, D2, a).vrvHp = dom gstepf(gs, ls, D2, a).prvHp ∧ ( gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next ≠ null ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D2, a).rvowns (gstepf(gs, ls, D2, a).vretRefs(gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID.tid, gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D2, a).orl.last = gstepf(gs, ls, D2, a).vhead ∧ (gstepf(gs, ls, D2, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D2, a).qrl.tail, gstepf(gs, ls, D2, a).vs)) ∨ gstepf(gs, ls, D2, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D2, a).orl.butlast.last = gstepf(gs, ls, D2, a).vhead ∧ gstepf(gs, ls, D2, a).phead ≠ gstepf(gs, ls, D2, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs)) ∧ ( gstepf(gs, ls, D2, a).vtail = (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl).last ∨ gstepf(gs, ls, D2, a).qrl ≠ [] ∧ gstepf(gs, ls, D2, a).vtail = (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl.butlast).last ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D2, a).vs[(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs) ∧ noid(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs) ∧ noowns(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).owns)
| dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, D2, a) = D3, gs.orl ≠ [], 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, D2, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( gstepf(gs, ls, D2, a).rvowns(lstepf(gs, ls, D2, a).rvref) = Pending(lstepf(gs, ls, D2, a).tid) ∧ lstepf(gs, ls, D2, a).rvref ∈ gstepf(gs, ls, D2, a).vrvHp ∧ lstepf(gs, ls, D2, a).rvref ∈ gstepf(gs, ls, D2, a).prvHp ∧ lstepf(gs, ls, D2, a).rvref ≠ null) ∧ ( listp(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps, gstepf(gs, ls, D2, a).owns) ∧ ¬ dups(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl) ∧ markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).ps) ∧ markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).vs) ∧ unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).ps) ∧ gstepf(gs, ls, D2, a).orl ≠ [] ∧ gstepf(gs, ls, D2, a).phead ∈ gstepf(gs, ls, D2, a).orl ∧ rvownerok(gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp, gstepf(gs, ls, D2, a).rvowns) ∧ allocrv(gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp, gstepf(gs, ls, D2, a).rvowns) ∧ allocrv(gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp) ∧ dom gstepf(gs, ls, D2, a).vrvHp = dom gstepf(gs, ls, D2, a).prvHp ∧ ( gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next ≠ null ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D2, a).rvowns (gstepf(gs, ls, D2, a).vretRefs(gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID.tid, gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D2, a).orl.last = gstepf(gs, ls, D2, a).vhead ∧ (gstepf(gs, ls, D2, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D2, a).qrl.tail, gstepf(gs, ls, D2, a).vs)) ∨ gstepf(gs, ls, D2, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D2, a).orl.butlast.last = gstepf(gs, ls, D2, a).vhead ∧ gstepf(gs, ls, D2, a).phead ≠ gstepf(gs, ls, D2, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs)) ∧ ( gstepf(gs, ls, D2, a).vtail = (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl).last ∨ gstepf(gs, ls, D2, a).qrl ≠ [] ∧ gstepf(gs, ls, D2, a).vtail = (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl.butlast).last ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D2, a).vs[(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs) ∧ noid(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs) ∧ noowns(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).owns) |
dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], rvref ≠ null, allocrv(gs.vretRefs, gs.vrvHp[rvref, optval00]), allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ rvref ∈ gs.vrvHp, ¬ rvref ∈ 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.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null, gs.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.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → (rvref = gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid) ⊃ Pending(ls.tid);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)) ∧ allocrv(gs.pretRefs, gs.prvHp[rvref, optval00]) ∧ rvownerok(gs.pretRefs, gs.prvHp[rvref, optval00], gs.rvowns(rvref; Pending(ls.tid))) ∧ rvownerok(gs.vretRefs, gs.vrvHp[rvref, optval00], gs.rvowns(rvref; Pending(ls.tid)))
Used simplifier rules: ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws) ⊦ allocrv(vretRefs, vrvHp) → ( allocrv(vretRefs0, vrvHp0) ↔ (∀ tid. vretRefs(tid) = null ∨ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null → vretRefs0(tid) = null ∨ vretRefs0(tid) ∈ vrvHp0 ∧ vretRefs0(tid) ≠ null)); (ss) ⊦ (gs.vrvHp:= vrvHp).owns = gs.owns; (s) ⊦ (gs.prvHp:= vrvHp0).owns = gs.owns; (s) ⊦ (gs.rvowns:= rvowns).owns = gs.owns; (s) ⊦ (ls.rvref:= rvref).tid = ls.tid; (s) ⊦ (ls.optval0:= optval0).tid = ls.tid; (s) ⊦ (ls.rvref:= rvref).rvref = rvref; (s) ⊦ (ls.optval0:= optval0).rvref = ls.rvref; (s) ⊦ (ls.optval0:= optval0).optval0 = optval0; (s) ⊦ gstepf(gs, ls, D2, chooseD2(rvref0, optval00)) = ( ( gs .vrvHp:= gs.vrvHp [((ls.rvref:= rvref0).optval0:= optval00 ).rvref, ((ls.rvref:= rvref0).optval0:= optval00 ).optval0 ]) .prvHp:= gs.prvHp [((ls.rvref:= rvref0).optval0:= optval00).rvref, ((ls.rvref:= rvref0).optval0:= optval00).optval0 ]) .rvowns:= gs.rvowns (((ls.rvref:= rvref0).optval0:= optval00).rvref ; Pending(((ls.rvref:= rvref0).optval0:= optval00).tid) ); (s) ⊦ lstepf(gs, ls, D2, chooseD2(rvref0, optval00)) = (ls.rvref:= rvref0).optval0:= optval00; (s) ⊦ (gs.vrvHp:= vrvHp).vs = gs.vs; (s) ⊦ (gs.prvHp:= vrvHp0).vs = gs.vs; (s) ⊦ (gs.rvowns:= rvowns).vs = gs.vs; (s) ⊦ (gs.vrvHp:= vrvHp).vhead = gs.vhead; (s) ⊦ (gs.prvHp:= vrvHp0).vhead = gs.vhead; (s) ⊦ (gs.rvowns:= rvowns).vhead = gs.vhead; (s) ⊦ (gs.vrvHp:= vrvHp).qrl = gs.qrl; (s) ⊦ (gs.prvHp:= vrvHp0).qrl = gs.qrl; (s) ⊦ (gs.rvowns:= rvowns).qrl = gs.qrl; (s) ⊦ (gs.vrvHp:= vrvHp).orl = gs.orl; (s) ⊦ (gs.prvHp:= vrvHp0).orl = gs.orl; (s) ⊦ (gs.rvowns:= rvowns).orl = gs.orl; (s) ⊦ (gs.vrvHp:= vrvHp).vtail = gs.vtail; (s) ⊦ (gs.prvHp:= vrvHp0).vtail = gs.vtail; (s) ⊦ (gs.rvowns:= rvowns).vtail = gs.vtail; (s) ⊦ (gs.vrvHp:= vrvHp).phead = gs.phead; (s) ⊦ (gs.prvHp:= vrvHp0).phead = gs.phead; (s) ⊦ (gs.rvowns:= rvowns).phead = gs.phead; (s) ⊦ (gs.rvowns:= rvowns).rvowns = rvowns; (s) ⊦ (gs.vrvHp:= vrvHp).vretRefs = gs.vretRefs; (s) ⊦ (gs.prvHp:= vrvHp0).vretRefs = gs.vretRefs; (s) ⊦ (gs.rvowns:= rvowns).vretRefs = gs.vretRefs; (s) ⊦ dom st[a, d] = dom st ++ a; (s) ⊦ (gs.prvHp:= vrvHp0).prvHp = vrvHp0; (s) ⊦ (gs.rvowns:= rvowns).prvHp = gs.prvHp; (s) ⊦ (gs.vrvHp:= vrvHp).vrvHp = vrvHp; (s) ⊦ (gs.prvHp:= vrvHp0).vrvHp = gs.vrvHp; (s) ⊦ (gs.rvowns:= rvowns).vrvHp = gs.vrvHp; (s) ⊦ (gs.vrvHp:= vrvHp).pretRefs = gs.pretRefs; (s) ⊦ (gs.prvHp:= vrvHp0).pretRefs = gs.pretRefs; (s) ⊦ (gs.rvowns:= rvowns).pretRefs = gs.pretRefs; (s) ⊦ (gs.vrvHp:= vrvHp).ps = gs.ps; (s) ⊦ (gs.prvHp:= vrvHp0).ps = gs.ps; (s) ⊦ (gs.rvowns:= rvowns).ps = gs.ps; (s) ⊦ a ∈ st[a, d]; (s) ⊦ Pending(tid) = Pending(tid0) ↔ tid = tid0; (s) ⊦ chooseD2(rvref, optval) = chooseD2(rvref0, optval0) ↔ rvref = rvref0 ∧ optval = optval0; (ws) ⊦ chooseD2(rvref, optval) ≠ τ; (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 ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ dom st0 = dom st1 ∧ a ∈ st0 → a ∈ st1; (ss) ⊦ pre(gs, ls, D2, a) ↔ (∃ rvref0, optval00. (¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null) ∧ a = chooseD2(rvref0, optval00)) ∨ a = τ ∧ ¬ (∃ rvref0, optval00. ¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null); (s) ⊦ D2 ≠ D3; (s) ⊦ pcstepf(gs, ls, D2, a) = (∃ rvref0, optval00. a = chooseD2(rvref0, optval00) ⊃ D3;D2); (s)
| dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], rvref ≠ null, allocrv(gs.vretRefs, gs.vrvHp[rvref, optval00]), allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ rvref ∈ gs.vrvHp, ¬ rvref ∈ 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.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null, gs.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.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → (rvref = gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid) ⊃ Pending(ls.tid);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)) ∧ allocrv(gs.pretRefs, gs.prvHp[rvref, optval00]) ∧ rvownerok(gs.pretRefs, gs.prvHp[rvref, optval00], gs.rvowns(rvref; Pending(ls.tid))) ∧ rvownerok(gs.vretRefs, gs.vrvHp[rvref, optval00], gs.rvowns(rvref; Pending(ls.tid))) |
dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp[rvref, optval00]), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → (rvref = vretRefs(vs[vs[vhead].next].deqID.tid) ⊃ Pending(ls.tid);rvowns(vretRefs(vs[vs[vhead].next].deqID.tid))) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val)) ∧ allocrv(pretRefs, prvHp[rvref, optval00]) ∧ rvownerok(pretRefs, prvHp[rvref, optval00], rvowns(rvref; Pending(ls.tid))) ∧ rvownerok(vretRefs, vrvHp[rvref, optval00], rvowns(rvref; Pending(ls.tid)))
Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ((ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns); (elim) Used terms: qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs
| dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp[rvref, optval00]), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → (rvref = vretRefs(vs[vs[vhead].next].deqID.tid) ⊃ Pending(ls.tid);rvowns(vretRefs(vs[vs[vhead].next].deqID.tid))) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val)) ∧ allocrv(pretRefs, prvHp[rvref, optval00]) ∧ rvownerok(pretRefs, prvHp[rvref, optval00], rvowns(rvref; Pending(ls.tid))) ∧ rvownerok(vretRefs, vrvHp[rvref, optval00], rvowns(rvref; Pending(ls.tid))) |
dom vrvHp = dom prvHp, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp[rvref, optval00]), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ( vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → (rvref = vretRefs(vs[vs[vhead].next].deqID.tid) ⊃ Pending(ls.tid);rvowns(vretRefs(vs[vs[vhead].next].deqID.tid))) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val)) ∧ allocrv(pretRefs, prvHp[rvref, optval00]) ∧ rvownerok(pretRefs, prvHp[rvref, optval00], rvowns(rvref; Pending(ls.tid))) ∧ rvownerok(vretRefs, vrvHp[rvref, optval00], rvowns(rvref; Pending(ls.tid)))
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] 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, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp[rvref, optval00]), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ( vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → (rvref = vretRefs(vs[vs[vhead].next].deqID.tid) ⊃ Pending(ls.tid);rvowns(vretRefs(vs[vs[vhead].next].deqID.tid))) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val)) ∧ allocrv(pretRefs, prvHp[rvref, optval00]) ∧ rvownerok(pretRefs, prvHp[rvref, optval00], rvowns(rvref; Pending(ls.tid))) ∧ rvownerok(vretRefs, vrvHp[rvref, optval00], rvowns(rvref; Pending(ls.tid))) |
dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref0, optval0, first, othertid, addr), orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp[rvref, optval00]), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → (rvref = vretRefs(vs[vs[vhead].next].deqID.tid) ⊃ Pending(tid);rvowns(vretRefs(vs[vs[vhead].next].deqID.tid))) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val)) ∧ allocrv(pretRefs, prvHp[rvref, optval00]) ∧ rvownerok(pretRefs, prvHp[rvref, optval00], rvowns(rvref; Pending(tid))) ∧ rvownerok(vretRefs, vrvHp[rvref, optval00], rvowns(rvref; Pending(tid)))
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, rvref0, othertid, success, optval
| dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref0, optval0, first, othertid, addr), orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp[rvref, optval00]), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → (rvref = vretRefs(vs[vs[vhead].next].deqID.tid) ⊃ Pending(tid);rvowns(vretRefs(vs[vs[vhead].next].deqID.tid))) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val)) ∧ allocrv(pretRefs, prvHp[rvref, optval00]) ∧ rvownerok(pretRefs, prvHp[rvref, optval00], rvowns(rvref; Pending(tid))) ∧ rvownerok(vretRefs, vrvHp[rvref, optval00], rvowns(rvref; Pending(tid))) |
dom vrvHp = dom prvHp, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp[rvref, optval00]), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ( vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → (rvref = vretRefs(vs[vs[vhead].next].deqID.tid) ⊃ Pending(tid);rvowns(vretRefs(vs[vs[vhead].next].deqID.tid))) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val)) ∧ allocrv(pretRefs, prvHp[rvref, optval00]) ∧ rvownerok(pretRefs, prvHp[rvref, optval00], rvowns(rvref; Pending(tid))) ∧ rvownerok(vretRefs, vrvHp[rvref, optval00], rvowns(rvref; Pending(tid)))
| dom vrvHp = dom prvHp, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp[rvref, optval00]), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ( vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → (rvref = vretRefs(vs[vs[vhead].next].deqID.tid) ⊃ Pending(tid);rvowns(vretRefs(vs[vs[vhead].next].deqID.tid))) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val)) ∧ allocrv(pretRefs, prvHp[rvref, optval00]) ∧ rvownerok(pretRefs, prvHp[rvref, optval00], rvowns(rvref; Pending(tid))) ∧ rvownerok(vretRefs, vrvHp[rvref, optval00], rvowns(rvref; Pending(tid))) |
dom vrvHp = dom prvHp, vs[vs[vhead].next].deqID ≠ None, vs[vhead].next ≠ null, (rvref = vretRefs(vs[vs[vhead].next].deqID.tid) ⊃ Pending(tid);rvowns(vretRefs(vs[vs[vhead].next].deqID.tid))) ≠ Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp[rvref, optval00]), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
dom vrvHp = dom prvHp, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp[rvref, optval00]), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ allocrv(pretRefs, prvHp[rvref, optval00]), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
dom vrvHp = dom prvHp, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp[rvref, optval00]), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvownerok(pretRefs, prvHp[rvref, optval00], rvowns(rvref; Pending(tid))), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: ⊦ rvownerok(vretRefs, vrvHp, rvowns) → ( rvownerok(vretRefs0, vrvHp0, rvowns0) ↔ (∀ tid. ( vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid) → vretRefs0(tid) ≠ null → vretRefs0(tid) ∈ vrvHp0 ∧ rvowns0(vretRefs0(tid)).tid = tid)); (ss) ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws)
| dom vrvHp = dom prvHp, vs[vs[vhead].next].deqID ≠ None, vs[vhead].next ≠ null, (rvref = vretRefs(vs[vs[vhead].next].deqID.tid) ⊃ Pending(tid);rvowns(vretRefs(vs[vs[vhead].next].deqID.tid))) ≠ Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp[rvref, optval00]), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
dom vrvHp = dom prvHp, rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[vs[vhead].next].deqID ≠ None, vs[vhead].next ≠ null, (rvref = vretRefs(vs[vs[vhead].next].deqID.tid) ⊃ Pending(tid);Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val)) ≠ Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp[rvref, optval00]), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
| dom vrvHp = dom prvHp, rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[vs[vhead].next].deqID ≠ None, vs[vhead].next ≠ null, (rvref = vretRefs(vs[vs[vhead].next].deqID.tid) ⊃ Pending(tid);Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val)) ≠ Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp[rvref, optval00]), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
dom vrvHp = dom prvHp, rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), rvref = vretRefs(vs[vs[vhead].next].deqID.tid), vs[vs[vhead].next].deqID ≠ None, vs[vhead].next ≠ null, Pending(tid) ≠ Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp[rvref, optval00]), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
| dom vrvHp = dom prvHp, rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), rvref = vretRefs(vs[vs[vhead].next].deqID.tid), vs[vs[vhead].next].deqID ≠ None, vs[vhead].next ≠ null, Pending(tid) ≠ Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp[rvref, optval00]), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
dom vrvHp = dom prvHp, rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[vs[vhead].next].deqID ≠ None, vs[vhead].next ≠ null, orl ≠ [], vretRefs(vs[vs[vhead].next].deqID.tid) ≠ null, allocrv(vretRefs, vrvHp[vretRefs(vs[vs[vhead].next].deqID.tid), optval00]), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vretRefs(vs[vs[vhead].next].deqID.tid) ∈ vrvHp, ¬ vretRefs(vs[vs[vhead].next].deqID.tid) ∈ prvHp, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ Pending(tid) ≠ Claimed(tid0, val); (s)
| dom vrvHp = dom prvHp, rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[vs[vhead].next].deqID ≠ None, vs[vhead].next ≠ null, orl ≠ [], vretRefs(vs[vs[vhead].next].deqID.tid) ≠ null, allocrv(vretRefs, vrvHp[vretRefs(vs[vs[vhead].next].deqID.tid), optval00]), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vretRefs(vs[vs[vhead].next].deqID.tid) ∈ vrvHp, ¬ vretRefs(vs[vs[vhead].next].deqID.tid) ∈ prvHp, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ allocrv(vretRefs, vrvHp) ↔ (∀ tid. vretRefs(tid) = null ∨ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null)
dom vrvHp = dom prvHp, rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[vs[vhead].next].deqID ≠ None, vs[vhead].next ≠ null, orl ≠ [], vretRefs(vs[vs[vhead].next].deqID.tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp[vretRefs(vs[vs[vhead].next].deqID.tid), optval00]), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vretRefs(vs[vs[vhead].next].deqID.tid) ∈ vrvHp, ¬ vretRefs(vs[vs[vhead].next].deqID.tid) ∈ prvHp, ∀ tid. vretRefs(tid) = null ∨ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used terms: vretRefs, vrvHp
| ⊦ allocrv(vretRefs, vrvHp) ↔ (∀ tid. vretRefs(tid) = null ∨ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null) |
| dom vrvHp = dom prvHp, rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[vs[vhead].next].deqID ≠ None, vs[vhead].next ≠ null, orl ≠ [], vretRefs(vs[vs[vhead].next].deqID.tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp[vretRefs(vs[vs[vhead].next].deqID.tid), optval00]), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vretRefs(vs[vs[vhead].next].deqID.tid) ∈ vrvHp, ¬ vretRefs(vs[vs[vhead].next].deqID.tid) ∈ prvHp, ∀ tid. vretRefs(tid) = null ∨ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
dom vrvHp = dom prvHp, rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[vs[vhead].next].deqID ≠ None, vs[vhead].next ≠ null, orl ≠ [], vretRefs(vs[vs[vhead].next].deqID.tid) ≠ null, allocrv(vretRefs, vrvHp[vretRefs(vs[vs[vhead].next].deqID.tid), optval00]), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vretRefs(vs[vs[vhead].next].deqID.tid) ∈ vrvHp, ¬ vretRefs(vs[vs[vhead].next].deqID.tid) ∈ prvHp, ∀ tid0. vretRefs(tid0) = null ∨ vretRefs(tid0) ∈ vrvHp, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
| dom vrvHp = dom prvHp, rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[vs[vhead].next].deqID ≠ None, vs[vhead].next ≠ null, orl ≠ [], vretRefs(vs[vs[vhead].next].deqID.tid) ≠ null, allocrv(vretRefs, vrvHp[vretRefs(vs[vs[vhead].next].deqID.tid), optval00]), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vretRefs(vs[vs[vhead].next].deqID.tid) ∈ vrvHp, ¬ vretRefs(vs[vs[vhead].next].deqID.tid) ∈ prvHp, ∀ tid0. vretRefs(tid0) = null ∨ vretRefs(tid0) ∈ vrvHp, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
Used terms: vs[vs[vhead].next].deqID.tid
| dom vrvHp = dom prvHp, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp[rvref, optval00]), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ allocrv(pretRefs, prvHp[rvref, optval00]), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
dom vrvHp = dom prvHp, orl ≠ [], pretRefs(tid0) ≠ null, pretRefs(tid0) ≠ rvref, rvref ≠ null, allocrv(vretRefs, vrvHp[rvref, optval00]), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, ¬ pretRefs(tid0) ∈ prvHp, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vretRefs(tid0) = null ∨ vretRefs(tid0) ∈ vrvHp ⊦
Used simplifier rules: ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws) ⊦ allocrv(vretRefs, vrvHp) → ( allocrv(vretRefs0, vrvHp0) ↔ (∀ tid. vretRefs(tid) = null ∨ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null → vretRefs0(tid) = null ∨ vretRefs0(tid) ∈ vrvHp0 ∧ vretRefs0(tid) ≠ null)); (ss)
| dom vrvHp = dom prvHp, orl ≠ [], pretRefs(tid0) ≠ null, pretRefs(tid0) ≠ rvref, rvref ≠ null, allocrv(vretRefs, vrvHp[rvref, optval00]), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, ¬ pretRefs(tid0) ∈ prvHp, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vretRefs(tid0) = null ∨ vretRefs(tid0) ∈ vrvHp ⊦ |
⊦ allocrv(vretRefs, vrvHp) ↔ (∀ tid. vretRefs(tid) = null ∨ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null)
dom vrvHp = dom prvHp, orl ≠ [], pretRefs(tid0) ≠ null, pretRefs(tid0) ≠ rvref, rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(vretRefs, vrvHp[rvref, optval00]), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, ¬ pretRefs(tid0) ∈ prvHp, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ tid. pretRefs(tid) = null ∨ pretRefs(tid) ∈ prvHp ∧ pretRefs(tid) ≠ null, vretRefs(tid0) = null ∨ vretRefs(tid0) ∈ vrvHp, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used terms: pretRefs, prvHp
| ⊦ allocrv(vretRefs, vrvHp) ↔ (∀ tid. vretRefs(tid) = null ∨ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null) |
| dom vrvHp = dom prvHp, orl ≠ [], pretRefs(tid0) ≠ null, pretRefs(tid0) ≠ rvref, rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(vretRefs, vrvHp[rvref, optval00]), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, ¬ pretRefs(tid0) ∈ prvHp, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ tid. pretRefs(tid) = null ∨ pretRefs(tid) ∈ prvHp ∧ pretRefs(tid) ≠ null, vretRefs(tid0) = null ∨ vretRefs(tid0) ∈ vrvHp, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
dom vrvHp = dom prvHp, orl ≠ [], pretRefs(tid0) ≠ null, pretRefs(tid0) ≠ rvref, rvref ≠ null, allocrv(vretRefs, vrvHp[rvref, optval00]), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, ¬ pretRefs(tid0) ∈ prvHp, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ tid1. pretRefs(tid1) = null ∨ pretRefs(tid1) ∈ prvHp, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vretRefs(tid0) = null ∨ vretRefs(tid0) ∈ vrvHp ⊦
| dom vrvHp = dom prvHp, orl ≠ [], pretRefs(tid0) ≠ null, pretRefs(tid0) ≠ rvref, rvref ≠ null, allocrv(vretRefs, vrvHp[rvref, optval00]), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, ¬ pretRefs(tid0) ∈ prvHp, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ tid1. pretRefs(tid1) = null ∨ pretRefs(tid1) ∈ prvHp, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vretRefs(tid0) = null ∨ vretRefs(tid0) ∈ vrvHp ⊦ |
Used terms: tid0
| dom vrvHp = dom prvHp, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp[rvref, optval00]), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvownerok(pretRefs, prvHp[rvref, optval00], rvowns(rvref; Pending(tid))), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
dom vrvHp = dom prvHp, orl ≠ [], pretRefs(tid0) ≠ null, rvref ≠ null, allocrv(vretRefs, vrvHp[rvref, optval00]), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vretRefs(tid0) ≠ null → vretRefs(tid0) ∈ vrvHp ∧ rvowns(vretRefs(tid0)).tid = tid0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ pretRefs(tid0) ∈ prvHp[rvref, optval00] ∧ (rvref = pretRefs(tid0) ⊃ Pending(tid);rvowns(pretRefs(tid0))).tid = tid0
Used simplifier rules: ⊦ rvownerok(vretRefs, vrvHp, rvowns) → ( rvownerok(vretRefs0, vrvHp0, rvowns0) ↔ (∀ tid. ( vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid) → vretRefs0(tid) ≠ null → vretRefs0(tid) ∈ vrvHp0 ∧ rvowns0(vretRefs0(tid)).tid = tid)); (ss)
| dom vrvHp = dom prvHp, orl ≠ [], pretRefs(tid0) ≠ null, rvref ≠ null, allocrv(vretRefs, vrvHp[rvref, optval00]), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vretRefs(tid0) ≠ null → vretRefs(tid0) ∈ vrvHp ∧ rvowns(vretRefs(tid0)).tid = tid0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ pretRefs(tid0) ∈ prvHp[rvref, optval00] ∧ (rvref = pretRefs(tid0) ⊃ Pending(tid);rvowns(pretRefs(tid0))).tid = tid0 |
⊦ allocrv(vretRefs, vrvHp) ↔ (∀ tid. vretRefs(tid) = null ∨ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null)
dom vrvHp = dom prvHp, orl ≠ [], pretRefs(tid0) ≠ null, rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(vretRefs, vrvHp[rvref, optval00]), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, vretRefs(tid0) ≠ null → vretRefs(tid0) ∈ vrvHp ∧ rvowns(vretRefs(tid0)).tid = tid0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ tid. pretRefs(tid) = null ∨ pretRefs(tid) ∈ prvHp ∧ pretRefs(tid) ≠ null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ pretRefs(tid0) ∈ prvHp[rvref, optval00] ∧ (rvref = pretRefs(tid0) ⊃ Pending(tid);rvowns(pretRefs(tid0))).tid = tid0
Used terms: pretRefs, prvHp
| ⊦ allocrv(vretRefs, vrvHp) ↔ (∀ tid. vretRefs(tid) = null ∨ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null) |
| dom vrvHp = dom prvHp, orl ≠ [], pretRefs(tid0) ≠ null, rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(vretRefs, vrvHp[rvref, optval00]), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, vretRefs(tid0) ≠ null → vretRefs(tid0) ∈ vrvHp ∧ rvowns(vretRefs(tid0)).tid = tid0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ tid. pretRefs(tid) = null ∨ pretRefs(tid) ∈ prvHp ∧ pretRefs(tid) ≠ null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ pretRefs(tid0) ∈ prvHp[rvref, optval00] ∧ (rvref = pretRefs(tid0) ⊃ Pending(tid);rvowns(pretRefs(tid0))).tid = tid0 |
dom vrvHp = dom prvHp, orl ≠ [], pretRefs(tid0) ≠ null, rvref ≠ null, allocrv(vretRefs, vrvHp[rvref, optval00]), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vretRefs(tid0) ≠ null → vretRefs(tid0) ∈ vrvHp ∧ rvowns(vretRefs(tid0)).tid = tid0, ∀ tid1. pretRefs(tid1) = null ∨ pretRefs(tid1) ∈ prvHp, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ pretRefs(tid0) ∈ prvHp[rvref, optval00] ∧ (rvref = pretRefs(tid0) ⊃ Pending(tid);rvowns(pretRefs(tid0))).tid = tid0
| dom vrvHp = dom prvHp, orl ≠ [], pretRefs(tid0) ≠ null, rvref ≠ null, allocrv(vretRefs, vrvHp[rvref, optval00]), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vretRefs(tid0) ≠ null → vretRefs(tid0) ∈ vrvHp ∧ rvowns(vretRefs(tid0)).tid = tid0, ∀ tid1. pretRefs(tid1) = null ∨ pretRefs(tid1) ∈ prvHp, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ pretRefs(tid0) ∈ prvHp[rvref, optval00] ∧ (rvref = pretRefs(tid0) ⊃ Pending(tid);rvowns(pretRefs(tid0))).tid = tid0 |
dom vrvHp = dom prvHp, orl ≠ [], pretRefs(tid0) ≠ null, rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(vretRefs, vrvHp[rvref, optval00]), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, vretRefs(tid0) ≠ null → vretRefs(tid0) ∈ vrvHp ∧ rvowns(vretRefs(tid0)).tid = tid0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, pretRefs(tid0) = null ∨ pretRefs(tid0) ∈ prvHp ⊦ pretRefs(tid0) ∈ prvHp[rvref, optval00] ∧ (rvref = pretRefs(tid0) ⊃ Pending(tid);rvowns(pretRefs(tid0))).tid = tid0
Used terms: tid0
| dom vrvHp = dom prvHp, orl ≠ [], pretRefs(tid0) ≠ null, rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(vretRefs, vrvHp[rvref, optval00]), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref ∈ vrvHp, ¬ rvref ∈ prvHp, vretRefs(tid0) ≠ null → vretRefs(tid0) ∈ vrvHp ∧ rvowns(vretRefs(tid0)).tid = tid0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, pretRefs(tid0) = null ∨ pretRefs(tid0) ∈ prvHp ⊦ pretRefs(tid0) ∈ prvHp[rvref, optval00] ∧ (rvref = pretRefs(tid0) ⊃ Pending(tid);rvowns(pretRefs(tid0))).tid = tid0 |
dom vrvHp = dom prvHp, rvowns(pretRefs(tid0)).tid ≠ tid0, orl ≠ [], pretRefs(tid0) ≠ null, rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(vretRefs, vrvHp[rvref, optval00]), 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), pretRefs(tid0) ∈ prvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, pretRefs(tid0) ∈ prvHp[rvref, optval00], ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ rvref ∈ prvHp, ¬ rvref ∈ vrvHp, vretRefs(tid0) ≠ null → vretRefs(tid0) ∈ vrvHp ∧ rvowns(vretRefs(tid0)).tid = tid0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws)
| dom vrvHp = dom prvHp, rvowns(pretRefs(tid0)).tid ≠ tid0, orl ≠ [], pretRefs(tid0) ≠ null, rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(vretRefs, vrvHp[rvref, optval00]), 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), pretRefs(tid0) ∈ prvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, pretRefs(tid0) ∈ prvHp[rvref, optval00], ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ rvref ∈ prvHp, ¬ rvref ∈ vrvHp, vretRefs(tid0) ≠ null → vretRefs(tid0) ∈ vrvHp ∧ rvowns(vretRefs(tid0)).tid = tid0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
⊦ rvownerok(vretRefs, vrvHp, rvowns) ↔ (∀ tid. vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid)
dom vrvHp = dom prvHp, rvowns(pretRefs(tid0)).tid ≠ tid0, orl ≠ [], pretRefs(tid0) ≠ null, rvref ≠ null, allocrv(vretRefs, vrvHp[rvref, optval00]), 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(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), pretRefs(tid0) ∈ prvHp[rvref, optval00], phead ∈ orl, phead ∈ vs, phead ∈ ps, pretRefs(tid0) ∈ prvHp, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ rvref ∈ prvHp, ¬ rvref ∈ vrvHp, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vretRefs(tid0) ≠ null → vretRefs(tid0) ∈ vrvHp ∧ rvowns(vretRefs(tid0)).tid = tid0, ∀ tid. pretRefs(tid) ≠ null → pretRefs(tid) ∈ prvHp ∧ rvowns(pretRefs(tid)).tid = tid, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used terms: pretRefs, prvHp, rvowns
| ⊦ rvownerok(vretRefs, vrvHp, rvowns) ↔ (∀ tid. vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid) |
| dom vrvHp = dom prvHp, rvowns(pretRefs(tid0)).tid ≠ tid0, orl ≠ [], pretRefs(tid0) ≠ null, rvref ≠ null, allocrv(vretRefs, vrvHp[rvref, optval00]), 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(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), pretRefs(tid0) ∈ prvHp[rvref, optval00], phead ∈ orl, phead ∈ vs, phead ∈ ps, pretRefs(tid0) ∈ prvHp, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ rvref ∈ prvHp, ¬ rvref ∈ vrvHp, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vretRefs(tid0) ≠ null → vretRefs(tid0) ∈ vrvHp ∧ rvowns(vretRefs(tid0)).tid = tid0, ∀ tid. pretRefs(tid) ≠ null → pretRefs(tid) ∈ prvHp ∧ rvowns(pretRefs(tid)).tid = tid, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
Used terms: 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.