| ⊦ ( ( ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( 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) ∧ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ pre(gs, ls, E11, a) ∧ pcstepf(gs, ls, E11, a) = E12 → ( lstepf(gs, ls, E11, a).success ∧ lstepf(gs, ls, E11, a).lst ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl ∧ lstepf(gs, ls, E11, a).node ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl ∧ gstepf(gs, ls, E11, a).vs[lstepf(gs, ls, E11, a).lst].next = lstepf(gs, ls, E11, a).node ∧ gstepf(gs, ls, E11, a).ps[lstepf(gs, ls, E11, a).lst].next = lstepf(gs, ls, E11, a).node ∧ lstepf(gs, ls, E11, a).node ∈ gstepf(gs, ls, E11, a).ps ∧ lstepf(gs, ls, E11, a).node ∈ gstepf(gs, ls, E11, a).vs ∧ lstepf(gs, ls, E11, a).node ≠ null) ∧ ( listp (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).ps, gstepf(gs, ls, E11, a).owns) ∧ ¬ dups(gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl) ∧ markedp(gstepf(gs, ls, E11, a).orl, gstepf(gs, ls, E11, a).ps) ∧ markedp(gstepf(gs, ls, E11, a).orl, gstepf(gs, ls, E11, a).vs) ∧ unmarkedp(gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).ps) ∧ gstepf(gs, ls, E11, a).orl ≠ [] ∧ gstepf(gs, ls, E11, a).phead ∈ gstepf(gs, ls, E11, a).orl ∧ rvownerok(gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).vrvHp, gstepf(gs, ls, E11, a).rvowns) ∧ allocrv(gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E11, a).pretRefs, gstepf(gs, ls, E11, a).prvHp, gstepf(gs, ls, E11, a).rvowns) ∧ allocrv(gstepf(gs, ls, E11, a).pretRefs, gstepf(gs, ls, E11, a).prvHp) ∧ dom gstepf(gs, ls, E11, a).vrvHp = dom gstepf(gs, ls, E11, a).prvHp ∧ ( gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next ≠ null ∧ gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E11, a).rvowns (gstepf(gs, ls, E11, a).vretRefs(gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].deqID.tid, gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E11, a).orl.last = gstepf(gs, ls, E11, a).vhead ∧ (gstepf(gs, ls, E11, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E11, a).qrl.tail, gstepf(gs, ls, E11, a).vs)) ∨ gstepf(gs, ls, E11, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E11, a).orl.butlast.last = gstepf(gs, ls, E11, a).vhead ∧ gstepf(gs, ls, E11, a).phead ≠ gstepf(gs, ls, E11, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs)) ∧ ( gstepf(gs, ls, E11, a).vtail = (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl).last ∨ gstepf(gs, ls, E11, a).qrl ≠ [] ∧ gstepf(gs, ls, E11, a).vtail = (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl.butlast).last ∧ gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E11, a).vs[(gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, E11, a).tid, gstepf(gs, ls, E11, a).vhead, gstepf(gs, ls, E11, a).vs) ∧ noid (lstepf(gs, ls, E11, a).tid, gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vhead, gstepf(gs, ls, E11, a).vs) ∧ noowns(lstepf(gs, ls, E11, a).tid, gstepf(gs, ls, E11, a).owns) |
gs.vs[ls.lst].next = ls.node, gs.vs[ls.node].val = ls.value, dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, E11, a) = E12, ls.node ≠ null, gs.orl ≠ [], ls.success, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), 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), pre(gs, ls, E11, 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.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)), ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node, 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, E11, a).success ∧ lstepf(gs, ls, E11, a).lst ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl ∧ lstepf(gs, ls, E11, a).node ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl ∧ gstepf(gs, ls, E11, a).vs[lstepf(gs, ls, E11, a).lst].next = lstepf(gs, ls, E11, a).node ∧ gstepf(gs, ls, E11, a).ps[lstepf(gs, ls, E11, a).lst].next = lstepf(gs, ls, E11, a).node ∧ lstepf(gs, ls, E11, a).node ∈ gstepf(gs, ls, E11, a).ps ∧ lstepf(gs, ls, E11, a).node ∈ gstepf(gs, ls, E11, a).vs ∧ lstepf(gs, ls, E11, a).node ≠ null) ∧ ( listp (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).ps, gstepf(gs, ls, E11, a).owns) ∧ ¬ dups(gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl) ∧ markedp(gstepf(gs, ls, E11, a).orl, gstepf(gs, ls, E11, a).ps) ∧ markedp(gstepf(gs, ls, E11, a).orl, gstepf(gs, ls, E11, a).vs) ∧ unmarkedp(gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).ps) ∧ gstepf(gs, ls, E11, a).orl ≠ [] ∧ gstepf(gs, ls, E11, a).phead ∈ gstepf(gs, ls, E11, a).orl ∧ rvownerok(gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).vrvHp, gstepf(gs, ls, E11, a).rvowns) ∧ allocrv(gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E11, a).pretRefs, gstepf(gs, ls, E11, a).prvHp, gstepf(gs, ls, E11, a).rvowns) ∧ allocrv(gstepf(gs, ls, E11, a).pretRefs, gstepf(gs, ls, E11, a).prvHp) ∧ dom gstepf(gs, ls, E11, a).vrvHp = dom gstepf(gs, ls, E11, a).prvHp ∧ ( gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next ≠ null ∧ gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E11, a).rvowns (gstepf(gs, ls, E11, a).vretRefs(gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].deqID.tid, gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E11, a).orl.last = gstepf(gs, ls, E11, a).vhead ∧ (gstepf(gs, ls, E11, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E11, a).qrl.tail, gstepf(gs, ls, E11, a).vs)) ∨ gstepf(gs, ls, E11, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E11, a).orl.butlast.last = gstepf(gs, ls, E11, a).vhead ∧ gstepf(gs, ls, E11, a).phead ≠ gstepf(gs, ls, E11, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs)) ∧ ( gstepf(gs, ls, E11, a).vtail = (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl).last ∨ gstepf(gs, ls, E11, a).qrl ≠ [] ∧ gstepf(gs, ls, E11, a).vtail = (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl.butlast).last ∧ gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E11, a).vs[(gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, E11, a).tid, gstepf(gs, ls, E11, a).vhead, gstepf(gs, ls, E11, a).vs) ∧ noid(lstepf(gs, ls, E11, a).tid, gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vhead, gstepf(gs, ls, E11, a).vs) ∧ noowns(lstepf(gs, ls, E11, a).tid, gstepf(gs, ls, E11, a).owns)
| gs.vs[ls.lst].next = ls.node, gs.vs[ls.node].val = ls.value, dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, E11, a) = E12, ls.node ≠ null, gs.orl ≠ [], ls.success, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), 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), pre(gs, ls, E11, 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.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)), ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node, 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, E11, a).success ∧ lstepf(gs, ls, E11, a).lst ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl ∧ lstepf(gs, ls, E11, a).node ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl ∧ gstepf(gs, ls, E11, a).vs[lstepf(gs, ls, E11, a).lst].next = lstepf(gs, ls, E11, a).node ∧ gstepf(gs, ls, E11, a).ps[lstepf(gs, ls, E11, a).lst].next = lstepf(gs, ls, E11, a).node ∧ lstepf(gs, ls, E11, a).node ∈ gstepf(gs, ls, E11, a).ps ∧ lstepf(gs, ls, E11, a).node ∈ gstepf(gs, ls, E11, a).vs ∧ lstepf(gs, ls, E11, a).node ≠ null) ∧ ( listp (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).ps, gstepf(gs, ls, E11, a).owns) ∧ ¬ dups(gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl) ∧ markedp(gstepf(gs, ls, E11, a).orl, gstepf(gs, ls, E11, a).ps) ∧ markedp(gstepf(gs, ls, E11, a).orl, gstepf(gs, ls, E11, a).vs) ∧ unmarkedp(gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).ps) ∧ gstepf(gs, ls, E11, a).orl ≠ [] ∧ gstepf(gs, ls, E11, a).phead ∈ gstepf(gs, ls, E11, a).orl ∧ rvownerok(gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).vrvHp, gstepf(gs, ls, E11, a).rvowns) ∧ allocrv(gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E11, a).pretRefs, gstepf(gs, ls, E11, a).prvHp, gstepf(gs, ls, E11, a).rvowns) ∧ allocrv(gstepf(gs, ls, E11, a).pretRefs, gstepf(gs, ls, E11, a).prvHp) ∧ dom gstepf(gs, ls, E11, a).vrvHp = dom gstepf(gs, ls, E11, a).prvHp ∧ ( gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next ≠ null ∧ gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E11, a).rvowns (gstepf(gs, ls, E11, a).vretRefs(gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].deqID.tid, gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E11, a).orl.last = gstepf(gs, ls, E11, a).vhead ∧ (gstepf(gs, ls, E11, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E11, a).qrl.tail, gstepf(gs, ls, E11, a).vs)) ∨ gstepf(gs, ls, E11, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E11, a).orl.butlast.last = gstepf(gs, ls, E11, a).vhead ∧ gstepf(gs, ls, E11, a).phead ≠ gstepf(gs, ls, E11, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs)) ∧ ( gstepf(gs, ls, E11, a).vtail = (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl).last ∨ gstepf(gs, ls, E11, a).qrl ≠ [] ∧ gstepf(gs, ls, E11, a).vtail = (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl.butlast).last ∧ gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E11, a).vs[(gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, E11, a).tid, gstepf(gs, ls, E11, a).vhead, gstepf(gs, ls, E11, a).vs) ∧ noid(lstepf(gs, ls, E11, a).tid, gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vhead, gstepf(gs, ls, E11, a).vs) ∧ noowns(lstepf(gs, ls, E11, a).tid, gstepf(gs, ls, E11, a).owns) |
gs.vs[ls.lst].next = ls.node, gs.vs[ls.node].val = ls.value, dom gs.vrvHp = dom gs.prvHp, ls.node ≠ null, gs.orl ≠ [], ls.success, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), 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), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.ps, gs.phead ∈ gs.vs, gs.phead ∈ gs.orl, ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), (gs.ps[ls.lst].next ≠ ls.node ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)), ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ (ls.lst ∈ gs.orl ∨ ls.lst ∈ gs.qrl) ∧ gs.ps[ls.lst].next = ls.node, 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) ⊦ (ls.lst ∈ gs.orl ∨ ls.lst ∈ (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node ')) ∧ (ls.node ∈ gs.orl ∨ ls.node ∈ (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node ')) ∧ ls.node ∈ gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.node] ∧ ls.node ∈ gs.vs ∧ listp (gs.orl + (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node '), gs.vs, gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.node], (gs.ps[ls.lst].next = ls.node ⊃ gs.owns;gs.owns(ls.node; None))) ∧ ¬ dups(gs.orl + (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node ')) ∧ markedp(gs.orl, gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.node]) ∧ unmarkedp((gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node '), gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.node]) ∧ nonullRetRefs(gs.orl + (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node '), gs.vs, gs.vretRefs, gs.pretRefs) ∧ ( gs.orl.last = gs.vhead ∧ ( (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node ') ≠ [] → unmarkedp((gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node ').tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp((gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node '), gs.vs)) ∧ ( gs.vtail = (gs.orl + (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node ')).last ∨ (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node ') ≠ [] ∧ gs.vtail = (gs.orl + (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node ').butlast).last ∧ gs.vs[(gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node ').last].deqID = None ∧ gs.vs[(gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node ').last].next = null) ∧ noid(ls.tid, gs.orl + (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node '), gs.vhead, gs.vs) ∧ noowns(ls.tid, (gs.ps[ls.lst].next = ls.node ⊃ gs.owns;gs.owns(ls.node; None)))
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ (gs.owns:= owns).owns = owns; (s) ⊦ x + a = x + a '; (s) ⊦ gstepf(gs, ls, E11, a) = ( ( gs .ps:= gs.ps [ls.lst, gs.ps[ls.lst].next:= gs.vs[ls.lst].next ]) .qrl:= (gs.ps[ls.lst].next = gs.vs[ls.lst].next ⊃ gs.qrl ;gs.qrl + gs.vs[ls.lst].next )) .owns:= (gs.ps[ls.lst].next = gs.vs[ls.lst].next ⊃ gs.owns ;gs.owns(ls.node; None) ); (s) ⊦ lstepf(gs, ls, E11, a) = ls; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.owns:= owns).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.owns:= owns).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ (gs.owns:= owns).qrl = gs.qrl; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.owns:= owns).orl = gs.orl; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.owns:= owns).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.owns:= owns).phead = gs.phead; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.owns:= owns).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.owns:= owns).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.owns:= owns).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.owns:= owns).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.owns:= owns).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.owns:= owns).ps = gs.ps; (s) ⊦ (nd.next:= nxt).next = nxt; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ pre(gs, ls, E11, a) ↔ a = (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ doEnq(ls.tid);τ); (s) ⊦ pcstepf(gs, ls, E11, a) = E12; (s)
| gs.vs[ls.lst].next = ls.node, gs.vs[ls.node].val = ls.value, dom gs.vrvHp = dom gs.prvHp, ls.node ≠ null, gs.orl ≠ [], ls.success, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), 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), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.ps, gs.phead ∈ gs.vs, gs.phead ∈ gs.orl, ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), (gs.ps[ls.lst].next ≠ ls.node ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)), ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ (ls.lst ∈ gs.orl ∨ ls.lst ∈ gs.qrl) ∧ gs.ps[ls.lst].next = ls.node, 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) ⊦ (ls.lst ∈ gs.orl ∨ ls.lst ∈ (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node ')) ∧ (ls.node ∈ gs.orl ∨ ls.node ∈ (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node ')) ∧ ls.node ∈ gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.node] ∧ ls.node ∈ gs.vs ∧ listp (gs.orl + (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node '), gs.vs, gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.node], (gs.ps[ls.lst].next = ls.node ⊃ gs.owns;gs.owns(ls.node; None))) ∧ ¬ dups(gs.orl + (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node ')) ∧ markedp(gs.orl, gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.node]) ∧ unmarkedp((gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node '), gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.node]) ∧ nonullRetRefs(gs.orl + (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node '), gs.vs, gs.vretRefs, gs.pretRefs) ∧ ( gs.orl.last = gs.vhead ∧ ( (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node ') ≠ [] → unmarkedp((gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node ').tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp((gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node '), gs.vs)) ∧ ( gs.vtail = (gs.orl + (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node ')).last ∨ (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node ') ≠ [] ∧ gs.vtail = (gs.orl + (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node ').butlast).last ∧ gs.vs[(gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node ').last].deqID = None ∧ gs.vs[(gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node ').last].next = null) ∧ noid(ls.tid, gs.orl + (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node '), gs.vhead, gs.vs) ∧ noowns(ls.tid, (gs.ps[ls.lst].next = ls.node ⊃ gs.owns;gs.owns(ls.node; None))) |
vs[ls.lst].next = ls.node, vs[ls.node].val = ls.value, dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls.node ≠ null, orl ≠ [], ls.success, 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), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (ps[ls.lst].next ≠ ls.node ⊃ oneweakowns(ls.tid, ls.node, owns, vs, ps);noowns(ls.tid, owns)), 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, ls.lst = vtail ∧ ps[ls.lst].next = null ∧ owns(ls.node) = Weak(ls.tid) ∨ (ls.lst ∈ orl ∨ ls.lst ∈ qrl) ∧ ps[ls.lst].next = ls.node ⊦ (ls.lst ∈ orl ∨ ls.lst ∈ (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ')) ∧ (ls.node ∈ orl ∨ ls.node ∈ (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ')) ∧ ls.node ∈ ps[ls.lst, ps[ls.lst].next:= ls.node] ∧ ls.node ∈ vs ∧ listp (orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node '), vs, ps[ls.lst, ps[ls.lst].next:= ls.node], (ps[ls.lst].next = ls.node ⊃ owns;owns(ls.node; None))) ∧ ¬ dups(orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ')) ∧ markedp(orl, ps[ls.lst, ps[ls.lst].next:= ls.node]) ∧ unmarkedp((ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node '), ps[ls.lst, ps[ls.lst].next:= ls.node]) ∧ nonullRetRefs(orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node '), vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ ((ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ') ≠ [] → unmarkedp((ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ').tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node '), vs)) ∧ ( vtail = (orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ')).last ∨ (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ') ≠ [] ∧ vtail = (orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ').butlast).last ∧ vs[(ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ').last].deqID = None ∧ vs[(ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ').last].next = null) ∧ noid(ls.tid, orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node '), vhead, vs) ∧ noowns(ls.tid, (ps[ls.lst].next = ls.node ⊃ owns;owns(ls.node; None)))
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
| vs[ls.lst].next = ls.node, vs[ls.node].val = ls.value, dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls.node ≠ null, orl ≠ [], ls.success, 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), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (ps[ls.lst].next ≠ ls.node ⊃ oneweakowns(ls.tid, ls.node, owns, vs, ps);noowns(ls.tid, owns)), 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, ls.lst = vtail ∧ ps[ls.lst].next = null ∧ owns(ls.node) = Weak(ls.tid) ∨ (ls.lst ∈ orl ∨ ls.lst ∈ qrl) ∧ ps[ls.lst].next = ls.node ⊦ (ls.lst ∈ orl ∨ ls.lst ∈ (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ')) ∧ (ls.node ∈ orl ∨ ls.node ∈ (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ')) ∧ ls.node ∈ ps[ls.lst, ps[ls.lst].next:= ls.node] ∧ ls.node ∈ vs ∧ listp (orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node '), vs, ps[ls.lst, ps[ls.lst].next:= ls.node], (ps[ls.lst].next = ls.node ⊃ owns;owns(ls.node; None))) ∧ ¬ dups(orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ')) ∧ markedp(orl, ps[ls.lst, ps[ls.lst].next:= ls.node]) ∧ unmarkedp((ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node '), ps[ls.lst, ps[ls.lst].next:= ls.node]) ∧ nonullRetRefs(orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node '), vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ ((ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ') ≠ [] → unmarkedp((ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ').tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node '), vs)) ∧ ( vtail = (orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ')).last ∨ (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ') ≠ [] ∧ vtail = (orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ').butlast).last ∧ vs[(ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ').last].deqID = None ∧ vs[(ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ').last].next = null) ∧ noid(ls.tid, orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node '), vhead, vs) ∧ noowns(ls.tid, (ps[ls.lst].next = ls.node ⊃ owns;owns(ls.node; None))) |
vs[ls.lst].next = ls.node, vs[ls.node].val = ls.value, dom vrvHp = dom prvHp, ls.node ≠ null, orl ≠ [], ls.success, 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), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (ps[ls.lst].next ≠ ls.node ⊃ oneweakowns(ls.tid, ls.node, owns, vs, ps);noowns(ls.tid, owns)), ls.lst = vtail ∧ ps[ls.lst].next = null ∧ owns(ls.node) = Weak(ls.tid) ∨ (ls.lst ∈ orl ∨ ls.lst ∈ qrl) ∧ ps[ls.lst].next = ls.node, 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) ⊦ (ls.lst ∈ orl ∨ ls.lst ∈ (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ')) ∧ (ls.node ∈ orl ∨ ls.node ∈ (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ')) ∧ ls.node ∈ ps[ls.lst, ps[ls.lst].next:= ls.node] ∧ ls.node ∈ vs ∧ listp (orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node '), vs, ps[ls.lst, ps[ls.lst].next:= ls.node], (ps[ls.lst].next = ls.node ⊃ owns;owns(ls.node; None))) ∧ ¬ dups(orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ')) ∧ markedp(orl, ps[ls.lst, ps[ls.lst].next:= ls.node]) ∧ unmarkedp((ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node '), ps[ls.lst, ps[ls.lst].next:= ls.node]) ∧ nonullRetRefs(orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node '), vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ ((ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ') ≠ [] → unmarkedp((ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ').tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node '), vs)) ∧ ( vtail = (orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ')).last ∨ (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ') ≠ [] ∧ vtail = (orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ').butlast).last ∧ vs[(ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ').last].deqID = None ∧ vs[(ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ').last].next = null) ∧ noid(ls.tid, orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node '), vhead, vs) ∧ noowns(ls.tid, (ps[ls.lst].next = ls.node ⊃ owns;owns(ls.node; None)))
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-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
| vs[ls.lst].next = ls.node, vs[ls.node].val = ls.value, dom vrvHp = dom prvHp, ls.node ≠ null, orl ≠ [], ls.success, 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), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (ps[ls.lst].next ≠ ls.node ⊃ oneweakowns(ls.tid, ls.node, owns, vs, ps);noowns(ls.tid, owns)), ls.lst = vtail ∧ ps[ls.lst].next = null ∧ owns(ls.node) = Weak(ls.tid) ∨ (ls.lst ∈ orl ∨ ls.lst ∈ qrl) ∧ ps[ls.lst].next = ls.node, 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) ⊦ (ls.lst ∈ orl ∨ ls.lst ∈ (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ')) ∧ (ls.node ∈ orl ∨ ls.node ∈ (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ')) ∧ ls.node ∈ ps[ls.lst, ps[ls.lst].next:= ls.node] ∧ ls.node ∈ vs ∧ listp (orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node '), vs, ps[ls.lst, ps[ls.lst].next:= ls.node], (ps[ls.lst].next = ls.node ⊃ owns;owns(ls.node; None))) ∧ ¬ dups(orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ')) ∧ markedp(orl, ps[ls.lst, ps[ls.lst].next:= ls.node]) ∧ unmarkedp((ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node '), ps[ls.lst, ps[ls.lst].next:= ls.node]) ∧ nonullRetRefs(orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node '), vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ ((ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ') ≠ [] → unmarkedp((ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ').tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node '), vs)) ∧ ( vtail = (orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ')).last ∨ (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ') ≠ [] ∧ vtail = (orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ').butlast).last ∧ vs[(ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ').last].deqID = None ∧ vs[(ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ').last].next = null) ∧ noid(ls.tid, orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node '), vhead, vs) ∧ noowns(ls.tid, (ps[ls.lst].next = ls.node ⊃ owns;owns(ls.node; None))) |
vs[lst].next = node, vs[node].val = value, dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), success, node ≠ null, orl ≠ [], 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), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (ps[lst].next ≠ node ⊃ oneweakowns(tid, node, owns, vs, ps);noowns(tid, owns)), 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, lst = vtail ∧ ps[lst].next = null ∧ owns(node) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ qrl) ∧ ps[lst].next = node ⊦ (lst ∈ orl ∨ lst ∈ (ps[lst].next = node ⊃ qrl;qrl + node ')) ∧ (node ∈ orl ∨ node ∈ (ps[lst].next = node ⊃ qrl;qrl + node ')) ∧ node ∈ ps[lst, ps[lst].next:= node] ∧ node ∈ vs ∧ listp(orl + (ps[lst].next = node ⊃ qrl;qrl + node '), vs, ps[lst, ps[lst].next:= node], (ps[lst].next = node ⊃ owns;owns(node; None))) ∧ ¬ dups(orl + (ps[lst].next = node ⊃ qrl;qrl + node ')) ∧ markedp(orl, ps[lst, ps[lst].next:= node]) ∧ unmarkedp((ps[lst].next = node ⊃ qrl;qrl + node '), ps[lst, ps[lst].next:= node]) ∧ nonullRetRefs(orl + (ps[lst].next = node ⊃ qrl;qrl + node '), vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ ((ps[lst].next = node ⊃ qrl;qrl + node ') ≠ [] → unmarkedp((ps[lst].next = node ⊃ qrl;qrl + node ').tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((ps[lst].next = node ⊃ qrl;qrl + node '), vs)) ∧ ( vtail = (orl + (ps[lst].next = node ⊃ qrl;qrl + node ')).last ∨ (ps[lst].next = node ⊃ qrl;qrl + node ') ≠ [] ∧ vtail = (orl + (ps[lst].next = node ⊃ qrl;qrl + node ').butlast).last ∧ vs[(ps[lst].next = node ⊃ qrl;qrl + node ').last].deqID = None ∧ vs[(ps[lst].next = node ⊃ qrl;qrl + node ').last].next = null) ∧ noid(tid, orl + (ps[lst].next = node ⊃ qrl;qrl + node '), vhead, vs) ∧ noowns(tid, (ps[lst].next = node ⊃ owns;owns(node; None)))
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
| vs[lst].next = node, vs[node].val = value, dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), success, node ≠ null, orl ≠ [], 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), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (ps[lst].next ≠ node ⊃ oneweakowns(tid, node, owns, vs, ps);noowns(tid, owns)), 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, lst = vtail ∧ ps[lst].next = null ∧ owns(node) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ qrl) ∧ ps[lst].next = node ⊦ (lst ∈ orl ∨ lst ∈ (ps[lst].next = node ⊃ qrl;qrl + node ')) ∧ (node ∈ orl ∨ node ∈ (ps[lst].next = node ⊃ qrl;qrl + node ')) ∧ node ∈ ps[lst, ps[lst].next:= node] ∧ node ∈ vs ∧ listp(orl + (ps[lst].next = node ⊃ qrl;qrl + node '), vs, ps[lst, ps[lst].next:= node], (ps[lst].next = node ⊃ owns;owns(node; None))) ∧ ¬ dups(orl + (ps[lst].next = node ⊃ qrl;qrl + node ')) ∧ markedp(orl, ps[lst, ps[lst].next:= node]) ∧ unmarkedp((ps[lst].next = node ⊃ qrl;qrl + node '), ps[lst, ps[lst].next:= node]) ∧ nonullRetRefs(orl + (ps[lst].next = node ⊃ qrl;qrl + node '), vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ ((ps[lst].next = node ⊃ qrl;qrl + node ') ≠ [] → unmarkedp((ps[lst].next = node ⊃ qrl;qrl + node ').tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((ps[lst].next = node ⊃ qrl;qrl + node '), vs)) ∧ ( vtail = (orl + (ps[lst].next = node ⊃ qrl;qrl + node ')).last ∨ (ps[lst].next = node ⊃ qrl;qrl + node ') ≠ [] ∧ vtail = (orl + (ps[lst].next = node ⊃ qrl;qrl + node ').butlast).last ∧ vs[(ps[lst].next = node ⊃ qrl;qrl + node ').last].deqID = None ∧ vs[(ps[lst].next = node ⊃ qrl;qrl + node ').last].next = null) ∧ noid(tid, orl + (ps[lst].next = node ⊃ qrl;qrl + node '), vhead, vs) ∧ noowns(tid, (ps[lst].next = node ⊃ owns;owns(node; None))) |
dom vrvHp = dom prvHp, vs[lst].next ≠ null, orl ≠ [], 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), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), 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), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ qrl) ∧ ps[lst].next = vs[lst].next ⊦ (lst ∈ orl ∨ lst ∈ (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')) ∧ (vs[lst].next ∈ orl ∨ vs[lst].next ∈ (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp (orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vs, ps[lst, ps[lst].next:= vs[lst].next], (ps[lst].next = vs[lst].next ⊃ owns;owns(vs[lst].next; None))) ∧ ¬ dups(orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp((ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), ps[lst, ps[lst].next:= vs[lst].next]) ∧ nonullRetRefs(orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ ((ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ') ≠ [] → unmarkedp((ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ').tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vs)) ∧ ( vtail = (orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')).last ∨ (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ') ≠ [] ∧ vtail = (orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ').butlast).last ∧ vs[(ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ').last].deqID = None ∧ vs[(ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ').last].next = null) ∧ noid(tid, orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vhead, vs) ∧ noowns(tid, (ps[lst].next = vs[lst].next ⊃ owns;owns(vs[lst].next; None)))
| dom vrvHp = dom prvHp, vs[lst].next ≠ null, orl ≠ [], 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), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), 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), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ qrl) ∧ ps[lst].next = vs[lst].next ⊦ (lst ∈ orl ∨ lst ∈ (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')) ∧ (vs[lst].next ∈ orl ∨ vs[lst].next ∈ (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp (orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vs, ps[lst, ps[lst].next:= vs[lst].next], (ps[lst].next = vs[lst].next ⊃ owns;owns(vs[lst].next; None))) ∧ ¬ dups(orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp((ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), ps[lst, ps[lst].next:= vs[lst].next]) ∧ nonullRetRefs(orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ ((ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ') ≠ [] → unmarkedp((ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ').tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vs)) ∧ ( vtail = (orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')).last ∨ (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ') ≠ [] ∧ vtail = (orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ').butlast).last ∧ vs[(ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ').last].deqID = None ∧ vs[(ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ').last].next = null) ∧ noid(tid, orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vhead, vs) ∧ noowns(tid, (ps[lst].next = vs[lst].next ⊃ owns;owns(vs[lst].next; None))) |
ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, orl ≠ [], 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), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ qrl) ∧ ps[lst].next = vs[lst].next, 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 ⊦ (lst ∈ orl ∨ lst ∈ (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')) ∧ (vs[lst].next ∈ orl ∨ vs[lst].next ∈ (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp (orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vs, ps[lst, ps[lst].next:= vs[lst].next], (ps[lst].next = vs[lst].next ⊃ owns;owns(vs[lst].next; None))) ∧ ¬ dups(orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp((ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), ps[lst, ps[lst].next:= vs[lst].next]) ∧ nonullRetRefs(orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ ((ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ') ≠ [] → unmarkedp((ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ').tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vs)) ∧ ( vtail = (orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')).last ∨ (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ') ≠ [] ∧ vtail = (orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ').butlast).last ∧ vs[(ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ').last].deqID = None ∧ vs[(ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ').last].next = null) ∧ noid(tid, orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vhead, vs) ∧ noowns(tid, (ps[lst].next = vs[lst].next ⊃ owns;owns(vs[lst].next; None)))
dom vrvHp = dom prvHp, ps[lst].next ≠ vs[lst].next, vs[lst].next ≠ null, orl ≠ [], 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), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ qrl) ∧ ps[lst].next = vs[lst].next, 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 ⊦ (lst ∈ orl ∨ lst ∈ (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')) ∧ (vs[lst].next ∈ orl ∨ vs[lst].next ∈ (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp (orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vs, ps[lst, ps[lst].next:= vs[lst].next], (ps[lst].next = vs[lst].next ⊃ owns;owns(vs[lst].next; None))) ∧ ¬ dups(orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp((ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), ps[lst, ps[lst].next:= vs[lst].next]) ∧ nonullRetRefs(orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ ((ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ') ≠ [] → unmarkedp((ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ').tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vs)) ∧ ( vtail = (orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')).last ∨ (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ') ≠ [] ∧ vtail = (orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ').butlast).last ∧ vs[(ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ').last].deqID = None ∧ vs[(ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ').last].next = null) ∧ noid(tid, orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vhead, vs) ∧ noowns(tid, (ps[lst].next = vs[lst].next ⊃ owns;owns(vs[lst].next; None)))
Used formulas: ps[lst].next = vs[lst].next
| ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, orl ≠ [], 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), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ qrl) ∧ ps[lst].next = vs[lst].next, 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 ⊦ (lst ∈ orl ∨ lst ∈ (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')) ∧ (vs[lst].next ∈ orl ∨ vs[lst].next ∈ (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp (orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vs, ps[lst, ps[lst].next:= vs[lst].next], (ps[lst].next = vs[lst].next ⊃ owns;owns(vs[lst].next; None))) ∧ ¬ dups(orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp((ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), ps[lst, ps[lst].next:= vs[lst].next]) ∧ nonullRetRefs(orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ ((ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ') ≠ [] → unmarkedp((ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ').tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vs)) ∧ ( vtail = (orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')).last ∨ (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ') ≠ [] ∧ vtail = (orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ').butlast).last ∧ vs[(ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ').last].deqID = None ∧ vs[(ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ').last].next = null) ∧ noid(tid, orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vhead, vs) ∧ noowns(tid, (ps[lst].next = vs[lst].next ⊃ owns;owns(vs[lst].next; None))) |
ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, 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) ⊦ (lst ∈ orl ∨ lst ∈ qrl) ∧ (vs[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next])
| ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, 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) ⊦ (lst ∈ orl ∨ lst ∈ qrl) ∧ (vs[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next]) |
⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns))
ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp(orl + qrl, vs, ps, owns) ∧ lst ∈ orl + qrl → (∃ rl1, rl2. orl + qrl = rl1 + lst ' + rl2 ∧ listp(lst ' + rl2, vs, ps, owns)), 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, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl ⊦ (lst ∈ orl ∨ lst ∈ qrl) ∧ (vs[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next])
Used terms: ps, orl + qrl, owns, lst, vs
| ⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns)) |
| ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp(orl + qrl, vs, ps, owns) ∧ lst ∈ orl + qrl → (∃ rl1, rl2. orl + qrl = rl1 + lst ' + rl2 ∧ listp(lst ' + rl2, vs, ps, owns)), 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, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl ⊦ (lst ∈ orl ∨ lst ∈ qrl) ∧ (vs[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next]) |
ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl ∨ lst ∈ qrl → orl + qrl = rl1 + lst ' + rl2 ∧ listp(lst ' + rl2, vs, ps, owns), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, 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) ⊦ (lst ∈ orl ∨ lst ∈ qrl) ∧ (vs[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next])
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl ∨ lst ∈ qrl → orl + qrl = rl1 + lst ' + rl2 ∧ listp(lst ' + rl2, vs, ps, owns), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, 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) ⊦ (lst ∈ orl ∨ lst ∈ qrl) ∧ (vs[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next]) |
ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), lst ∈ orl ∨ lst ∈ qrl → orl + qrl = rl1 + lst ' + rl2 ∧ listp(lst ' + rl2, vs, ps, owns), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, lst ∈ orl ∨ lst ∈ qrl ⊦ (lst ∈ orl ∨ lst ∈ qrl) ∧ (vs[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next])
Used simplifier rules: ⊦ owns(r) = Weak(tid) → ¬ noowns(tid, owns); (s) Used formulas: lst ∈ orl ∨ lst ∈ qrl
| ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), lst ∈ orl ∨ lst ∈ qrl → orl + qrl = rl1 + lst ' + rl2 ∧ listp(lst ' + rl2, vs, ps, owns), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, lst ∈ orl ∨ lst ∈ qrl ⊦ (lst ∈ orl ∨ lst ∈ qrl) ∧ (vs[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next]) |
orl + qrl = rl1 + lst ' + rl2, ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp(lst ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl ∨ lst ∈ qrl, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, 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[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next])
| orl + qrl = rl1 + lst ' + rl2, ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp(lst ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl ∨ lst ∈ qrl, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, 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[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next]) |
orl + qrl = rl1 + lst ' + rl2, ps[lst].next = vs[lst].next, ps[lst, ps[lst].next:= vs[lst].next] = ps, dom vrvHp = dom prvHp, vs[lst].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(lst ' + rl2, vs, ps, owns), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, lst ∈ orl ∨ lst ∈ qrl ⊦ (vs[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next])
orl + qrl = rl1 + lst ' + rl2, ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, ps[lst, ps[lst].next:= vs[lst].next] ≠ ps, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(lst ' + rl2, vs, ps, owns), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, lst ∈ orl ∨ lst ∈ qrl ⊦ (vs[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next])
Used formulas: ps[lst, ps[lst].next:= vs[lst].next] = ps
| orl + qrl = rl1 + lst ' + rl2, ps[lst].next = vs[lst].next, ps[lst, ps[lst].next:= vs[lst].next] = ps, dom vrvHp = dom prvHp, vs[lst].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(lst ' + rl2, vs, ps, owns), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, lst ∈ orl ∨ lst ∈ qrl ⊦ (vs[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next]) |
orl + qrl = rl1 + lst ' + rl2, ps[lst].next = vs[lst].next, ps[lst, ps[lst].next:= vs[lst].next] = ps, dom vrvHp = dom prvHp, vs[lst].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(lst ' + rl2, vs, ps, owns), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, lst ∈ orl ∨ lst ∈ qrl ⊦ (vs[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps ∧ vs[lst].next ∈ vs
| orl + qrl = rl1 + lst ' + rl2, ps[lst].next = vs[lst].next, ps[lst, ps[lst].next:= vs[lst].next] = ps, dom vrvHp = dom prvHp, vs[lst].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(lst ' + rl2, vs, ps, owns), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, lst ∈ orl ∨ lst ∈ qrl ⊦ (vs[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps ∧ vs[lst].next ∈ vs |
orl + qrl = rl1 + lst ' + rl2, ps[lst].next = vs[lst].next, ps[lst, ps[lst].next:= vs[lst].next] = ps, dom vrvHp = dom prvHp, rl2 = lst0 + rl, vs[lst].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp(lst ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl ∨ lst ∈ qrl, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, 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[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps ∧ vs[lst].next ∈ vs
Used simplifier rules: reflist freely generated by [], +;; ⊦ x + [] = x; (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]
| orl + qrl = rl1 + lst ' + rl2, ps[lst].next = vs[lst].next, ps[lst, ps[lst].next:= vs[lst].next] = ps, dom vrvHp = dom prvHp, rl2 = lst0 + rl, vs[lst].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp(lst ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl ∨ lst ∈ qrl, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, 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[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps ∧ vs[lst].next ∈ vs |
orl + qrl = rl1 + lst ' + vs[lst].next ' + rl, ps[lst].next = vs[lst].next, ps[lst].val = vs[lst].val, ps[lst, ps[lst].next:= vs[lst].next] = ps, dom vrvHp = dom prvHp, owns(lst) = None, vs[lst].next ≠ null, lst ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[lst].next ' + rl, vs, ps, owns), 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), lst ∈ ps, lst ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ weak?(vs[lst].deqID), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[lst].deqID = vs[lst].deqID ∨ ps[lst].deqID = None, lst ∈ orl ∨ lst ∈ qrl, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, 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[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps ∧ vs[lst].next ∈ vs
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ 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 = a ' + x; (s)
| orl + qrl = rl1 + lst ' + vs[lst].next ' + rl, ps[lst].next = vs[lst].next, ps[lst].val = vs[lst].val, ps[lst, ps[lst].next:= vs[lst].next] = ps, dom vrvHp = dom prvHp, owns(lst) = None, vs[lst].next ≠ null, lst ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[lst].next ' + rl, vs, ps, owns), 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), lst ∈ ps, lst ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ weak?(vs[lst].deqID), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[lst].deqID = vs[lst].deqID ∨ ps[lst].deqID = None, lst ∈ orl ∨ lst ∈ qrl, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, 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[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps ∧ vs[lst].next ∈ vs |
orl + qrl = rl1 + lst ' + vs[lst].next ' + rl, ps[lst].next = vs[lst].next, ps[lst].val = vs[lst].val, ps[lst, ps[lst].next:= vs[lst].next] = ps, dom vrvHp = dom prvHp, owns(lst) = None, vs[lst].next ≠ null, lst ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), listp(vs[lst].next ' + rl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ weak?(vs[lst].deqID), ¬ vs[lst].next ∈ ps, vs[vhead].next ≠ null ∧ vs[vs[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, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, lst ∈ orl ∨ lst ∈ qrl, ps[lst].deqID = vs[lst].deqID ∨ ps[lst].deqID = None ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ listp(orl + qrl, vs, ps, owns) ∧ first ∈ orl ∧ nxt = ps[first].next ∧ nxt ≠ null → (nxt ∈ vs ↔ true); (ss) ⊦ listp(orl + qrl, vs, ps, owns) ∧ first ∈ qrl ∧ nxt = ps[first].next ∧ nxt ≠ null → (nxt ∈ vs ↔ true); (ss) ⊦ owns(r) = Weak(tid) → ¬ noowns(tid, owns); (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ a ∈ b ' ↔ a = b; (s)
| orl + qrl = rl1 + lst ' + vs[lst].next ' + rl, ps[lst].next = vs[lst].next, ps[lst].val = vs[lst].val, ps[lst, ps[lst].next:= vs[lst].next] = ps, dom vrvHp = dom prvHp, owns(lst) = None, vs[lst].next ≠ null, lst ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), listp(vs[lst].next ' + rl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ weak?(vs[lst].deqID), ¬ vs[lst].next ∈ ps, vs[vhead].next ≠ null ∧ vs[vs[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, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, lst ∈ orl ∨ lst ∈ qrl, ps[lst].deqID = vs[lst].deqID ∨ ps[lst].deqID = None ⊦ |
Used simplifier rules: reflist freely generated by [], +;; ⊦ 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) ⊦ 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)
| orl + qrl = rl1 + lst ' + rl2, ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, ps[lst, ps[lst].next:= vs[lst].next] ≠ ps, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(lst ' + rl2, vs, ps, owns), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, lst ∈ orl ∨ lst ∈ qrl ⊦ (vs[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next]) |
⊦ st1 = st2 ↔ (∀ a. (a ∈ st1 ↔ a ∈ st2) ∧ st1[a] = st2[a])
orl + qrl = rl1 + lst ' + rl2, ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp(lst ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ lst0. ¬((lst0 ∈ ps[lst, ps[lst].next:= vs[lst].next] ↔ lst0 ∈ ps) ∧ ps[lst, ps[lst].next:= vs[lst].next][lst0] = ps[lst0]), lst ∈ orl ∨ lst ∈ qrl, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, 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[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next])
Used terms: ps[lst, ps[lst].next:= vs[lst].next], ps
| ⊦ st1 = st2 ↔ (∀ a. (a ∈ st1 ↔ a ∈ st2) ∧ st1[a] = st2[a]) |
| orl + qrl = rl1 + lst ' + rl2, ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp(lst ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ lst0. ¬((lst0 ∈ ps[lst, ps[lst].next:= vs[lst].next] ↔ lst0 ∈ ps) ∧ ps[lst, ps[lst].next:= vs[lst].next][lst0] = ps[lst0]), lst ∈ orl ∨ lst ∈ qrl, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, 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[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next]) |
orl + qrl = rl1 + lst ' + rl2, ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(lst ' + rl2, vs, ps, owns), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, lst ∈ orl ∨ lst ∈ qrl ⊦ (vs[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next]), (lst0 ∈ ps[lst, ps[lst].next:= vs[lst].next] ↔ lst0 ∈ ps) ∧ ps[lst, ps[lst].next:= vs[lst].next][lst0] = ps[lst0]
| orl + qrl = rl1 + lst ' + rl2, ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(lst ' + rl2, vs, ps, owns), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, lst ∈ orl ∨ lst ∈ qrl ⊦ (vs[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next]), (lst0 ∈ ps[lst, ps[lst].next:= vs[lst].next] ↔ lst0 ∈ ps) ∧ ps[lst, ps[lst].next:= vs[lst].next][lst0] = ps[lst0] |
⊦ a ≠ b → st[b, d][a] = st[a]
orl + qrl = rl1 + lst ' + rl2, ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, lst0 = lst, vs[lst].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp(lst ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl ∨ lst ∈ qrl, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, 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) ⊦ (lst0 ∈ ps[lst, ps[lst].next:= vs[lst].next] ↔ lst0 ∈ ps) ∧ ps[lst, ps[lst].next:= vs[lst].next][lst0] = ps[lst0], (vs[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next])
Used simplifier rules: ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s) Used terms: ps, lst, ps[lst].next:= vs[lst].next, lst0
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| orl + qrl = rl1 + lst ' + rl2, ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, lst0 = lst, vs[lst].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp(lst ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl ∨ lst ∈ qrl, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, 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) ⊦ (lst0 ∈ ps[lst, ps[lst].next:= vs[lst].next] ↔ lst0 ∈ ps) ∧ ps[lst, ps[lst].next:= vs[lst].next][lst0] = ps[lst0], (vs[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next]) |
orl + qrl = rl1 + lst ' + rl2, ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(lst ' + rl2, vs, ps, owns), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, lst ∈ orl ∨ lst ∈ qrl ⊦ (vs[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next]), lst ∈ ps ∧ ps[lst].next:= vs[lst].next = ps[lst]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ a ∈ st[a, d]; (s) ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws) ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s)
| orl + qrl = rl1 + lst ' + rl2, ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(lst ' + rl2, vs, ps, owns), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, lst ∈ orl ∨ lst ∈ qrl ⊦ (vs[lst].next ∈ orl ∨ vs[lst].next ∈ qrl) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next]), lst ∈ ps ∧ ps[lst].next:= vs[lst].next = ps[lst] |
Used simplifier rules: ⊦ markedp(rl, vs) → (markedp(rl, vs[r, mk(val, opttid, nxt)]) ↔ r ∈ rl → some?(opttid)); (s) ⊦ mk(val, opttid, nxt).next = nxt; (s) ⊦ mk(val, opttid, nxt) = mk(val0, opttid0, nxt0) ↔ val = val0 ∧ opttid = opttid0 ∧ nxt = nxt0; (ws) ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]
| dom vrvHp = dom prvHp, ps[lst].next ≠ vs[lst].next, vs[lst].next ≠ null, orl ≠ [], 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), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ qrl) ∧ ps[lst].next = vs[lst].next, 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 ⊦ (lst ∈ orl ∨ lst ∈ (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')) ∧ (vs[lst].next ∈ orl ∨ vs[lst].next ∈ (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')) ∧ vs[lst].next ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[lst].next ∈ vs ∧ listp (orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vs, ps[lst, ps[lst].next:= vs[lst].next], (ps[lst].next = vs[lst].next ⊃ owns;owns(vs[lst].next; None))) ∧ ¬ dups(orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp((ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), ps[lst, ps[lst].next:= vs[lst].next]) ∧ nonullRetRefs(orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ ((ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ') ≠ [] → unmarkedp((ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ').tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vs)) ∧ ( vtail = (orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')).last ∨ (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ') ≠ [] ∧ vtail = (orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ').butlast).last ∧ vs[(ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ').last].deqID = None ∧ vs[(ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ').last].next = null) ∧ noid(tid, orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vhead, vs) ∧ noowns(tid, (ps[lst].next = vs[lst].next ⊃ owns;owns(vs[lst].next; None))) |
ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, orl ≠ [], 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (vtail ∈ orl ∨ vtail ∈ qrl ∨ vtail = vs[vtail].next) ∧ vs[vtail].next ∈ ps[vtail, ps[vtail].next:= vs[vtail].next] ∧ vs[vtail].next ∈ vs ∧ listp(orl + qrl + vs[vtail].next ', vs, ps[vtail, ps[vtail].next:= vs[vtail].next], owns(vs[vtail].next; None)) ∧ ¬ vs[vtail].next ∈ orl ∧ ¬ vs[vtail].next ∈ qrl ∧ markedp(orl, ps[vtail, ps[vtail].next:= vs[vtail].next]) ∧ unmarkedp(qrl, ps[vtail, ps[vtail].next:= vs[vtail].next]) ∧ ps[vtail, ps[vtail].next:= vs[vtail].next][vs[vtail].next].deqID = None ∧ nonullRetRefs(orl + qrl + vs[vtail].next ', vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp((qrl + vs[vtail].next ').tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ∧ vs[vs[vtail].next].deqID = None) ∧ (vtail = vs[vtail].next ∨ vtail = (orl + qrl).last ∧ vs[vs[(orl + qrl).last].next].deqID = None ∧ vs[vs[(orl + qrl).last].next].next = null) ∧ noid(tid, orl + qrl + vs[vtail].next ', vhead, vs) ∧ noowns(tid, owns(vs[vtail].next; None))
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (x + a ').last = a; (s) ⊦ (x + a ').butlast = x; (s) ⊦ x + a ' ≠ []; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ a ∈ b ' ↔ a = b; (s)
| ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, orl ≠ [], 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (vtail ∈ orl ∨ vtail ∈ qrl ∨ vtail = vs[vtail].next) ∧ vs[vtail].next ∈ ps[vtail, ps[vtail].next:= vs[vtail].next] ∧ vs[vtail].next ∈ vs ∧ listp(orl + qrl + vs[vtail].next ', vs, ps[vtail, ps[vtail].next:= vs[vtail].next], owns(vs[vtail].next; None)) ∧ ¬ vs[vtail].next ∈ orl ∧ ¬ vs[vtail].next ∈ qrl ∧ markedp(orl, ps[vtail, ps[vtail].next:= vs[vtail].next]) ∧ unmarkedp(qrl, ps[vtail, ps[vtail].next:= vs[vtail].next]) ∧ ps[vtail, ps[vtail].next:= vs[vtail].next][vs[vtail].next].deqID = None ∧ nonullRetRefs(orl + qrl + vs[vtail].next ', vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp((qrl + vs[vtail].next ').tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ∧ vs[vs[vtail].next].deqID = None) ∧ (vtail = vs[vtail].next ∨ vtail = (orl + qrl).last ∧ vs[vs[(orl + qrl).last].next].deqID = None ∧ vs[vs[(orl + qrl).last].next].next = null) ∧ noid(tid, orl + qrl + vs[vtail].next ', vhead, vs) ∧ noowns(tid, owns(vs[vtail].next; None)) |
qrl + vs[vtail].next ' = phead0 + qrl0, ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), qrl + vs[vtail].next ' ≠ [], vs[vtail].next ≠ null, orl ≠ [], 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (vtail ∈ orl ∨ vtail ∈ qrl ∨ vtail = vs[vtail].next) ∧ vs[vtail].next ∈ ps[vtail, ps[vtail].next:= vs[vtail].next] ∧ vs[vtail].next ∈ vs ∧ listp(orl + qrl + vs[vtail].next ', vs, ps[vtail, ps[vtail].next:= vs[vtail].next], owns(vs[vtail].next; None)) ∧ ¬ vs[vtail].next ∈ orl ∧ ¬ vs[vtail].next ∈ qrl ∧ markedp(orl, ps[vtail, ps[vtail].next:= vs[vtail].next]) ∧ unmarkedp(qrl, ps[vtail, ps[vtail].next:= vs[vtail].next]) ∧ ps[vtail, ps[vtail].next:= vs[vtail].next][vs[vtail].next].deqID = None ∧ nonullRetRefs(orl + qrl + vs[vtail].next ', vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ∧ vs[vs[vtail].next].deqID = None) ∧ (vtail = vs[vtail].next ∨ vtail = (orl + qrl).last ∧ vs[vs[(orl + qrl).last].next].deqID = None ∧ vs[vs[(orl + qrl).last].next].next = null) ∧ noid(tid, orl + qrl + vs[vtail].next ', vhead, vs) ∧ noowns(tid, owns(vs[vtail].next; None))
Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl + vs[vtail].next ', phead0, y
| qrl + vs[vtail].next ' = phead0 + qrl0, ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), qrl + vs[vtail].next ' ≠ [], vs[vtail].next ≠ null, orl ≠ [], 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (vtail ∈ orl ∨ vtail ∈ qrl ∨ vtail = vs[vtail].next) ∧ vs[vtail].next ∈ ps[vtail, ps[vtail].next:= vs[vtail].next] ∧ vs[vtail].next ∈ vs ∧ listp(orl + qrl + vs[vtail].next ', vs, ps[vtail, ps[vtail].next:= vs[vtail].next], owns(vs[vtail].next; None)) ∧ ¬ vs[vtail].next ∈ orl ∧ ¬ vs[vtail].next ∈ qrl ∧ markedp(orl, ps[vtail, ps[vtail].next:= vs[vtail].next]) ∧ unmarkedp(qrl, ps[vtail, ps[vtail].next:= vs[vtail].next]) ∧ ps[vtail, ps[vtail].next:= vs[vtail].next][vs[vtail].next].deqID = None ∧ nonullRetRefs(orl + qrl + vs[vtail].next ', vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ∧ vs[vs[vtail].next].deqID = None) ∧ (vtail = vs[vtail].next ∨ vtail = (orl + qrl).last ∧ vs[vs[(orl + qrl).last].next].deqID = None ∧ vs[vs[(orl + qrl).last].next].next = null) ∧ noid(tid, orl + qrl + vs[vtail].next ', vhead, vs) ∧ noowns(tid, owns(vs[vtail].next; None)) |
qrl + vs[vtail].next ' = phead0 ' + qrl0, ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, orl ≠ [], 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vs[vtail].next = phead0 ∨ vs[vtail].next ∈ qrl0, phead0 ∈ qrl ∨ phead0 = vs[vtail].next ⊦ (vtail ∈ orl ∨ vtail ∈ qrl ∨ vtail = vs[vtail].next) ∧ vs[vtail].next ∈ ps[vtail, ps[vtail].next:= vs[vtail].next] ∧ vs[vtail].next ∈ vs ∧ listp(orl + phead0 ' + qrl0, vs, ps[vtail, ps[vtail].next:= vs[vtail].next], owns(vs[vtail].next; None)) ∧ ¬ vs[vtail].next ∈ orl ∧ ¬ vs[vtail].next ∈ qrl ∧ markedp(orl, ps[vtail, ps[vtail].next:= vs[vtail].next]) ∧ unmarkedp(qrl, ps[vtail, ps[vtail].next:= vs[vtail].next]) ∧ ps[vtail, ps[vtail].next:= vs[vtail].next][vs[vtail].next].deqID = None ∧ nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ∧ vs[vs[vtail].next].deqID = None) ∧ (vtail = vs[vtail].next ∨ vtail = (orl + qrl).last ∧ vs[vs[(orl + qrl).last].next].deqID = None ∧ vs[vs[(orl + qrl).last].next].next = null) ∧ noid(tid, orl + phead0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[vtail].next; None))
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ x + a ' ≠ []; (s) ⊦ a + x = a ' + x; (s)
| qrl + vs[vtail].next ' = phead0 ' + qrl0, ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, orl ≠ [], 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vs[vtail].next = phead0 ∨ vs[vtail].next ∈ qrl0, phead0 ∈ qrl ∨ phead0 = vs[vtail].next ⊦ (vtail ∈ orl ∨ vtail ∈ qrl ∨ vtail = vs[vtail].next) ∧ vs[vtail].next ∈ ps[vtail, ps[vtail].next:= vs[vtail].next] ∧ vs[vtail].next ∈ vs ∧ listp(orl + phead0 ' + qrl0, vs, ps[vtail, ps[vtail].next:= vs[vtail].next], owns(vs[vtail].next; None)) ∧ ¬ vs[vtail].next ∈ orl ∧ ¬ vs[vtail].next ∈ qrl ∧ markedp(orl, ps[vtail, ps[vtail].next:= vs[vtail].next]) ∧ unmarkedp(qrl, ps[vtail, ps[vtail].next:= vs[vtail].next]) ∧ ps[vtail, ps[vtail].next:= vs[vtail].next][vs[vtail].next].deqID = None ∧ nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ∧ vs[vs[vtail].next].deqID = None) ∧ (vtail = vs[vtail].next ∨ vtail = (orl + qrl).last ∧ vs[vs[(orl + qrl).last].next].deqID = None ∧ vs[vs[(orl + qrl).last].next].next = null) ∧ noid(tid, orl + phead0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[vtail].next; None)) |
qrl + vs[vtail].next ' = phead0 ' + qrl0, ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vtail = (orl + qrl).last, vs[vtail].next ≠ null, orl ≠ [], 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ qrl ∨ phead0 = vs[vtail].next, vs[vtail].next = phead0 ∨ vs[vtail].next ∈ qrl0, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (vtail ∈ orl ∨ vtail ∈ qrl ∨ vtail = vs[vtail].next) ∧ vs[vtail].next ∈ ps[vtail, ps[vtail].next:= vs[vtail].next] ∧ vs[vtail].next ∈ vs ∧ listp(orl + phead0 ' + qrl0, vs, ps[vtail, ps[vtail].next:= vs[vtail].next], owns(vs[vtail].next; None)) ∧ ¬ vs[vtail].next ∈ orl ∧ ¬ vs[vtail].next ∈ qrl ∧ markedp(orl, ps[vtail, ps[vtail].next:= vs[vtail].next]) ∧ unmarkedp(qrl, ps[vtail, ps[vtail].next:= vs[vtail].next]) ∧ ps[vtail, ps[vtail].next:= vs[vtail].next][vs[vtail].next].deqID = None ∧ nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ∧ vs[vs[vtail].next].deqID = None) ∧ (vtail = vs[vtail].next ∨ vtail = (orl + qrl).last ∧ vs[vs[(orl + qrl).last].next].deqID = None ∧ vs[vs[(orl + qrl).last].next].next = null) ∧ noid(tid, orl + phead0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[vtail].next; None))
qrl + vs[vtail].next ' = phead0 ' + qrl0, vs[qrl.last].deqID = None, ps[vtail].next = null, vs[qrl.last].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vtail = (orl + qrl.butlast).last, vs[vtail].next ≠ null, orl ≠ [], qrl ≠ [], 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ qrl ∨ phead0 = vs[vtail].next, vs[vtail].next = phead0 ∨ vs[vtail].next ∈ qrl0, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (vtail ∈ orl ∨ vtail ∈ qrl ∨ vtail = vs[vtail].next) ∧ vs[vtail].next ∈ ps[vtail, ps[vtail].next:= vs[vtail].next] ∧ vs[vtail].next ∈ vs ∧ listp(orl + phead0 ' + qrl0, vs, ps[vtail, ps[vtail].next:= vs[vtail].next], owns(vs[vtail].next; None)) ∧ ¬ vs[vtail].next ∈ orl ∧ ¬ vs[vtail].next ∈ qrl ∧ markedp(orl, ps[vtail, ps[vtail].next:= vs[vtail].next]) ∧ unmarkedp(qrl, ps[vtail, ps[vtail].next:= vs[vtail].next]) ∧ ps[vtail, ps[vtail].next:= vs[vtail].next][vs[vtail].next].deqID = None ∧ nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ∧ vs[vs[vtail].next].deqID = None) ∧ (vtail = vs[vtail].next ∨ vtail = (orl + qrl).last ∧ vs[vs[(orl + qrl).last].next].deqID = None ∧ vs[vs[(orl + qrl).last].next].next = null) ∧ noid(tid, orl + phead0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[vtail].next; None))
| qrl + vs[vtail].next ' = phead0 ' + qrl0, ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vtail = (orl + qrl).last, vs[vtail].next ≠ null, orl ≠ [], 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ qrl ∨ phead0 = vs[vtail].next, vs[vtail].next = phead0 ∨ vs[vtail].next ∈ qrl0, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (vtail ∈ orl ∨ vtail ∈ qrl ∨ vtail = vs[vtail].next) ∧ vs[vtail].next ∈ ps[vtail, ps[vtail].next:= vs[vtail].next] ∧ vs[vtail].next ∈ vs ∧ listp(orl + phead0 ' + qrl0, vs, ps[vtail, ps[vtail].next:= vs[vtail].next], owns(vs[vtail].next; None)) ∧ ¬ vs[vtail].next ∈ orl ∧ ¬ vs[vtail].next ∈ qrl ∧ markedp(orl, ps[vtail, ps[vtail].next:= vs[vtail].next]) ∧ unmarkedp(qrl, ps[vtail, ps[vtail].next:= vs[vtail].next]) ∧ ps[vtail, ps[vtail].next:= vs[vtail].next][vs[vtail].next].deqID = None ∧ nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ∧ vs[vs[vtail].next].deqID = None) ∧ (vtail = vs[vtail].next ∨ vtail = (orl + qrl).last ∧ vs[vs[(orl + qrl).last].next].deqID = None ∧ vs[vs[(orl + qrl).last].next].next = null) ∧ noid(tid, orl + phead0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[vtail].next; None)) |
qrl + vs[(orl + qrl).last].next ' = phead0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, ps[(orl + qrl).last].next = null, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, owns(vs[(orl + qrl).last].next) = Weak(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], 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), oneweakowns(tid, vs[(orl + qrl).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), vs[(orl + qrl).last].next ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], phead ∈ ps, phead ∈ vs, phead ∈ orl, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ qrl ∨ phead0 = vs[(orl + qrl).last].next, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vs[(orl + qrl).last].next = phead0 ∨ vs[(orl + qrl).last].next ∈ qrl0 ⊦ noowns(tid, owns(vs[(orl + qrl).last].next; None)) ∧ noid(tid, orl + phead0 ' + qrl0, vhead, vs) ∧ (orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][vs[(orl + qrl).last].next].deqID = None ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ listp (orl + phead0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ((orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ∨ (orl + qrl).last = vs[(orl + qrl).last].next)
Used simplifier rules: ⊦ weak?(Weak(tid)); (s) fw-weak-oneweakowns: ⊦ oneweakowns(tid, r0, owns, vs, ps) ∧ owns(r) = Weak(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) listp-nextoflast: ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next)); (forward) from specification DMSQ in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist]
| qrl + vs[(orl + qrl).last].next ' = phead0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, ps[(orl + qrl).last].next = null, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, owns(vs[(orl + qrl).last].next) = Weak(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], 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), oneweakowns(tid, vs[(orl + qrl).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), vs[(orl + qrl).last].next ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], phead ∈ ps, phead ∈ vs, phead ∈ orl, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ qrl ∨ phead0 = vs[(orl + qrl).last].next, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vs[(orl + qrl).last].next = phead0 ∨ vs[(orl + qrl).last].next ∈ qrl0 ⊦ noowns(tid, owns(vs[(orl + qrl).last].next; None)) ∧ noid(tid, orl + phead0 ' + qrl0, vhead, vs) ∧ (orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][vs[(orl + qrl).last].next].deqID = None ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ listp (orl + phead0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ((orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ∨ (orl + qrl).last = vs[(orl + qrl).last].next) |
qrl + vs[(orl + qrl).last].next ' = phead0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[(orl + qrl).last].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, orl = orl0 + vhead0 ', owns(vs[(orl + qrl).last].next) = Weak(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], 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), oneweakowns(tid, vs[(orl + qrl).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(orl + qrl).last].next = phead0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vhead0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(qrl, vs), phead0 ∈ qrl ∨ phead0 = vs[(orl + qrl).last].next ⊦ noowns(tid, owns(vs[(orl + qrl).last].next; None)) ∧ noid(tid, orl + phead0 ' + qrl0, vhead, vs) ∧ (vhead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(qrl, vs)) ∧ nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][vs[(orl + qrl).last].next].deqID = None ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ listp (orl + phead0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ((orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ∨ (orl + qrl).last = vs[(orl + qrl).last].next)
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, vhead0, y
| qrl + vs[(orl + qrl).last].next ' = phead0 ' + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[(orl + qrl).last].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, orl = orl0 + vhead0 ', owns(vs[(orl + qrl).last].next) = Weak(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], 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), oneweakowns(tid, vs[(orl + qrl).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(orl + qrl).last].next = phead0 ∨ vs[(orl + qrl).last].next ∈ qrl0, vhead0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(qrl, vs), phead0 ∈ qrl ∨ phead0 = vs[(orl + qrl).last].next ⊦ noowns(tid, owns(vs[(orl + qrl).last].next; None)) ∧ noid(tid, orl + phead0 ' + qrl0, vhead, vs) ∧ (vhead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(qrl, vs)) ∧ nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][vs[(orl + qrl).last].next].deqID = None ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ listp (orl + phead0 ' + qrl0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ((orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ∨ (orl + qrl).last = vs[(orl + qrl).last].next) |
qrl + vs[(vhead0 ' + qrl).last].next ' = phead0 ' + qrl0, vs[vs[(vhead0 ' + qrl).last].next].deqID = None, vs[vs[(vhead0 ' + qrl).last].next].next = null, ps[(vhead0 ' + qrl).last].next = null, ps[vs[(vhead0 ' + qrl).last].next] = vs[vs[(vhead0 ' + qrl).last].next], dom vrvHp = dom prvHp, owns(vs[(vhead0 ' + qrl).last].next) = Weak(tid), vs[(vhead0 ' + qrl).last].next ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + vhead0 ') + qrl, vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + qrl, vhead, vs), nonullRetRefs((orl0 + vhead0 ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(vhead0 ' + qrl).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(qrl, ps), vs[(vhead0 ' + qrl).last].next ∈ vs, vs[(vhead0 ' + qrl).last].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[(vhead0 ' + qrl).last].next ∈ ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next], ¬ dups(qrl), ¬ dups(orl0), ¬ dups(orl0 + qrl), ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(vhead0 ' + qrl).last].next = phead0 ∨ vs[(vhead0 ' + qrl).last].next ∈ qrl0, phead ∈ orl0 ∨ phead = vhead0, vhead0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(qrl, vs), phead0 ∈ qrl ∨ phead0 = vs[(vhead0 ' + qrl).last].next ⊦ noowns(tid, owns(vs[(vhead0 ' + qrl).last].next; None)) ∧ noid(tid, (orl0 + vhead0 ') + phead0 ' + qrl0, vhead, vs) ∧ (vhead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(qrl, vs)) ∧ nonullRetRefs((orl0 + vhead0 ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next][vs[(vhead0 ' + qrl).last].next].deqID = None ∧ unmarkedp(qrl, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next]) ∧ markedp(orl0, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next]) ∧ some?(ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next][vhead0].deqID) ∧ ¬ vs[(vhead0 ' + qrl).last].next ∈ qrl ∧ ¬ vs[(vhead0 ' + qrl).last].next ∈ orl0 ∧ vs[(vhead0 ' + qrl).last].next ≠ vhead0 ∧ listp ((orl0 + vhead0 ') + phead0 ' + qrl0, vs, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next], owns(vs[(vhead0 ' + qrl).last].next; None)) ∧ ( (vhead0 ' + qrl).last ∈ orl0 ∨ (vhead0 ' + qrl).last = vhead0 ∨ (vhead0 ' + qrl).last ∈ qrl ∨ (vhead0 ' + qrl).last = vs[(vhead0 ' + qrl).last].next)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| qrl + vs[(vhead0 ' + qrl).last].next ' = phead0 ' + qrl0, vs[vs[(vhead0 ' + qrl).last].next].deqID = None, vs[vs[(vhead0 ' + qrl).last].next].next = null, ps[(vhead0 ' + qrl).last].next = null, ps[vs[(vhead0 ' + qrl).last].next] = vs[vs[(vhead0 ' + qrl).last].next], dom vrvHp = dom prvHp, owns(vs[(vhead0 ' + qrl).last].next) = Weak(tid), vs[(vhead0 ' + qrl).last].next ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + vhead0 ') + qrl, vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + qrl, vhead, vs), nonullRetRefs((orl0 + vhead0 ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(vhead0 ' + qrl).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(qrl, ps), vs[(vhead0 ' + qrl).last].next ∈ vs, vs[(vhead0 ' + qrl).last].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[(vhead0 ' + qrl).last].next ∈ ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next], ¬ dups(qrl), ¬ dups(orl0), ¬ dups(orl0 + qrl), ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(vhead0 ' + qrl).last].next = phead0 ∨ vs[(vhead0 ' + qrl).last].next ∈ qrl0, phead ∈ orl0 ∨ phead = vhead0, vhead0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(qrl, vs), phead0 ∈ qrl ∨ phead0 = vs[(vhead0 ' + qrl).last].next ⊦ noowns(tid, owns(vs[(vhead0 ' + qrl).last].next; None)) ∧ noid(tid, (orl0 + vhead0 ') + phead0 ' + qrl0, vhead, vs) ∧ (vhead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(qrl, vs)) ∧ nonullRetRefs((orl0 + vhead0 ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next][vs[(vhead0 ' + qrl).last].next].deqID = None ∧ unmarkedp(qrl, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next]) ∧ markedp(orl0, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next]) ∧ some?(ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next][vhead0].deqID) ∧ ¬ vs[(vhead0 ' + qrl).last].next ∈ qrl ∧ ¬ vs[(vhead0 ' + qrl).last].next ∈ orl0 ∧ vs[(vhead0 ' + qrl).last].next ≠ vhead0 ∧ listp ((orl0 + vhead0 ') + phead0 ' + qrl0, vs, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next], owns(vs[(vhead0 ' + qrl).last].next; None)) ∧ ( (vhead0 ' + qrl).last ∈ orl0 ∨ (vhead0 ' + qrl).last = vhead0 ∨ (vhead0 ' + qrl).last ∈ qrl ∨ (vhead0 ' + qrl).last = vs[(vhead0 ' + qrl).last].next) |
qrl + vs[(vhead0 ' + qrl).last].next ' = phead0 ' + qrl0, vs[vs[(vhead0 ' + qrl).last].next].deqID = None, ps[(vhead0 ' + qrl).last].next = null, vs[vs[(vhead0 ' + qrl).last].next].next = null, ps[vs[(vhead0 ' + qrl).last].next] = vs[vs[(vhead0 ' + qrl).last].next], dom vrvHp = dom prvHp, owns(vs[(vhead0 ' + qrl).last].next) = Weak(tid), vhead0 = vhead, vs[(vhead0 ' + qrl).last].next ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + vhead0 ') + qrl, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + qrl, vhead, vs), nonullRetRefs((orl0 + vhead0 ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(vhead0 ' + qrl).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(qrl, ps), vs[(vhead0 ' + qrl).last].next ∈ ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next], phead ∈ ps, phead ∈ vs, vs[(vhead0 ' + qrl).last].next ∈ ps, vs[(vhead0 ' + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl0), ¬ dups(orl0 + qrl), ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), phead0 ∈ qrl ∨ phead0 = vs[(vhead0 ' + qrl).last].next, phead ∈ orl0 ∨ phead = vhead0, vs[(vhead0 ' + qrl).last].next = phead0 ∨ vs[(vhead0 ' + qrl).last].next ∈ qrl0 ⊦ noowns(tid, owns(vs[(vhead0 ' + qrl).last].next; None)) ∧ noid(tid, (orl0 + vhead0 ') + phead0 ' + qrl0, vhead, vs) ∧ (vhead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(qrl, vs)) ∧ nonullRetRefs((orl0 + vhead0 ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next][vs[(vhead0 ' + qrl).last].next].deqID = None ∧ unmarkedp(qrl, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next]) ∧ markedp(orl0, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next]) ∧ some?(ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next][vhead0].deqID) ∧ ¬ vs[(vhead0 ' + qrl).last].next ∈ qrl ∧ ¬ vs[(vhead0 ' + qrl).last].next ∈ orl0 ∧ vs[(vhead0 ' + qrl).last].next ≠ vhead0 ∧ listp ((orl0 + vhead0 ') + phead0 ' + qrl0, vs, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next], owns(vs[(vhead0 ' + qrl).last].next; None)) ∧ ( (vhead0 ' + qrl).last ∈ orl0 ∨ (vhead0 ' + qrl).last = vhead0 ∨ (vhead0 ' + qrl).last ∈ qrl ∨ (vhead0 ' + qrl).last = vs[(vhead0 ' + qrl).last].next)
qrl + vs[(vhead0 ' + qrl).last].next ' = phead0 ' + qrl0, vs[vs[(vhead0 ' + qrl).last].next].deqID = None, orl0.last = vhead, ps[(vhead0 ' + qrl).last].next = null, vs[vs[(vhead0 ' + qrl).last].next].next = null, ps[vs[(vhead0 ' + qrl).last].next] = vs[vs[(vhead0 ' + qrl).last].next], dom vrvHp = dom prvHp, owns(vs[(vhead0 ' + qrl).last].next) = Weak(tid), vs[(vhead0 ' + qrl).last].next ≠ null, orl0 ≠ [], phead ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + vhead0 ') + qrl, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + qrl, vhead, vs), nonullRetRefs((orl0 + vhead0 ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(vhead0 ' + qrl).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vs[(vhead0 ' + qrl).last].next ∈ ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next], phead ∈ ps, phead ∈ vs, vs[(vhead0 ' + qrl).last].next ∈ ps, vs[(vhead0 ' + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl0), ¬ dups(orl0 + qrl), ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ qrl ∨ phead0 = vs[(vhead0 ' + qrl).last].next, phead ∈ orl0 ∨ phead = vhead0, vs[(vhead0 ' + qrl).last].next = phead0 ∨ vs[(vhead0 ' + qrl).last].next ∈ qrl0 ⊦ noowns(tid, owns(vs[(vhead0 ' + qrl).last].next; None)) ∧ noid(tid, (orl0 + vhead0 ') + phead0 ' + qrl0, vhead, vs) ∧ (vhead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(qrl, vs)) ∧ nonullRetRefs((orl0 + vhead0 ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next][vs[(vhead0 ' + qrl).last].next].deqID = None ∧ unmarkedp(qrl, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next]) ∧ markedp(orl0, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next]) ∧ some?(ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next][vhead0].deqID) ∧ ¬ vs[(vhead0 ' + qrl).last].next ∈ qrl ∧ ¬ vs[(vhead0 ' + qrl).last].next ∈ orl0 ∧ vs[(vhead0 ' + qrl).last].next ≠ vhead0 ∧ listp ((orl0 + vhead0 ') + phead0 ' + qrl0, vs, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next], owns(vs[(vhead0 ' + qrl).last].next; None)) ∧ ( (vhead0 ' + qrl).last ∈ orl0 ∨ (vhead0 ' + qrl).last = vhead0 ∨ (vhead0 ' + qrl).last ∈ qrl ∨ (vhead0 ' + qrl).last = vs[(vhead0 ' + qrl).last].next)
| qrl + vs[(vhead0 ' + qrl).last].next ' = phead0 ' + qrl0, vs[vs[(vhead0 ' + qrl).last].next].deqID = None, ps[(vhead0 ' + qrl).last].next = null, vs[vs[(vhead0 ' + qrl).last].next].next = null, ps[vs[(vhead0 ' + qrl).last].next] = vs[vs[(vhead0 ' + qrl).last].next], dom vrvHp = dom prvHp, owns(vs[(vhead0 ' + qrl).last].next) = Weak(tid), vhead0 = vhead, vs[(vhead0 ' + qrl).last].next ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + vhead0 ') + qrl, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + qrl, vhead, vs), nonullRetRefs((orl0 + vhead0 ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(vhead0 ' + qrl).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(qrl, ps), vs[(vhead0 ' + qrl).last].next ∈ ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next], phead ∈ ps, phead ∈ vs, vs[(vhead0 ' + qrl).last].next ∈ ps, vs[(vhead0 ' + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl0), ¬ dups(orl0 + qrl), ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), phead0 ∈ qrl ∨ phead0 = vs[(vhead0 ' + qrl).last].next, phead ∈ orl0 ∨ phead = vhead0, vs[(vhead0 ' + qrl).last].next = phead0 ∨ vs[(vhead0 ' + qrl).last].next ∈ qrl0 ⊦ noowns(tid, owns(vs[(vhead0 ' + qrl).last].next; None)) ∧ noid(tid, (orl0 + vhead0 ') + phead0 ' + qrl0, vhead, vs) ∧ (vhead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(qrl, vs)) ∧ nonullRetRefs((orl0 + vhead0 ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next][vs[(vhead0 ' + qrl).last].next].deqID = None ∧ unmarkedp(qrl, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next]) ∧ markedp(orl0, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next]) ∧ some?(ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next][vhead0].deqID) ∧ ¬ vs[(vhead0 ' + qrl).last].next ∈ qrl ∧ ¬ vs[(vhead0 ' + qrl).last].next ∈ orl0 ∧ vs[(vhead0 ' + qrl).last].next ≠ vhead0 ∧ listp ((orl0 + vhead0 ') + phead0 ' + qrl0, vs, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next], owns(vs[(vhead0 ' + qrl).last].next; None)) ∧ ( (vhead0 ' + qrl).last ∈ orl0 ∨ (vhead0 ' + qrl).last = vhead0 ∨ (vhead0 ' + qrl).last ∈ qrl ∨ (vhead0 ' + qrl).last = vs[(vhead0 ' + qrl).last].next) |
qrl + vs[(vhead ' + qrl).last].next ' = phead0 ' + qrl0, vs[vs[(vhead ' + qrl).last].next].deqID = None, ps[(vhead ' + qrl).last].next = null, vs[vs[(vhead ' + qrl).last].next].next = null, ps[vs[(vhead ' + qrl).last].next] = vs[vs[(vhead ' + qrl).last].next], dom vrvHp = dom prvHp, owns(vs[(vhead ' + qrl).last].next) = Weak(tid), vs[(vhead ' + qrl).last].next ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + vhead ') + qrl, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead ') + qrl, vhead, vs), nonullRetRefs((orl0 + vhead ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(vhead ' + qrl).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(qrl, ps), vs[(vhead ' + qrl).last].next ∈ ps[(vhead ' + qrl).last, ps[(vhead ' + qrl).last].next:= vs[(vhead ' + qrl).last].next], phead ∈ ps, phead ∈ vs, vs[(vhead ' + qrl).last].next ∈ ps, vs[(vhead ' + qrl).last].next ∈ vs, ¬ dups(orl0 + qrl), ¬ dups(orl0), ¬ dups(qrl), ¬ vhead ∈ orl0, ¬ vhead ∈ 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), qrl ≠ [] → unmarkedp(qrl.tail, vs), phead ∈ orl0 ∨ phead = vhead, vs[(vhead ' + qrl).last].next = phead0 ∨ vs[(vhead ' + qrl).last].next ∈ qrl0, phead0 ∈ qrl ∨ phead0 = vs[(vhead ' + qrl).last].next ⊦ noowns(tid, owns(vs[(vhead ' + qrl).last].next; None)) ∧ noid(tid, (orl0 + vhead ') + phead0 ' + qrl0, vhead, vs) ∧ (unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs)) ∧ nonullRetRefs((orl0 + vhead ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ps[(vhead ' + qrl).last, ps[(vhead ' + qrl).last].next:= vs[(vhead ' + qrl).last].next][vs[(vhead ' + qrl).last].next].deqID = None ∧ unmarkedp(qrl, ps[(vhead ' + qrl).last, ps[(vhead ' + qrl).last].next:= vs[(vhead ' + qrl).last].next]) ∧ markedp(orl0, ps[(vhead ' + qrl).last, ps[(vhead ' + qrl).last].next:= vs[(vhead ' + qrl).last].next]) ∧ some?(ps[(vhead ' + qrl).last, ps[(vhead ' + qrl).last].next:= vs[(vhead ' + qrl).last].next][vhead].deqID) ∧ ¬ vs[(vhead ' + qrl).last].next ∈ qrl ∧ ¬ vs[(vhead ' + qrl).last].next ∈ orl0 ∧ vs[(vhead ' + qrl).last].next ≠ vhead ∧ listp ((orl0 + vhead ') + phead0 ' + qrl0, vs, ps[(vhead ' + qrl).last, ps[(vhead ' + qrl).last].next:= vs[(vhead ' + qrl).last].next], owns(vs[(vhead ' + qrl).last].next; None)) ∧ ((vhead ' + qrl).last ∈ orl0 ∨ (vhead ' + qrl).last = vhead ∨ (vhead ' + qrl).last ∈ qrl ∨ (vhead ' + qrl).last = vs[(vhead ' + qrl).last].next)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist]
| qrl + vs[(vhead ' + qrl).last].next ' = phead0 ' + qrl0, vs[vs[(vhead ' + qrl).last].next].deqID = None, ps[(vhead ' + qrl).last].next = null, vs[vs[(vhead ' + qrl).last].next].next = null, ps[vs[(vhead ' + qrl).last].next] = vs[vs[(vhead ' + qrl).last].next], dom vrvHp = dom prvHp, owns(vs[(vhead ' + qrl).last].next) = Weak(tid), vs[(vhead ' + qrl).last].next ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + vhead ') + qrl, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead ') + qrl, vhead, vs), nonullRetRefs((orl0 + vhead ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(vhead ' + qrl).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(qrl, ps), vs[(vhead ' + qrl).last].next ∈ ps[(vhead ' + qrl).last, ps[(vhead ' + qrl).last].next:= vs[(vhead ' + qrl).last].next], phead ∈ ps, phead ∈ vs, vs[(vhead ' + qrl).last].next ∈ ps, vs[(vhead ' + qrl).last].next ∈ vs, ¬ dups(orl0 + qrl), ¬ dups(orl0), ¬ dups(qrl), ¬ vhead ∈ orl0, ¬ vhead ∈ 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), qrl ≠ [] → unmarkedp(qrl.tail, vs), phead ∈ orl0 ∨ phead = vhead, vs[(vhead ' + qrl).last].next = phead0 ∨ vs[(vhead ' + qrl).last].next ∈ qrl0, phead0 ∈ qrl ∨ phead0 = vs[(vhead ' + qrl).last].next ⊦ noowns(tid, owns(vs[(vhead ' + qrl).last].next; None)) ∧ noid(tid, (orl0 + vhead ') + phead0 ' + qrl0, vhead, vs) ∧ (unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs)) ∧ nonullRetRefs((orl0 + vhead ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ps[(vhead ' + qrl).last, ps[(vhead ' + qrl).last].next:= vs[(vhead ' + qrl).last].next][vs[(vhead ' + qrl).last].next].deqID = None ∧ unmarkedp(qrl, ps[(vhead ' + qrl).last, ps[(vhead ' + qrl).last].next:= vs[(vhead ' + qrl).last].next]) ∧ markedp(orl0, ps[(vhead ' + qrl).last, ps[(vhead ' + qrl).last].next:= vs[(vhead ' + qrl).last].next]) ∧ some?(ps[(vhead ' + qrl).last, ps[(vhead ' + qrl).last].next:= vs[(vhead ' + qrl).last].next][vhead].deqID) ∧ ¬ vs[(vhead ' + qrl).last].next ∈ qrl ∧ ¬ vs[(vhead ' + qrl).last].next ∈ orl0 ∧ vs[(vhead ' + qrl).last].next ≠ vhead ∧ listp ((orl0 + vhead ') + phead0 ' + qrl0, vs, ps[(vhead ' + qrl).last, ps[(vhead ' + qrl).last].next:= vs[(vhead ' + qrl).last].next], owns(vs[(vhead ' + qrl).last].next; None)) ∧ ((vhead ' + qrl).last ∈ orl0 ∨ (vhead ' + qrl).last = vhead ∨ (vhead ' + qrl).last ∈ qrl ∨ (vhead ' + qrl).last = vs[(vhead ' + qrl).last].next) |
⊦ y ≠ [] → (x + y).last = y.last
qrl + vs[(vhead ' + qrl).last].next ' = phead0 ' + qrl0, vs[vs[(vhead ' + qrl).last].next].deqID = None, vs[vs[(vhead ' + qrl).last].next].next = null, ps[(vhead ' + qrl).last].next = null, ps[vs[(vhead ' + qrl).last].next] = vs[vs[(vhead ' + qrl).last].next], dom vrvHp = dom prvHp, owns(vs[(vhead ' + qrl).last].next) = Weak(tid), qrl = [], vs[(vhead ' + qrl).last].next ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + vhead ') + qrl, vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead ') + qrl, vhead, vs), nonullRetRefs((orl0 + vhead ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(vhead ' + qrl).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(qrl, ps), vs[(vhead ' + qrl).last].next ∈ vs, vs[(vhead ' + qrl).last].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[(vhead ' + qrl).last].next ∈ ps[(vhead ' + qrl).last, ps[(vhead ' + qrl).last].next:= vs[(vhead ' + qrl).last].next], ¬ dups(orl0 + qrl), ¬ dups(orl0), ¬ dups(qrl), ¬ vhead ∈ orl0, ¬ vhead ∈ qrl, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ qrl ∨ phead0 = vs[(vhead ' + qrl).last].next, vs[(vhead ' + qrl).last].next = phead0 ∨ vs[(vhead ' + qrl).last].next ∈ qrl0, phead ∈ orl0 ∨ phead = vhead ⊦ noowns(tid, owns(vs[(vhead ' + qrl).last].next; None)) ∧ noid(tid, (orl0 + vhead ') + phead0 ' + qrl0, vhead, vs) ∧ (unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs)) ∧ nonullRetRefs((orl0 + vhead ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ps[(vhead ' + qrl).last, ps[(vhead ' + qrl).last].next:= vs[(vhead ' + qrl).last].next][vs[(vhead ' + qrl).last].next].deqID = None ∧ unmarkedp(qrl, ps[(vhead ' + qrl).last, ps[(vhead ' + qrl).last].next:= vs[(vhead ' + qrl).last].next]) ∧ markedp(orl0, ps[(vhead ' + qrl).last, ps[(vhead ' + qrl).last].next:= vs[(vhead ' + qrl).last].next]) ∧ some?(ps[(vhead ' + qrl).last, ps[(vhead ' + qrl).last].next:= vs[(vhead ' + qrl).last].next][vhead].deqID) ∧ ¬ vs[(vhead ' + qrl).last].next ∈ qrl ∧ ¬ vs[(vhead ' + qrl).last].next ∈ orl0 ∧ vs[(vhead ' + qrl).last].next ≠ vhead ∧ listp ((orl0 + vhead ') + phead0 ' + qrl0, vs, ps[(vhead ' + qrl).last, ps[(vhead ' + qrl).last].next:= vs[(vhead ' + qrl).last].next], owns(vs[(vhead ' + qrl).last].next; None)) ∧ ((vhead ' + qrl).last ∈ orl0 ∨ (vhead ' + qrl).last = vhead ∨ (vhead ' + qrl).last ∈ qrl ∨ (vhead ' + qrl).last = vs[(vhead ' + qrl).last].next)
qrl + vs[qrl.last].next ' = phead0 ' + qrl0, vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[qrl.last].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, owns(vs[qrl.last].next) = Weak(tid), vs[qrl.last].next ≠ null, qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + vhead ') + qrl, vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead ') + qrl, vhead, vs), nonullRetRefs((orl0 + vhead ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[qrl.last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(qrl, ps), vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[qrl.last].next ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], ¬ dups(orl0 + qrl), ¬ dups(orl0), ¬ dups(qrl), ¬ vhead ∈ orl0, ¬ vhead ∈ qrl, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ qrl ∨ phead0 = vs[qrl.last].next, vs[qrl.last].next = phead0 ∨ vs[qrl.last].next ∈ qrl0, phead ∈ orl0 ∨ phead = vhead ⊦ noowns(tid, owns(vs[qrl.last].next; None)) ∧ noid(tid, (orl0 + vhead ') + phead0 ' + qrl0, vhead, vs) ∧ (unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs)) ∧ nonullRetRefs((orl0 + vhead ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][vs[qrl.last].next].deqID = None ∧ unmarkedp(qrl, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ markedp(orl0, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ some?(ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][vhead].deqID) ∧ ¬ vs[qrl.last].next ∈ qrl ∧ ¬ vs[qrl.last].next ∈ orl0 ∧ vs[qrl.last].next ≠ vhead ∧ listp((orl0 + vhead ') + phead0 ' + qrl0, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)) ∧ (qrl.last ∈ orl0 ∨ qrl.last = vhead ∨ qrl.last ∈ qrl ∨ qrl.last = vs[qrl.last].next)
Used terms: vhead ', qrl
| ⊦ y ≠ [] → (x + y).last = y.last |
| qrl + vs[(vhead ' + qrl).last].next ' = phead0 ' + qrl0, vs[vs[(vhead ' + qrl).last].next].deqID = None, vs[vs[(vhead ' + qrl).last].next].next = null, ps[(vhead ' + qrl).last].next = null, ps[vs[(vhead ' + qrl).last].next] = vs[vs[(vhead ' + qrl).last].next], dom vrvHp = dom prvHp, owns(vs[(vhead ' + qrl).last].next) = Weak(tid), qrl = [], vs[(vhead ' + qrl).last].next ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + vhead ') + qrl, vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead ') + qrl, vhead, vs), nonullRetRefs((orl0 + vhead ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(vhead ' + qrl).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(qrl, ps), vs[(vhead ' + qrl).last].next ∈ vs, vs[(vhead ' + qrl).last].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[(vhead ' + qrl).last].next ∈ ps[(vhead ' + qrl).last, ps[(vhead ' + qrl).last].next:= vs[(vhead ' + qrl).last].next], ¬ dups(orl0 + qrl), ¬ dups(orl0), ¬ dups(qrl), ¬ vhead ∈ orl0, ¬ vhead ∈ qrl, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ qrl ∨ phead0 = vs[(vhead ' + qrl).last].next, vs[(vhead ' + qrl).last].next = phead0 ∨ vs[(vhead ' + qrl).last].next ∈ qrl0, phead ∈ orl0 ∨ phead = vhead ⊦ noowns(tid, owns(vs[(vhead ' + qrl).last].next; None)) ∧ noid(tid, (orl0 + vhead ') + phead0 ' + qrl0, vhead, vs) ∧ (unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs)) ∧ nonullRetRefs((orl0 + vhead ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ps[(vhead ' + qrl).last, ps[(vhead ' + qrl).last].next:= vs[(vhead ' + qrl).last].next][vs[(vhead ' + qrl).last].next].deqID = None ∧ unmarkedp(qrl, ps[(vhead ' + qrl).last, ps[(vhead ' + qrl).last].next:= vs[(vhead ' + qrl).last].next]) ∧ markedp(orl0, ps[(vhead ' + qrl).last, ps[(vhead ' + qrl).last].next:= vs[(vhead ' + qrl).last].next]) ∧ some?(ps[(vhead ' + qrl).last, ps[(vhead ' + qrl).last].next:= vs[(vhead ' + qrl).last].next][vhead].deqID) ∧ ¬ vs[(vhead ' + qrl).last].next ∈ qrl ∧ ¬ vs[(vhead ' + qrl).last].next ∈ orl0 ∧ vs[(vhead ' + qrl).last].next ≠ vhead ∧ listp ((orl0 + vhead ') + phead0 ' + qrl0, vs, ps[(vhead ' + qrl).last, ps[(vhead ' + qrl).last].next:= vs[(vhead ' + qrl).last].next], owns(vs[(vhead ' + qrl).last].next; None)) ∧ ((vhead ' + qrl).last ∈ orl0 ∨ (vhead ' + qrl).last = vhead ∨ (vhead ' + qrl).last ∈ qrl ∨ (vhead ' + qrl).last = vs[(vhead ' + qrl).last].next) |
vs[vs[vhead].next].deqID = None, vs[vs[vhead].next].next = null, ps[vhead].next = null, ps[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp = dom prvHp, owns(vs[vhead].next) = Weak(tid), vs[vhead].next ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ', vhead, vs), nonullRetRefs(orl0 + vhead ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), vs[vhead].next ∈ vs, vs[vhead].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[vhead].next ∈ ps[vhead, ps[vhead].next:= vs[vhead].next], ¬ dups(orl0), ¬ vhead ∈ orl0, phead ∈ orl0 ∨ phead = vhead ⊦ noowns(tid, owns(vs[vhead].next; None)) ∧ noid(tid, orl0 + vhead ' + vs[vhead].next ', vhead, vs) ∧ nonullRetRefs(orl0 + vhead ' + vs[vhead].next ', vs, vretRefs, pretRefs) ∧ ¬ vs[vhead].next ∈ orl0 ∧ vs[vhead].next ≠ vhead ∧ listp(orl0 + vhead ' + vs[vhead].next ', vs, ps[vhead, ps[vhead].next:= vs[vhead].next], owns(vs[vhead].next; None))
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ unmarkedp([], vs); (s) ⊦ a ≠ b → st[b, d][a] = st[a]; (s) ⊦ a '.last = a; (s) ⊦ ¬ a ∈ []; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ ¬ node ∈ rl → (markedp(rl, vs[node, nd]) ↔ markedp(rl, vs)); (s) ⊦ ¬ dups([]); (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ [] + x = x; (s)
| vs[vs[vhead].next].deqID = None, vs[vs[vhead].next].next = null, ps[vhead].next = null, ps[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp = dom prvHp, owns(vs[vhead].next) = Weak(tid), vs[vhead].next ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ', vhead, vs), nonullRetRefs(orl0 + vhead ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), vs[vhead].next ∈ vs, vs[vhead].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[vhead].next ∈ ps[vhead, ps[vhead].next:= vs[vhead].next], ¬ dups(orl0), ¬ vhead ∈ orl0, phead ∈ orl0 ∨ phead = vhead ⊦ noowns(tid, owns(vs[vhead].next; None)) ∧ noid(tid, orl0 + vhead ' + vs[vhead].next ', vhead, vs) ∧ nonullRetRefs(orl0 + vhead ' + vs[vhead].next ', vs, vretRefs, pretRefs) ∧ ¬ vs[vhead].next ∈ orl0 ∧ vs[vhead].next ≠ vhead ∧ listp(orl0 + vhead ' + vs[vhead].next ', vs, ps[vhead, ps[vhead].next:= vs[vhead].next], owns(vs[vhead].next; None)) |
vs[vs[vhead].next].deqID = None, ps[vhead].next = null, vs[vs[vhead].next].next = null, ps[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp = dom prvHp, owns(vs[vhead].next) = Weak(tid), vs[vhead].next ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ', vhead, vs), nonullRetRefs(orl0 + vhead ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), vs[vhead].next ∈ ps[vhead, ps[vhead].next:= vs[vhead].next], phead ∈ ps, phead ∈ vs, vs[vhead].next ∈ ps, vs[vhead].next ∈ vs, ¬ dups(orl0), ¬ noowns(tid, owns(vs[vhead].next; None)), ¬ vhead ∈ orl0, phead ∈ orl0 ∨ phead = vhead ⊦
vs[vs[vhead].next].deqID = None, ps[vhead].next = null, vs[vs[vhead].next].next = null, ps[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp = dom prvHp, owns(vs[vhead].next) = Weak(tid), vs[vhead].next ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ', vhead, vs), nonullRetRefs(orl0 + vhead ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), vs[vhead].next ∈ orl0, vs[vhead].next ∈ ps[vhead, ps[vhead].next:= vs[vhead].next], phead ∈ ps, phead ∈ vs, vs[vhead].next ∈ ps, vs[vhead].next ∈ vs, ¬ dups(orl0), ¬ vhead ∈ orl0, phead ∈ orl0 ∨ phead = vhead ⊦
vs[vs[vhead].next].deqID = None, ps[vhead].next = null, vs[vs[vhead].next].next = null, ps[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp = dom prvHp, owns(vs[vhead].next) = Weak(tid), vs[vhead].next ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ', vhead, vs), nonullRetRefs(orl0 + vhead ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), vs[vhead].next ∈ ps[vhead, ps[vhead].next:= vs[vhead].next], phead ∈ ps, phead ∈ vs, vs[vhead].next ∈ ps, vs[vhead].next ∈ vs, ¬ dups(orl0), ¬ listp(orl0 + vhead ' + vs[vhead].next ', vs, ps[vhead, ps[vhead].next:= vs[vhead].next], owns(vs[vhead].next; None)), ¬ vhead ∈ orl0, phead ∈ orl0 ∨ phead = vhead ⊦
Used simplifier rules: ⊦ nonullRetRefs(rl, vs, vretRefs, pretRefs) → ( nonullRetRefs(rl0, vs0, vretRefs0, pretRefs0) ↔ (∀ r. ( r ∈ rl ∧ r ≠ rl.head ∧ vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null) → r ∈ rl0 ∧ r ≠ rl0.head ∧ vs0[r].deqID ≠ None → vretRefs0(vs0[r].deqID.tid) ≠ null ∧ pretRefs0(vs0[r].deqID.tid) ≠ null)); (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ (x + a ' + y).head = (x + a ').head; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ noid(tid, rl, r, vs) → ( noid(tid, rl0, r, vs0) ↔ (∀ r0. (r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) → r0 ≠ r ∧ r0 ∈ rl0 from r → vs0[r0].deqID ≠ Some(tid))); (ss) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s) ⊦ None ≠ Some(tid); (s)
| vs[vs[vhead].next].deqID = None, ps[vhead].next = null, vs[vs[vhead].next].next = null, ps[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp = dom prvHp, owns(vs[vhead].next) = Weak(tid), vs[vhead].next ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ', vhead, vs), nonullRetRefs(orl0 + vhead ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), vs[vhead].next ∈ ps[vhead, ps[vhead].next:= vs[vhead].next], phead ∈ ps, phead ∈ vs, vs[vhead].next ∈ ps, vs[vhead].next ∈ vs, ¬ dups(orl0), ¬ noowns(tid, owns(vs[vhead].next; None)), ¬ vhead ∈ orl0, phead ∈ orl0 ∨ phead = vhead ⊦ |
⊦ oneweakowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Weak(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)
vs[vs[vhead].next].deqID = None, vs[vs[vhead].next].next = null, ps[vhead].next = null, ps[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp = dom prvHp, owns(vs[vhead].next) = Weak(tid), vs[vhead].next ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ', vhead, vs), nonullRetRefs(orl0 + vhead ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), phead ∈ vs, phead ∈ ps, vs[vhead].next ∈ ps[vhead, ps[vhead].next:= vs[vhead].next], vs[vhead].next ∈ vs, vs[vhead].next ∈ ps, ¬ dups(orl0), ¬ noowns(tid, owns(vs[vhead].next; None)), ¬ vhead ∈ orl0, ∀ r0. r0 ≠ vs[vhead].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, phead ∈ orl0 ∨ phead = vhead ⊦
Used terms: ps, tid, owns, vs[vhead].next, vs
| ⊦ oneweakowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Weak(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid) |
| vs[vs[vhead].next].deqID = None, vs[vs[vhead].next].next = null, ps[vhead].next = null, ps[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp = dom prvHp, owns(vs[vhead].next) = Weak(tid), vs[vhead].next ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ', vhead, vs), nonullRetRefs(orl0 + vhead ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), phead ∈ vs, phead ∈ ps, vs[vhead].next ∈ ps[vhead, ps[vhead].next:= vs[vhead].next], vs[vhead].next ∈ vs, vs[vhead].next ∈ ps, ¬ dups(orl0), ¬ noowns(tid, owns(vs[vhead].next; None)), ¬ vhead ∈ orl0, ∀ r0. r0 ≠ vs[vhead].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, phead ∈ orl0 ∨ phead = vhead ⊦ |
⊦ noowns(tid, owns) ↔ (∀ r. owns(r) ≠ None → owns(r).tid ≠ tid)
vs[vs[vhead].next].deqID = None, ps[vhead].next = null, vs[vs[vhead].next].next = null, ps[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp = dom prvHp, owns(vs[vhead].next) = Weak(tid), vs[vhead].next ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ', vhead, vs), nonullRetRefs(orl0 + vhead ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), vs[vhead].next ∈ ps, vs[vhead].next ∈ vs, vs[vhead].next ∈ ps[vhead, ps[vhead].next:= vs[vhead].next], phead ∈ ps, phead ∈ vs, ¬ dups(orl0), ¬ vhead ∈ orl0, ∀ r0. r0 ≠ vs[vhead].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, ∃ r. ¬(owns(vs[vhead].next; None)(r) ≠ None → owns(vs[vhead].next; None)(r).tid ≠ tid), phead ∈ orl0 ∨ phead = vhead ⊦
Used terms: tid, owns(vs[vhead].next; None)
| ⊦ noowns(tid, owns) ↔ (∀ r. owns(r) ≠ None → owns(r).tid ≠ tid) |
| vs[vs[vhead].next].deqID = None, ps[vhead].next = null, vs[vs[vhead].next].next = null, ps[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp = dom prvHp, owns(vs[vhead].next) = Weak(tid), vs[vhead].next ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ', vhead, vs), nonullRetRefs(orl0 + vhead ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), vs[vhead].next ∈ ps, vs[vhead].next ∈ vs, vs[vhead].next ∈ ps[vhead, ps[vhead].next:= vs[vhead].next], phead ∈ ps, phead ∈ vs, ¬ dups(orl0), ¬ vhead ∈ orl0, ∀ r0. r0 ≠ vs[vhead].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, ∃ r. ¬(owns(vs[vhead].next; None)(r) ≠ None → owns(vs[vhead].next; None)(r).tid ≠ tid), phead ∈ orl0 ∨ phead = vhead ⊦ |
vs[vs[vhead].next].deqID = None, vs[vs[vhead].next].next = null, ps[vhead].next = null, ps[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp = dom prvHp, owns(vs[vhead].next) = Weak(owns(r).tid), vs[vhead].next ≠ null, vs[vhead].next ≠ r, None ≠ owns(r), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(owns(r).tid, vhead, vs), noid(owns(r).tid, orl0 + vhead ', vhead, vs), nonullRetRefs(orl0 + vhead ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), phead ∈ vs, phead ∈ ps, vs[vhead].next ∈ ps[vhead, ps[vhead].next:= vs[vhead].next], vs[vhead].next ∈ vs, vs[vhead].next ∈ ps, ¬ dups(orl0), ¬ vhead ∈ orl0, ∀ r0. r0 ≠ vs[vhead].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ owns(r).tid, phead ∈ orl0 ∨ phead = vhead ⊦
| vs[vs[vhead].next].deqID = None, vs[vs[vhead].next].next = null, ps[vhead].next = null, ps[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp = dom prvHp, owns(vs[vhead].next) = Weak(owns(r).tid), vs[vhead].next ≠ null, vs[vhead].next ≠ r, None ≠ owns(r), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(owns(r).tid, vhead, vs), noid(owns(r).tid, orl0 + vhead ', vhead, vs), nonullRetRefs(orl0 + vhead ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), phead ∈ vs, phead ∈ ps, vs[vhead].next ∈ ps[vhead, ps[vhead].next:= vs[vhead].next], vs[vhead].next ∈ vs, vs[vhead].next ∈ ps, ¬ dups(orl0), ¬ vhead ∈ orl0, ∀ r0. r0 ≠ vs[vhead].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ owns(r).tid, phead ∈ orl0 ∨ phead = vhead ⊦ |
Used terms: r
| vs[vs[vhead].next].deqID = None, ps[vhead].next = null, vs[vs[vhead].next].next = null, ps[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp = dom prvHp, owns(vs[vhead].next) = Weak(tid), vs[vhead].next ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ', vhead, vs), nonullRetRefs(orl0 + vhead ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), vs[vhead].next ∈ orl0, vs[vhead].next ∈ ps[vhead, ps[vhead].next:= vs[vhead].next], phead ∈ ps, phead ∈ vs, vs[vhead].next ∈ ps, vs[vhead].next ∈ vs, ¬ dups(orl0), ¬ vhead ∈ orl0, phead ∈ orl0 ∨ phead = vhead ⊦ |
vs[vs[vhead].next].deqID = None, vs[vs[vhead].next].next = null, ps[vhead].next = null, ps[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp = dom prvHp, owns(vs[vhead].next) = Weak(tid), vs[vhead].next ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ', vhead, vs), nonullRetRefs(orl0 + vhead ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), phead ∈ vs, phead ∈ ps, vs[vhead].next ∈ ps[vhead, ps[vhead].next:= vs[vhead].next], vs[vhead].next ∈ orl0, vs[vhead].next ∈ vs, vs[vhead].next ∈ ps, ¬ dups(orl0), ¬ vhead ∈ orl0, phead ∈ orl0 ∨ phead = vhead ⊦
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
| vs[vs[vhead].next].deqID = None, vs[vs[vhead].next].next = null, ps[vhead].next = null, ps[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp = dom prvHp, owns(vs[vhead].next) = Weak(tid), vs[vhead].next ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ', vhead, vs), nonullRetRefs(orl0 + vhead ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), phead ∈ vs, phead ∈ ps, vs[vhead].next ∈ ps[vhead, ps[vhead].next:= vs[vhead].next], vs[vhead].next ∈ orl0, vs[vhead].next ∈ vs, vs[vhead].next ∈ ps, ¬ dups(orl0), ¬ vhead ∈ orl0, phead ∈ orl0 ∨ phead = vhead ⊦ |
⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])
vs[vs[vhead].next].deqID = None, ps[vhead].next = null, vs[vs[vhead].next].next = null, ps[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp = dom prvHp, owns(vs[vhead].next) = Weak(tid), vs[vhead].next ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ', vhead, vs), nonullRetRefs(orl0 + vhead ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), vs[vhead].next ∈ ps, vs[vhead].next ∈ vs, vs[vhead].next ∈ orl0, vs[vhead].next ∈ ps[vhead, ps[vhead].next:= vs[vhead].next], phead ∈ ps, phead ∈ vs, ¬ dups(orl0), ¬ vhead ∈ orl0, listp(orl0 + vhead ', vs, ps, owns) → (listp(vhead ', vs, ps, owns) ↔ vhead ' ≠ []), phead ∈ orl0 ∨ phead = vhead ⊦
Used terms: ps, orl0, owns, vhead ', vs
| ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []) |
| vs[vs[vhead].next].deqID = None, ps[vhead].next = null, vs[vs[vhead].next].next = null, ps[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp = dom prvHp, owns(vs[vhead].next) = Weak(tid), vs[vhead].next ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ', vhead, vs), nonullRetRefs(orl0 + vhead ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), vs[vhead].next ∈ ps, vs[vhead].next ∈ vs, vs[vhead].next ∈ orl0, vs[vhead].next ∈ ps[vhead, ps[vhead].next:= vs[vhead].next], phead ∈ ps, phead ∈ vs, ¬ dups(orl0), ¬ vhead ∈ orl0, listp(orl0 + vhead ', vs, ps, owns) → (listp(vhead ', vs, ps, owns) ↔ vhead ' ≠ []), phead ∈ orl0 ∨ phead = vhead ⊦ |
ps[vhead].deqID = vs[vhead].deqID, vs[vs[vhead].next].deqID = None, ps[vhead].next = null, vs[vs[vhead].next].next = null, ps[vhead].val = vs[vhead].val, ps[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp = dom prvHp, owns(vhead) = None, owns(vs[vhead].next) = Weak(tid), vs[vhead].next ≠ null, vhead ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ', vhead, vs), nonullRetRefs(orl0 + vhead ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), vhead ∈ ps, vhead ∈ vs, vs[vhead].next ∈ ps, vs[vhead].next ∈ vs, vs[vhead].next ∈ orl0, vs[vhead].next ∈ ps[vhead, ps[vhead].next:= vs[vhead].next], phead ∈ ps, phead ∈ vs, ¬ dups(orl0), ¬ weak?(vs[vhead].deqID), ¬ vhead ∈ orl0, phead ∈ orl0 ∨ phead = vhead ⊦
Used simplifier rules: ⊦ weak?(Weak(tid)); (s) ⊦ 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 ' ≠ []; (s)
| ps[vhead].deqID = vs[vhead].deqID, vs[vs[vhead].next].deqID = None, ps[vhead].next = null, vs[vs[vhead].next].next = null, ps[vhead].val = vs[vhead].val, ps[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp = dom prvHp, owns(vhead) = None, owns(vs[vhead].next) = Weak(tid), vs[vhead].next ≠ null, vhead ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ', vhead, vs), nonullRetRefs(orl0 + vhead ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), vhead ∈ ps, vhead ∈ vs, vs[vhead].next ∈ ps, vs[vhead].next ∈ vs, vs[vhead].next ∈ orl0, vs[vhead].next ∈ ps[vhead, ps[vhead].next:= vs[vhead].next], phead ∈ ps, phead ∈ vs, ¬ dups(orl0), ¬ weak?(vs[vhead].deqID), ¬ vhead ∈ orl0, phead ∈ orl0 ∨ phead = vhead ⊦ |
⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z))
Used simplifier rules: ⊦ a + x = a ' + x; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ some?(opttid) → opttid ≠ None; (as) Used terms: vs[vhead].next, orl0
| ⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z)) |
| vs[vs[vhead].next].deqID = None, ps[vhead].next = null, vs[vs[vhead].next].next = null, ps[vs[vhead].next] = vs[vs[vhead].next], dom vrvHp = dom prvHp, owns(vs[vhead].next) = Weak(tid), vs[vhead].next ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ', vhead, vs), nonullRetRefs(orl0 + vhead ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), vs[vhead].next ∈ ps[vhead, ps[vhead].next:= vs[vhead].next], phead ∈ ps, phead ∈ vs, vs[vhead].next ∈ ps, vs[vhead].next ∈ vs, ¬ dups(orl0), ¬ listp(orl0 + vhead ' + vs[vhead].next ', vs, ps[vhead, ps[vhead].next:= vs[vhead].next], owns(vs[vhead].next; None)), ¬ vhead ∈ orl0, phead ∈ orl0 ∨ phead = vhead ⊦ |
⊦ listp(rl, vs, ps, owns) ∧ r ≠ null ∧ r ∈ vs ∧ r ∈ ps → (listp(rl + r ', vs, ps[rl.last, ps[rl.last].next:= r], owns(r; None)) ↔ vs[rl.last].next = r ∧ ps[r].next = null ∧ ps[r].deqID = None)
Used simplifier rules: ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, orl0 + vhead ', owns, vs[vhead].next, vs
| ⊦ listp(rl, vs, ps, owns) ∧ r ≠ null ∧ r ∈ vs ∧ r ∈ ps → (listp(rl + r ', vs, ps[rl.last, ps[rl.last].next:= r], owns(r; None)) ↔ vs[rl.last].next = r ∧ ps[r].next = null ∧ ps[r].deqID = None) |
| qrl + vs[qrl.last].next ' = phead0 ' + qrl0, vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[qrl.last].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, owns(vs[qrl.last].next) = Weak(tid), vs[qrl.last].next ≠ null, qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + vhead ') + qrl, vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead ') + qrl, vhead, vs), nonullRetRefs((orl0 + vhead ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[qrl.last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(qrl, ps), vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[qrl.last].next ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], ¬ dups(orl0 + qrl), ¬ dups(orl0), ¬ dups(qrl), ¬ vhead ∈ orl0, ¬ vhead ∈ qrl, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ qrl ∨ phead0 = vs[qrl.last].next, vs[qrl.last].next = phead0 ∨ vs[qrl.last].next ∈ qrl0, phead ∈ orl0 ∨ phead = vhead ⊦ noowns(tid, owns(vs[qrl.last].next; None)) ∧ noid(tid, (orl0 + vhead ') + phead0 ' + qrl0, vhead, vs) ∧ (unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs)) ∧ nonullRetRefs((orl0 + vhead ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][vs[qrl.last].next].deqID = None ∧ unmarkedp(qrl, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ markedp(orl0, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ some?(ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][vhead].deqID) ∧ ¬ vs[qrl.last].next ∈ qrl ∧ ¬ vs[qrl.last].next ∈ orl0 ∧ vs[qrl.last].next ≠ vhead ∧ listp((orl0 + vhead ') + phead0 ' + qrl0, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)) ∧ (qrl.last ∈ orl0 ∨ qrl.last = vhead ∨ qrl.last ∈ qrl ∨ qrl.last = vs[qrl.last].next) |
qrl + vs[qrl.last].next ' = phead0 ' + qrl0, vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[qrl.last].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, owns(vs[qrl.last].next) = Weak(tid), vs[qrl.last].next ≠ null, vs[qrl.last].next ≠ vhead, qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + vhead ') + qrl, vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead ') + qrl, vhead, vs), nonullRetRefs((orl0 + vhead ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[qrl.last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(qrl.tail, vs), unmarkedp(qrl, ps), phead0 ∈ qrl, vs[qrl.last].next ∈ qrl0, vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[qrl.last].next ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], phead0 ∈ vs, phead0 ∈ ps, ¬ dups(qrl), ¬ dups(orl0), ¬ dups(orl0 + qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ listp((orl0 + vhead ') + phead0 ' + qrl0, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)) ∧ ¬ vs[qrl.last].next ∈ orl0 ∧ ¬ vs[qrl.last].next ∈ qrl ∧ some?(ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][vhead].deqID) ∧ markedp(orl0, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ unmarkedp(qrl, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][vs[qrl.last].next].deqID = None ∧ nonullRetRefs((orl0 + vhead ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs)) ∧ noid(tid, (orl0 + vhead ') + phead0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[qrl.last].next; None))
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ a ∈ x → a ∈ x + y; (s) ⊦ a ∈ y → a ∈ x + y; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] inapp-08: ⊦ a ' + x = y + b ' ∧ y ≠ [] → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] ⊦ x.last ∈ x ↔ x ≠ []; (s)
| qrl + vs[qrl.last].next ' = phead0 ' + qrl0, vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[qrl.last].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, owns(vs[qrl.last].next) = Weak(tid), vs[qrl.last].next ≠ null, vs[qrl.last].next ≠ vhead, qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + vhead ') + qrl, vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead ') + qrl, vhead, vs), nonullRetRefs((orl0 + vhead ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[qrl.last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(qrl.tail, vs), unmarkedp(qrl, ps), phead0 ∈ qrl, vs[qrl.last].next ∈ qrl0, vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[qrl.last].next ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], phead0 ∈ vs, phead0 ∈ ps, ¬ dups(qrl), ¬ dups(orl0), ¬ dups(orl0 + qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ listp((orl0 + vhead ') + phead0 ' + qrl0, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)) ∧ ¬ vs[qrl.last].next ∈ orl0 ∧ ¬ vs[qrl.last].next ∈ qrl ∧ some?(ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][vhead].deqID) ∧ markedp(orl0, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ unmarkedp(qrl, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][vs[qrl.last].next].deqID = None ∧ nonullRetRefs((orl0 + vhead ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs)) ∧ noid(tid, (orl0 + vhead ') + phead0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[qrl.last].next; None)) |
qrl + vs[qrl.last].next ' = phead0 ' + qrl0, vs[vs[qrl.last].next].deqID = None, ps[qrl.last].next = null, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, owns(vs[qrl.last].next) = Weak(tid), qrl = vhead0 + orl, vs[qrl.last].next ≠ null, vs[qrl.last].next ≠ vhead, qrl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + vhead ') + qrl, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead ') + qrl, vhead, vs), nonullRetRefs((orl0 + vhead ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[qrl.last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(qrl, ps), unmarkedp(orl, vs), phead0 ∈ ps, phead0 ∈ vs, vs[qrl.last].next ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], phead ∈ ps, phead ∈ vs, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ qrl0, phead0 ∈ qrl, ¬ dups(qrl), ¬ dups(orl0), ¬ dups(orl0 + qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ listp((orl0 + vhead ') + phead0 ' + qrl0, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)) ∧ ¬ vs[qrl.last].next ∈ orl0 ∧ ¬ vs[qrl.last].next ∈ qrl ∧ some?(ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][vhead].deqID) ∧ markedp(orl0, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ unmarkedp(qrl, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][vs[qrl.last].next].deqID = None ∧ nonullRetRefs((orl0 + vhead ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs)) ∧ noid(tid, (orl0 + vhead ') + phead0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[qrl.last].next; None))
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, tail
| qrl + vs[qrl.last].next ' = phead0 ' + qrl0, vs[vs[qrl.last].next].deqID = None, ps[qrl.last].next = null, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, owns(vs[qrl.last].next) = Weak(tid), qrl = vhead0 + orl, vs[qrl.last].next ≠ null, vs[qrl.last].next ≠ vhead, qrl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + vhead ') + qrl, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead ') + qrl, vhead, vs), nonullRetRefs((orl0 + vhead ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[qrl.last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(qrl, ps), unmarkedp(orl, vs), phead0 ∈ ps, phead0 ∈ vs, vs[qrl.last].next ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], phead ∈ ps, phead ∈ vs, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ qrl0, phead0 ∈ qrl, ¬ dups(qrl), ¬ dups(orl0), ¬ dups(orl0 + qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ listp((orl0 + vhead ') + phead0 ' + qrl0, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)) ∧ ¬ vs[qrl.last].next ∈ orl0 ∧ ¬ vs[qrl.last].next ∈ qrl ∧ some?(ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][vhead].deqID) ∧ markedp(orl0, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ unmarkedp(qrl, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][vs[qrl.last].next].deqID = None ∧ nonullRetRefs((orl0 + vhead ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ (unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs)) ∧ noid(tid, (orl0 + vhead ') + phead0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[qrl.last].next; None)) |
ps[ps[vhead].next].deqID = None, vs[vs[(ps[vhead].next ' + orl).last].next].deqID = None, ps[(ps[vhead].next ' + orl).last].next = null, vs[vs[(ps[vhead].next ' + orl).last].next].next = null, ps[vs[(ps[vhead].next ' + orl).last].next] = vs[vs[(ps[vhead].next ' + orl).last].next], dom vrvHp = dom prvHp, owns(vs[(ps[vhead].next ' + orl).last].next) = Weak(tid), vs[(ps[vhead].next ' + orl).last].next ≠ vhead, vs[(ps[vhead].next ' + orl).last].next ≠ null, vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl, vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(ps[vhead].next ' + orl).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(orl, ps), unmarkedp(orl, vs), ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, vs[(ps[vhead].next ' + orl).last].next ∈ ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next], phead ∈ ps, phead ∈ vs, vs[(ps[vhead].next ' + orl).last].next ∈ ps, vs[(ps[vhead].next ' + orl).last].next ∈ vs, ¬ dups(orl), ¬ dups(orl0), ¬ dups(orl0 + orl), ¬ vhead ∈ orl, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ listp ((orl0 + vhead ') + ps[vhead].next ' + orl + vs[(ps[vhead].next ' + orl).last].next ', vs, ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next], owns(vs[(ps[vhead].next ' + orl).last].next; None)) ∧ ¬ vs[(ps[vhead].next ' + orl).last].next ∈ orl0 ∧ vs[(ps[vhead].next ' + orl).last].next ≠ ps[vhead].next ∧ ¬ vs[(ps[vhead].next ' + orl).last].next ∈ orl ∧ some?(ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next][vhead].deqID) ∧ markedp(orl0, ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next]) ∧ ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next][ps[vhead].next].deqID = None ∧ unmarkedp(orl, ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next]) ∧ ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next] [vs[(ps[vhead].next ' + orl).last].next ] .deqID = None ∧ nonullRetRefs((orl0 + vhead ') + ps[vhead].next ' + orl + vs[(ps[vhead].next ' + orl).last].next ', vs, vretRefs, pretRefs) ∧ noid(tid, (orl0 + vhead ') + ps[vhead].next ' + orl + vs[(ps[vhead].next ' + orl).last].next ', vhead, vs) ∧ noowns(tid, owns(vs[(ps[vhead].next ' + orl).last].next; None))
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) 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 in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ' + x ≠ []; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)
| ps[ps[vhead].next].deqID = None, vs[vs[(ps[vhead].next ' + orl).last].next].deqID = None, ps[(ps[vhead].next ' + orl).last].next = null, vs[vs[(ps[vhead].next ' + orl).last].next].next = null, ps[vs[(ps[vhead].next ' + orl).last].next] = vs[vs[(ps[vhead].next ' + orl).last].next], dom vrvHp = dom prvHp, owns(vs[(ps[vhead].next ' + orl).last].next) = Weak(tid), vs[(ps[vhead].next ' + orl).last].next ≠ vhead, vs[(ps[vhead].next ' + orl).last].next ≠ null, vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl, vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(ps[vhead].next ' + orl).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(orl, ps), unmarkedp(orl, vs), ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, vs[(ps[vhead].next ' + orl).last].next ∈ ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next], phead ∈ ps, phead ∈ vs, vs[(ps[vhead].next ' + orl).last].next ∈ ps, vs[(ps[vhead].next ' + orl).last].next ∈ vs, ¬ dups(orl), ¬ dups(orl0), ¬ dups(orl0 + orl), ¬ vhead ∈ orl, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ listp ((orl0 + vhead ') + ps[vhead].next ' + orl + vs[(ps[vhead].next ' + orl).last].next ', vs, ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next], owns(vs[(ps[vhead].next ' + orl).last].next; None)) ∧ ¬ vs[(ps[vhead].next ' + orl).last].next ∈ orl0 ∧ vs[(ps[vhead].next ' + orl).last].next ≠ ps[vhead].next ∧ ¬ vs[(ps[vhead].next ' + orl).last].next ∈ orl ∧ some?(ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next][vhead].deqID) ∧ markedp(orl0, ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next]) ∧ ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next][ps[vhead].next].deqID = None ∧ unmarkedp(orl, ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next]) ∧ ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next] [vs[(ps[vhead].next ' + orl).last].next ] .deqID = None ∧ nonullRetRefs((orl0 + vhead ') + ps[vhead].next ' + orl + vs[(ps[vhead].next ' + orl).last].next ', vs, vretRefs, pretRefs) ∧ noid(tid, (orl0 + vhead ') + ps[vhead].next ' + orl + vs[(ps[vhead].next ' + orl).last].next ', vhead, vs) ∧ noowns(tid, owns(vs[(ps[vhead].next ' + orl).last].next; None)) |
⊦ y ≠ [] → (x + y).last = y.last
vs[vs[(ps[vhead].next ' + orl).last].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[(ps[vhead].next ' + orl).last].next].next = null, ps[(ps[vhead].next ' + orl).last].next = null, ps[vs[(ps[vhead].next ' + orl).last].next] = vs[vs[(ps[vhead].next ' + orl).last].next], dom vrvHp = dom prvHp, orl = [], owns(vs[(ps[vhead].next ' + orl).last].next) = Weak(tid), vs[(ps[vhead].next ' + orl).last].next ≠ vhead, vs[(ps[vhead].next ' + orl).last].next ≠ null, vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl, vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl, vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(ps[vhead].next ' + orl).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl, vs), unmarkedp(orl, ps), vs[(ps[vhead].next ' + orl).last].next ∈ vs, vs[(ps[vhead].next ' + orl).last].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[(ps[vhead].next ' + orl).last].next ∈ ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next], ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, ¬ dups(orl), ¬ dups(orl0), ¬ dups(orl0 + orl), ¬ vhead ∈ orl, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ listp ((orl0 + vhead ') + ps[vhead].next ' + orl + vs[(ps[vhead].next ' + orl).last].next ', vs, ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next], owns(vs[(ps[vhead].next ' + orl).last].next; None)) ∧ ¬ vs[(ps[vhead].next ' + orl).last].next ∈ orl0 ∧ vs[(ps[vhead].next ' + orl).last].next ≠ ps[vhead].next ∧ ¬ vs[(ps[vhead].next ' + orl).last].next ∈ orl ∧ some?(ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next][vhead].deqID) ∧ markedp(orl0, ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next]) ∧ ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next][ps[vhead].next].deqID = None ∧ unmarkedp(orl, ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next]) ∧ ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next] [vs[(ps[vhead].next ' + orl).last].next ] .deqID = None ∧ nonullRetRefs((orl0 + vhead ') + ps[vhead].next ' + orl + vs[(ps[vhead].next ' + orl).last].next ', vs, vretRefs, pretRefs) ∧ noid(tid, (orl0 + vhead ') + ps[vhead].next ' + orl + vs[(ps[vhead].next ' + orl).last].next ', vhead, vs) ∧ noowns(tid, owns(vs[(ps[vhead].next ' + orl).last].next; None))
vs[vs[orl.last].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[orl.last].next].next = null, ps[orl.last].next = null, ps[vs[orl.last].next] = vs[vs[orl.last].next], dom vrvHp = dom prvHp, owns(vs[orl.last].next) = Weak(tid), vs[orl.last].next ≠ vhead, vs[orl.last].next ≠ null, orl ≠ [], vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl, vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl, vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[orl.last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl, vs), unmarkedp(orl, ps), vs[orl.last].next ∈ vs, vs[orl.last].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[orl.last].next ∈ ps[orl.last, ps[orl.last].next:= vs[orl.last].next], ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, ¬ dups(orl), ¬ dups(orl0), ¬ dups(orl0 + orl), ¬ vhead ∈ orl, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ listp ((orl0 + vhead ') + ps[vhead].next ' + orl + vs[orl.last].next ', vs, ps[orl.last, ps[orl.last].next:= vs[orl.last].next], owns(vs[orl.last].next; None)) ∧ ¬ vs[orl.last].next ∈ orl0 ∧ vs[orl.last].next ≠ ps[vhead].next ∧ ¬ vs[orl.last].next ∈ orl ∧ some?(ps[orl.last, ps[orl.last].next:= vs[orl.last].next][vhead].deqID) ∧ markedp(orl0, ps[orl.last, ps[orl.last].next:= vs[orl.last].next]) ∧ ps[orl.last, ps[orl.last].next:= vs[orl.last].next][ps[vhead].next].deqID = None ∧ unmarkedp(orl, ps[orl.last, ps[orl.last].next:= vs[orl.last].next]) ∧ ps[orl.last, ps[orl.last].next:= vs[orl.last].next][vs[orl.last].next].deqID = None ∧ nonullRetRefs((orl0 + vhead ') + ps[vhead].next ' + orl + vs[orl.last].next ', vs, vretRefs, pretRefs) ∧ noid(tid, (orl0 + vhead ') + ps[vhead].next ' + orl + vs[orl.last].next ', vhead, vs) ∧ noowns(tid, owns(vs[orl.last].next; None))
Used terms: ps[vhead].next ', orl
| ⊦ y ≠ [] → (x + y).last = y.last |
| vs[vs[(ps[vhead].next ' + orl).last].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[(ps[vhead].next ' + orl).last].next].next = null, ps[(ps[vhead].next ' + orl).last].next = null, ps[vs[(ps[vhead].next ' + orl).last].next] = vs[vs[(ps[vhead].next ' + orl).last].next], dom vrvHp = dom prvHp, orl = [], owns(vs[(ps[vhead].next ' + orl).last].next) = Weak(tid), vs[(ps[vhead].next ' + orl).last].next ≠ vhead, vs[(ps[vhead].next ' + orl).last].next ≠ null, vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl, vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl, vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(ps[vhead].next ' + orl).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl, vs), unmarkedp(orl, ps), vs[(ps[vhead].next ' + orl).last].next ∈ vs, vs[(ps[vhead].next ' + orl).last].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[(ps[vhead].next ' + orl).last].next ∈ ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next], ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, ¬ dups(orl), ¬ dups(orl0), ¬ dups(orl0 + orl), ¬ vhead ∈ orl, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ listp ((orl0 + vhead ') + ps[vhead].next ' + orl + vs[(ps[vhead].next ' + orl).last].next ', vs, ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next], owns(vs[(ps[vhead].next ' + orl).last].next; None)) ∧ ¬ vs[(ps[vhead].next ' + orl).last].next ∈ orl0 ∧ vs[(ps[vhead].next ' + orl).last].next ≠ ps[vhead].next ∧ ¬ vs[(ps[vhead].next ' + orl).last].next ∈ orl ∧ some?(ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next][vhead].deqID) ∧ markedp(orl0, ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next]) ∧ ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next][ps[vhead].next].deqID = None ∧ unmarkedp(orl, ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next]) ∧ ps[(ps[vhead].next ' + orl).last, ps[(ps[vhead].next ' + orl).last].next:= vs[(ps[vhead].next ' + orl).last].next] [vs[(ps[vhead].next ' + orl).last].next ] .deqID = None ∧ nonullRetRefs((orl0 + vhead ') + ps[vhead].next ' + orl + vs[(ps[vhead].next ' + orl).last].next ', vs, vretRefs, pretRefs) ∧ noid(tid, (orl0 + vhead ') + ps[vhead].next ' + orl + vs[(ps[vhead].next ' + orl).last].next ', vhead, vs) ∧ noowns(tid, owns(vs[(ps[vhead].next ' + orl).last].next; None)) |
vs[vs[ps[vhead].next].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[ps[vhead].next].next].next = null, ps[ps[vhead].next].next = null, ps[vs[ps[vhead].next].next] = vs[vs[ps[vhead].next].next], dom vrvHp = dom prvHp, owns(vs[ps[vhead].next].next) = Weak(tid), vs[ps[vhead].next].next ≠ null, vs[ps[vhead].next].next ≠ vhead, vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[ps[vhead].next].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), vs[ps[vhead].next].next ∈ vs, vs[ps[vhead].next].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[ps[vhead].next].next ∈ ps[ps[vhead].next, ps[ps[vhead].next].next:= vs[ps[vhead].next].next], ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, ¬ dups(orl0), ¬ vhead ∈ orl0, ¬ ps[vhead].next ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ listp (orl0 + vhead ' + ps[vhead].next ' + vs[ps[vhead].next].next ', vs, ps[ps[vhead].next, ps[ps[vhead].next].next:= vs[ps[vhead].next].next], owns(vs[ps[vhead].next].next; None)) ∧ ¬ vs[ps[vhead].next].next ∈ orl0 ∧ vs[ps[vhead].next].next ≠ ps[vhead].next ∧ nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + vs[ps[vhead].next].next ', vs, vretRefs, pretRefs) ∧ noid(tid, orl0 + vhead ' + ps[vhead].next ' + vs[ps[vhead].next].next ', vhead, vs) ∧ noowns(tid, owns(vs[ps[vhead].next].next; None))
Used simplifier rules: ⊦ a '.last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ [] + x = x; (s) ⊦ a ≠ b → st[b, d][a] = st[a]; (s) ⊦ unmarkedp([], vs); (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ ¬ node ∈ rl → (markedp(rl, vs[node, nd]) ↔ markedp(rl, vs)); (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s)
| vs[vs[ps[vhead].next].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[ps[vhead].next].next].next = null, ps[ps[vhead].next].next = null, ps[vs[ps[vhead].next].next] = vs[vs[ps[vhead].next].next], dom vrvHp = dom prvHp, owns(vs[ps[vhead].next].next) = Weak(tid), vs[ps[vhead].next].next ≠ null, vs[ps[vhead].next].next ≠ vhead, vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[ps[vhead].next].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), vs[ps[vhead].next].next ∈ vs, vs[ps[vhead].next].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[ps[vhead].next].next ∈ ps[ps[vhead].next, ps[ps[vhead].next].next:= vs[ps[vhead].next].next], ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, ¬ dups(orl0), ¬ vhead ∈ orl0, ¬ ps[vhead].next ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ listp (orl0 + vhead ' + ps[vhead].next ' + vs[ps[vhead].next].next ', vs, ps[ps[vhead].next, ps[ps[vhead].next].next:= vs[ps[vhead].next].next], owns(vs[ps[vhead].next].next; None)) ∧ ¬ vs[ps[vhead].next].next ∈ orl0 ∧ vs[ps[vhead].next].next ≠ ps[vhead].next ∧ nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + vs[ps[vhead].next].next ', vs, vretRefs, pretRefs) ∧ noid(tid, orl0 + vhead ' + ps[vhead].next ' + vs[ps[vhead].next].next ', vhead, vs) ∧ noowns(tid, owns(vs[ps[vhead].next].next; None)) |
ps[ps[vhead].next].deqID = None, vs[vs[ps[vhead].next].next].deqID = None, ps[ps[vhead].next].next = null, vs[vs[ps[vhead].next].next].next = null, ps[vs[ps[vhead].next].next] = vs[vs[ps[vhead].next].next], dom vrvHp = dom prvHp, owns(vs[ps[vhead].next].next) = Weak(tid), vs[ps[vhead].next].next ≠ null, vs[ps[vhead].next].next ≠ vhead, vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[ps[vhead].next].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, vs[ps[vhead].next].next ∈ ps[ps[vhead].next, ps[ps[vhead].next].next:= vs[ps[vhead].next].next], phead ∈ ps, phead ∈ vs, vs[ps[vhead].next].next ∈ ps, vs[ps[vhead].next].next ∈ vs, ¬ dups(orl0), ¬ listp (orl0 + vhead ' + ps[vhead].next ' + vs[ps[vhead].next].next ', vs, ps[ps[vhead].next, ps[ps[vhead].next].next:= vs[ps[vhead].next].next], owns(vs[ps[vhead].next].next; None)), ¬ vhead ∈ orl0, ¬ ps[vhead].next ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦
ps[ps[vhead].next].deqID = None, vs[vs[ps[vhead].next].next].deqID = None, ps[ps[vhead].next].next = null, vs[vs[ps[vhead].next].next].next = null, ps[vs[ps[vhead].next].next] = vs[vs[ps[vhead].next].next], dom vrvHp = dom prvHp, owns(vs[ps[vhead].next].next) = Weak(tid), vs[ps[vhead].next].next ≠ null, vs[ps[vhead].next].next ≠ vhead, vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[ps[vhead].next].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), vs[ps[vhead].next].next ∈ orl0, ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, vs[ps[vhead].next].next ∈ ps[ps[vhead].next, ps[ps[vhead].next].next:= vs[ps[vhead].next].next], phead ∈ ps, phead ∈ vs, vs[ps[vhead].next].next ∈ ps, vs[ps[vhead].next].next ∈ vs, ¬ dups(orl0), ¬ vhead ∈ orl0, ¬ ps[vhead].next ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦
ps[ps[vhead].next].deqID = None, vs[vs[ps[vhead].next].next].deqID = None, ps[ps[vhead].next].next = null, vs[vs[ps[vhead].next].next].next = null, ps[vs[ps[vhead].next].next] = vs[vs[ps[vhead].next].next], dom vrvHp = dom prvHp, owns(vs[ps[vhead].next].next) = Weak(tid), vs[ps[vhead].next].next ≠ null, vs[ps[vhead].next].next ≠ vhead, vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[ps[vhead].next].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, vs[ps[vhead].next].next ∈ ps[ps[vhead].next, ps[ps[vhead].next].next:= vs[ps[vhead].next].next], phead ∈ ps, phead ∈ vs, vs[ps[vhead].next].next ∈ ps, vs[ps[vhead].next].next ∈ vs, ¬ dups(orl0), ¬ noowns(tid, owns(vs[ps[vhead].next].next; None)), ¬ vhead ∈ orl0, ¬ ps[vhead].next ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦
Used simplifier rules: ⊦ noid(tid, rl, r, vs) → ( noid(tid, rl0, r, vs0) ↔ (∀ r0. (r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) → r0 ≠ r ∧ r0 ∈ rl0 from r → vs0[r0].deqID ≠ Some(tid))); (ss) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s) ⊦ None ≠ Some(tid); (s) ⊦ nonullRetRefs(rl, vs, vretRefs, pretRefs) → ( nonullRetRefs(rl0, vs0, vretRefs0, pretRefs0) ↔ (∀ r. ( r ∈ rl ∧ r ≠ rl.head ∧ vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null) → r ∈ rl0 ∧ r ≠ rl0.head ∧ vs0[r].deqID ≠ None → vretRefs0(vs0[r].deqID.tid) ≠ null ∧ pretRefs0(vs0[r].deqID.tid) ≠ null)); (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (x + a ' + y).head = (x + a ').head; (s)
| ps[ps[vhead].next].deqID = None, vs[vs[ps[vhead].next].next].deqID = None, ps[ps[vhead].next].next = null, vs[vs[ps[vhead].next].next].next = null, ps[vs[ps[vhead].next].next] = vs[vs[ps[vhead].next].next], dom vrvHp = dom prvHp, owns(vs[ps[vhead].next].next) = Weak(tid), vs[ps[vhead].next].next ≠ null, vs[ps[vhead].next].next ≠ vhead, vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[ps[vhead].next].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, vs[ps[vhead].next].next ∈ ps[ps[vhead].next, ps[ps[vhead].next].next:= vs[ps[vhead].next].next], phead ∈ ps, phead ∈ vs, vs[ps[vhead].next].next ∈ ps, vs[ps[vhead].next].next ∈ vs, ¬ dups(orl0), ¬ listp (orl0 + vhead ' + ps[vhead].next ' + vs[ps[vhead].next].next ', vs, ps[ps[vhead].next, ps[ps[vhead].next].next:= vs[ps[vhead].next].next], owns(vs[ps[vhead].next].next; None)), ¬ vhead ∈ orl0, ¬ ps[vhead].next ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ |
⊦ listp(rl, vs, ps, owns) ∧ r ≠ null ∧ r ∈ vs ∧ r ∈ ps → (listp(rl + r ', vs, ps[rl.last, ps[rl.last].next:= r], owns(r; None)) ↔ vs[rl.last].next = r ∧ ps[r].next = null ∧ ps[r].deqID = None)
Used simplifier rules: ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, orl0 + vhead ' + ps[vhead].next ', owns, vs[ps[vhead].next].next, vs
| ⊦ listp(rl, vs, ps, owns) ∧ r ≠ null ∧ r ∈ vs ∧ r ∈ ps → (listp(rl + r ', vs, ps[rl.last, ps[rl.last].next:= r], owns(r; None)) ↔ vs[rl.last].next = r ∧ ps[r].next = null ∧ ps[r].deqID = None) |
| ps[ps[vhead].next].deqID = None, vs[vs[ps[vhead].next].next].deqID = None, ps[ps[vhead].next].next = null, vs[vs[ps[vhead].next].next].next = null, ps[vs[ps[vhead].next].next] = vs[vs[ps[vhead].next].next], dom vrvHp = dom prvHp, owns(vs[ps[vhead].next].next) = Weak(tid), vs[ps[vhead].next].next ≠ null, vs[ps[vhead].next].next ≠ vhead, vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[ps[vhead].next].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), vs[ps[vhead].next].next ∈ orl0, ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, vs[ps[vhead].next].next ∈ ps[ps[vhead].next, ps[ps[vhead].next].next:= vs[ps[vhead].next].next], phead ∈ ps, phead ∈ vs, vs[ps[vhead].next].next ∈ ps, vs[ps[vhead].next].next ∈ vs, ¬ dups(orl0), ¬ vhead ∈ orl0, ¬ ps[vhead].next ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ |
vs[vs[ps[vhead].next].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[ps[vhead].next].next].next = null, ps[ps[vhead].next].next = null, ps[vs[ps[vhead].next].next] = vs[vs[ps[vhead].next].next], dom vrvHp = dom prvHp, owns(vs[ps[vhead].next].next) = Weak(tid), vs[ps[vhead].next].next ≠ null, vs[ps[vhead].next].next ≠ vhead, vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[ps[vhead].next].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), phead ∈ vs, phead ∈ ps, vs[ps[vhead].next].next ∈ ps[ps[vhead].next, ps[ps[vhead].next].next:= vs[ps[vhead].next].next], ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, vs[ps[vhead].next].next ∈ orl0, vs[ps[vhead].next].next ∈ vs, vs[ps[vhead].next].next ∈ ps, ¬ dups(orl0), ¬ vhead ∈ orl0, ¬ ps[vhead].next ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦
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
| vs[vs[ps[vhead].next].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[ps[vhead].next].next].next = null, ps[ps[vhead].next].next = null, ps[vs[ps[vhead].next].next] = vs[vs[ps[vhead].next].next], dom vrvHp = dom prvHp, owns(vs[ps[vhead].next].next) = Weak(tid), vs[ps[vhead].next].next ≠ null, vs[ps[vhead].next].next ≠ vhead, vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[ps[vhead].next].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), phead ∈ vs, phead ∈ ps, vs[ps[vhead].next].next ∈ ps[ps[vhead].next, ps[ps[vhead].next].next:= vs[ps[vhead].next].next], ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, vs[ps[vhead].next].next ∈ orl0, vs[ps[vhead].next].next ∈ vs, vs[ps[vhead].next].next ∈ ps, ¬ dups(orl0), ¬ vhead ∈ orl0, ¬ ps[vhead].next ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ |
⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z))
Used simplifier rules: ⊦ a + x = a ' + x; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ some?(opttid) → opttid ≠ None; (as) Used terms: vs[ps[vhead].next].next, orl0
| ⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z)) |
| ps[ps[vhead].next].deqID = None, vs[vs[ps[vhead].next].next].deqID = None, ps[ps[vhead].next].next = null, vs[vs[ps[vhead].next].next].next = null, ps[vs[ps[vhead].next].next] = vs[vs[ps[vhead].next].next], dom vrvHp = dom prvHp, owns(vs[ps[vhead].next].next) = Weak(tid), vs[ps[vhead].next].next ≠ null, vs[ps[vhead].next].next ≠ vhead, vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[ps[vhead].next].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, vs[ps[vhead].next].next ∈ ps[ps[vhead].next, ps[ps[vhead].next].next:= vs[ps[vhead].next].next], phead ∈ ps, phead ∈ vs, vs[ps[vhead].next].next ∈ ps, vs[ps[vhead].next].next ∈ vs, ¬ dups(orl0), ¬ noowns(tid, owns(vs[ps[vhead].next].next; None)), ¬ vhead ∈ orl0, ¬ ps[vhead].next ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ |
⊦ oneweakowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Weak(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)
vs[vs[ps[vhead].next].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[ps[vhead].next].next].next = null, ps[ps[vhead].next].next = null, ps[vs[ps[vhead].next].next] = vs[vs[ps[vhead].next].next], dom vrvHp = dom prvHp, owns(vs[ps[vhead].next].next) = Weak(tid), vs[ps[vhead].next].next ≠ null, vs[ps[vhead].next].next ≠ vhead, vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), phead ∈ vs, phead ∈ ps, vs[ps[vhead].next].next ∈ ps[ps[vhead].next, ps[ps[vhead].next].next:= vs[ps[vhead].next].next], ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, vs[ps[vhead].next].next ∈ vs, vs[ps[vhead].next].next ∈ ps, ¬ dups(orl0), ¬ noowns(tid, owns(vs[ps[vhead].next].next; None)), ¬ vhead ∈ orl0, ¬ ps[vhead].next ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ vs[ps[vhead].next].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, phead ∈ orl0 ∨ phead = vhead ⊦
Used terms: ps, tid, owns, vs[ps[vhead].next].next, vs
| ⊦ oneweakowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Weak(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid) |
| vs[vs[ps[vhead].next].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[ps[vhead].next].next].next = null, ps[ps[vhead].next].next = null, ps[vs[ps[vhead].next].next] = vs[vs[ps[vhead].next].next], dom vrvHp = dom prvHp, owns(vs[ps[vhead].next].next) = Weak(tid), vs[ps[vhead].next].next ≠ null, vs[ps[vhead].next].next ≠ vhead, vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), phead ∈ vs, phead ∈ ps, vs[ps[vhead].next].next ∈ ps[ps[vhead].next, ps[ps[vhead].next].next:= vs[ps[vhead].next].next], ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, vs[ps[vhead].next].next ∈ vs, vs[ps[vhead].next].next ∈ ps, ¬ dups(orl0), ¬ noowns(tid, owns(vs[ps[vhead].next].next; None)), ¬ vhead ∈ orl0, ¬ ps[vhead].next ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ vs[ps[vhead].next].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, phead ∈ orl0 ∨ phead = vhead ⊦ |
⊦ noowns(tid, owns) ↔ (∀ r. owns(r) ≠ None → owns(r).tid ≠ tid)
ps[ps[vhead].next].deqID = None, vs[vs[ps[vhead].next].next].deqID = None, ps[ps[vhead].next].next = null, vs[vs[ps[vhead].next].next].next = null, ps[vs[ps[vhead].next].next] = vs[vs[ps[vhead].next].next], dom vrvHp = dom prvHp, owns(vs[ps[vhead].next].next) = Weak(tid), vs[ps[vhead].next].next ≠ null, vs[ps[vhead].next].next ≠ vhead, vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), vs[ps[vhead].next].next ∈ ps, vs[ps[vhead].next].next ∈ vs, ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, vs[ps[vhead].next].next ∈ ps[ps[vhead].next, ps[ps[vhead].next].next:= vs[ps[vhead].next].next], phead ∈ ps, phead ∈ vs, ¬ dups(orl0), ¬ vhead ∈ orl0, ¬ ps[vhead].next ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ vs[ps[vhead].next].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, ∃ r. ¬(owns(vs[ps[vhead].next].next; None)(r) ≠ None → owns(vs[ps[vhead].next].next; None)(r).tid ≠ tid), phead ∈ orl0 ∨ phead = vhead ⊦
Used terms: tid, owns(vs[ps[vhead].next].next; None)
| ⊦ noowns(tid, owns) ↔ (∀ r. owns(r) ≠ None → owns(r).tid ≠ tid) |
| ps[ps[vhead].next].deqID = None, vs[vs[ps[vhead].next].next].deqID = None, ps[ps[vhead].next].next = null, vs[vs[ps[vhead].next].next].next = null, ps[vs[ps[vhead].next].next] = vs[vs[ps[vhead].next].next], dom vrvHp = dom prvHp, owns(vs[ps[vhead].next].next) = Weak(tid), vs[ps[vhead].next].next ≠ null, vs[ps[vhead].next].next ≠ vhead, vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), vs[ps[vhead].next].next ∈ ps, vs[ps[vhead].next].next ∈ vs, ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, vs[ps[vhead].next].next ∈ ps[ps[vhead].next, ps[ps[vhead].next].next:= vs[ps[vhead].next].next], phead ∈ ps, phead ∈ vs, ¬ dups(orl0), ¬ vhead ∈ orl0, ¬ ps[vhead].next ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ vs[ps[vhead].next].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, ∃ r. ¬(owns(vs[ps[vhead].next].next; None)(r) ≠ None → owns(vs[ps[vhead].next].next; None)(r).tid ≠ tid), phead ∈ orl0 ∨ phead = vhead ⊦ |
vs[vs[ps[vhead].next].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[ps[vhead].next].next].next = null, ps[ps[vhead].next].next = null, ps[vs[ps[vhead].next].next] = vs[vs[ps[vhead].next].next], dom vrvHp = dom prvHp, owns(vs[ps[vhead].next].next) = Weak(owns(r).tid), vs[ps[vhead].next].next ≠ null, vs[ps[vhead].next].next ≠ vhead, vs[ps[vhead].next].next ≠ r, None ≠ owns(r), vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(owns(r).tid, vhead, vs), noid(owns(r).tid, orl0 + vhead ' + ps[vhead].next ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), phead ∈ vs, phead ∈ ps, vs[ps[vhead].next].next ∈ ps[ps[vhead].next, ps[ps[vhead].next].next:= vs[ps[vhead].next].next], ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, vs[ps[vhead].next].next ∈ vs, vs[ps[vhead].next].next ∈ ps, ¬ dups(orl0), ¬ vhead ∈ orl0, ¬ ps[vhead].next ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ vs[ps[vhead].next].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ owns(r).tid, phead ∈ orl0 ∨ phead = vhead ⊦
| vs[vs[ps[vhead].next].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[ps[vhead].next].next].next = null, ps[ps[vhead].next].next = null, ps[vs[ps[vhead].next].next] = vs[vs[ps[vhead].next].next], dom vrvHp = dom prvHp, owns(vs[ps[vhead].next].next) = Weak(owns(r).tid), vs[ps[vhead].next].next ≠ null, vs[ps[vhead].next].next ≠ vhead, vs[ps[vhead].next].next ≠ r, None ≠ owns(r), vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(owns(r).tid, vhead, vs), noid(owns(r).tid, orl0 + vhead ' + ps[vhead].next ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), phead ∈ vs, phead ∈ ps, vs[ps[vhead].next].next ∈ ps[ps[vhead].next, ps[ps[vhead].next].next:= vs[ps[vhead].next].next], ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, vs[ps[vhead].next].next ∈ vs, vs[ps[vhead].next].next ∈ ps, ¬ dups(orl0), ¬ vhead ∈ orl0, ¬ ps[vhead].next ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ vs[ps[vhead].next].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ owns(r).tid, phead ∈ orl0 ∨ phead = vhead ⊦ |
Used terms: r
| vs[vs[orl.last].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[orl.last].next].next = null, ps[orl.last].next = null, ps[vs[orl.last].next] = vs[vs[orl.last].next], dom vrvHp = dom prvHp, owns(vs[orl.last].next) = Weak(tid), vs[orl.last].next ≠ vhead, vs[orl.last].next ≠ null, orl ≠ [], vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl, vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl, vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[orl.last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl, vs), unmarkedp(orl, ps), vs[orl.last].next ∈ vs, vs[orl.last].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[orl.last].next ∈ ps[orl.last, ps[orl.last].next:= vs[orl.last].next], ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, ¬ dups(orl), ¬ dups(orl0), ¬ dups(orl0 + orl), ¬ vhead ∈ orl, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ listp ((orl0 + vhead ') + ps[vhead].next ' + orl + vs[orl.last].next ', vs, ps[orl.last, ps[orl.last].next:= vs[orl.last].next], owns(vs[orl.last].next; None)) ∧ ¬ vs[orl.last].next ∈ orl0 ∧ vs[orl.last].next ≠ ps[vhead].next ∧ ¬ vs[orl.last].next ∈ orl ∧ some?(ps[orl.last, ps[orl.last].next:= vs[orl.last].next][vhead].deqID) ∧ markedp(orl0, ps[orl.last, ps[orl.last].next:= vs[orl.last].next]) ∧ ps[orl.last, ps[orl.last].next:= vs[orl.last].next][ps[vhead].next].deqID = None ∧ unmarkedp(orl, ps[orl.last, ps[orl.last].next:= vs[orl.last].next]) ∧ ps[orl.last, ps[orl.last].next:= vs[orl.last].next][vs[orl.last].next].deqID = None ∧ nonullRetRefs((orl0 + vhead ') + ps[vhead].next ' + orl + vs[orl.last].next ', vs, vretRefs, pretRefs) ∧ noid(tid, (orl0 + vhead ') + ps[vhead].next ' + orl + vs[orl.last].next ', vhead, vs) ∧ noowns(tid, owns(vs[orl.last].next; None)) |
ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl = orl1 + phead0 ', owns(vs[phead0].next) = Weak(tid), vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, orl ≠ [], vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl, vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(orl, ps), unmarkedp(orl, vs), ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, vs[phead0].next ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl), ¬ dups(orl0), ¬ dups(orl0 + orl), ¬ vhead ∈ orl, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ listp ((orl0 + vhead ') + ps[vhead].next ' + orl + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)) ∧ ¬ vs[phead0].next ∈ orl0 ∧ vs[phead0].next ≠ ps[vhead].next ∧ ¬ vs[phead0].next ∈ orl ∧ some?(ps[phead0, ps[phead0].next:= vs[phead0].next][vhead].deqID) ∧ markedp(orl0, ps[phead0, ps[phead0].next:= vs[phead0].next]) ∧ ps[phead0, ps[phead0].next:= vs[phead0].next][ps[vhead].next].deqID = None ∧ unmarkedp(orl, ps[phead0, ps[phead0].next:= vs[phead0].next]) ∧ ps[phead0, ps[phead0].next:= vs[phead0].next][vs[phead0].next].deqID = None ∧ nonullRetRefs((orl0 + vhead ') + ps[vhead].next ' + orl + vs[phead0].next ', vs, vretRefs, pretRefs) ∧ noid(tid, (orl0 + vhead ') + ps[vhead].next ' + orl + vs[phead0].next ', vhead, vs) ∧ noowns(tid, owns(vs[phead0].next; None))
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, phead0, y
| ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl = orl1 + phead0 ', owns(vs[phead0].next) = Weak(tid), vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, orl ≠ [], vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl, vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(orl, ps), unmarkedp(orl, vs), ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, vs[phead0].next ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl), ¬ dups(orl0), ¬ dups(orl0 + orl), ¬ vhead ∈ orl, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ listp ((orl0 + vhead ') + ps[vhead].next ' + orl + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)) ∧ ¬ vs[phead0].next ∈ orl0 ∧ vs[phead0].next ≠ ps[vhead].next ∧ ¬ vs[phead0].next ∈ orl ∧ some?(ps[phead0, ps[phead0].next:= vs[phead0].next][vhead].deqID) ∧ markedp(orl0, ps[phead0, ps[phead0].next:= vs[phead0].next]) ∧ ps[phead0, ps[phead0].next:= vs[phead0].next][ps[vhead].next].deqID = None ∧ unmarkedp(orl, ps[phead0, ps[phead0].next:= vs[phead0].next]) ∧ ps[phead0, ps[phead0].next:= vs[phead0].next][vs[phead0].next].deqID = None ∧ nonullRetRefs((orl0 + vhead ') + ps[vhead].next ' + orl + vs[phead0].next ', vs, vretRefs, pretRefs) ∧ noid(tid, (orl0 + vhead ') + ps[vhead].next ' + orl + vs[phead0].next ', vhead, vs) ∧ noowns(tid, owns(vs[phead0].next; None)) |
ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, vs), ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, vs[phead0].next ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead].next ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ listp ((orl0 + vhead ') + ps[vhead].next ' + (orl1 + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)) ∧ ¬ vs[phead0].next ∈ orl0 ∧ vs[phead0].next ≠ ps[vhead].next ∧ ¬ vs[phead0].next ∈ orl1 ∧ vs[phead0].next ≠ phead0 ∧ nonullRetRefs((orl0 + vhead ') + ps[vhead].next ' + (orl1 + phead0 ') + vs[phead0].next ', vs, vretRefs, pretRefs) ∧ noid(tid, (orl0 + vhead ') + ps[vhead].next ' + (orl1 + phead0 ') + vs[phead0].next ', vhead, vs) ∧ noowns(tid, owns(vs[phead0].next; None))
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ≠ b → st[b, d][a] = st[a]; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ ¬ node ∈ rl → (unmarkedp(rl, vs[node, nd]) ↔ unmarkedp(rl, vs)); (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ ¬ node ∈ rl → (markedp(rl, vs[node, nd]) ↔ markedp(rl, vs)); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, vs), ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, vs[phead0].next ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead].next ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ listp ((orl0 + vhead ') + ps[vhead].next ' + (orl1 + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)) ∧ ¬ vs[phead0].next ∈ orl0 ∧ vs[phead0].next ≠ ps[vhead].next ∧ ¬ vs[phead0].next ∈ orl1 ∧ vs[phead0].next ≠ phead0 ∧ nonullRetRefs((orl0 + vhead ') + ps[vhead].next ' + (orl1 + phead0 ') + vs[phead0].next ', vs, vretRefs, pretRefs) ∧ noid(tid, (orl0 + vhead ') + ps[vhead].next ' + (orl1 + phead0 ') + vs[phead0].next ', vhead, vs) ∧ noowns(tid, owns(vs[phead0].next; None)) |
vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ listp ((orl0 + vhead ') + ps[vhead].next ' + (orl1 + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), ¬ ps[vhead].next ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦
vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), vs[phead0].next ∈ orl0, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead].next ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦
vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[phead0].next = ps[vhead].next, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead].next ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦
vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), vs[phead0].next ∈ orl1, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead].next ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦
vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ noowns(tid, owns(vs[phead0].next; None)), ¬ ps[vhead].next ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦
Used simplifier rules: ⊦ noid(tid, rl, r, vs) → ( noid(tid, rl0, r, vs0) ↔ (∀ r0. (r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) → r0 ≠ r ∧ r0 ∈ rl0 from r → vs0[r0].deqID ≠ Some(tid))); (ss) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s) ⊦ None ≠ Some(tid); (s) ⊦ nonullRetRefs(rl, vs, vretRefs, pretRefs) → ( nonullRetRefs(rl0, vs0, vretRefs0, pretRefs0) ↔ (∀ r. ( r ∈ rl ∧ r ≠ rl.head ∧ vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null) → r ∈ rl0 ∧ r ≠ rl0.head ∧ vs0[r].deqID ≠ None → vretRefs0(vs0[r].deqID.tid) ≠ null ∧ pretRefs0(vs0[r].deqID.tid) ≠ null)); (ss) ⊦ (x + a ' + y).head = (x + a ').head; (s)
| vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ listp ((orl0 + vhead ') + ps[vhead].next ' + (orl1 + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), ¬ ps[vhead].next ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ |
⊦ listp(rl, vs, ps, owns) ∧ r ≠ null ∧ r ∈ vs ∧ r ∈ ps → (listp(rl + r ', vs, ps[rl.last, ps[rl.last].next:= r], owns(r; None)) ↔ vs[rl.last].next = r ∧ ps[r].next = null ∧ ps[r].deqID = None)
Used simplifier rules: ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', owns, vs[phead0].next, vs
| ⊦ listp(rl, vs, ps, owns) ∧ r ≠ null ∧ r ∈ vs ∧ r ∈ ps → (listp(rl + r ', vs, ps[rl.last, ps[rl.last].next:= r], owns(r; None)) ↔ vs[rl.last].next = r ∧ ps[r].next = null ∧ ps[r].deqID = None) |
| vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), vs[phead0].next ∈ orl0, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead].next ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ |
ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, vs), ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, vs[phead0].next ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ orl0, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead].next ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦
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
| ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, vs), ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, vs[phead0].next ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ orl0, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead].next ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ |
⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z))
Used simplifier rules: ⊦ a + x = a ' + x; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ some?(opttid) → opttid ≠ None; (as) Used terms: vs[phead0].next, orl0
| ⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z)) |
| vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[phead0].next = ps[vhead].next, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead].next ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ |
vs[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[phead0].next = ps[vhead].next, vs[ps[vhead].next].next = null, ps[phead0].next = null, ps[ps[vhead].next] = vs[ps[vhead].next], dom vrvHp = dom prvHp, owns(ps[vhead].next) = Weak(tid), ps[vhead].next ≠ vhead, ps[vhead].next ≠ null, ps[vhead].next ≠ phead0, vhead ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, ps[vhead].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), ps[vhead].next ∈ vs, phead ∈ vs, phead ∈ ps, ps[vhead].next ∈ ps, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ vhead ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦
Used simplifier rules: ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s)
| vs[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[phead0].next = ps[vhead].next, vs[ps[vhead].next].next = null, ps[phead0].next = null, ps[ps[vhead].next] = vs[ps[vhead].next], dom vrvHp = dom prvHp, owns(ps[vhead].next) = Weak(tid), ps[vhead].next ≠ vhead, ps[vhead].next ≠ null, ps[vhead].next ≠ phead0, vhead ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, ps[vhead].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), ps[vhead].next ∈ vs, phead ∈ vs, phead ∈ ps, ps[vhead].next ∈ ps, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ vhead ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ |
⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])
ps[phead0].deqID = None, vs[phead0].deqID = None, vs[ps[vhead].next].deqID = None, ps[phead0].next = null, vs[ps[vhead].next].next = null, vs[phead0].next = ps[vhead].next, ps[ps[vhead].next] = vs[ps[vhead].next], dom vrvHp = dom prvHp, owns(ps[vhead].next) = Weak(tid), ps[vhead].next ≠ vhead, ps[vhead].next ≠ null, ps[vhead].next ≠ phead0, vhead ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, ps[vhead].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, vs), ps[vhead].next ∈ ps, phead ∈ ps, phead ∈ vs, ps[vhead].next ∈ vs, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ vhead ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp((orl0 + vhead ') + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns) → (listp(ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns) ↔ ps[vhead].next ' + orl1 + phead0 ' ≠ []), phead ∈ orl0 ∨ phead = vhead ⊦
Used terms: ps, orl0 + vhead ', owns, ps[vhead].next ' + orl1 + phead0 ', vs
| ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []) |
| ps[phead0].deqID = None, vs[phead0].deqID = None, vs[ps[vhead].next].deqID = None, ps[phead0].next = null, vs[ps[vhead].next].next = null, vs[phead0].next = ps[vhead].next, ps[ps[vhead].next] = vs[ps[vhead].next], dom vrvHp = dom prvHp, owns(ps[vhead].next) = Weak(tid), ps[vhead].next ≠ vhead, ps[vhead].next ≠ null, ps[vhead].next ≠ phead0, vhead ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, ps[vhead].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, vs), ps[vhead].next ∈ ps, phead ∈ ps, phead ∈ vs, ps[vhead].next ∈ vs, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ vhead ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp((orl0 + vhead ') + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns) → (listp(ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns) ↔ ps[vhead].next ' + orl1 + phead0 ' ≠ []), phead ∈ orl0 ∨ phead = vhead ⊦ |
vs[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[phead0].next = ps[vhead].next, vs[ps[vhead].next].next = null, ps[phead0].next = null, ps[ps[vhead].next] = vs[ps[vhead].next], dom vrvHp = dom prvHp, owns(ps[vhead].next) = Weak(tid), ps[vhead].next ≠ vhead, ps[vhead].next ≠ null, ps[vhead].next ≠ phead0, vhead ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), listp(ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, ps[vhead].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), ps[vhead].next ∈ vs, phead ∈ vs, phead ∈ ps, ps[vhead].next ∈ ps, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ vhead ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ' + x ≠ []; (s)
| vs[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[phead0].next = ps[vhead].next, vs[ps[vhead].next].next = null, ps[phead0].next = null, ps[ps[vhead].next] = vs[ps[vhead].next], dom vrvHp = dom prvHp, owns(ps[vhead].next) = Weak(tid), ps[vhead].next ≠ vhead, ps[vhead].next ≠ null, ps[vhead].next ≠ phead0, vhead ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), listp(ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, ps[vhead].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), ps[vhead].next ∈ vs, phead ∈ vs, phead ∈ ps, ps[vhead].next ∈ ps, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ vhead ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ |
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 + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) 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] ⊦ None ≠ Weak(tid); (s) ⊦ unmarkedp([], vs); (s) ⊦ [] + x = x; (s) ⊦ listp(r ' + r0 ', 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 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (s) ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s)
| vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), vs[phead0].next ∈ orl1, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead].next ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ |
⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z))
ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, vs), ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, vs[phead0].next ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead].next ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ y, z. orl1 = y + (vs[phead0].next + z), phead ∈ orl0 ∨ phead = vhead ⊦
Used terms: vs[phead0].next, orl1
| ⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z)) |
| ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, vs), ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, vs[phead0].next ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead].next ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ y, z. orl1 = y + (vs[phead0].next + z), phead ∈ orl0 ∨ phead = vhead ⊦ |
ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ vs[phead0].next, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, ps[vhead].next ≠ phead0, phead0 ≠ vs[phead0].next, vhead ≠ ps[vhead].next, vhead ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl + (vs[phead0].next ' + orl2) + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl + (vs[phead0].next ' + orl2) + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl + (vs[phead0].next ' + orl2) + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(orl2, ps), unmarkedp(orl, ps), unmarkedp(orl2, vs), unmarkedp(orl, vs), phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, ¬ dups(orl2), ¬ dups(orl0 + orl), ¬ dups(orl + orl2), ¬ dups((orl0 + orl) + orl2), ¬ dups(orl0), ¬ dups(orl), ¬ phead0 ∈ orl2, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl2, ¬ vhead ∈ orl, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl2, ¬ ps[vhead].next ∈ orl, ¬ vs[phead0].next ∈ orl0, ¬ vs[phead0].next ∈ orl2, ¬ vs[phead0].next ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦
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 ∈ st[b, d] ↔ a ∈ st); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a + x = a ' + x; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s)
| ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ vs[phead0].next, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, ps[vhead].next ≠ phead0, phead0 ≠ vs[phead0].next, vhead ≠ ps[vhead].next, vhead ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl + (vs[phead0].next ' + orl2) + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl + (vs[phead0].next ' + orl2) + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl + (vs[phead0].next ' + orl2) + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(orl2, ps), unmarkedp(orl, ps), unmarkedp(orl2, vs), unmarkedp(orl, vs), phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, ¬ dups(orl2), ¬ dups(orl0 + orl), ¬ dups(orl + orl2), ¬ dups((orl0 + orl) + orl2), ¬ dups(orl0), ¬ dups(orl), ¬ phead0 ∈ orl2, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl2, ¬ vhead ∈ orl, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl2, ¬ ps[vhead].next ∈ orl, ¬ vs[phead0].next ∈ orl0, ¬ vs[phead0].next ∈ orl2, ¬ vs[phead0].next ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ |
vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl2 = [], owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ vs[phead0].next, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, ps[vhead].next ≠ phead0, phead0 ≠ vs[phead0].next, vhead ≠ ps[vhead].next, vhead ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl + (vs[phead0].next ' + orl2) + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl + (vs[phead0].next ' + orl2) + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl + (vs[phead0].next ' + orl2) + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl, vs), unmarkedp(orl2, vs), unmarkedp(orl, ps), unmarkedp(orl2, ps), ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(orl2), ¬ dups(orl0 + orl), ¬ dups(orl + orl2), ¬ dups((orl0 + orl) + orl2), ¬ dups(orl0), ¬ dups(orl), ¬ phead0 ∈ orl2, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl2, ¬ vhead ∈ orl, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl2, ¬ ps[vhead].next ∈ orl, ¬ vs[phead0].next ∈ orl0, ¬ vs[phead0].next ∈ orl2, ¬ vs[phead0].next ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦
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) ⊦ 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 + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) 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 ⊦ ¬ listp(rl + null ' + rl0, vs, ps, owns); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]
| vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl2 = [], owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ vs[phead0].next, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, ps[vhead].next ≠ phead0, phead0 ≠ vs[phead0].next, vhead ≠ ps[vhead].next, vhead ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl + (vs[phead0].next ' + orl2) + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl + (vs[phead0].next ' + orl2) + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl + (vs[phead0].next ' + orl2) + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl, vs), unmarkedp(orl2, vs), unmarkedp(orl, ps), unmarkedp(orl2, ps), ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(orl2), ¬ dups(orl0 + orl), ¬ dups(orl + orl2), ¬ dups((orl0 + orl) + orl2), ¬ dups(orl0), ¬ dups(orl), ¬ phead0 ∈ orl2, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl2, ¬ vhead ∈ orl, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl2, ¬ ps[vhead].next ∈ orl, ¬ vs[phead0].next ∈ orl0, ¬ vs[phead0].next ∈ orl2, ¬ vs[phead0].next ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ |
ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ vs[phead0].next, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, ps[vhead].next ≠ phead0, phead0 ≠ vs[phead0].next, vhead ≠ ps[vhead].next, vhead ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(orl, ps), unmarkedp(orl, vs), phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl0 + orl), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl, ¬ vs[phead0].next ∈ orl0, ¬ vs[phead0].next ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦
Used simplifier rules: ⊦ ¬ a ∈ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s) ⊦ [] + x = x; (s) ⊦ unmarkedp([], vs); (s)
| ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ vs[phead0].next, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, ps[vhead].next ≠ phead0, phead0 ≠ vs[phead0].next, vhead ≠ ps[vhead].next, vhead ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(orl, ps), unmarkedp(orl, vs), phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl0 + orl), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl, ¬ vs[phead0].next ∈ orl0, ¬ vs[phead0].next ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ |
vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl = [], owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ vs[phead0].next, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, ps[vhead].next ≠ phead0, phead0 ≠ vs[phead0].next, vhead ≠ ps[vhead].next, vhead ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl, vs), unmarkedp(orl, ps), ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl0 + orl), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl, ¬ vs[phead0].next ∈ orl0, ¬ vs[phead0].next ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦
vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ vs[phead0].next, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, ps[vhead].next ≠ phead0, orl ≠ [], phead0 ≠ vs[phead0].next, vhead ≠ ps[vhead].next, vhead ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl, vs), unmarkedp(orl, ps), ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl0 + orl), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl, ¬ vs[phead0].next ∈ orl0, ¬ vs[phead0].next ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦
Used formulas: orl = []
| vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl = [], owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ vs[phead0].next, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, ps[vhead].next ≠ phead0, phead0 ≠ vs[phead0].next, vhead ≠ ps[vhead].next, vhead ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl, vs), unmarkedp(orl, ps), ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl0 + orl), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl, ¬ vs[phead0].next ∈ orl0, ¬ vs[phead0].next ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ |
ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[ps[vhead].next].next = vs[phead0].next, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ vs[phead0].next, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, ps[vhead].next ≠ phead0, phead0 ≠ vs[phead0].next, vhead ≠ ps[vhead].next, vhead ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ' + vs[phead0].next ' + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + vs[phead0].next ' + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + vs[phead0].next ' + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ ps[vhead].next ∈ orl0, ¬ vs[phead0].next ∈ orl0, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦
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 ∈ []; (s) ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s) ⊦ [] + x = x; (s) ⊦ unmarkedp([], vs); (s)
| ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[ps[vhead].next].next = vs[phead0].next, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ vs[phead0].next, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, ps[vhead].next ≠ phead0, phead0 ≠ vs[phead0].next, vhead ≠ ps[vhead].next, vhead ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ' + vs[phead0].next ' + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + vs[phead0].next ' + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + vs[phead0].next ' + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ ps[vhead].next ∈ orl0, ¬ vs[phead0].next ∈ orl0, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ |
⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])
Used simplifier rules: ⊦ a ' + 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) ⊦ listp(r ' + r0 ', 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 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (s) ⊦ weak?(opttid) → opttid ≠ None; (as) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, orl0, owns, vhead ' + ps[vhead].next ' + vs[phead0].next ' + phead0 ', vs
| ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []) |
| vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ vs[phead0].next, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, ps[vhead].next ≠ phead0, orl ≠ [], phead0 ≠ vs[phead0].next, vhead ≠ ps[vhead].next, vhead ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl, vs), unmarkedp(orl, ps), ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl0 + orl), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl, ¬ vs[phead0].next ∈ orl0, ¬ vs[phead0].next ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ |
⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns))
ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ vs[phead0].next, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, ps[vhead].next ≠ phead0, orl ≠ [], phead0 ≠ vs[phead0].next, vhead ≠ ps[vhead].next, vhead ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(orl, ps), unmarkedp(orl, vs), phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl0 + orl), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl, ¬ vs[phead0].next ∈ orl0, ¬ vs[phead0].next ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp(orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', vs, ps, owns) ∧ orl.last ∈ orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ' → (∃ rl1, rl2. orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ' = rl1 + orl.last ' + rl2 ∧ listp(orl.last ' + rl2, vs, ps, owns)), phead ∈ orl0 ∨ phead = vhead ⊦
Used terms: ps, orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', owns, orl.last, vs
| ⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns)) |
| ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ vs[phead0].next, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, ps[vhead].next ≠ phead0, orl ≠ [], phead0 ≠ vs[phead0].next, vhead ≠ ps[vhead].next, vhead ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(orl, ps), unmarkedp(orl, vs), phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl0 + orl), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl, ¬ vs[phead0].next ∈ orl0, ¬ vs[phead0].next ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp(orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ', vs, ps, owns) ∧ orl.last ∈ orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ' → (∃ rl1, rl2. orl0 + vhead ' + ps[vhead].next ' + orl + vs[phead0].next ' + phead0 ' = rl1 + orl.last ' + rl2 ∧ listp(orl.last ' + rl2, vs, ps, owns)), phead ∈ orl0 ∨ phead = vhead ⊦ |
orl0 + vhead ' + ps[vhead].next ' + orl = rl1 + orl.last ' + rl, vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ vs[phead0].next, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, ps[vhead].next ≠ phead0, vs[phead0].next ≠ orl.last, orl ≠ [], phead0 ≠ orl.last, phead0 ≠ vs[phead0].next, vhead ≠ ps[vhead].next, vhead ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + orl.last ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), listp(orl.last ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + orl.last ' + (rl + vs[phead0].next ') + phead0 ', vhead, vs), nonullRetRefs(rl1 + orl.last ' + (rl + vs[phead0].next ') + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl, vs), unmarkedp(orl, ps), phead0 ∈ ps, phead0 ∈ vs, ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl0 + orl), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl, ¬ vs[phead0].next ∈ orl0, ¬ vs[phead0].next ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) inex: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → (∃ z0. z = z0 + a '); (forward) from specification list[reflist] in-16: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → a ∈ z; (forward) from specification list[reflist] ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ x.last ∈ x ↔ x ≠ []; (s)
| orl0 + vhead ' + ps[vhead].next ' + orl = rl1 + orl.last ' + rl, vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ vs[phead0].next, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, ps[vhead].next ≠ phead0, vs[phead0].next ≠ orl.last, orl ≠ [], phead0 ≠ orl.last, phead0 ≠ vs[phead0].next, vhead ≠ ps[vhead].next, vhead ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + orl.last ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), listp(orl.last ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + orl.last ' + (rl + vs[phead0].next ') + phead0 ', vhead, vs), nonullRetRefs(rl1 + orl.last ' + (rl + vs[phead0].next ') + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl, vs), unmarkedp(orl, ps), phead0 ∈ ps, phead0 ∈ vs, ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl0 + orl), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl, ¬ vs[phead0].next ∈ orl0, ¬ vs[phead0].next ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ |
orl0 + vhead ' + ps[vhead].next ' + orl = rl1 + phead1 ' + rl, ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl = rl0 + phead1 ', owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ vs[phead0].next, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, ps[vhead].next ≠ phead0, vs[phead0].next ≠ phead1, orl ≠ [], phead0 ≠ phead1, phead0 ≠ vs[phead0].next, vhead ≠ ps[vhead].next, vhead ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), listp(rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(orl, ps), unmarkedp(orl, vs), phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl0 + orl), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl, ¬ vs[phead0].next ∈ orl0, ¬ vs[phead0].next ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, phead1, y
| orl0 + vhead ' + ps[vhead].next ' + orl = rl1 + phead1 ' + rl, ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl = rl0 + phead1 ', owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ vs[phead0].next, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, ps[vhead].next ≠ phead0, vs[phead0].next ≠ phead1, orl ≠ [], phead0 ≠ phead1, phead0 ≠ vs[phead0].next, vhead ≠ ps[vhead].next, vhead ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), listp(rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(orl, ps), unmarkedp(orl, vs), phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl0 + orl), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ orl, ¬ vs[phead0].next ∈ orl0, ¬ vs[phead0].next ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ |
orl0 + vhead ' + ps[vhead].next ' + rl0 + phead1 ' = rl1 + phead1 ' + rl, ps[phead1].deqID = None, vs[phead1].deqID = None, ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ phead1, vs[phead0].next ≠ phead1, ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, ps[vhead].next ≠ vs[phead0].next, phead0 ≠ vs[phead0].next, phead0 ≠ phead1, vhead ≠ phead1, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), listp(rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(rl0, ps), unmarkedp(rl0, vs), phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl0), ¬ dups(orl0), ¬ dups(orl0 + rl0), ¬ vs[phead0].next ∈ rl0, ¬ vs[phead0].next ∈ orl0, ¬ ps[vhead].next ∈ rl0, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ rl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ rl0, ¬ phead1 ∈ orl0, ¬ phead1 ∈ rl0, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| orl0 + vhead ' + ps[vhead].next ' + rl0 + phead1 ' = rl1 + phead1 ' + rl, ps[phead1].deqID = None, vs[phead1].deqID = None, ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ phead1, vs[phead0].next ≠ phead1, ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, ps[vhead].next ≠ vs[phead0].next, phead0 ≠ vs[phead0].next, phead0 ≠ phead1, vhead ≠ phead1, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), listp(rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(rl0, ps), unmarkedp(rl0, vs), phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl0), ¬ dups(orl0), ¬ dups(orl0 + rl0), ¬ vs[phead0].next ∈ rl0, ¬ vs[phead0].next ∈ orl0, ¬ ps[vhead].next ∈ rl0, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ rl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ rl0, ¬ phead1 ∈ orl0, ¬ phead1 ∈ rl0, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ |
y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last
orl0 + vhead ' + ps[vhead].next ' + rl0 = (rl1 + phead1 ' + rl).butlast, vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[phead1].deqID = None, ps[phead1].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), phead1 = (rl1 + phead1 ' + rl).last, rl1 + phead1 ' + rl ≠ [], ps[vhead].next ≠ phead1, vs[phead0].next ≠ phead1, ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, ps[vhead].next ≠ vs[phead0].next, phead0 ≠ vs[phead0].next, phead0 ≠ phead1, vhead ≠ phead1, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), listp(phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(rl0, vs), unmarkedp(rl0, ps), phead0 ∈ ps, phead0 ∈ vs, ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(rl0), ¬ dups(orl0), ¬ dups(orl0 + rl0), ¬ vs[phead0].next ∈ rl0, ¬ vs[phead0].next ∈ orl0, ¬ ps[vhead].next ∈ rl0, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ rl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ rl0, ¬ phead1 ∈ orl0, ¬ phead1 ∈ rl0, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦
Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: orl0 + vhead ' + ps[vhead].next ' + rl0, phead1, rl1 + phead1 ' + rl
| y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last |
| orl0 + vhead ' + ps[vhead].next ' + rl0 = (rl1 + phead1 ' + rl).butlast, vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[phead1].deqID = None, ps[phead1].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), phead1 = (rl1 + phead1 ' + rl).last, rl1 + phead1 ' + rl ≠ [], ps[vhead].next ≠ phead1, vs[phead0].next ≠ phead1, ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, ps[vhead].next ≠ vs[phead0].next, phead0 ≠ vs[phead0].next, phead0 ≠ phead1, vhead ≠ phead1, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), listp(phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(rl0, vs), unmarkedp(rl0, ps), phead0 ∈ ps, phead0 ∈ vs, ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(rl0), ¬ dups(orl0), ¬ dups(orl0 + rl0), ¬ vs[phead0].next ∈ rl0, ¬ vs[phead0].next ∈ orl0, ¬ ps[vhead].next ∈ rl0, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ rl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ rl0, ¬ phead1 ∈ orl0, ¬ phead1 ∈ rl0, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ |
orl0 + vhead ' + ps[vhead].next ' + rl0 = rl1 + (phead1 ' + rl).butlast, ps[phead1].deqID = None, vs[phead1].deqID = None, ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), phead1 = (phead1 ' + rl).last, ps[vhead].next ≠ phead1, vs[phead0].next ≠ phead1, ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, ps[vhead].next ≠ vs[phead0].next, phead0 ≠ vs[phead0].next, phead0 ≠ phead1, vhead ≠ phead1, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), listp(rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(rl0, ps), unmarkedp(rl0, vs), phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl0), ¬ dups(orl0), ¬ dups(orl0 + rl0), ¬ vs[phead0].next ∈ rl0, ¬ vs[phead0].next ∈ orl0, ¬ ps[vhead].next ∈ rl0, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ rl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ rl0, ¬ phead1 ∈ orl0, ¬ phead1 ∈ rl0, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + a ' + y ≠ []; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s)
| orl0 + vhead ' + ps[vhead].next ' + rl0 = rl1 + (phead1 ' + rl).butlast, ps[phead1].deqID = None, vs[phead1].deqID = None, ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), phead1 = (phead1 ' + rl).last, ps[vhead].next ≠ phead1, vs[phead0].next ≠ phead1, ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, ps[vhead].next ≠ vs[phead0].next, phead0 ≠ vs[phead0].next, phead0 ≠ phead1, vhead ≠ phead1, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), listp(rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(rl0, ps), unmarkedp(rl0, vs), phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl0), ¬ dups(orl0), ¬ dups(orl0 + rl0), ¬ vs[phead0].next ∈ rl0, ¬ vs[phead0].next ∈ orl0, ¬ ps[vhead].next ∈ rl0, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ rl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ rl0, ¬ phead1 ∈ orl0, ¬ phead1 ∈ rl0, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ |
⊦ y ≠ [] → (x + y).butlast = x + y.butlast
orl0 + vhead ' + ps[vhead].next ' + rl0 = rl1 + phead1 ' + rl.butlast, vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[phead1].deqID = None, ps[phead1].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), phead1 = (phead1 ' + rl).last, ps[vhead].next ≠ phead1, vs[phead0].next ≠ phead1, ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, ps[vhead].next ≠ vs[phead0].next, phead0 ≠ vs[phead0].next, phead0 ≠ phead1, rl ≠ [], vhead ≠ phead1, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), listp(phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(rl0, vs), unmarkedp(rl0, ps), phead0 ∈ ps, phead0 ∈ vs, ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(rl0), ¬ dups(orl0), ¬ dups(orl0 + rl0), ¬ vs[phead0].next ∈ rl0, ¬ vs[phead0].next ∈ orl0, ¬ ps[vhead].next ∈ rl0, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ rl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ rl0, ¬ phead1 ∈ orl0, ¬ phead1 ∈ rl0, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦
Used simplifier rules: ⊦ a '.last = a; (s) ⊦ a '.butlast = []; (s) ⊦ x + [] = x; (s) ⊦ [] + x = x; (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ listp(r ' + r0 ', 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 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (s) ⊦ weak?(opttid) → opttid ≠ None; (as) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: phead1 ', rl
| ⊦ y ≠ [] → (x + y).butlast = x + y.butlast |
| orl0 + vhead ' + ps[vhead].next ' + rl0 = rl1 + phead1 ' + rl.butlast, vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[phead1].deqID = None, ps[phead1].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), phead1 = (phead1 ' + rl).last, ps[vhead].next ≠ phead1, vs[phead0].next ≠ phead1, ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, ps[vhead].next ≠ vs[phead0].next, phead0 ≠ vs[phead0].next, phead0 ≠ phead1, rl ≠ [], vhead ≠ phead1, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), listp(phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(rl0, vs), unmarkedp(rl0, ps), phead0 ∈ ps, phead0 ∈ vs, ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(rl0), ¬ dups(orl0), ¬ dups(orl0 + rl0), ¬ vs[phead0].next ∈ rl0, ¬ vs[phead0].next ∈ orl0, ¬ ps[vhead].next ∈ rl0, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ rl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ rl0, ¬ phead1 ∈ orl0, ¬ phead1 ∈ rl0, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ |
orl0 + vhead ' + ps[vhead].next ' + rl0 = rl1 + rl.last ' + rl.butlast, vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[rl.last].deqID = None, ps[rl.last].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ vs[phead0].next, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, ps[vhead].next ≠ phead0, vs[phead0].next ≠ rl.last, ps[vhead].next ≠ rl.last, phead0 ≠ rl.last, phead0 ≠ vs[phead0].next, rl ≠ [], vhead ≠ ps[vhead].next, vhead ≠ phead0, vhead ≠ rl.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + rl.last ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), listp(rl.last ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + rl.last ' + (rl + vs[phead0].next ') + phead0 ', vhead, vs), nonullRetRefs(rl1 + rl.last ' + (rl + vs[phead0].next ') + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(rl0, vs), unmarkedp(rl0, ps), phead0 ∈ ps, phead0 ∈ vs, ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(orl0 + rl0), ¬ dups(orl0), ¬ dups(rl0), ¬ vhead ∈ orl0, ¬ rl.last ∈ rl0, ¬ rl.last ∈ orl0, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl0, ¬ vhead ∈ rl0, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ rl0, ¬ vs[phead0].next ∈ orl0, ¬ vs[phead0].next ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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 ∈ orl0 ∨ phead = vhead ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (a ' + x).last = x.last; (s)
| orl0 + vhead ' + ps[vhead].next ' + rl0 = rl1 + rl.last ' + rl.butlast, vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[rl.last].deqID = None, ps[rl.last].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ vs[phead0].next, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, ps[vhead].next ≠ phead0, vs[phead0].next ≠ rl.last, ps[vhead].next ≠ rl.last, phead0 ≠ rl.last, phead0 ≠ vs[phead0].next, rl ≠ [], vhead ≠ ps[vhead].next, vhead ≠ phead0, vhead ≠ rl.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + rl.last ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), listp(rl.last ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + rl.last ' + (rl + vs[phead0].next ') + phead0 ', vhead, vs), nonullRetRefs(rl1 + rl.last ' + (rl + vs[phead0].next ') + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(rl0, vs), unmarkedp(rl0, ps), phead0 ∈ ps, phead0 ∈ vs, ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(orl0 + rl0), ¬ dups(orl0), ¬ dups(rl0), ¬ vhead ∈ orl0, ¬ rl.last ∈ rl0, ¬ rl.last ∈ orl0, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl0, ¬ vhead ∈ rl0, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ rl0, ¬ vs[phead0].next ∈ orl0, ¬ vs[phead0].next ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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 ∈ orl0 ∨ phead = vhead ⊦ |
orl0 + vhead ' + ps[vhead].next ' + rl0 = rl1 + phead1 ' + rl2, ps[phead1].deqID = None, vs[phead1].deqID = None, ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), rl = rl2 + phead1 ', ps[vhead].next ≠ vs[phead0].next, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, ps[vhead].next ≠ phead0, vs[phead0].next ≠ phead1, ps[vhead].next ≠ phead1, phead0 ≠ phead1, phead0 ≠ vs[phead0].next, rl ≠ [], vhead ≠ ps[vhead].next, vhead ≠ phead0, vhead ≠ phead1, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), listp(rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(rl0, ps), unmarkedp(rl0, vs), phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0 + rl0), ¬ dups(orl0), ¬ dups(rl0), ¬ vhead ∈ orl0, ¬ phead1 ∈ rl0, ¬ phead1 ∈ orl0, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl0, ¬ vhead ∈ rl0, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ rl0, ¬ vs[phead0].next ∈ orl0, ¬ vs[phead0].next ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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 ∈ orl0 ∨ phead = vhead ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl, phead1, y
| orl0 + vhead ' + ps[vhead].next ' + rl0 = rl1 + phead1 ' + rl2, ps[phead1].deqID = None, vs[phead1].deqID = None, ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), rl = rl2 + phead1 ', ps[vhead].next ≠ vs[phead0].next, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, ps[vhead].next ≠ phead0, vs[phead0].next ≠ phead1, ps[vhead].next ≠ phead1, phead0 ≠ phead1, phead0 ≠ vs[phead0].next, rl ≠ [], vhead ≠ ps[vhead].next, vhead ≠ phead0, vhead ≠ phead1, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), listp(rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead1 ' + (rl + vs[phead0].next ') + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(rl0, ps), unmarkedp(rl0, vs), phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0 + rl0), ¬ dups(orl0), ¬ dups(rl0), ¬ vhead ∈ orl0, ¬ phead1 ∈ rl0, ¬ phead1 ∈ orl0, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl0, ¬ vhead ∈ rl0, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ rl0, ¬ vs[phead0].next ∈ orl0, ¬ vs[phead0].next ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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 ∈ orl0 ∨ phead = vhead ⊦ |
orl0 + vhead ' + ps[vhead].next ' + rl0 = rl1 + phead1 ' + rl2, vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[phead1].deqID = None, ps[phead1].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead1].next = vs[phead0].next, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ vs[phead0].next, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, ps[vhead].next ≠ phead0, vs[phead0].next ≠ phead1, ps[vhead].next ≠ phead1, phead0 ≠ phead1, phead0 ≠ vs[phead0].next, vhead ≠ ps[vhead].next, vhead ≠ phead0, vhead ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead1 ' + ((rl2 + phead1 ') + vs[phead0].next ') + phead0 ', vs, ps, owns), listp(phead1 ' + ((rl2 + phead1 ') + vs[phead0].next ') + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead1 ' + ((rl2 + phead1 ') + vs[phead0].next ') + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead1 ' + ((rl2 + phead1 ') + vs[phead0].next ') + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(rl0, vs), unmarkedp(rl0, ps), phead0 ∈ ps, phead0 ∈ vs, ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(orl0 + rl0), ¬ dups(orl0), ¬ dups(rl0), ¬ vhead ∈ orl0, ¬ phead1 ∈ rl0, ¬ phead1 ∈ orl0, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl0, ¬ vhead ∈ rl0, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ rl0, ¬ vs[phead0].next ∈ orl0, ¬ vs[phead0].next ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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 ∈ orl0 ∨ phead = vhead ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ x + a ' ≠ []; (s)
| orl0 + vhead ' + ps[vhead].next ' + rl0 = rl1 + phead1 ' + rl2, vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[phead1].deqID = None, ps[phead1].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead1].next = vs[phead0].next, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ vs[phead0].next, vs[phead0].next ≠ vhead, vs[phead0].next ≠ null, ps[vhead].next ≠ phead0, vs[phead0].next ≠ phead1, ps[vhead].next ≠ phead1, phead0 ≠ phead1, phead0 ≠ vs[phead0].next, vhead ≠ ps[vhead].next, vhead ≠ phead0, vhead ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead1 ' + ((rl2 + phead1 ') + vs[phead0].next ') + phead0 ', vs, ps, owns), listp(phead1 ' + ((rl2 + phead1 ') + vs[phead0].next ') + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead1 ' + ((rl2 + phead1 ') + vs[phead0].next ') + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead1 ' + ((rl2 + phead1 ') + vs[phead0].next ') + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(rl0, vs), unmarkedp(rl0, ps), phead0 ∈ ps, phead0 ∈ vs, ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(orl0 + rl0), ¬ dups(orl0), ¬ dups(rl0), ¬ vhead ∈ orl0, ¬ phead1 ∈ rl0, ¬ phead1 ∈ orl0, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl0, ¬ vhead ∈ rl0, ¬ ps[vhead].next ∈ orl0, ¬ ps[vhead].next ∈ rl0, ¬ vs[phead0].next ∈ orl0, ¬ vs[phead0].next ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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 ∈ orl0 ∨ phead = vhead ⊦ |
⊦ listp(rl, vs, ps, owns) → ¬ dups(rl)
Used simplifier rules: ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: owns, phead1 ' + ((rl2 + phead1 ') + vs[phead0].next ') + phead0 ', vs, ps
| ⊦ listp(rl, vs, ps, owns) → ¬ dups(rl) |
| vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ noowns(tid, owns(vs[phead0].next; None)), ¬ ps[vhead].next ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead ⊦ |
⊦ oneweakowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Weak(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)
ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, vs), ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, vs[phead0].next ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ noowns(tid, owns(vs[phead0].next; None)), ¬ ps[vhead].next ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ vs[phead0].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, phead ∈ orl0 ∨ phead = vhead ⊦
Used terms: ps, tid, owns, vs[phead0].next, vs
| ⊦ oneweakowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Weak(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid) |
| ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, vs), ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, vs[phead0].next ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ noowns(tid, owns(vs[phead0].next; None)), ¬ ps[vhead].next ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ vs[phead0].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, phead ∈ orl0 ∨ phead = vhead ⊦ |
⊦ noowns(tid, owns) ↔ (∀ r. owns(r) ≠ None → owns(r).tid ≠ tid)
vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead].next ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ vs[phead0].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, ∃ r. ¬(owns(vs[phead0].next; None)(r) ≠ None → owns(vs[phead0].next; None)(r).tid ≠ tid), phead ∈ orl0 ∨ phead = vhead ⊦
Used terms: tid, owns(vs[phead0].next; None)
| ⊦ noowns(tid, owns) ↔ (∀ r. owns(r) ≠ None → owns(r).tid ≠ tid) |
| vs[vs[phead0].next].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], ps[vhead].next ∈ vs, ps[vhead].next ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead].next ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ vs[phead0].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, ∃ r. ¬(owns(vs[phead0].next; None)(r) ≠ None → owns(vs[phead0].next; None)(r).tid ≠ tid), phead ∈ orl0 ∨ phead = vhead ⊦ |
ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(owns(r).tid), ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, vs[phead0].next ≠ r, None ≠ owns(r), vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(owns(r).tid, vhead, vs), noid(owns(r).tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, vs), ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, vs[phead0].next ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead].next ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ vs[phead0].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ owns(r).tid, phead ∈ orl0 ∨ phead = vhead ⊦
| ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(owns(r).tid), ps[vhead].next ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead, vs[phead0].next ≠ r, None ≠ owns(r), vhead ≠ phead0, vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(owns(r).tid, vhead, vs), noid(owns(r).tid, orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl0 + vhead ' + ps[vhead].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, vs), ps[vhead].next ∈ ps, ps[vhead].next ∈ vs, vs[phead0].next ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead].next ∈ orl1, ¬ ps[vhead].next ∈ orl0, ¬ vhead ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ vs[phead0].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ owns(r).tid, phead ∈ orl0 ∨ phead = vhead ⊦ |
Used terms: r
| qrl + vs[(vhead0 ' + qrl).last].next ' = phead0 ' + qrl0, vs[vs[(vhead0 ' + qrl).last].next].deqID = None, orl0.last = vhead, ps[(vhead0 ' + qrl).last].next = null, vs[vs[(vhead0 ' + qrl).last].next].next = null, ps[vs[(vhead0 ' + qrl).last].next] = vs[vs[(vhead0 ' + qrl).last].next], dom vrvHp = dom prvHp, owns(vs[(vhead0 ' + qrl).last].next) = Weak(tid), vs[(vhead0 ' + qrl).last].next ≠ null, orl0 ≠ [], phead ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + vhead0 ') + qrl, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + qrl, vhead, vs), nonullRetRefs((orl0 + vhead0 ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(vhead0 ' + qrl).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vs[(vhead0 ' + qrl).last].next ∈ ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next], phead ∈ ps, phead ∈ vs, vs[(vhead0 ' + qrl).last].next ∈ ps, vs[(vhead0 ' + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl0), ¬ dups(orl0 + qrl), ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ qrl ∨ phead0 = vs[(vhead0 ' + qrl).last].next, phead ∈ orl0 ∨ phead = vhead0, vs[(vhead0 ' + qrl).last].next = phead0 ∨ vs[(vhead0 ' + qrl).last].next ∈ qrl0 ⊦ noowns(tid, owns(vs[(vhead0 ' + qrl).last].next; None)) ∧ noid(tid, (orl0 + vhead0 ') + phead0 ' + qrl0, vhead, vs) ∧ (vhead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(qrl, vs)) ∧ nonullRetRefs((orl0 + vhead0 ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next][vs[(vhead0 ' + qrl).last].next].deqID = None ∧ unmarkedp(qrl, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next]) ∧ markedp(orl0, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next]) ∧ some?(ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next][vhead0].deqID) ∧ ¬ vs[(vhead0 ' + qrl).last].next ∈ qrl ∧ ¬ vs[(vhead0 ' + qrl).last].next ∈ orl0 ∧ vs[(vhead0 ' + qrl).last].next ≠ vhead0 ∧ listp ((orl0 + vhead0 ') + phead0 ' + qrl0, vs, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next], owns(vs[(vhead0 ' + qrl).last].next; None)) ∧ ( (vhead0 ' + qrl).last ∈ orl0 ∨ (vhead0 ' + qrl).last = vhead0 ∨ (vhead0 ' + qrl).last ∈ qrl ∨ (vhead0 ' + qrl).last = vs[(vhead0 ' + qrl).last].next) |
qrl + vs[(vhead0 ' + qrl).last].next ' = phead0 ' + qrl0, vs[vs[(vhead0 ' + qrl).last].next].deqID = None, vs[vs[(vhead0 ' + qrl).last].next].next = null, ps[(vhead0 ' + qrl).last].next = null, ps[vs[(vhead0 ' + qrl).last].next] = vs[vs[(vhead0 ' + qrl).last].next], dom vrvHp = dom prvHp, owns(vs[(vhead0 ' + qrl).last].next) = Weak(tid), vs[(vhead0 ' + qrl).last].next ≠ null, orl0 ≠ [], phead ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + vhead0 ') + qrl, vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, orl0.last, vs), noid(tid, (orl0 + vhead0 ') + qrl, orl0.last, vs), nonullRetRefs((orl0 + vhead0 ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(vhead0 ' + qrl).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), vs[(vhead0 ' + qrl).last].next ∈ vs, vs[(vhead0 ' + qrl).last].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[(vhead0 ' + qrl).last].next ∈ ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next], phead ∈ orl0, ¬ dups(qrl), ¬ dups(orl0), ¬ dups(orl0 + qrl), ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ orl0, vs[orl0.last].next ≠ null ∧ vs[vs[orl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl0.last].next].deqID.tid)) = Claimed(vs[vs[orl0.last].next].deqID.tid, vs[vs[orl0.last].next].val), phead0 ∈ qrl ∨ phead0 = vs[(vhead0 ' + qrl).last].next, vs[(vhead0 ' + qrl).last].next = phead0 ∨ vs[(vhead0 ' + qrl).last].next ∈ qrl0 ⊦ noowns(tid, owns(vs[(vhead0 ' + qrl).last].next; None)) ∧ noid(tid, (orl0 + vhead0 ') + phead0 ' + qrl0, orl0.last, vs) ∧ nonullRetRefs((orl0 + vhead0 ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next][vs[(vhead0 ' + qrl).last].next].deqID = None ∧ unmarkedp(qrl, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next]) ∧ markedp(orl0, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next]) ∧ some?(ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next][vhead0].deqID) ∧ ¬ vs[(vhead0 ' + qrl).last].next ∈ qrl ∧ ¬ vs[(vhead0 ' + qrl).last].next ∈ orl0 ∧ vs[(vhead0 ' + qrl).last].next ≠ vhead0 ∧ listp ((orl0 + vhead0 ') + phead0 ' + qrl0, vs, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next], owns(vs[(vhead0 ' + qrl).last].next; None)) ∧ ( (vhead0 ' + qrl).last ∈ orl0 ∨ (vhead0 ' + qrl).last = vhead0 ∨ (vhead0 ' + qrl).last ∈ qrl ∨ (vhead0 ' + qrl).last = vs[(vhead0 ' + qrl).last].next)
| qrl + vs[(vhead0 ' + qrl).last].next ' = phead0 ' + qrl0, vs[vs[(vhead0 ' + qrl).last].next].deqID = None, vs[vs[(vhead0 ' + qrl).last].next].next = null, ps[(vhead0 ' + qrl).last].next = null, ps[vs[(vhead0 ' + qrl).last].next] = vs[vs[(vhead0 ' + qrl).last].next], dom vrvHp = dom prvHp, owns(vs[(vhead0 ' + qrl).last].next) = Weak(tid), vs[(vhead0 ' + qrl).last].next ≠ null, orl0 ≠ [], phead ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + vhead0 ') + qrl, vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, orl0.last, vs), noid(tid, (orl0 + vhead0 ') + qrl, orl0.last, vs), nonullRetRefs((orl0 + vhead0 ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(vhead0 ' + qrl).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), vs[(vhead0 ' + qrl).last].next ∈ vs, vs[(vhead0 ' + qrl).last].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[(vhead0 ' + qrl).last].next ∈ ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next], phead ∈ orl0, ¬ dups(qrl), ¬ dups(orl0), ¬ dups(orl0 + qrl), ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ orl0, vs[orl0.last].next ≠ null ∧ vs[vs[orl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl0.last].next].deqID.tid)) = Claimed(vs[vs[orl0.last].next].deqID.tid, vs[vs[orl0.last].next].val), phead0 ∈ qrl ∨ phead0 = vs[(vhead0 ' + qrl).last].next, vs[(vhead0 ' + qrl).last].next = phead0 ∨ vs[(vhead0 ' + qrl).last].next ∈ qrl0 ⊦ noowns(tid, owns(vs[(vhead0 ' + qrl).last].next; None)) ∧ noid(tid, (orl0 + vhead0 ') + phead0 ' + qrl0, orl0.last, vs) ∧ nonullRetRefs((orl0 + vhead0 ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next][vs[(vhead0 ' + qrl).last].next].deqID = None ∧ unmarkedp(qrl, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next]) ∧ markedp(orl0, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next]) ∧ some?(ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next][vhead0].deqID) ∧ ¬ vs[(vhead0 ' + qrl).last].next ∈ qrl ∧ ¬ vs[(vhead0 ' + qrl).last].next ∈ orl0 ∧ vs[(vhead0 ' + qrl).last].next ≠ vhead0 ∧ listp ((orl0 + vhead0 ') + phead0 ' + qrl0, vs, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next], owns(vs[(vhead0 ' + qrl).last].next; None)) ∧ ( (vhead0 ' + qrl).last ∈ orl0 ∨ (vhead0 ' + qrl).last = vhead0 ∨ (vhead0 ' + qrl).last ∈ qrl ∨ (vhead0 ' + qrl).last = vs[(vhead0 ' + qrl).last].next) |
qrl + vs[(vhead0 ' + qrl).last].next ' = phead0 ' + qrl0, vs[vs[(vhead0 ' + qrl).last].next].deqID = None, ps[(vhead0 ' + qrl).last].next = null, vs[vs[(vhead0 ' + qrl).last].next].next = null, ps[vs[(vhead0 ' + qrl).last].next] = vs[vs[(vhead0 ' + qrl).last].next], dom vrvHp = dom prvHp, orl0 = orl + phead1 ', owns(vs[(vhead0 ' + qrl).last].next) = Weak(tid), vs[(vhead0 ' + qrl).last].next ≠ null, orl0 ≠ [], phead ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + vhead0 ') + qrl, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, phead1, vs), noid(tid, (orl0 + vhead0 ') + qrl, phead1, vs), nonullRetRefs((orl0 + vhead0 ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(vhead0 ' + qrl).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ orl0, vs[(vhead0 ' + qrl).last].next ∈ ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next], phead ∈ ps, phead ∈ vs, vs[(vhead0 ' + qrl).last].next ∈ ps, vs[(vhead0 ' + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl0), ¬ dups(orl0 + qrl), ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ orl0, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), vs[(vhead0 ' + qrl).last].next = phead0 ∨ vs[(vhead0 ' + qrl).last].next ∈ qrl0, phead0 ∈ qrl ∨ phead0 = vs[(vhead0 ' + qrl).last].next ⊦ noowns(tid, owns(vs[(vhead0 ' + qrl).last].next; None)) ∧ noid(tid, (orl0 + vhead0 ') + phead0 ' + qrl0, phead1, vs) ∧ nonullRetRefs((orl0 + vhead0 ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next][vs[(vhead0 ' + qrl).last].next].deqID = None ∧ unmarkedp(qrl, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next]) ∧ markedp(orl0, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next]) ∧ some?(ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next][vhead0].deqID) ∧ ¬ vs[(vhead0 ' + qrl).last].next ∈ qrl ∧ ¬ vs[(vhead0 ' + qrl).last].next ∈ orl0 ∧ vs[(vhead0 ' + qrl).last].next ≠ vhead0 ∧ listp ((orl0 + vhead0 ') + phead0 ' + qrl0, vs, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next], owns(vs[(vhead0 ' + qrl).last].next; None)) ∧ ( (vhead0 ' + qrl).last ∈ orl0 ∨ (vhead0 ' + qrl).last = vhead0 ∨ (vhead0 ' + qrl).last ∈ qrl ∨ (vhead0 ' + qrl).last = vs[(vhead0 ' + qrl).last].next)
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, phead1, y
| qrl + vs[(vhead0 ' + qrl).last].next ' = phead0 ' + qrl0, vs[vs[(vhead0 ' + qrl).last].next].deqID = None, ps[(vhead0 ' + qrl).last].next = null, vs[vs[(vhead0 ' + qrl).last].next].next = null, ps[vs[(vhead0 ' + qrl).last].next] = vs[vs[(vhead0 ' + qrl).last].next], dom vrvHp = dom prvHp, orl0 = orl + phead1 ', owns(vs[(vhead0 ' + qrl).last].next) = Weak(tid), vs[(vhead0 ' + qrl).last].next ≠ null, orl0 ≠ [], phead ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + vhead0 ') + qrl, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, phead1, vs), noid(tid, (orl0 + vhead0 ') + qrl, phead1, vs), nonullRetRefs((orl0 + vhead0 ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(vhead0 ' + qrl).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ orl0, vs[(vhead0 ' + qrl).last].next ∈ ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next], phead ∈ ps, phead ∈ vs, vs[(vhead0 ' + qrl).last].next ∈ ps, vs[(vhead0 ' + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl0), ¬ dups(orl0 + qrl), ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ orl0, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), vs[(vhead0 ' + qrl).last].next = phead0 ∨ vs[(vhead0 ' + qrl).last].next ∈ qrl0, phead0 ∈ qrl ∨ phead0 = vs[(vhead0 ' + qrl).last].next ⊦ noowns(tid, owns(vs[(vhead0 ' + qrl).last].next; None)) ∧ noid(tid, (orl0 + vhead0 ') + phead0 ' + qrl0, phead1, vs) ∧ nonullRetRefs((orl0 + vhead0 ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next][vs[(vhead0 ' + qrl).last].next].deqID = None ∧ unmarkedp(qrl, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next]) ∧ markedp(orl0, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next]) ∧ some?(ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next][vhead0].deqID) ∧ ¬ vs[(vhead0 ' + qrl).last].next ∈ qrl ∧ ¬ vs[(vhead0 ' + qrl).last].next ∈ orl0 ∧ vs[(vhead0 ' + qrl).last].next ≠ vhead0 ∧ listp ((orl0 + vhead0 ') + phead0 ' + qrl0, vs, ps[(vhead0 ' + qrl).last, ps[(vhead0 ' + qrl).last].next:= vs[(vhead0 ' + qrl).last].next], owns(vs[(vhead0 ' + qrl).last].next; None)) ∧ ( (vhead0 ' + qrl).last ∈ orl0 ∨ (vhead0 ' + qrl).last = vhead0 ∨ (vhead0 ' + qrl).last ∈ qrl ∨ (vhead0 ' + qrl).last = vs[(vhead0 ' + qrl).last].next) |
qrl + vs[(ps[phead1].next ' + qrl).last].next ' = phead0 ' + qrl0, vs[vs[(ps[phead1].next ' + qrl).last].next].deqID = None, vs[vs[(ps[phead1].next ' + qrl).last].next].next = null, ps[(ps[phead1].next ' + qrl).last].next = null, ps[vs[(ps[phead1].next ' + qrl).last].next] = vs[vs[(ps[phead1].next ' + qrl).last].next], dom vrvHp = dom prvHp, owns(vs[(ps[phead1].next ' + qrl).last].next) = Weak(tid), vs[(ps[phead1].next ' + qrl).last].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((orl + phead1 ') + ps[phead1].next ') + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + qrl, phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(ps[phead1].next ' + qrl).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), vs[(ps[phead1].next ' + qrl).last].next ∈ vs, vs[(ps[phead1].next ' + qrl).last].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[(ps[phead1].next ' + qrl).last].next ∈ ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next], ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ phead1 ∈ orl, ¬ phead1 ∈ qrl, ¬ ps[phead1].next ∈ qrl, ¬ ps[phead1].next ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), vs[(ps[phead1].next ' + qrl).last].next = phead0 ∨ vs[(ps[phead1].next ' + qrl).last].next ∈ qrl0, phead ∈ orl ∨ phead = phead1, phead0 ∈ qrl ∨ phead0 = vs[(ps[phead1].next ' + qrl).last].next ⊦ noowns(tid, owns(vs[(ps[phead1].next ' + qrl).last].next; None)) ∧ noid(tid, ((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, phead1, vs) ∧ nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next] [vs[(ps[phead1].next ' + qrl).last].next ] .deqID = None ∧ unmarkedp(qrl, ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next]) ∧ markedp(orl, ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next]) ∧ some?(ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next][phead1].deqID) ∧ some? (ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next][ps[phead1].next].deqID) ∧ ¬ vs[(ps[phead1].next ' + qrl).last].next ∈ qrl ∧ ¬ vs[(ps[phead1].next ' + qrl).last].next ∈ orl ∧ vs[(ps[phead1].next ' + qrl).last].next ≠ phead1 ∧ vs[(ps[phead1].next ' + qrl).last].next ≠ ps[phead1].next ∧ listp (((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next], owns(vs[(ps[phead1].next ' + qrl).last].next; None)) ∧ ( (ps[phead1].next ' + qrl).last ∈ orl ∨ (ps[phead1].next ' + qrl).last = phead1 ∨ (ps[phead1].next ' + qrl).last = ps[phead1].next ∨ (ps[phead1].next ' + qrl).last ∈ qrl ∨ (ps[phead1].next ' + qrl).last = vs[(ps[phead1].next ' + qrl).last].next)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| qrl + vs[(ps[phead1].next ' + qrl).last].next ' = phead0 ' + qrl0, vs[vs[(ps[phead1].next ' + qrl).last].next].deqID = None, vs[vs[(ps[phead1].next ' + qrl).last].next].next = null, ps[(ps[phead1].next ' + qrl).last].next = null, ps[vs[(ps[phead1].next ' + qrl).last].next] = vs[vs[(ps[phead1].next ' + qrl).last].next], dom vrvHp = dom prvHp, owns(vs[(ps[phead1].next ' + qrl).last].next) = Weak(tid), vs[(ps[phead1].next ' + qrl).last].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((orl + phead1 ') + ps[phead1].next ') + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + qrl, phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(ps[phead1].next ' + qrl).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), vs[(ps[phead1].next ' + qrl).last].next ∈ vs, vs[(ps[phead1].next ' + qrl).last].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[(ps[phead1].next ' + qrl).last].next ∈ ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next], ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ phead1 ∈ orl, ¬ phead1 ∈ qrl, ¬ ps[phead1].next ∈ qrl, ¬ ps[phead1].next ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), vs[(ps[phead1].next ' + qrl).last].next = phead0 ∨ vs[(ps[phead1].next ' + qrl).last].next ∈ qrl0, phead ∈ orl ∨ phead = phead1, phead0 ∈ qrl ∨ phead0 = vs[(ps[phead1].next ' + qrl).last].next ⊦ noowns(tid, owns(vs[(ps[phead1].next ' + qrl).last].next; None)) ∧ noid(tid, ((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, phead1, vs) ∧ nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next] [vs[(ps[phead1].next ' + qrl).last].next ] .deqID = None ∧ unmarkedp(qrl, ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next]) ∧ markedp(orl, ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next]) ∧ some?(ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next][phead1].deqID) ∧ some? (ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next][ps[phead1].next].deqID) ∧ ¬ vs[(ps[phead1].next ' + qrl).last].next ∈ qrl ∧ ¬ vs[(ps[phead1].next ' + qrl).last].next ∈ orl ∧ vs[(ps[phead1].next ' + qrl).last].next ≠ phead1 ∧ vs[(ps[phead1].next ' + qrl).last].next ≠ ps[phead1].next ∧ listp (((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next], owns(vs[(ps[phead1].next ' + qrl).last].next; None)) ∧ ( (ps[phead1].next ' + qrl).last ∈ orl ∨ (ps[phead1].next ' + qrl).last = phead1 ∨ (ps[phead1].next ' + qrl).last = ps[phead1].next ∨ (ps[phead1].next ' + qrl).last ∈ qrl ∨ (ps[phead1].next ' + qrl).last = vs[(ps[phead1].next ' + qrl).last].next) |
⊦ y ≠ [] → (x + y).last = y.last
qrl + vs[(ps[phead1].next ' + qrl).last].next ' = phead0 ' + qrl0, vs[vs[(ps[phead1].next ' + qrl).last].next].deqID = None, ps[(ps[phead1].next ' + qrl).last].next = null, vs[vs[(ps[phead1].next ' + qrl).last].next].next = null, ps[vs[(ps[phead1].next ' + qrl).last].next] = vs[vs[(ps[phead1].next ' + qrl).last].next], dom vrvHp = dom prvHp, owns(vs[(ps[phead1].next ' + qrl).last].next) = Weak(tid), qrl = [], vs[(ps[phead1].next ' + qrl).last].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + qrl, phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(ps[phead1].next ' + qrl).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vs[(ps[phead1].next ' + qrl).last].next ∈ ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next], phead ∈ ps, phead ∈ vs, vs[(ps[phead1].next ' + qrl).last].next ∈ ps, vs[(ps[phead1].next ' + qrl).last].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ phead1 ∈ orl, ¬ phead1 ∈ qrl, ¬ ps[phead1].next ∈ qrl, ¬ ps[phead1].next ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ qrl ∨ phead0 = vs[(ps[phead1].next ' + qrl).last].next, phead ∈ orl ∨ phead = phead1, vs[(ps[phead1].next ' + qrl).last].next = phead0 ∨ vs[(ps[phead1].next ' + qrl).last].next ∈ qrl0 ⊦ noowns(tid, owns(vs[(ps[phead1].next ' + qrl).last].next; None)) ∧ noid(tid, ((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, phead1, vs) ∧ nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next] [vs[(ps[phead1].next ' + qrl).last].next ] .deqID = None ∧ unmarkedp(qrl, ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next]) ∧ markedp(orl, ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next]) ∧ some?(ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next][phead1].deqID) ∧ some? (ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next][ps[phead1].next].deqID) ∧ ¬ vs[(ps[phead1].next ' + qrl).last].next ∈ qrl ∧ ¬ vs[(ps[phead1].next ' + qrl).last].next ∈ orl ∧ vs[(ps[phead1].next ' + qrl).last].next ≠ phead1 ∧ vs[(ps[phead1].next ' + qrl).last].next ≠ ps[phead1].next ∧ listp (((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next], owns(vs[(ps[phead1].next ' + qrl).last].next; None)) ∧ ( (ps[phead1].next ' + qrl).last ∈ orl ∨ (ps[phead1].next ' + qrl).last = phead1 ∨ (ps[phead1].next ' + qrl).last = ps[phead1].next ∨ (ps[phead1].next ' + qrl).last ∈ qrl ∨ (ps[phead1].next ' + qrl).last = vs[(ps[phead1].next ' + qrl).last].next)
qrl + vs[qrl.last].next ' = phead0 ' + qrl0, vs[vs[qrl.last].next].deqID = None, ps[qrl.last].next = null, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, owns(vs[qrl.last].next) = Weak(tid), vs[qrl.last].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, qrl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + qrl, phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[qrl.last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vs[qrl.last].next ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], phead ∈ ps, phead ∈ vs, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ phead1 ∈ orl, ¬ phead1 ∈ qrl, ¬ ps[phead1].next ∈ qrl, ¬ ps[phead1].next ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ qrl ∨ phead0 = vs[qrl.last].next, phead ∈ orl ∨ phead = phead1, vs[qrl.last].next = phead0 ∨ vs[qrl.last].next ∈ qrl0 ⊦ noowns(tid, owns(vs[qrl.last].next; None)) ∧ noid(tid, ((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, phead1, vs) ∧ nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][vs[qrl.last].next].deqID = None ∧ unmarkedp(qrl, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ markedp(orl, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ some?(ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][phead1].deqID) ∧ some?(ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][ps[phead1].next].deqID) ∧ ¬ vs[qrl.last].next ∈ qrl ∧ ¬ vs[qrl.last].next ∈ orl ∧ vs[qrl.last].next ≠ phead1 ∧ vs[qrl.last].next ≠ ps[phead1].next ∧ listp (((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)) ∧ (qrl.last ∈ orl ∨ qrl.last = phead1 ∨ qrl.last = ps[phead1].next ∨ qrl.last ∈ qrl ∨ qrl.last = vs[qrl.last].next)
Used terms: ps[phead1].next ', qrl
| ⊦ y ≠ [] → (x + y).last = y.last |
| qrl + vs[(ps[phead1].next ' + qrl).last].next ' = phead0 ' + qrl0, vs[vs[(ps[phead1].next ' + qrl).last].next].deqID = None, ps[(ps[phead1].next ' + qrl).last].next = null, vs[vs[(ps[phead1].next ' + qrl).last].next].next = null, ps[vs[(ps[phead1].next ' + qrl).last].next] = vs[vs[(ps[phead1].next ' + qrl).last].next], dom vrvHp = dom prvHp, owns(vs[(ps[phead1].next ' + qrl).last].next) = Weak(tid), qrl = [], vs[(ps[phead1].next ' + qrl).last].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + qrl, phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(ps[phead1].next ' + qrl).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vs[(ps[phead1].next ' + qrl).last].next ∈ ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next], phead ∈ ps, phead ∈ vs, vs[(ps[phead1].next ' + qrl).last].next ∈ ps, vs[(ps[phead1].next ' + qrl).last].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ phead1 ∈ orl, ¬ phead1 ∈ qrl, ¬ ps[phead1].next ∈ qrl, ¬ ps[phead1].next ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ qrl ∨ phead0 = vs[(ps[phead1].next ' + qrl).last].next, phead ∈ orl ∨ phead = phead1, vs[(ps[phead1].next ' + qrl).last].next = phead0 ∨ vs[(ps[phead1].next ' + qrl).last].next ∈ qrl0 ⊦ noowns(tid, owns(vs[(ps[phead1].next ' + qrl).last].next; None)) ∧ noid(tid, ((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, phead1, vs) ∧ nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next] [vs[(ps[phead1].next ' + qrl).last].next ] .deqID = None ∧ unmarkedp(qrl, ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next]) ∧ markedp(orl, ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next]) ∧ some?(ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next][phead1].deqID) ∧ some? (ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next][ps[phead1].next].deqID) ∧ ¬ vs[(ps[phead1].next ' + qrl).last].next ∈ qrl ∧ ¬ vs[(ps[phead1].next ' + qrl).last].next ∈ orl ∧ vs[(ps[phead1].next ' + qrl).last].next ≠ phead1 ∧ vs[(ps[phead1].next ' + qrl).last].next ≠ ps[phead1].next ∧ listp (((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, ps[(ps[phead1].next ' + qrl).last, ps[(ps[phead1].next ' + qrl).last].next:= vs[(ps[phead1].next ' + qrl).last].next], owns(vs[(ps[phead1].next ' + qrl).last].next; None)) ∧ ( (ps[phead1].next ' + qrl).last ∈ orl ∨ (ps[phead1].next ' + qrl).last = phead1 ∨ (ps[phead1].next ' + qrl).last = ps[phead1].next ∨ (ps[phead1].next ' + qrl).last ∈ qrl ∨ (ps[phead1].next ' + qrl).last = vs[(ps[phead1].next ' + qrl).last].next) |
vs[vs[ps[phead1].next].next].deqID = None, ps[ps[phead1].next].next = null, vs[vs[ps[phead1].next].next].next = null, ps[vs[ps[phead1].next].next] = vs[vs[ps[phead1].next].next], dom vrvHp = dom prvHp, owns(vs[ps[phead1].next].next) = Weak(tid), vs[ps[phead1].next].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead1 ' + ps[phead1].next ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + ps[phead1].next ', phead1, vs), nonullRetRefs(orl + phead1 ' + ps[phead1].next ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[ps[phead1].next].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), vs[ps[phead1].next].next ∈ ps[ps[phead1].next, ps[ps[phead1].next].next:= vs[ps[phead1].next].next], phead ∈ ps, phead ∈ vs, vs[ps[phead1].next].next ∈ ps, vs[ps[phead1].next].next ∈ vs, ¬ dups(orl), ¬ ps[phead1].next ∈ orl, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead ∈ orl ∨ phead = phead1 ⊦ noowns(tid, owns(vs[ps[phead1].next].next; None)) ∧ noid(tid, orl + phead1 ' + ps[phead1].next ' + vs[ps[phead1].next].next ', phead1, vs) ∧ nonullRetRefs(orl + phead1 ' + ps[phead1].next ' + vs[ps[phead1].next].next ', vs, vretRefs, pretRefs) ∧ ¬ vs[ps[phead1].next].next ∈ orl ∧ vs[ps[phead1].next].next ≠ phead1 ∧ vs[ps[phead1].next].next ≠ ps[phead1].next ∧ listp (orl + phead1 ' + ps[phead1].next ' + vs[ps[phead1].next].next ', vs, ps[ps[phead1].next, ps[ps[phead1].next].next:= vs[ps[phead1].next].next], owns(vs[ps[phead1].next].next; None))
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ a ≠ b → st[b, d][a] = st[a]; (s) ⊦ a '.last = a; (s) ⊦ ¬ a ∈ []; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ ¬ node ∈ rl → (markedp(rl, vs[node, nd]) ↔ markedp(rl, vs)); (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ [] + x = x; (s)
| vs[vs[ps[phead1].next].next].deqID = None, ps[ps[phead1].next].next = null, vs[vs[ps[phead1].next].next].next = null, ps[vs[ps[phead1].next].next] = vs[vs[ps[phead1].next].next], dom vrvHp = dom prvHp, owns(vs[ps[phead1].next].next) = Weak(tid), vs[ps[phead1].next].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead1 ' + ps[phead1].next ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + ps[phead1].next ', phead1, vs), nonullRetRefs(orl + phead1 ' + ps[phead1].next ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[ps[phead1].next].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), vs[ps[phead1].next].next ∈ ps[ps[phead1].next, ps[ps[phead1].next].next:= vs[ps[phead1].next].next], phead ∈ ps, phead ∈ vs, vs[ps[phead1].next].next ∈ ps, vs[ps[phead1].next].next ∈ vs, ¬ dups(orl), ¬ ps[phead1].next ∈ orl, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead ∈ orl ∨ phead = phead1 ⊦ noowns(tid, owns(vs[ps[phead1].next].next; None)) ∧ noid(tid, orl + phead1 ' + ps[phead1].next ' + vs[ps[phead1].next].next ', phead1, vs) ∧ nonullRetRefs(orl + phead1 ' + ps[phead1].next ' + vs[ps[phead1].next].next ', vs, vretRefs, pretRefs) ∧ ¬ vs[ps[phead1].next].next ∈ orl ∧ vs[ps[phead1].next].next ≠ phead1 ∧ vs[ps[phead1].next].next ≠ ps[phead1].next ∧ listp (orl + phead1 ' + ps[phead1].next ' + vs[ps[phead1].next].next ', vs, ps[ps[phead1].next, ps[ps[phead1].next].next:= vs[ps[phead1].next].next], owns(vs[ps[phead1].next].next; None)) |
vs[vs[ps[phead1].next].next].deqID = None, vs[vs[ps[phead1].next].next].next = null, ps[ps[phead1].next].next = null, ps[vs[ps[phead1].next].next] = vs[vs[ps[phead1].next].next], dom vrvHp = dom prvHp, owns(vs[ps[phead1].next].next) = Weak(tid), vs[ps[phead1].next].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead1 ' + ps[phead1].next ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + ps[phead1].next ', phead1, vs), nonullRetRefs(orl + phead1 ' + ps[phead1].next ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[ps[phead1].next].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), vs[ps[phead1].next].next ∈ vs, vs[ps[phead1].next].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[ps[phead1].next].next ∈ ps[ps[phead1].next, ps[ps[phead1].next].next:= vs[ps[phead1].next].next], ¬ dups(orl), ¬ noowns(tid, owns(vs[ps[phead1].next].next; None)), ¬ ps[phead1].next ∈ orl, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead ∈ orl ∨ phead = phead1 ⊦
vs[vs[ps[phead1].next].next].deqID = None, vs[vs[ps[phead1].next].next].next = null, ps[ps[phead1].next].next = null, ps[vs[ps[phead1].next].next] = vs[vs[ps[phead1].next].next], dom vrvHp = dom prvHp, owns(vs[ps[phead1].next].next) = Weak(tid), vs[ps[phead1].next].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead1 ' + ps[phead1].next ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + ps[phead1].next ', phead1, vs), nonullRetRefs(orl + phead1 ' + ps[phead1].next ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[ps[phead1].next].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), vs[ps[phead1].next].next ∈ orl, vs[ps[phead1].next].next ∈ vs, vs[ps[phead1].next].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[ps[phead1].next].next ∈ ps[ps[phead1].next, ps[ps[phead1].next].next:= vs[ps[phead1].next].next], ¬ dups(orl), ¬ ps[phead1].next ∈ orl, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead ∈ orl ∨ phead = phead1 ⊦
vs[vs[ps[phead1].next].next].deqID = None, vs[vs[ps[phead1].next].next].next = null, ps[ps[phead1].next].next = null, ps[vs[ps[phead1].next].next] = vs[vs[ps[phead1].next].next], dom vrvHp = dom prvHp, owns(vs[ps[phead1].next].next) = Weak(tid), vs[ps[phead1].next].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead1 ' + ps[phead1].next ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + ps[phead1].next ', phead1, vs), nonullRetRefs(orl + phead1 ' + ps[phead1].next ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[ps[phead1].next].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), vs[ps[phead1].next].next ∈ vs, vs[ps[phead1].next].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[ps[phead1].next].next ∈ ps[ps[phead1].next, ps[ps[phead1].next].next:= vs[ps[phead1].next].next], ¬ dups(orl), ¬ listp (orl + phead1 ' + ps[phead1].next ' + vs[ps[phead1].next].next ', vs, ps[ps[phead1].next, ps[ps[phead1].next].next:= vs[ps[phead1].next].next], owns(vs[ps[phead1].next].next; None)), ¬ ps[phead1].next ∈ orl, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead ∈ orl ∨ phead = phead1 ⊦
Used simplifier rules: ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ nonullRetRefs(rl, vs, vretRefs, pretRefs) → ( nonullRetRefs(rl0, vs0, vretRefs0, pretRefs0) ↔ (∀ r. ( r ∈ rl ∧ r ≠ rl.head ∧ vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null) → r ∈ rl0 ∧ r ≠ rl0.head ∧ vs0[r].deqID ≠ None → vretRefs0(vs0[r].deqID.tid) ≠ null ∧ pretRefs0(vs0[r].deqID.tid) ≠ null)); (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ (x + a ' + y).head = (x + a ').head; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ noid(tid, rl, r, vs) → ( noid(tid, rl0, r, vs0) ↔ (∀ r0. (r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) → r0 ≠ r ∧ r0 ∈ rl0 from r → vs0[r0].deqID ≠ Some(tid))); (ss) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s) ⊦ None ≠ Some(tid); (s)
| vs[vs[ps[phead1].next].next].deqID = None, vs[vs[ps[phead1].next].next].next = null, ps[ps[phead1].next].next = null, ps[vs[ps[phead1].next].next] = vs[vs[ps[phead1].next].next], dom vrvHp = dom prvHp, owns(vs[ps[phead1].next].next) = Weak(tid), vs[ps[phead1].next].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead1 ' + ps[phead1].next ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + ps[phead1].next ', phead1, vs), nonullRetRefs(orl + phead1 ' + ps[phead1].next ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[ps[phead1].next].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), vs[ps[phead1].next].next ∈ vs, vs[ps[phead1].next].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[ps[phead1].next].next ∈ ps[ps[phead1].next, ps[ps[phead1].next].next:= vs[ps[phead1].next].next], ¬ dups(orl), ¬ noowns(tid, owns(vs[ps[phead1].next].next; None)), ¬ ps[phead1].next ∈ orl, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead ∈ orl ∨ phead = phead1 ⊦ |
⊦ oneweakowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Weak(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)
vs[vs[ps[phead1].next].next].deqID = None, ps[ps[phead1].next].next = null, vs[vs[ps[phead1].next].next].next = null, ps[vs[ps[phead1].next].next] = vs[vs[ps[phead1].next].next], dom vrvHp = dom prvHp, owns(vs[ps[phead1].next].next) = Weak(tid), vs[ps[phead1].next].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead1 ' + ps[phead1].next ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + ps[phead1].next ', phead1, vs), nonullRetRefs(orl + phead1 ' + ps[phead1].next ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), vs[ps[phead1].next].next ∈ ps[ps[phead1].next, ps[ps[phead1].next].next:= vs[ps[phead1].next].next], phead ∈ ps, phead ∈ vs, vs[ps[phead1].next].next ∈ vs, vs[ps[phead1].next].next ∈ ps, ¬ dups(orl), ¬ noowns(tid, owns(vs[ps[phead1].next].next; None)), ¬ ps[phead1].next ∈ orl, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), ∀ r0. r0 ≠ vs[ps[phead1].next].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, phead ∈ orl ∨ phead = phead1 ⊦
Used terms: ps, tid, owns, vs[ps[phead1].next].next, vs
| ⊦ oneweakowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Weak(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid) |
| vs[vs[ps[phead1].next].next].deqID = None, ps[ps[phead1].next].next = null, vs[vs[ps[phead1].next].next].next = null, ps[vs[ps[phead1].next].next] = vs[vs[ps[phead1].next].next], dom vrvHp = dom prvHp, owns(vs[ps[phead1].next].next) = Weak(tid), vs[ps[phead1].next].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead1 ' + ps[phead1].next ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + ps[phead1].next ', phead1, vs), nonullRetRefs(orl + phead1 ' + ps[phead1].next ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), vs[ps[phead1].next].next ∈ ps[ps[phead1].next, ps[ps[phead1].next].next:= vs[ps[phead1].next].next], phead ∈ ps, phead ∈ vs, vs[ps[phead1].next].next ∈ vs, vs[ps[phead1].next].next ∈ ps, ¬ dups(orl), ¬ noowns(tid, owns(vs[ps[phead1].next].next; None)), ¬ ps[phead1].next ∈ orl, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), ∀ r0. r0 ≠ vs[ps[phead1].next].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, phead ∈ orl ∨ phead = phead1 ⊦ |
⊦ noowns(tid, owns) ↔ (∀ r. owns(r) ≠ None → owns(r).tid ≠ tid)
vs[vs[ps[phead1].next].next].deqID = None, vs[vs[ps[phead1].next].next].next = null, ps[ps[phead1].next].next = null, ps[vs[ps[phead1].next].next] = vs[vs[ps[phead1].next].next], dom vrvHp = dom prvHp, owns(vs[ps[phead1].next].next) = Weak(tid), vs[ps[phead1].next].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead1 ' + ps[phead1].next ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + ps[phead1].next ', phead1, vs), nonullRetRefs(orl + phead1 ' + ps[phead1].next ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), vs[ps[phead1].next].next ∈ ps, vs[ps[phead1].next].next ∈ vs, phead ∈ vs, phead ∈ ps, vs[ps[phead1].next].next ∈ ps[ps[phead1].next, ps[ps[phead1].next].next:= vs[ps[phead1].next].next], ¬ dups(orl), ¬ ps[phead1].next ∈ orl, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), ∀ r0. r0 ≠ vs[ps[phead1].next].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, ∃ r. ¬(owns(vs[ps[phead1].next].next; None)(r) ≠ None → owns(vs[ps[phead1].next].next; None)(r).tid ≠ tid), phead ∈ orl ∨ phead = phead1 ⊦
Used terms: tid, owns(vs[ps[phead1].next].next; None)
| ⊦ noowns(tid, owns) ↔ (∀ r. owns(r) ≠ None → owns(r).tid ≠ tid) |
| vs[vs[ps[phead1].next].next].deqID = None, vs[vs[ps[phead1].next].next].next = null, ps[ps[phead1].next].next = null, ps[vs[ps[phead1].next].next] = vs[vs[ps[phead1].next].next], dom vrvHp = dom prvHp, owns(vs[ps[phead1].next].next) = Weak(tid), vs[ps[phead1].next].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead1 ' + ps[phead1].next ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + ps[phead1].next ', phead1, vs), nonullRetRefs(orl + phead1 ' + ps[phead1].next ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), vs[ps[phead1].next].next ∈ ps, vs[ps[phead1].next].next ∈ vs, phead ∈ vs, phead ∈ ps, vs[ps[phead1].next].next ∈ ps[ps[phead1].next, ps[ps[phead1].next].next:= vs[ps[phead1].next].next], ¬ dups(orl), ¬ ps[phead1].next ∈ orl, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), ∀ r0. r0 ≠ vs[ps[phead1].next].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, ∃ r. ¬(owns(vs[ps[phead1].next].next; None)(r) ≠ None → owns(vs[ps[phead1].next].next; None)(r).tid ≠ tid), phead ∈ orl ∨ phead = phead1 ⊦ |
vs[vs[ps[phead1].next].next].deqID = None, ps[ps[phead1].next].next = null, vs[vs[ps[phead1].next].next].next = null, ps[vs[ps[phead1].next].next] = vs[vs[ps[phead1].next].next], dom vrvHp = dom prvHp, owns(vs[ps[phead1].next].next) = Weak(owns(r).tid), vs[ps[phead1].next].next ≠ null, ps[phead1].next ≠ phead1, vs[ps[phead1].next].next ≠ r, None ≠ owns(r), phead ≠ ps[phead1].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead1 ' + ps[phead1].next ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(owns(r).tid, phead1, vs), noid(owns(r).tid, orl + phead1 ' + ps[phead1].next ', phead1, vs), nonullRetRefs(orl + phead1 ' + ps[phead1].next ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), vs[ps[phead1].next].next ∈ ps[ps[phead1].next, ps[ps[phead1].next].next:= vs[ps[phead1].next].next], phead ∈ ps, phead ∈ vs, vs[ps[phead1].next].next ∈ vs, vs[ps[phead1].next].next ∈ ps, ¬ dups(orl), ¬ ps[phead1].next ∈ orl, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), ∀ r0. r0 ≠ vs[ps[phead1].next].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ owns(r).tid, phead ∈ orl ∨ phead = phead1 ⊦
| vs[vs[ps[phead1].next].next].deqID = None, ps[ps[phead1].next].next = null, vs[vs[ps[phead1].next].next].next = null, ps[vs[ps[phead1].next].next] = vs[vs[ps[phead1].next].next], dom vrvHp = dom prvHp, owns(vs[ps[phead1].next].next) = Weak(owns(r).tid), vs[ps[phead1].next].next ≠ null, ps[phead1].next ≠ phead1, vs[ps[phead1].next].next ≠ r, None ≠ owns(r), phead ≠ ps[phead1].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead1 ' + ps[phead1].next ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(owns(r).tid, phead1, vs), noid(owns(r).tid, orl + phead1 ' + ps[phead1].next ', phead1, vs), nonullRetRefs(orl + phead1 ' + ps[phead1].next ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), vs[ps[phead1].next].next ∈ ps[ps[phead1].next, ps[ps[phead1].next].next:= vs[ps[phead1].next].next], phead ∈ ps, phead ∈ vs, vs[ps[phead1].next].next ∈ vs, vs[ps[phead1].next].next ∈ ps, ¬ dups(orl), ¬ ps[phead1].next ∈ orl, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), ∀ r0. r0 ≠ vs[ps[phead1].next].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ owns(r).tid, phead ∈ orl ∨ phead = phead1 ⊦ |
Used terms: r
| vs[vs[ps[phead1].next].next].deqID = None, vs[vs[ps[phead1].next].next].next = null, ps[ps[phead1].next].next = null, ps[vs[ps[phead1].next].next] = vs[vs[ps[phead1].next].next], dom vrvHp = dom prvHp, owns(vs[ps[phead1].next].next) = Weak(tid), vs[ps[phead1].next].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead1 ' + ps[phead1].next ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + ps[phead1].next ', phead1, vs), nonullRetRefs(orl + phead1 ' + ps[phead1].next ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[ps[phead1].next].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), vs[ps[phead1].next].next ∈ orl, vs[ps[phead1].next].next ∈ vs, vs[ps[phead1].next].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[ps[phead1].next].next ∈ ps[ps[phead1].next, ps[ps[phead1].next].next:= vs[ps[phead1].next].next], ¬ dups(orl), ¬ ps[phead1].next ∈ orl, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead ∈ orl ∨ phead = phead1 ⊦ |
vs[vs[ps[phead1].next].next].deqID = None, ps[ps[phead1].next].next = null, vs[vs[ps[phead1].next].next].next = null, ps[vs[ps[phead1].next].next] = vs[vs[ps[phead1].next].next], dom vrvHp = dom prvHp, owns(vs[ps[phead1].next].next) = Weak(tid), vs[ps[phead1].next].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead1 ' + ps[phead1].next ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + ps[phead1].next ', phead1, vs), nonullRetRefs(orl + phead1 ' + ps[phead1].next ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[ps[phead1].next].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), vs[ps[phead1].next].next ∈ ps[ps[phead1].next, ps[ps[phead1].next].next:= vs[ps[phead1].next].next], phead ∈ ps, phead ∈ vs, vs[ps[phead1].next].next ∈ orl, vs[ps[phead1].next].next ∈ vs, vs[ps[phead1].next].next ∈ ps, ¬ dups(orl), ¬ ps[phead1].next ∈ orl, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead ∈ orl ∨ phead = phead1 ⊦
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
| vs[vs[ps[phead1].next].next].deqID = None, ps[ps[phead1].next].next = null, vs[vs[ps[phead1].next].next].next = null, ps[vs[ps[phead1].next].next] = vs[vs[ps[phead1].next].next], dom vrvHp = dom prvHp, owns(vs[ps[phead1].next].next) = Weak(tid), vs[ps[phead1].next].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead1 ' + ps[phead1].next ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + ps[phead1].next ', phead1, vs), nonullRetRefs(orl + phead1 ' + ps[phead1].next ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[ps[phead1].next].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), vs[ps[phead1].next].next ∈ ps[ps[phead1].next, ps[ps[phead1].next].next:= vs[ps[phead1].next].next], phead ∈ ps, phead ∈ vs, vs[ps[phead1].next].next ∈ orl, vs[ps[phead1].next].next ∈ vs, vs[ps[phead1].next].next ∈ ps, ¬ dups(orl), ¬ ps[phead1].next ∈ orl, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead ∈ orl ∨ phead = phead1 ⊦ |
⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z))
Used simplifier rules: ⊦ a + x = a ' + x; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ some?(opttid) → opttid ≠ None; (as) Used terms: vs[ps[phead1].next].next, orl
| ⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z)) |
| vs[vs[ps[phead1].next].next].deqID = None, vs[vs[ps[phead1].next].next].next = null, ps[ps[phead1].next].next = null, ps[vs[ps[phead1].next].next] = vs[vs[ps[phead1].next].next], dom vrvHp = dom prvHp, owns(vs[ps[phead1].next].next) = Weak(tid), vs[ps[phead1].next].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead1 ' + ps[phead1].next ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + ps[phead1].next ', phead1, vs), nonullRetRefs(orl + phead1 ' + ps[phead1].next ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[ps[phead1].next].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), vs[ps[phead1].next].next ∈ vs, vs[ps[phead1].next].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[ps[phead1].next].next ∈ ps[ps[phead1].next, ps[ps[phead1].next].next:= vs[ps[phead1].next].next], ¬ dups(orl), ¬ listp (orl + phead1 ' + ps[phead1].next ' + vs[ps[phead1].next].next ', vs, ps[ps[phead1].next, ps[ps[phead1].next].next:= vs[ps[phead1].next].next], owns(vs[ps[phead1].next].next; None)), ¬ ps[phead1].next ∈ orl, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead ∈ orl ∨ phead = phead1 ⊦ |
⊦ listp(rl, vs, ps, owns) ∧ r ≠ null ∧ r ∈ vs ∧ r ∈ ps → (listp(rl + r ', vs, ps[rl.last, ps[rl.last].next:= r], owns(r; None)) ↔ vs[rl.last].next = r ∧ ps[r].next = null ∧ ps[r].deqID = None)
Used simplifier rules: ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, orl + phead1 ' + ps[phead1].next ', owns, vs[ps[phead1].next].next, vs
| ⊦ listp(rl, vs, ps, owns) ∧ r ≠ null ∧ r ∈ vs ∧ r ∈ ps → (listp(rl + r ', vs, ps[rl.last, ps[rl.last].next:= r], owns(r; None)) ↔ vs[rl.last].next = r ∧ ps[r].next = null ∧ ps[r].deqID = None) |
| qrl + vs[qrl.last].next ' = phead0 ' + qrl0, vs[vs[qrl.last].next].deqID = None, ps[qrl.last].next = null, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, owns(vs[qrl.last].next) = Weak(tid), vs[qrl.last].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, qrl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + qrl, phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[qrl.last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vs[qrl.last].next ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], phead ∈ ps, phead ∈ vs, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ phead1 ∈ orl, ¬ phead1 ∈ qrl, ¬ ps[phead1].next ∈ qrl, ¬ ps[phead1].next ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ qrl ∨ phead0 = vs[qrl.last].next, phead ∈ orl ∨ phead = phead1, vs[qrl.last].next = phead0 ∨ vs[qrl.last].next ∈ qrl0 ⊦ noowns(tid, owns(vs[qrl.last].next; None)) ∧ noid(tid, ((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, phead1, vs) ∧ nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][vs[qrl.last].next].deqID = None ∧ unmarkedp(qrl, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ markedp(orl, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ some?(ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][phead1].deqID) ∧ some?(ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][ps[phead1].next].deqID) ∧ ¬ vs[qrl.last].next ∈ qrl ∧ ¬ vs[qrl.last].next ∈ orl ∧ vs[qrl.last].next ≠ phead1 ∧ vs[qrl.last].next ≠ ps[phead1].next ∧ listp (((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)) ∧ (qrl.last ∈ orl ∨ qrl.last = phead1 ∨ qrl.last = ps[phead1].next ∨ qrl.last ∈ qrl ∨ qrl.last = vs[qrl.last].next) |
qrl + vs[qrl.last].next ' = phead0 ' + qrl0, vs[vs[qrl.last].next].deqID = None, ps[qrl.last].next = null, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, owns(vs[qrl.last].next) = Weak(tid), ps[phead1].next ≠ phead1, vs[qrl.last].next ≠ null, vs[qrl.last].next ≠ phead1, phead ≠ ps[phead1].next, qrl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + qrl, phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[qrl.last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead0 ∈ qrl, vs[qrl.last].next ∈ qrl0, vs[qrl.last].next ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], phead ∈ ps, phead ∈ vs, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ ps[phead1].next ∈ orl, ¬ ps[phead1].next ∈ qrl, ¬ phead1 ∈ qrl, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead ∈ orl ∨ phead = phead1 ⊦ listp (((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)) ∧ vs[qrl.last].next ≠ ps[phead1].next ∧ ¬ vs[qrl.last].next ∈ orl ∧ ¬ vs[qrl.last].next ∈ qrl ∧ some?(ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][ps[phead1].next].deqID) ∧ some?(ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][phead1].deqID) ∧ markedp(orl, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ unmarkedp(qrl, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][vs[qrl.last].next].deqID = None ∧ nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ noid(tid, ((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, phead1, vs) ∧ noowns(tid, owns(vs[qrl.last].next; None))
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ a ∈ x → a ∈ x + y; (s) ⊦ a ∈ y → a ∈ x + y; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] inapp-08: ⊦ a ' + x = y + b ' ∧ y ≠ [] → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] ⊦ x.last ∈ x ↔ x ≠ []; (s)
| qrl + vs[qrl.last].next ' = phead0 ' + qrl0, vs[vs[qrl.last].next].deqID = None, ps[qrl.last].next = null, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, owns(vs[qrl.last].next) = Weak(tid), ps[phead1].next ≠ phead1, vs[qrl.last].next ≠ null, vs[qrl.last].next ≠ phead1, phead ≠ ps[phead1].next, qrl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + qrl, phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[qrl.last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead0 ∈ qrl, vs[qrl.last].next ∈ qrl0, vs[qrl.last].next ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], phead ∈ ps, phead ∈ vs, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ ps[phead1].next ∈ orl, ¬ ps[phead1].next ∈ qrl, ¬ phead1 ∈ qrl, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead ∈ orl ∨ phead = phead1 ⊦ listp (((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)) ∧ vs[qrl.last].next ≠ ps[phead1].next ∧ ¬ vs[qrl.last].next ∈ orl ∧ ¬ vs[qrl.last].next ∈ qrl ∧ some?(ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][ps[phead1].next].deqID) ∧ some?(ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][phead1].deqID) ∧ markedp(orl, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ unmarkedp(qrl, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][vs[qrl.last].next].deqID = None ∧ nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ noid(tid, ((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, phead1, vs) ∧ noowns(tid, owns(vs[qrl.last].next; None)) |
qrl + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), qrl = orl0 + phead2 ', ps[phead1].next ≠ phead1, vs[phead2].next ≠ null, vs[phead2].next ≠ phead1, phead ≠ ps[phead1].next, qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((orl + phead1 ') + ps[phead1].next ') + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + qrl, phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), phead0 ∈ ps, phead0 ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, phead0 ∈ qrl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ ps[phead1].next ∈ orl, ¬ ps[phead1].next ∈ qrl, ¬ phead1 ∈ qrl, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead ∈ orl ∨ phead = phead1 ⊦ listp(((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, ps[phead2, ps[phead2].next:= vs[phead2].next], owns(vs[phead2].next; None)) ∧ vs[phead2].next ≠ ps[phead1].next ∧ ¬ vs[phead2].next ∈ orl ∧ ¬ vs[phead2].next ∈ qrl ∧ some?(ps[phead2, ps[phead2].next:= vs[phead2].next][ps[phead1].next].deqID) ∧ some?(ps[phead2, ps[phead2].next:= vs[phead2].next][phead1].deqID) ∧ markedp(orl, ps[phead2, ps[phead2].next:= vs[phead2].next]) ∧ unmarkedp(qrl, ps[phead2, ps[phead2].next:= vs[phead2].next]) ∧ ps[phead2, ps[phead2].next:= vs[phead2].next][vs[phead2].next].deqID = None ∧ nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ noid(tid, ((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, phead1, vs) ∧ noowns(tid, owns(vs[phead2].next; None))
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl, phead2, y
| qrl + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), qrl = orl0 + phead2 ', ps[phead1].next ≠ phead1, vs[phead2].next ≠ null, vs[phead2].next ≠ phead1, phead ≠ ps[phead1].next, qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((orl + phead1 ') + ps[phead1].next ') + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + qrl, phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), phead0 ∈ ps, phead0 ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, phead0 ∈ qrl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ ps[phead1].next ∈ orl, ¬ ps[phead1].next ∈ qrl, ¬ phead1 ∈ qrl, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead ∈ orl ∨ phead = phead1 ⊦ listp(((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, ps[phead2, ps[phead2].next:= vs[phead2].next], owns(vs[phead2].next; None)) ∧ vs[phead2].next ≠ ps[phead1].next ∧ ¬ vs[phead2].next ∈ orl ∧ ¬ vs[phead2].next ∈ qrl ∧ some?(ps[phead2, ps[phead2].next:= vs[phead2].next][ps[phead1].next].deqID) ∧ some?(ps[phead2, ps[phead2].next:= vs[phead2].next][phead1].deqID) ∧ markedp(orl, ps[phead2, ps[phead2].next:= vs[phead2].next]) ∧ unmarkedp(qrl, ps[phead2, ps[phead2].next:= vs[phead2].next]) ∧ ps[phead2, ps[phead2].next:= vs[phead2].next][vs[phead2].next].deqID = None ∧ nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ noid(tid, ((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, phead1, vs) ∧ noowns(tid, owns(vs[phead2].next; None)) |
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ orl0 ∨ phead0 = phead2, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next ⊦ listp(((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, ps[phead2, ps[phead2].next:= vs[phead2].next], owns(vs[phead2].next; None)) ∧ vs[phead2].next ≠ ps[phead1].next ∧ ¬ vs[phead2].next ∈ orl ∧ ¬ vs[phead2].next ∈ orl0 ∧ vs[phead2].next ≠ phead2 ∧ nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ noid(tid, ((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, phead1, vs) ∧ noowns(tid, owns(vs[phead2].next; None))
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ y → a ∈ x + y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ≠ b → st[b, d][a] = st[a]; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ ¬ node ∈ rl → (unmarkedp(rl, vs[node, nd]) ↔ unmarkedp(rl, vs)); (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ ¬ node ∈ rl → (markedp(rl, vs[node, nd]) ↔ markedp(rl, vs)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ orl0 ∨ phead0 = phead2, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next ⊦ listp(((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, ps[phead2, ps[phead2].next:= vs[phead2].next], owns(vs[phead2].next; None)) ∧ vs[phead2].next ≠ ps[phead1].next ∧ ¬ vs[phead2].next ∈ orl ∧ ¬ vs[phead2].next ∈ orl0 ∧ vs[phead2].next ≠ phead2 ∧ nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ noid(tid, ((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, phead1, vs) ∧ noowns(tid, owns(vs[phead2].next; None)) |
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ listp(((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, ps[phead2, ps[phead2].next:= vs[phead2].next], owns(vs[phead2].next; None)), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ⊦
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ orl, vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ⊦
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ orl0, vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ⊦
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, vretRefs, pretRefs), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ⊦
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ noid(tid, ((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, phead1, vs), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ⊦
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ noowns(tid, owns(vs[phead2].next; None)), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ⊦
Used simplifier rules: in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ some?(opttid) → opttid ≠ None; (as)
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ listp(((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, ps[phead2, ps[phead2].next:= vs[phead2].next], owns(vs[phead2].next; None)), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ⊦ |
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ listp (((orl + phead1 ') + ps[phead1].next ') + (orl0 + phead2 ') + vs[phead2].next ', vs, ps[phead2, ps[phead2].next:= vs[phead2].next], owns(vs[phead2].next; None)), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ orl0 ∨ phead0 = phead2, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next ⊦
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ listp (((orl + phead1 ') + ps[phead1].next ') + (orl0 + phead2 ') + vs[phead2].next ', vs, ps[phead2, ps[phead2].next:= vs[phead2].next], owns(vs[phead2].next; None)), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ orl0 ∨ phead0 = phead2, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next ⊦ |
⊦ listp(rl, vs, ps, owns) ∧ r ≠ null ∧ r ∈ vs ∧ r ∈ ps → (listp(rl + r ', vs, ps[rl.last, ps[rl.last].next:= r], owns(r; None)) ↔ vs[rl.last].next = r ∧ ps[r].next = null ∧ ps[r].deqID = None)
Used simplifier rules: ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', owns, vs[phead2].next, vs
| ⊦ listp(rl, vs, ps, owns) ∧ r ≠ null ∧ r ∈ vs ∧ r ∈ ps → (listp(rl + r ', vs, ps[rl.last, ps[rl.last].next:= r], owns(r; None)) ↔ vs[rl.last].next = r ∧ ps[r].next = null ∧ ps[r].deqID = None) |
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ orl, vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ⊦ |
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, vs[phead2].next ∈ orl, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ orl0 ∨ phead0 = phead2, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next ⊦
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
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, vs[phead2].next ∈ orl, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ orl0 ∨ phead0 = phead2, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next ⊦ |
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, orl0 = [], owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, vs[phead2].next ∈ orl, vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ⊦
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, orl0 = phead3 + orl1, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, vs[phead2].next ∈ orl, vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ⊦
Used simplifier rules: reflist freely generated by [], +;;
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, orl0 = [], owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, vs[phead2].next ∈ orl, vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ⊦ |
vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[phead0].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[phead1].next ≠ phead1, vs[phead0].next ≠ null, vs[phead0].next ≠ phead1, ps[phead1].next ≠ phead0, phead ≠ ps[phead1].next, phead1 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead1 ' + ps[phead1].next ' + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + ps[phead1].next ' + phead0 ', phead1, vs), nonullRetRefs(orl + phead1 ' + ps[phead1].next ' + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), vs[phead0].next ∈ orl, vs[phead0].next ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, ¬ dups(orl), ¬ phead1 ∈ orl, ¬ phead0 ∈ orl, ¬ ps[phead1].next ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead ∈ orl ∨ phead = phead1 ⊦
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 ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s) ⊦ [] + x = x; (s) ⊦ unmarkedp([], vs); (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)
| vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[phead0].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), ps[phead1].next ≠ phead1, vs[phead0].next ≠ null, vs[phead0].next ≠ phead1, ps[phead1].next ≠ phead0, phead ≠ ps[phead1].next, phead1 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead1 ' + ps[phead1].next ' + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + ps[phead1].next ' + phead0 ', phead1, vs), nonullRetRefs(orl + phead1 ' + ps[phead1].next ' + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), vs[phead0].next ∈ orl, vs[phead0].next ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, ¬ dups(orl), ¬ phead1 ∈ orl, ¬ phead0 ∈ orl, ¬ ps[phead1].next ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead ∈ orl ∨ phead = phead1 ⊦ |
⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z))
Used simplifier rules: ⊦ a + x = a ' + x; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ some?(opttid) → opttid ≠ None; (as) Used terms: vs[phead0].next, orl
| ⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z)) |
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, orl0 = phead3 + orl1, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, vs[phead2].next ∈ orl, vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ⊦ |
ps[ps[ps[phead1].next].next].deqID = None, vs[ps[ps[phead1].next].next].deqID = None, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ ps[ps[phead1].next].next, ps[phead1].next ≠ phead1, vs[phead2].next ≠ null, vs[phead2].next ≠ phead1, ps[phead1].next ≠ phead2, phead ≠ ps[phead1].next, phead1 ≠ ps[ps[phead1].next].next, phead1 ≠ phead2, phead2 ≠ ps[ps[phead1].next].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead1 ' + ps[phead1].next ' + (ps[ps[phead1].next].next ' + orl1) + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + ps[phead1].next ' + (ps[ps[phead1].next].next ' + orl1) + phead2 ', phead1, vs), nonullRetRefs(orl + phead1 ' + ps[phead1].next ' + (ps[ps[phead1].next].next ' + orl1) + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, vs), vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, vs[phead2].next ∈ orl, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, ps[ps[phead1].next].next ∈ vs, ps[ps[phead1].next].next ∈ ps, ¬ dups(orl1), ¬ dups(orl), ¬ dups(orl + orl1), ¬ phead2 ∈ orl1, ¬ phead2 ∈ orl, ¬ ps[phead1].next ∈ orl, ¬ ps[phead1].next ∈ orl1, ¬ phead1 ∈ orl1, ¬ ps[ps[phead1].next].next ∈ orl, ¬ ps[ps[phead1].next].next ∈ orl1, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead ∈ orl ∨ phead = phead1 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (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 in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[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) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)
| ps[ps[ps[phead1].next].next].deqID = None, vs[ps[ps[phead1].next].next].deqID = None, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ ps[ps[phead1].next].next, ps[phead1].next ≠ phead1, vs[phead2].next ≠ null, vs[phead2].next ≠ phead1, ps[phead1].next ≠ phead2, phead ≠ ps[phead1].next, phead1 ≠ ps[ps[phead1].next].next, phead1 ≠ phead2, phead2 ≠ ps[ps[phead1].next].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead1 ' + ps[phead1].next ' + (ps[ps[phead1].next].next ' + orl1) + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + ps[phead1].next ' + (ps[ps[phead1].next].next ' + orl1) + phead2 ', phead1, vs), nonullRetRefs(orl + phead1 ' + ps[phead1].next ' + (ps[ps[phead1].next].next ' + orl1) + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, vs), vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, vs[phead2].next ∈ orl, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, ps[ps[phead1].next].next ∈ vs, ps[ps[phead1].next].next ∈ ps, ¬ dups(orl1), ¬ dups(orl), ¬ dups(orl + orl1), ¬ phead2 ∈ orl1, ¬ phead2 ∈ orl, ¬ ps[phead1].next ∈ orl, ¬ ps[phead1].next ∈ orl1, ¬ phead1 ∈ orl1, ¬ ps[ps[phead1].next].next ∈ orl, ¬ ps[ps[phead1].next].next ∈ orl1, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead ∈ orl ∨ phead = phead1 ⊦ |
⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z))
Used simplifier rules: ⊦ a + x = a ' + x; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ some?(opttid) → opttid ≠ None; (as) Used terms: vs[phead2].next, orl
| ⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z)) |
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ orl0, vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ⊦ |
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, vs[phead2].next ∈ orl0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ orl0 ∨ phead0 = phead2, phead ∈ orl ∨ phead = phead1 ⊦
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, vs[phead2].next ∈ orl0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ orl0 ∨ phead0 = phead2, phead ∈ orl ∨ phead = phead1 ⊦ |
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, orl0 = phead3 + orl1, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ orl0, vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ⊦
Used simplifier rules: reflist freely generated by [], +;; ⊦ [] + x = x; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ a ∈ []; (s)
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, orl0 = phead3 + orl1, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ orl0, vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ⊦ |
ps[ps[ps[phead1].next].next].deqID = None, vs[ps[ps[phead1].next].next].deqID = None, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ ps[ps[phead1].next].next, ps[phead1].next ≠ phead1, vs[phead2].next ≠ null, vs[phead2].next ≠ phead1, ps[phead1].next ≠ phead2, phead ≠ ps[phead1].next, phead1 ≠ ps[ps[phead1].next].next, phead1 ≠ phead2, phead2 ≠ ps[ps[phead1].next].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead1 ' + ps[phead1].next ' + (ps[ps[phead1].next].next ' + orl1) + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + ps[phead1].next ' + (ps[ps[phead1].next].next ' + orl1) + phead2 ', phead1, vs), nonullRetRefs(orl + phead1 ' + ps[phead1].next ' + (ps[ps[phead1].next].next ' + orl1) + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, vs), vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, ps[ps[phead1].next].next ∈ vs, ps[ps[phead1].next].next ∈ ps, ¬ dups(orl1), ¬ dups(orl), ¬ dups(orl + orl1), ¬ phead2 ∈ orl1, ¬ phead2 ∈ orl, ¬ ps[phead1].next ∈ orl, ¬ ps[phead1].next ∈ orl1, ¬ phead1 ∈ orl1, ¬ ps[ps[phead1].next].next ∈ orl, ¬ ps[ps[phead1].next].next ∈ orl1, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), vs[phead2].next = ps[ps[phead1].next].next ∨ vs[phead2].next ∈ orl1, phead ∈ orl ∨ phead = phead1 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (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 in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[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) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)
| ps[ps[ps[phead1].next].next].deqID = None, vs[ps[ps[phead1].next].next].deqID = None, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ ps[ps[phead1].next].next, ps[phead1].next ≠ phead1, vs[phead2].next ≠ null, vs[phead2].next ≠ phead1, ps[phead1].next ≠ phead2, phead ≠ ps[phead1].next, phead1 ≠ ps[ps[phead1].next].next, phead1 ≠ phead2, phead2 ≠ ps[ps[phead1].next].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead1 ' + ps[phead1].next ' + (ps[ps[phead1].next].next ' + orl1) + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + ps[phead1].next ' + (ps[ps[phead1].next].next ' + orl1) + phead2 ', phead1, vs), nonullRetRefs(orl + phead1 ' + ps[phead1].next ' + (ps[ps[phead1].next].next ' + orl1) + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, vs), vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, ps[ps[phead1].next].next ∈ vs, ps[ps[phead1].next].next ∈ ps, ¬ dups(orl1), ¬ dups(orl), ¬ dups(orl + orl1), ¬ phead2 ∈ orl1, ¬ phead2 ∈ orl, ¬ ps[phead1].next ∈ orl, ¬ ps[phead1].next ∈ orl1, ¬ phead1 ∈ orl1, ¬ ps[ps[phead1].next].next ∈ orl, ¬ ps[ps[phead1].next].next ∈ orl1, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), vs[phead2].next = ps[ps[phead1].next].next ∨ vs[phead2].next ∈ orl1, phead ∈ orl ∨ phead = phead1 ⊦ |
⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])
vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[ps[ps[phead1].next].next].deqID = None, ps[ps[ps[phead1].next].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ ps[ps[phead1].next].next, ps[phead1].next ≠ phead1, vs[phead2].next ≠ null, vs[phead2].next ≠ phead1, ps[phead1].next ≠ phead2, phead ≠ ps[phead1].next, phead1 ≠ ps[ps[phead1].next].next, phead1 ≠ phead2, phead2 ≠ ps[ps[phead1].next].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead1 ' + ps[phead1].next ' + (ps[ps[phead1].next].next ' + orl1) + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + ps[phead1].next ' + (ps[ps[phead1].next].next ' + orl1) + phead2 ', phead1, vs), nonullRetRefs(orl + phead1 ' + ps[phead1].next ' + (ps[ps[phead1].next].next ' + orl1) + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), ps[ps[phead1].next].next ∈ ps, ps[ps[phead1].next].next ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], ¬ dups(orl1), ¬ dups(orl), ¬ dups(orl + orl1), ¬ phead2 ∈ orl1, ¬ phead2 ∈ orl, ¬ ps[phead1].next ∈ orl, ¬ ps[phead1].next ∈ orl1, ¬ phead1 ∈ orl1, ¬ ps[ps[phead1].next].next ∈ orl, ¬ ps[ps[phead1].next].next ∈ orl1, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), listp(orl + phead1 ' + ps[phead1].next ' + ps[ps[phead1].next].next ' + orl1 + phead2 ', vs, ps, owns) → ( listp(phead1 ' + ps[phead1].next ' + ps[ps[phead1].next].next ' + orl1 + phead2 ', vs, ps, owns) ↔ phead1 ' + ps[phead1].next ' + ps[ps[phead1].next].next ' + orl1 + phead2 ' ≠ []), phead ∈ orl ∨ phead = phead1, vs[phead2].next = ps[ps[phead1].next].next ∨ vs[phead2].next ∈ orl1 ⊦
Used terms: ps, orl, owns, phead1 ' + ps[phead1].next ' + ps[ps[phead1].next].next ' + orl1 + phead2 ', vs
| ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []) |
| vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[ps[ps[phead1].next].next].deqID = None, ps[ps[ps[phead1].next].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ ps[ps[phead1].next].next, ps[phead1].next ≠ phead1, vs[phead2].next ≠ null, vs[phead2].next ≠ phead1, ps[phead1].next ≠ phead2, phead ≠ ps[phead1].next, phead1 ≠ ps[ps[phead1].next].next, phead1 ≠ phead2, phead2 ≠ ps[ps[phead1].next].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead1 ' + ps[phead1].next ' + (ps[ps[phead1].next].next ' + orl1) + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + ps[phead1].next ' + (ps[ps[phead1].next].next ' + orl1) + phead2 ', phead1, vs), nonullRetRefs(orl + phead1 ' + ps[phead1].next ' + (ps[ps[phead1].next].next ' + orl1) + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), ps[ps[phead1].next].next ∈ ps, ps[ps[phead1].next].next ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], ¬ dups(orl1), ¬ dups(orl), ¬ dups(orl + orl1), ¬ phead2 ∈ orl1, ¬ phead2 ∈ orl, ¬ ps[phead1].next ∈ orl, ¬ ps[phead1].next ∈ orl1, ¬ phead1 ∈ orl1, ¬ ps[ps[phead1].next].next ∈ orl, ¬ ps[ps[phead1].next].next ∈ orl1, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), listp(orl + phead1 ' + ps[phead1].next ' + ps[ps[phead1].next].next ' + orl1 + phead2 ', vs, ps, owns) → ( listp(phead1 ' + ps[phead1].next ' + ps[ps[phead1].next].next ' + orl1 + phead2 ', vs, ps, owns) ↔ phead1 ' + ps[phead1].next ' + ps[ps[phead1].next].next ' + orl1 + phead2 ' ≠ []), phead ∈ orl ∨ phead = phead1, vs[phead2].next = ps[ps[phead1].next].next ∨ vs[phead2].next ∈ orl1 ⊦ |
ps[vs[phead1].next].deqID = vs[vs[phead1].next].deqID, ps[phead1].deqID = vs[phead1].deqID, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[vs[phead1].next].next].deqID = None, ps[vs[vs[phead1].next].next].deqID = None, ps[vs[phead1].next].next = vs[vs[phead1].next].next, ps[phead1].next = vs[phead1].next, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead1].next].val = vs[vs[phead1].next].val, ps[phead1].val = vs[phead1].val, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead1].next) = None, owns(phead1) = None, owns(vs[phead2].next) = Weak(tid), rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), vs[phead1].next ≠ null, vs[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, vs[phead1].next ≠ phead1, vs[phead1].next ≠ vs[vs[phead1].next].next, phead ≠ vs[phead1].next, phead1 ≠ null, phead1 ≠ phead2, phead1 ≠ vs[vs[phead1].next].next, phead2 ≠ vs[vs[phead1].next].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[vs[phead1].next].next ' + orl1 + phead2 ', vs, ps, owns), listp(orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', phead1, vs), nonullRetRefs(orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[vs[phead1].next].deqID), some?(vs[phead1].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), vs[phead1].next ∈ ps, vs[phead1].next ∈ vs, phead1 ∈ ps, phead1 ∈ vs, vs[vs[phead1].next].next ∈ ps, vs[vs[phead1].next].next ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ weak?(vs[phead1].deqID), ¬ weak?(vs[vs[phead1].next].deqID), ¬ phead1 ∈ orl, ¬ vs[vs[phead1].next].next ∈ orl1, ¬ vs[vs[phead1].next].next ∈ orl, ¬ phead1 ∈ orl1, ¬ vs[phead1].next ∈ orl1, ¬ vs[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl1, phead ∈ orl ∨ phead = phead1, vs[phead2].next = vs[vs[phead1].next].next ∨ vs[phead2].next ∈ orl1 ⊦
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 ⊦ 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 ≠ []; (s)
| ps[vs[phead1].next].deqID = vs[vs[phead1].next].deqID, ps[phead1].deqID = vs[phead1].deqID, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[vs[phead1].next].next].deqID = None, ps[vs[vs[phead1].next].next].deqID = None, ps[vs[phead1].next].next = vs[vs[phead1].next].next, ps[phead1].next = vs[phead1].next, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead1].next].val = vs[vs[phead1].next].val, ps[phead1].val = vs[phead1].val, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead1].next) = None, owns(phead1) = None, owns(vs[phead2].next) = Weak(tid), rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), vs[phead1].next ≠ null, vs[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, vs[phead1].next ≠ phead1, vs[phead1].next ≠ vs[vs[phead1].next].next, phead ≠ vs[phead1].next, phead1 ≠ null, phead1 ≠ phead2, phead1 ≠ vs[vs[phead1].next].next, phead2 ≠ vs[vs[phead1].next].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[vs[phead1].next].next ' + orl1 + phead2 ', vs, ps, owns), listp(orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', phead1, vs), nonullRetRefs(orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[vs[phead1].next].deqID), some?(vs[phead1].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), vs[phead1].next ∈ ps, vs[phead1].next ∈ vs, phead1 ∈ ps, phead1 ∈ vs, vs[vs[phead1].next].next ∈ ps, vs[vs[phead1].next].next ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ weak?(vs[phead1].deqID), ¬ weak?(vs[vs[phead1].next].deqID), ¬ phead1 ∈ orl, ¬ vs[vs[phead1].next].next ∈ orl1, ¬ vs[vs[phead1].next].next ∈ orl, ¬ phead1 ∈ orl1, ¬ vs[phead1].next ∈ orl1, ¬ vs[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl1, phead ∈ orl ∨ phead = phead1, vs[phead2].next = vs[vs[phead1].next].next ∨ vs[phead2].next ∈ orl1 ⊦ |
ps[vs[vs[phead1].next].next].deqID = None, vs[vs[vs[phead1].next].next].deqID = None, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead1].deqID = vs[phead1].deqID, ps[vs[phead1].next].deqID = vs[vs[phead1].next].deqID, vs[vs[phead1].next].deqID = Some(tid0), ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[phead1].next = vs[phead1].next, ps[vs[phead1].next].next = vs[vs[phead1].next].next, ps[phead1].val = vs[phead1].val, ps[vs[phead1].next].val = vs[vs[phead1].next].val, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), owns(phead1) = None, owns(vs[phead1].next) = None, rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead1].next].val), vs[phead1].next ≠ null, vs[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, vs[phead1].next ≠ phead1, vs[phead1].next ≠ vs[vs[phead1].next].next, phead ≠ vs[phead1].next, phead1 ≠ null, phead1 ≠ phead2, phead1 ≠ vs[vs[phead1].next].next, phead2 ≠ vs[vs[phead1].next].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', vs, ps, owns), listp(vs[vs[phead1].next].next ' + orl1 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', phead1, vs), nonullRetRefs(orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(vs[vs[phead1].next].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, vs), vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, vs[vs[phead1].next].next ∈ vs, vs[vs[phead1].next].next ∈ ps, phead1 ∈ vs, phead1 ∈ ps, vs[phead1].next ∈ vs, vs[phead1].next ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ weak?(vs[phead1].deqID), ¬ weak?(vs[vs[phead1].next].deqID), ¬ phead1 ∈ orl, ¬ vs[vs[phead1].next].next ∈ orl1, ¬ vs[vs[phead1].next].next ∈ orl, ¬ phead1 ∈ orl1, ¬ vs[phead1].next ∈ orl1, ¬ vs[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl1, vs[phead2].next = vs[vs[phead1].next].next ∨ vs[phead2].next ∈ orl1, phead ∈ orl ∨ phead = phead1 ⊦
Used simplifier rules: ⊦ some?(opttid) → (tid = opttid.tid ↔ opttid = Some(tid)); (elim) Used terms: vs[vs[phead1].next].deqID, tid0
| ps[vs[vs[phead1].next].next].deqID = None, vs[vs[vs[phead1].next].next].deqID = None, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead1].deqID = vs[phead1].deqID, ps[vs[phead1].next].deqID = vs[vs[phead1].next].deqID, vs[vs[phead1].next].deqID = Some(tid0), ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[phead1].next = vs[phead1].next, ps[vs[phead1].next].next = vs[vs[phead1].next].next, ps[phead1].val = vs[phead1].val, ps[vs[phead1].next].val = vs[vs[phead1].next].val, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), owns(phead1) = None, owns(vs[phead1].next) = None, rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead1].next].val), vs[phead1].next ≠ null, vs[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, vs[phead1].next ≠ phead1, vs[phead1].next ≠ vs[vs[phead1].next].next, phead ≠ vs[phead1].next, phead1 ≠ null, phead1 ≠ phead2, phead1 ≠ vs[vs[phead1].next].next, phead2 ≠ vs[vs[phead1].next].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', vs, ps, owns), listp(vs[vs[phead1].next].next ' + orl1 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', phead1, vs), nonullRetRefs(orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(vs[vs[phead1].next].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, vs), vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, vs[vs[phead1].next].next ∈ vs, vs[vs[phead1].next].next ∈ ps, phead1 ∈ vs, phead1 ∈ ps, vs[phead1].next ∈ vs, vs[phead1].next ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ weak?(vs[phead1].deqID), ¬ weak?(vs[vs[phead1].next].deqID), ¬ phead1 ∈ orl, ¬ vs[vs[phead1].next].next ∈ orl1, ¬ vs[vs[phead1].next].next ∈ orl, ¬ phead1 ∈ orl1, ¬ vs[phead1].next ∈ orl1, ¬ vs[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl1, vs[phead2].next = vs[vs[phead1].next].next ∨ vs[phead2].next ∈ orl1, phead ∈ orl ∨ phead = phead1 ⊦ |
ps[vs[vs[phead1].next].next].deqID = None, vs[vs[vs[phead1].next].next].deqID = None, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead1].deqID = vs[phead1].deqID, ps[vs[phead1].next].deqID = Some(tid0), vs[vs[phead1].next].deqID = Some(tid0), ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[phead1].next = vs[phead1].next, ps[vs[phead1].next].next = vs[vs[phead1].next].next, ps[phead1].val = vs[phead1].val, ps[vs[phead1].next].val = vs[vs[phead1].next].val, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), owns(phead1) = None, owns(vs[phead1].next) = None, rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead1].next].val), vs[phead1].next ≠ vs[vs[phead1].next].next, vs[phead1].next ≠ phead1, vs[phead2].next ≠ null, vs[phead2].next ≠ phead1, vs[phead1].next ≠ phead2, vs[phead1].next ≠ null, phead ≠ vs[phead1].next, phead1 ≠ vs[vs[phead1].next].next, phead1 ≠ phead2, phead1 ≠ null, phead2 ≠ vs[vs[phead1].next].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', vs, ps, owns), listp(vs[vs[phead1].next].next ' + orl1 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', phead1, vs), nonullRetRefs(orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, vs), vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, vs[vs[phead1].next].next ∈ vs, vs[vs[phead1].next].next ∈ ps, phead1 ∈ vs, phead1 ∈ ps, vs[phead1].next ∈ vs, vs[phead1].next ∈ ps, ¬ dups(orl1), ¬ dups(orl), ¬ dups(orl + orl1), ¬ weak?(vs[phead1].deqID), ¬ phead2 ∈ orl1, ¬ phead2 ∈ orl, ¬ vs[phead1].next ∈ orl, ¬ vs[phead1].next ∈ orl1, ¬ phead1 ∈ orl1, ¬ vs[vs[phead1].next].next ∈ orl, ¬ vs[vs[phead1].next].next ∈ orl1, ¬ phead1 ∈ orl, vs[phead2].next = vs[vs[phead1].next].next ∨ vs[phead2].next ∈ orl1, phead ∈ orl ∨ phead = phead1 ⊦
Used simplifier rules: ⊦ ¬ weak?(Some(tid)); (s) ⊦ some?(Some(tid)); (s)
| ps[vs[vs[phead1].next].next].deqID = None, vs[vs[vs[phead1].next].next].deqID = None, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead1].deqID = vs[phead1].deqID, ps[vs[phead1].next].deqID = Some(tid0), vs[vs[phead1].next].deqID = Some(tid0), ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[phead1].next = vs[phead1].next, ps[vs[phead1].next].next = vs[vs[phead1].next].next, ps[phead1].val = vs[phead1].val, ps[vs[phead1].next].val = vs[vs[phead1].next].val, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), owns(phead1) = None, owns(vs[phead1].next) = None, rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead1].next].val), vs[phead1].next ≠ vs[vs[phead1].next].next, vs[phead1].next ≠ phead1, vs[phead2].next ≠ null, vs[phead2].next ≠ phead1, vs[phead1].next ≠ phead2, vs[phead1].next ≠ null, phead ≠ vs[phead1].next, phead1 ≠ vs[vs[phead1].next].next, phead1 ≠ phead2, phead1 ≠ null, phead2 ≠ vs[vs[phead1].next].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', vs, ps, owns), listp(vs[vs[phead1].next].next ' + orl1 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', phead1, vs), nonullRetRefs(orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, vs), vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, vs[vs[phead1].next].next ∈ vs, vs[vs[phead1].next].next ∈ ps, phead1 ∈ vs, phead1 ∈ ps, vs[phead1].next ∈ vs, vs[phead1].next ∈ ps, ¬ dups(orl1), ¬ dups(orl), ¬ dups(orl + orl1), ¬ weak?(vs[phead1].deqID), ¬ phead2 ∈ orl1, ¬ phead2 ∈ orl, ¬ vs[phead1].next ∈ orl, ¬ vs[phead1].next ∈ orl1, ¬ phead1 ∈ orl1, ¬ vs[vs[phead1].next].next ∈ orl, ¬ vs[vs[phead1].next].next ∈ orl1, ¬ phead1 ∈ orl, vs[phead2].next = vs[vs[phead1].next].next ∨ vs[phead2].next ∈ orl1, phead ∈ orl ∨ phead = phead1 ⊦ |
vs[vs[phead1].next].deqID = Some(tid0), ps[vs[phead1].next].deqID = Some(tid0), ps[phead1].deqID = vs[phead1].deqID, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[vs[phead1].next].next].deqID = None, ps[vs[vs[phead1].next].next].deqID = None, ps[vs[phead1].next].next = vs[vs[phead1].next].next, ps[phead1].next = vs[phead1].next, vs[vs[phead2].next].next = null, ps[phead2].next = null, vs[phead2].next = vs[vs[phead1].next].next, ps[vs[phead1].next].val = vs[vs[phead1].next].val, ps[phead1].val = vs[phead1].val, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead1].next) = None, owns(phead1) = None, owns(vs[phead2].next) = Weak(tid), rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead1].next].val), vs[phead1].next ≠ vs[vs[phead1].next].next, vs[phead1].next ≠ phead1, vs[phead2].next ≠ null, vs[phead2].next ≠ phead1, vs[phead1].next ≠ phead2, vs[phead1].next ≠ null, phead ≠ vs[phead1].next, phead1 ≠ vs[vs[phead1].next].next, phead1 ≠ phead2, phead1 ≠ null, phead2 ≠ vs[vs[phead1].next].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[vs[phead1].next].next ' + orl1 + phead2 ', vs, ps, owns), listp(orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', phead1, vs), nonullRetRefs(orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead1].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), vs[phead1].next ∈ ps, vs[phead1].next ∈ vs, phead1 ∈ ps, phead1 ∈ vs, vs[vs[phead1].next].next ∈ ps, vs[vs[phead1].next].next ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], ¬ dups(orl1), ¬ dups(orl), ¬ dups(orl + orl1), ¬ weak?(vs[phead1].deqID), ¬ phead2 ∈ orl1, ¬ phead2 ∈ orl, ¬ vs[phead1].next ∈ orl, ¬ vs[phead1].next ∈ orl1, ¬ phead1 ∈ orl1, ¬ vs[vs[phead1].next].next ∈ orl, ¬ vs[vs[phead1].next].next ∈ orl1, ¬ phead1 ∈ orl, phead ∈ orl ∨ phead = phead1 ⊦
vs[vs[phead1].next].deqID = Some(tid0), ps[vs[phead1].next].deqID = Some(tid0), ps[phead1].deqID = vs[phead1].deqID, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[vs[phead1].next].next].deqID = None, ps[vs[vs[phead1].next].next].deqID = None, ps[vs[phead1].next].next = vs[vs[phead1].next].next, ps[phead1].next = vs[phead1].next, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead1].next].val = vs[vs[phead1].next].val, ps[phead1].val = vs[phead1].val, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead1].next) = None, owns(phead1) = None, owns(vs[phead2].next) = Weak(tid), rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead1].next].val), vs[phead1].next ≠ vs[vs[phead1].next].next, vs[phead1].next ≠ phead1, vs[phead2].next ≠ null, vs[phead2].next ≠ phead1, vs[phead1].next ≠ phead2, vs[phead1].next ≠ null, phead ≠ vs[phead1].next, phead1 ≠ vs[vs[phead1].next].next, phead1 ≠ phead2, phead1 ≠ null, phead2 ≠ vs[vs[phead1].next].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[vs[phead1].next].next ' + orl1 + phead2 ', vs, ps, owns), listp(orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', phead1, vs), nonullRetRefs(orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead1].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), vs[phead1].next ∈ ps, vs[phead1].next ∈ vs, phead1 ∈ ps, phead1 ∈ vs, vs[vs[phead1].next].next ∈ ps, vs[vs[phead1].next].next ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ orl1, ¬ dups(orl1), ¬ dups(orl), ¬ dups(orl + orl1), ¬ weak?(vs[phead1].deqID), ¬ phead2 ∈ orl1, ¬ phead2 ∈ orl, ¬ vs[phead1].next ∈ orl, ¬ vs[phead1].next ∈ orl1, ¬ phead1 ∈ orl1, ¬ vs[vs[phead1].next].next ∈ orl, ¬ vs[vs[phead1].next].next ∈ orl1, ¬ phead1 ∈ orl, phead ∈ orl ∨ phead = phead1 ⊦
| vs[vs[phead1].next].deqID = Some(tid0), ps[vs[phead1].next].deqID = Some(tid0), ps[phead1].deqID = vs[phead1].deqID, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[vs[phead1].next].next].deqID = None, ps[vs[vs[phead1].next].next].deqID = None, ps[vs[phead1].next].next = vs[vs[phead1].next].next, ps[phead1].next = vs[phead1].next, vs[vs[phead2].next].next = null, ps[phead2].next = null, vs[phead2].next = vs[vs[phead1].next].next, ps[vs[phead1].next].val = vs[vs[phead1].next].val, ps[phead1].val = vs[phead1].val, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead1].next) = None, owns(phead1) = None, owns(vs[phead2].next) = Weak(tid), rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead1].next].val), vs[phead1].next ≠ vs[vs[phead1].next].next, vs[phead1].next ≠ phead1, vs[phead2].next ≠ null, vs[phead2].next ≠ phead1, vs[phead1].next ≠ phead2, vs[phead1].next ≠ null, phead ≠ vs[phead1].next, phead1 ≠ vs[vs[phead1].next].next, phead1 ≠ phead2, phead1 ≠ null, phead2 ≠ vs[vs[phead1].next].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[vs[phead1].next].next ' + orl1 + phead2 ', vs, ps, owns), listp(orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', phead1, vs), nonullRetRefs(orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead1].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), vs[phead1].next ∈ ps, vs[phead1].next ∈ vs, phead1 ∈ ps, phead1 ∈ vs, vs[vs[phead1].next].next ∈ ps, vs[vs[phead1].next].next ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], ¬ dups(orl1), ¬ dups(orl), ¬ dups(orl + orl1), ¬ weak?(vs[phead1].deqID), ¬ phead2 ∈ orl1, ¬ phead2 ∈ orl, ¬ vs[phead1].next ∈ orl, ¬ vs[phead1].next ∈ orl1, ¬ phead1 ∈ orl1, ¬ vs[vs[phead1].next].next ∈ orl, ¬ vs[vs[phead1].next].next ∈ orl1, ¬ phead1 ∈ orl, phead ∈ orl ∨ phead = phead1 ⊦ |
vs[vs[phead1].next].deqID = Some(tid0), ps[vs[phead1].next].deqID = Some(tid0), ps[phead1].deqID = vs[phead1].deqID, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, ps[vs[phead1].next].next = vs[phead2].next, ps[phead1].next = vs[phead1].next, vs[vs[phead2].next].next = null, ps[phead2].next = null, vs[phead2].next = vs[vs[phead1].next].next, ps[vs[phead1].next].val = vs[vs[phead1].next].val, ps[phead1].val = vs[phead1].val, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead1].next) = None, owns(phead1) = None, owns(vs[phead2].next) = Weak(tid), rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead1].next].val), vs[phead1].next ≠ null, vs[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, vs[phead1].next ≠ phead1, vs[phead1].next ≠ vs[phead2].next, phead ≠ vs[phead1].next, phead1 ≠ null, phead1 ≠ phead2, phead2 ≠ vs[phead2].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[phead2].next ' + orl1 + phead2 ', vs, ps, owns), listp(orl + phead1 ' + vs[phead1].next ' + (vs[phead2].next ' + orl1) + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + vs[phead1].next ' + (vs[phead2].next ' + orl1) + phead2 ', phead1, vs), nonullRetRefs(orl + phead1 ' + vs[phead1].next ' + (vs[phead2].next ' + orl1) + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead1].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), vs[phead1].next ∈ ps, vs[phead1].next ∈ vs, phead1 ∈ ps, phead1 ∈ vs, vs[phead2].next ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ weak?(vs[phead1].deqID), ¬ phead1 ∈ orl, ¬ vs[phead2].next ∈ orl1, ¬ vs[phead2].next ∈ orl, ¬ phead1 ∈ orl1, ¬ vs[phead1].next ∈ orl1, ¬ vs[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl1, phead ∈ orl ∨ phead = phead1 ⊦
Used simplifier rules: ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (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
| vs[vs[phead1].next].deqID = Some(tid0), ps[vs[phead1].next].deqID = Some(tid0), ps[phead1].deqID = vs[phead1].deqID, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, ps[vs[phead1].next].next = vs[phead2].next, ps[phead1].next = vs[phead1].next, vs[vs[phead2].next].next = null, ps[phead2].next = null, vs[phead2].next = vs[vs[phead1].next].next, ps[vs[phead1].next].val = vs[vs[phead1].next].val, ps[phead1].val = vs[phead1].val, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead1].next) = None, owns(phead1) = None, owns(vs[phead2].next) = Weak(tid), rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead1].next].val), vs[phead1].next ≠ null, vs[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, vs[phead1].next ≠ phead1, vs[phead1].next ≠ vs[phead2].next, phead ≠ vs[phead1].next, phead1 ≠ null, phead1 ≠ phead2, phead2 ≠ vs[phead2].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[phead2].next ' + orl1 + phead2 ', vs, ps, owns), listp(orl + phead1 ' + vs[phead1].next ' + (vs[phead2].next ' + orl1) + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + vs[phead1].next ' + (vs[phead2].next ' + orl1) + phead2 ', phead1, vs), nonullRetRefs(orl + phead1 ' + vs[phead1].next ' + (vs[phead2].next ' + orl1) + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead1].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), vs[phead1].next ∈ ps, vs[phead1].next ∈ vs, phead1 ∈ ps, phead1 ∈ vs, vs[phead2].next ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ weak?(vs[phead1].deqID), ¬ phead1 ∈ orl, ¬ vs[phead2].next ∈ orl1, ¬ vs[phead2].next ∈ orl, ¬ phead1 ∈ orl1, ¬ vs[phead1].next ∈ orl1, ¬ vs[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl1, phead ∈ orl ∨ phead = phead1 ⊦ |
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 + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) 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] ⊦ None ≠ Weak(tid); (s) ⊦ unmarkedp([], vs); (s) ⊦ [] + x = x; (s) ⊦ listp(r ' + r0 ', 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 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (s) ⊦ weak?(opttid) → opttid ≠ None; (as)
| vs[vs[phead1].next].deqID = Some(tid0), ps[vs[phead1].next].deqID = Some(tid0), ps[phead1].deqID = vs[phead1].deqID, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[vs[phead1].next].next].deqID = None, ps[vs[vs[phead1].next].next].deqID = None, ps[vs[phead1].next].next = vs[vs[phead1].next].next, ps[phead1].next = vs[phead1].next, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead1].next].val = vs[vs[phead1].next].val, ps[phead1].val = vs[phead1].val, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead1].next) = None, owns(phead1) = None, owns(vs[phead2].next) = Weak(tid), rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead1].next].val), vs[phead1].next ≠ vs[vs[phead1].next].next, vs[phead1].next ≠ phead1, vs[phead2].next ≠ null, vs[phead2].next ≠ phead1, vs[phead1].next ≠ phead2, vs[phead1].next ≠ null, phead ≠ vs[phead1].next, phead1 ≠ vs[vs[phead1].next].next, phead1 ≠ phead2, phead1 ≠ null, phead2 ≠ vs[vs[phead1].next].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[vs[phead1].next].next ' + orl1 + phead2 ', vs, ps, owns), listp(orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', phead1, vs), nonullRetRefs(orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead1].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), vs[phead1].next ∈ ps, vs[phead1].next ∈ vs, phead1 ∈ ps, phead1 ∈ vs, vs[vs[phead1].next].next ∈ ps, vs[vs[phead1].next].next ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ orl1, ¬ dups(orl1), ¬ dups(orl), ¬ dups(orl + orl1), ¬ weak?(vs[phead1].deqID), ¬ phead2 ∈ orl1, ¬ phead2 ∈ orl, ¬ vs[phead1].next ∈ orl, ¬ vs[phead1].next ∈ orl1, ¬ phead1 ∈ orl1, ¬ vs[vs[phead1].next].next ∈ orl, ¬ vs[vs[phead1].next].next ∈ orl1, ¬ phead1 ∈ orl, phead ∈ orl ∨ phead = phead1 ⊦ |
⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z))
ps[vs[vs[phead1].next].next].deqID = None, vs[vs[vs[phead1].next].next].deqID = None, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead1].deqID = vs[phead1].deqID, ps[vs[phead1].next].deqID = Some(tid0), vs[vs[phead1].next].deqID = Some(tid0), ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[phead1].next = vs[phead1].next, ps[vs[phead1].next].next = vs[vs[phead1].next].next, ps[phead1].val = vs[phead1].val, ps[vs[phead1].next].val = vs[vs[phead1].next].val, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), owns(phead1) = None, owns(vs[phead1].next) = None, rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead1].next].val), vs[phead1].next ≠ vs[vs[phead1].next].next, vs[phead1].next ≠ phead1, vs[phead2].next ≠ null, vs[phead2].next ≠ phead1, vs[phead1].next ≠ phead2, vs[phead1].next ≠ null, phead ≠ vs[phead1].next, phead1 ≠ vs[vs[phead1].next].next, phead1 ≠ phead2, phead1 ≠ null, phead2 ≠ vs[vs[phead1].next].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', vs, ps, owns), listp(vs[vs[phead1].next].next ' + orl1 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', phead1, vs), nonullRetRefs(orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, vs), vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, vs[vs[phead1].next].next ∈ vs, vs[vs[phead1].next].next ∈ ps, phead1 ∈ vs, phead1 ∈ ps, vs[phead1].next ∈ vs, vs[phead1].next ∈ ps, ¬ dups(orl1), ¬ dups(orl), ¬ dups(orl + orl1), ¬ weak?(vs[phead1].deqID), ¬ phead2 ∈ orl1, ¬ phead2 ∈ orl, ¬ vs[phead1].next ∈ orl, ¬ vs[phead1].next ∈ orl1, ¬ phead1 ∈ orl1, ¬ vs[vs[phead1].next].next ∈ orl, ¬ vs[vs[phead1].next].next ∈ orl1, ¬ phead1 ∈ orl, ∃ y, z. orl1 = y + (vs[phead2].next + z), phead ∈ orl ∨ phead = phead1 ⊦
Used terms: vs[phead2].next, orl1
| ⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z)) |
| ps[vs[vs[phead1].next].next].deqID = None, vs[vs[vs[phead1].next].next].deqID = None, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead1].deqID = vs[phead1].deqID, ps[vs[phead1].next].deqID = Some(tid0), vs[vs[phead1].next].deqID = Some(tid0), ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[phead1].next = vs[phead1].next, ps[vs[phead1].next].next = vs[vs[phead1].next].next, ps[phead1].val = vs[phead1].val, ps[vs[phead1].next].val = vs[vs[phead1].next].val, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), owns(phead1) = None, owns(vs[phead1].next) = None, rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead1].next].val), vs[phead1].next ≠ vs[vs[phead1].next].next, vs[phead1].next ≠ phead1, vs[phead2].next ≠ null, vs[phead2].next ≠ phead1, vs[phead1].next ≠ phead2, vs[phead1].next ≠ null, phead ≠ vs[phead1].next, phead1 ≠ vs[vs[phead1].next].next, phead1 ≠ phead2, phead1 ≠ null, phead2 ≠ vs[vs[phead1].next].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', vs, ps, owns), listp(vs[vs[phead1].next].next ' + orl1 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', phead1, vs), nonullRetRefs(orl + phead1 ' + vs[phead1].next ' + (vs[vs[phead1].next].next ' + orl1) + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, vs), vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, vs[vs[phead1].next].next ∈ vs, vs[vs[phead1].next].next ∈ ps, phead1 ∈ vs, phead1 ∈ ps, vs[phead1].next ∈ vs, vs[phead1].next ∈ ps, ¬ dups(orl1), ¬ dups(orl), ¬ dups(orl + orl1), ¬ weak?(vs[phead1].deqID), ¬ phead2 ∈ orl1, ¬ phead2 ∈ orl, ¬ vs[phead1].next ∈ orl, ¬ vs[phead1].next ∈ orl1, ¬ phead1 ∈ orl1, ¬ vs[vs[phead1].next].next ∈ orl, ¬ vs[vs[phead1].next].next ∈ orl1, ¬ phead1 ∈ orl, ∃ y, z. orl1 = y + (vs[phead2].next + z), phead ∈ orl ∨ phead = phead1 ⊦ |
ps[vs[vs[phead1].next].next].deqID = None, vs[vs[vs[phead1].next].next].deqID = None, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead1].deqID = vs[phead1].deqID, ps[vs[phead1].next].deqID = Some(tid0), vs[vs[phead1].next].deqID = Some(tid0), ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[phead1].next = vs[phead1].next, ps[vs[phead1].next].next = vs[vs[phead1].next].next, ps[phead1].val = vs[phead1].val, ps[vs[phead1].next].val = vs[vs[phead1].next].val, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), owns(phead1) = None, owns(vs[phead1].next) = None, rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead1].next].val), vs[vs[phead1].next].next ≠ vs[phead2].next, vs[phead1].next ≠ vs[phead2].next, vs[phead1].next ≠ null, vs[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, vs[phead1].next ≠ phead1, vs[phead1].next ≠ vs[vs[phead1].next].next, phead ≠ vs[phead1].next, phead1 ≠ null, phead1 ≠ phead2, phead1 ≠ vs[vs[phead1].next].next, phead2 ≠ vs[phead2].next, phead2 ≠ vs[vs[phead1].next].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead1 ' + vs[phead1].next ' + vs[vs[phead1].next].next ' + orl0 + (vs[phead2].next ' + orl2) + phead2 ', vs, ps, owns), listp(vs[vs[phead1].next].next ' + orl0 + (vs[phead2].next ' + orl2) + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + vs[phead1].next ' + vs[vs[phead1].next].next ' + orl0 + (vs[phead2].next ' + orl2) + phead2 ', phead1, vs), nonullRetRefs(orl + phead1 ' + vs[phead1].next ' + vs[vs[phead1].next].next ' + orl0 + (vs[phead2].next ' + orl2) + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), unmarkedp(orl2, ps), unmarkedp(orl0, ps), unmarkedp(orl2, vs), unmarkedp(orl0, vs), phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, vs[vs[phead1].next].next ∈ vs, vs[vs[phead1].next].next ∈ ps, phead1 ∈ vs, phead1 ∈ ps, vs[phead1].next ∈ vs, vs[phead1].next ∈ ps, ¬ dups(orl2), ¬ dups(orl + orl0), ¬ dups(orl0 + orl2), ¬ dups((orl + orl0) + orl2), ¬ dups(orl), ¬ dups(orl0), ¬ weak?(vs[phead1].deqID), ¬ vs[vs[phead1].next].next ∈ orl2, ¬ vs[vs[phead1].next].next ∈ orl0, ¬ vs[vs[phead1].next].next ∈ orl, ¬ phead1 ∈ orl2, ¬ phead1 ∈ orl0, ¬ vs[phead1].next ∈ orl2, ¬ vs[phead1].next ∈ orl0, ¬ vs[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl2, ¬ phead2 ∈ orl0, ¬ vs[phead2].next ∈ orl, ¬ vs[phead2].next ∈ orl2, ¬ vs[phead2].next ∈ orl0, ¬ phead1 ∈ orl, phead ∈ orl ∨ phead = phead1 ⊦
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 ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a + x = a ' + x; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s)
| ps[vs[vs[phead1].next].next].deqID = None, vs[vs[vs[phead1].next].next].deqID = None, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead1].deqID = vs[phead1].deqID, ps[vs[phead1].next].deqID = Some(tid0), vs[vs[phead1].next].deqID = Some(tid0), ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[phead1].next = vs[phead1].next, ps[vs[phead1].next].next = vs[vs[phead1].next].next, ps[phead1].val = vs[phead1].val, ps[vs[phead1].next].val = vs[vs[phead1].next].val, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), owns(phead1) = None, owns(vs[phead1].next) = None, rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead1].next].val), vs[vs[phead1].next].next ≠ vs[phead2].next, vs[phead1].next ≠ vs[phead2].next, vs[phead1].next ≠ null, vs[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, vs[phead1].next ≠ phead1, vs[phead1].next ≠ vs[vs[phead1].next].next, phead ≠ vs[phead1].next, phead1 ≠ null, phead1 ≠ phead2, phead1 ≠ vs[vs[phead1].next].next, phead2 ≠ vs[phead2].next, phead2 ≠ vs[vs[phead1].next].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead1 ' + vs[phead1].next ' + vs[vs[phead1].next].next ' + orl0 + (vs[phead2].next ' + orl2) + phead2 ', vs, ps, owns), listp(vs[vs[phead1].next].next ' + orl0 + (vs[phead2].next ' + orl2) + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + vs[phead1].next ' + vs[vs[phead1].next].next ' + orl0 + (vs[phead2].next ' + orl2) + phead2 ', phead1, vs), nonullRetRefs(orl + phead1 ' + vs[phead1].next ' + vs[vs[phead1].next].next ' + orl0 + (vs[phead2].next ' + orl2) + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), unmarkedp(orl2, ps), unmarkedp(orl0, ps), unmarkedp(orl2, vs), unmarkedp(orl0, vs), phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, vs[vs[phead1].next].next ∈ vs, vs[vs[phead1].next].next ∈ ps, phead1 ∈ vs, phead1 ∈ ps, vs[phead1].next ∈ vs, vs[phead1].next ∈ ps, ¬ dups(orl2), ¬ dups(orl + orl0), ¬ dups(orl0 + orl2), ¬ dups((orl + orl0) + orl2), ¬ dups(orl), ¬ dups(orl0), ¬ weak?(vs[phead1].deqID), ¬ vs[vs[phead1].next].next ∈ orl2, ¬ vs[vs[phead1].next].next ∈ orl0, ¬ vs[vs[phead1].next].next ∈ orl, ¬ phead1 ∈ orl2, ¬ phead1 ∈ orl0, ¬ vs[phead1].next ∈ orl2, ¬ vs[phead1].next ∈ orl0, ¬ vs[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl2, ¬ phead2 ∈ orl0, ¬ vs[phead2].next ∈ orl, ¬ vs[phead2].next ∈ orl2, ¬ vs[phead2].next ∈ orl0, ¬ phead1 ∈ orl, phead ∈ orl ∨ phead = phead1 ⊦ |
⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])
vs[vs[phead1].next].deqID = Some(tid0), ps[vs[phead1].next].deqID = Some(tid0), ps[phead1].deqID = vs[phead1].deqID, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[vs[phead1].next].next].deqID = None, ps[vs[vs[phead1].next].next].deqID = None, ps[vs[phead1].next].next = vs[vs[phead1].next].next, ps[phead1].next = vs[phead1].next, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead1].next].val = vs[vs[phead1].next].val, ps[phead1].val = vs[phead1].val, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead1].next) = None, owns(phead1) = None, owns(vs[phead2].next) = Weak(tid), rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead1].next].val), vs[vs[phead1].next].next ≠ vs[phead2].next, vs[phead1].next ≠ vs[phead2].next, vs[phead1].next ≠ null, vs[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, vs[phead1].next ≠ phead1, vs[phead1].next ≠ vs[vs[phead1].next].next, phead ≠ vs[phead1].next, phead1 ≠ null, phead1 ≠ phead2, phead1 ≠ vs[vs[phead1].next].next, phead2 ≠ vs[phead2].next, phead2 ≠ vs[vs[phead1].next].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[vs[phead1].next].next ' + orl0 + (vs[phead2].next ' + orl2) + phead2 ', vs, ps, owns), listp(orl + phead1 ' + vs[phead1].next ' + vs[vs[phead1].next].next ' + orl0 + (vs[phead2].next ' + orl2) + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + vs[phead1].next ' + vs[vs[phead1].next].next ' + orl0 + (vs[phead2].next ' + orl2) + phead2 ', phead1, vs), nonullRetRefs(orl + phead1 ' + vs[phead1].next ' + vs[vs[phead1].next].next ' + orl0 + (vs[phead2].next ' + orl2) + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl2, vs), unmarkedp(orl0, ps), unmarkedp(orl2, ps), vs[phead1].next ∈ ps, vs[phead1].next ∈ vs, phead1 ∈ ps, phead1 ∈ vs, vs[vs[phead1].next].next ∈ ps, vs[vs[phead1].next].next ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(orl2), ¬ dups(orl + orl0), ¬ dups(orl0 + orl2), ¬ dups((orl + orl0) + orl2), ¬ dups(orl), ¬ dups(orl0), ¬ weak?(vs[phead1].deqID), ¬ vs[vs[phead1].next].next ∈ orl2, ¬ vs[vs[phead1].next].next ∈ orl0, ¬ vs[vs[phead1].next].next ∈ orl, ¬ phead1 ∈ orl2, ¬ phead1 ∈ orl0, ¬ vs[phead1].next ∈ orl2, ¬ vs[phead1].next ∈ orl0, ¬ vs[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl2, ¬ phead2 ∈ orl0, ¬ vs[phead2].next ∈ orl, ¬ vs[phead2].next ∈ orl2, ¬ vs[phead2].next ∈ orl0, ¬ phead1 ∈ orl, listp((vs[vs[phead1].next].next ' + orl0) + vs[phead2].next ' + orl2 + phead2 ', vs, ps, owns) → (listp(vs[phead2].next ' + orl2 + phead2 ', vs, ps, owns) ↔ vs[phead2].next ' + orl2 + phead2 ' ≠ []), phead ∈ orl ∨ phead = phead1 ⊦
Used terms: ps, vs[vs[phead1].next].next ' + orl0, owns, vs[phead2].next ' + orl2 + phead2 ', vs
| ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []) |
| vs[vs[phead1].next].deqID = Some(tid0), ps[vs[phead1].next].deqID = Some(tid0), ps[phead1].deqID = vs[phead1].deqID, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[vs[phead1].next].next].deqID = None, ps[vs[vs[phead1].next].next].deqID = None, ps[vs[phead1].next].next = vs[vs[phead1].next].next, ps[phead1].next = vs[phead1].next, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead1].next].val = vs[vs[phead1].next].val, ps[phead1].val = vs[phead1].val, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead1].next) = None, owns(phead1) = None, owns(vs[phead2].next) = Weak(tid), rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead1].next].val), vs[vs[phead1].next].next ≠ vs[phead2].next, vs[phead1].next ≠ vs[phead2].next, vs[phead1].next ≠ null, vs[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, vs[phead1].next ≠ phead1, vs[phead1].next ≠ vs[vs[phead1].next].next, phead ≠ vs[phead1].next, phead1 ≠ null, phead1 ≠ phead2, phead1 ≠ vs[vs[phead1].next].next, phead2 ≠ vs[phead2].next, phead2 ≠ vs[vs[phead1].next].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[vs[phead1].next].next ' + orl0 + (vs[phead2].next ' + orl2) + phead2 ', vs, ps, owns), listp(orl + phead1 ' + vs[phead1].next ' + vs[vs[phead1].next].next ' + orl0 + (vs[phead2].next ' + orl2) + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + vs[phead1].next ' + vs[vs[phead1].next].next ' + orl0 + (vs[phead2].next ' + orl2) + phead2 ', phead1, vs), nonullRetRefs(orl + phead1 ' + vs[phead1].next ' + vs[vs[phead1].next].next ' + orl0 + (vs[phead2].next ' + orl2) + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl2, vs), unmarkedp(orl0, ps), unmarkedp(orl2, ps), vs[phead1].next ∈ ps, vs[phead1].next ∈ vs, phead1 ∈ ps, phead1 ∈ vs, vs[vs[phead1].next].next ∈ ps, vs[vs[phead1].next].next ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(orl2), ¬ dups(orl + orl0), ¬ dups(orl0 + orl2), ¬ dups((orl + orl0) + orl2), ¬ dups(orl), ¬ dups(orl0), ¬ weak?(vs[phead1].deqID), ¬ vs[vs[phead1].next].next ∈ orl2, ¬ vs[vs[phead1].next].next ∈ orl0, ¬ vs[vs[phead1].next].next ∈ orl, ¬ phead1 ∈ orl2, ¬ phead1 ∈ orl0, ¬ vs[phead1].next ∈ orl2, ¬ vs[phead1].next ∈ orl0, ¬ vs[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl2, ¬ phead2 ∈ orl0, ¬ vs[phead2].next ∈ orl, ¬ vs[phead2].next ∈ orl2, ¬ vs[phead2].next ∈ orl0, ¬ phead1 ∈ orl, listp((vs[vs[phead1].next].next ' + orl0) + vs[phead2].next ' + orl2 + phead2 ', vs, ps, owns) → (listp(vs[phead2].next ' + orl2 + phead2 ', vs, ps, owns) ↔ vs[phead2].next ' + orl2 + phead2 ' ≠ []), phead ∈ orl ∨ phead = phead1 ⊦ |
ps[vs[vs[phead1].next].next].deqID = None, vs[vs[vs[phead1].next].next].deqID = None, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead1].deqID = vs[phead1].deqID, ps[vs[phead1].next].deqID = Some(tid0), vs[vs[phead1].next].deqID = Some(tid0), ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[phead1].next = vs[phead1].next, ps[vs[phead1].next].next = vs[vs[phead1].next].next, ps[phead1].val = vs[phead1].val, ps[vs[phead1].next].val = vs[vs[phead1].next].val, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), owns(phead1) = None, owns(vs[phead1].next) = None, rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead1].next].val), vs[vs[phead1].next].next ≠ vs[phead2].next, vs[phead1].next ≠ vs[phead2].next, vs[phead1].next ≠ null, vs[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, vs[phead1].next ≠ phead1, vs[phead1].next ≠ vs[vs[phead1].next].next, phead ≠ vs[phead1].next, phead1 ≠ null, phead1 ≠ phead2, phead1 ≠ vs[vs[phead1].next].next, phead2 ≠ vs[phead2].next, phead2 ≠ vs[vs[phead1].next].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead1 ' + vs[phead1].next ' + vs[vs[phead1].next].next ' + orl0 + (vs[phead2].next ' + orl2) + phead2 ', vs, ps, owns), listp(vs[vs[phead1].next].next ' + orl0 + (vs[phead2].next ' + orl2) + phead2 ', vs, ps, owns), listp(vs[phead2].next ' + orl2 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + vs[phead1].next ' + vs[vs[phead1].next].next ' + orl0 + (vs[phead2].next ' + orl2) + phead2 ', phead1, vs), nonullRetRefs(orl + phead1 ' + vs[phead1].next ' + vs[vs[phead1].next].next ' + orl0 + (vs[phead2].next ' + orl2) + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), unmarkedp(orl2, ps), unmarkedp(orl0, ps), unmarkedp(orl2, vs), unmarkedp(orl0, vs), phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, vs[vs[phead1].next].next ∈ vs, vs[vs[phead1].next].next ∈ ps, phead1 ∈ vs, phead1 ∈ ps, vs[phead1].next ∈ vs, vs[phead1].next ∈ ps, ¬ dups(orl2), ¬ dups(orl + orl0), ¬ dups(orl0 + orl2), ¬ dups((orl + orl0) + orl2), ¬ dups(orl), ¬ dups(orl0), ¬ weak?(vs[phead1].deqID), ¬ vs[vs[phead1].next].next ∈ orl2, ¬ vs[vs[phead1].next].next ∈ orl0, ¬ vs[vs[phead1].next].next ∈ orl, ¬ phead1 ∈ orl2, ¬ phead1 ∈ orl0, ¬ vs[phead1].next ∈ orl2, ¬ vs[phead1].next ∈ orl0, ¬ vs[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl2, ¬ phead2 ∈ orl0, ¬ vs[phead2].next ∈ orl, ¬ vs[phead2].next ∈ orl2, ¬ vs[phead2].next ∈ orl0, ¬ phead1 ∈ orl, phead ∈ orl ∨ phead = phead1 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ' + x ≠ []; (s)
| ps[vs[vs[phead1].next].next].deqID = None, vs[vs[vs[phead1].next].next].deqID = None, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead1].deqID = vs[phead1].deqID, ps[vs[phead1].next].deqID = Some(tid0), vs[vs[phead1].next].deqID = Some(tid0), ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[phead1].next = vs[phead1].next, ps[vs[phead1].next].next = vs[vs[phead1].next].next, ps[phead1].val = vs[phead1].val, ps[vs[phead1].next].val = vs[vs[phead1].next].val, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), owns(phead1) = None, owns(vs[phead1].next) = None, rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[phead1].next].val), vs[vs[phead1].next].next ≠ vs[phead2].next, vs[phead1].next ≠ vs[phead2].next, vs[phead1].next ≠ null, vs[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, vs[phead1].next ≠ phead1, vs[phead1].next ≠ vs[vs[phead1].next].next, phead ≠ vs[phead1].next, phead1 ≠ null, phead1 ≠ phead2, phead1 ≠ vs[vs[phead1].next].next, phead2 ≠ vs[phead2].next, phead2 ≠ vs[vs[phead1].next].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead1 ' + vs[phead1].next ' + vs[vs[phead1].next].next ' + orl0 + (vs[phead2].next ' + orl2) + phead2 ', vs, ps, owns), listp(vs[vs[phead1].next].next ' + orl0 + (vs[phead2].next ' + orl2) + phead2 ', vs, ps, owns), listp(vs[phead2].next ' + orl2 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, orl + phead1 ' + vs[phead1].next ' + vs[vs[phead1].next].next ' + orl0 + (vs[phead2].next ' + orl2) + phead2 ', phead1, vs), nonullRetRefs(orl + phead1 ' + vs[phead1].next ' + vs[vs[phead1].next].next ' + orl0 + (vs[phead2].next ' + orl2) + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), unmarkedp(orl2, ps), unmarkedp(orl0, ps), unmarkedp(orl2, vs), unmarkedp(orl0, vs), phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, vs[vs[phead1].next].next ∈ vs, vs[vs[phead1].next].next ∈ ps, phead1 ∈ vs, phead1 ∈ ps, vs[phead1].next ∈ vs, vs[phead1].next ∈ ps, ¬ dups(orl2), ¬ dups(orl + orl0), ¬ dups(orl0 + orl2), ¬ dups((orl + orl0) + orl2), ¬ dups(orl), ¬ dups(orl0), ¬ weak?(vs[phead1].deqID), ¬ vs[vs[phead1].next].next ∈ orl2, ¬ vs[vs[phead1].next].next ∈ orl0, ¬ vs[vs[phead1].next].next ∈ orl, ¬ phead1 ∈ orl2, ¬ phead1 ∈ orl0, ¬ vs[phead1].next ∈ orl2, ¬ vs[phead1].next ∈ orl0, ¬ vs[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl2, ¬ phead2 ∈ orl0, ¬ vs[phead2].next ∈ orl, ¬ vs[phead2].next ∈ orl2, ¬ vs[phead2].next ∈ orl0, ¬ phead1 ∈ orl, phead ∈ orl ∨ phead = phead1 ⊦ |
Used simplifier rules: reflist freely generated by [], +;; ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) 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] ⊦ None ≠ Weak(tid); (s) ⊦ unmarkedp([], vs); (s) ⊦ [] + x = x; (s) ⊦ listp(r ' + r0 ', 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 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (s) ⊦ weak?(opttid) → opttid ≠ None; (as)
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs, vretRefs, pretRefs), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ⊦ |
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), vs[r].deqID ≠ None, ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, r ≠ (orl + phead1 ').head, r ≠ phead1, r ≠ ps[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, ¬ r ∈ orl, ¬ r ∈ orl0, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ orl0 ∨ phead0 = phead2, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, r = phead0 ∨ r ∈ qrl0 ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (x + a ' + y).head = (x + a ').head; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ nonullRetRefs(rl, vs, vretRefs, pretRefs) → ( nonullRetRefs(rl0, vs0, vretRefs0, pretRefs0) ↔ (∀ r. ( r ∈ rl ∧ r ≠ rl.head ∧ vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null) → r ∈ rl0 ∧ r ≠ rl0.head ∧ vs0[r].deqID ≠ None → vretRefs0(vs0[r].deqID.tid) ≠ null ∧ pretRefs0(vs0[r].deqID.tid) ≠ null)); (ss)
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), vs[r].deqID ≠ None, ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, r ≠ (orl + phead1 ').head, r ≠ phead1, r ≠ ps[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, ¬ r ∈ orl, ¬ r ∈ orl0, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ orl0 ∨ phead0 = phead2, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, r = phead0 ∨ r ∈ qrl0 ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null |
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, orl + phead1 ' = r0 + qrl, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), orl + phead1 ' ≠ [], vs[r].deqID ≠ None, ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, r ≠ r0, r ≠ phead1, r ≠ ps[phead1].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, ¬ r ∈ orl, ¬ r ∈ orl0, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), r = phead0 ∨ r ∈ qrl0, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null
Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: orl + phead1 ', r0, y
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, orl + phead1 ' = r0 + qrl, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), orl + phead1 ' ≠ [], vs[r].deqID ≠ None, ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, r ≠ r0, r ≠ phead1, r ≠ ps[phead1].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, ¬ r ∈ orl, ¬ r ∈ orl0, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), r = phead0 ∨ r ∈ qrl0, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null |
orl + phead1 ' = r0 ' + qrl, (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), vs[r].deqID ≠ None, ps[phead1].next ≠ phead1, vs[phead2].next ≠ null, vs[phead2].next ≠ phead1, ps[phead1].next ≠ phead2, phead ≠ ps[phead1].next, phead1 ≠ phead2, r ≠ ps[phead1].next, r ≠ phead1, r ≠ r0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((r0 ' + qrl) + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((r0 ' + qrl) + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((r0 ' + qrl) + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ r ∈ orl0, ¬ r ∈ orl, ¬ phead1 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead2 ∈ orl, ¬ ps[phead1].next ∈ orl, ¬ ps[phead1].next ∈ orl0, ¬ phead1 ∈ orl0, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), r = phead0 ∨ r ∈ qrl0, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2, phead1 = r0 ∨ phead1 ∈ qrl, r0 ∈ orl ∨ r0 = phead1 ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ x + a ' ≠ []; (s) ⊦ a + x = a ' + x; (s)
| orl + phead1 ' = r0 ' + qrl, (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), vs[r].deqID ≠ None, ps[phead1].next ≠ phead1, vs[phead2].next ≠ null, vs[phead2].next ≠ phead1, ps[phead1].next ≠ phead2, phead ≠ ps[phead1].next, phead1 ≠ phead2, r ≠ ps[phead1].next, r ≠ phead1, r ≠ r0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((r0 ' + qrl) + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((r0 ' + qrl) + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((r0 ' + qrl) + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ r ∈ orl0, ¬ r ∈ orl, ¬ phead1 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead2 ∈ orl, ¬ ps[phead1].next ∈ orl, ¬ ps[phead1].next ∈ orl0, ¬ phead1 ∈ orl0, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), r = phead0 ∨ r ∈ qrl0, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2, phead1 = r0 ∨ phead1 ∈ qrl, r0 ∈ orl ∨ r0 = phead1 ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null |
y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, orl = (r0 ' + qrl).butlast, owns(vs[phead2].next) = Weak(tid), phead1 = (r0 ' + qrl).last, r0 ' + qrl ≠ [], vs[r].deqID ≠ None, ps[phead1].next ≠ phead1, vs[phead2].next ≠ null, vs[phead2].next ≠ phead1, ps[phead1].next ≠ phead2, phead ≠ ps[phead1].next, phead1 ≠ phead2, r ≠ ps[phead1].next, r ≠ phead1, r ≠ r0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((r0 ' + qrl) + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, ((r0 ' + qrl) + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((r0 ' + qrl) + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ r ∈ orl0, ¬ r ∈ orl, ¬ phead1 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead2 ∈ orl, ¬ ps[phead1].next ∈ orl, ¬ ps[phead1].next ∈ orl0, ¬ phead1 ∈ orl0, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), r0 ∈ orl ∨ r0 = phead1, phead1 = r0 ∨ phead1 ∈ qrl, phead0 ∈ orl0 ∨ phead0 = phead2, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, r = phead0 ∨ r ∈ qrl0 ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null
Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: orl, phead1, r0 ' + qrl
| y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last |
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, orl = (r0 ' + qrl).butlast, owns(vs[phead2].next) = Weak(tid), phead1 = (r0 ' + qrl).last, r0 ' + qrl ≠ [], vs[r].deqID ≠ None, ps[phead1].next ≠ phead1, vs[phead2].next ≠ null, vs[phead2].next ≠ phead1, ps[phead1].next ≠ phead2, phead ≠ ps[phead1].next, phead1 ≠ phead2, r ≠ ps[phead1].next, r ≠ phead1, r ≠ r0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((r0 ' + qrl) + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, ((r0 ' + qrl) + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((r0 ' + qrl) + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ r ∈ orl0, ¬ r ∈ orl, ¬ phead1 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead2 ∈ orl, ¬ ps[phead1].next ∈ orl, ¬ ps[phead1].next ∈ orl0, ¬ phead1 ∈ orl0, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), r0 ∈ orl ∨ r0 = phead1, phead1 = r0 ∨ phead1 ∈ qrl, phead0 ∈ orl0 ∨ phead0 = phead2, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, r = phead0 ∨ r ∈ qrl0 ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null |
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), vs[r].deqID ≠ None, (r0 ' + qrl).last ≠ phead2, ps[(r0 ' + qrl).last].next ≠ (r0 ' + qrl).last, vs[phead2].next ≠ null, vs[phead2].next ≠ (r0 ' + qrl).last, ps[(r0 ' + qrl).last].next ≠ phead2, phead ≠ ps[(r0 ' + qrl).last].next, r ≠ ps[(r0 ' + qrl).last].next, r ≠ (r0 ' + qrl).last, r ≠ r0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((r0 ' + qrl) + ps[(r0 ' + qrl).last].next ') + orl0 + phead2 ', vs, ps, owns), markedp((r0 ' + qrl).butlast, vs), markedp((r0 ' + qrl).butlast, ps), nextnottid(tid, (r0 ' + qrl).last, vs), noid(tid, ((r0 ' + qrl) + ps[(r0 ' + qrl).last].next ') + orl0 + phead2 ', (r0 ' + qrl).last, vs), nonullRetRefs(((r0 ' + qrl) + ps[(r0 ' + qrl).last].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[(r0 ' + qrl).last].deqID), some?(ps[(r0 ' + qrl).last].deqID), some?(vs[ps[(r0 ' + qrl).last].next].deqID), some?(ps[ps[(r0 ' + qrl).last].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups((r0 ' + qrl).butlast + orl0), ¬ dups((r0 ' + qrl).butlast), ¬ dups(orl0), ¬ r ∈ orl0, ¬ r ∈ (r0 ' + qrl).butlast, ¬ (r0 ' + qrl).last ∈ (r0 ' + qrl).butlast, ¬ phead2 ∈ orl0, ¬ phead2 ∈ (r0 ' + qrl).butlast, ¬ ps[(r0 ' + qrl).last].next ∈ (r0 ' + qrl).butlast, ¬ ps[(r0 ' + qrl).last].next ∈ orl0, ¬ (r0 ' + qrl).last ∈ orl0, vs[(r0 ' + qrl).last].next ≠ null ∧ vs[vs[(r0 ' + qrl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(r0 ' + qrl).last].next].deqID.tid)) = Claimed(vs[vs[(r0 ' + qrl).last].next].deqID.tid, vs[vs[(r0 ' + qrl).last].next].val), r = phead0 ∨ r ∈ qrl0, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead ∈ (r0 ' + qrl).butlast ∨ phead = (r0 ' + qrl).last, phead0 ∈ orl0 ∨ phead0 = phead2, (r0 ' + qrl).last = r0 ∨ (r0 ' + qrl).last ∈ qrl, r0 ∈ (r0 ' + qrl).butlast ∨ r0 = (r0 ' + qrl).last ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ' + x ≠ []; (s)
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), vs[r].deqID ≠ None, (r0 ' + qrl).last ≠ phead2, ps[(r0 ' + qrl).last].next ≠ (r0 ' + qrl).last, vs[phead2].next ≠ null, vs[phead2].next ≠ (r0 ' + qrl).last, ps[(r0 ' + qrl).last].next ≠ phead2, phead ≠ ps[(r0 ' + qrl).last].next, r ≠ ps[(r0 ' + qrl).last].next, r ≠ (r0 ' + qrl).last, r ≠ r0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((r0 ' + qrl) + ps[(r0 ' + qrl).last].next ') + orl0 + phead2 ', vs, ps, owns), markedp((r0 ' + qrl).butlast, vs), markedp((r0 ' + qrl).butlast, ps), nextnottid(tid, (r0 ' + qrl).last, vs), noid(tid, ((r0 ' + qrl) + ps[(r0 ' + qrl).last].next ') + orl0 + phead2 ', (r0 ' + qrl).last, vs), nonullRetRefs(((r0 ' + qrl) + ps[(r0 ' + qrl).last].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[(r0 ' + qrl).last].deqID), some?(ps[(r0 ' + qrl).last].deqID), some?(vs[ps[(r0 ' + qrl).last].next].deqID), some?(ps[ps[(r0 ' + qrl).last].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups((r0 ' + qrl).butlast + orl0), ¬ dups((r0 ' + qrl).butlast), ¬ dups(orl0), ¬ r ∈ orl0, ¬ r ∈ (r0 ' + qrl).butlast, ¬ (r0 ' + qrl).last ∈ (r0 ' + qrl).butlast, ¬ phead2 ∈ orl0, ¬ phead2 ∈ (r0 ' + qrl).butlast, ¬ ps[(r0 ' + qrl).last].next ∈ (r0 ' + qrl).butlast, ¬ ps[(r0 ' + qrl).last].next ∈ orl0, ¬ (r0 ' + qrl).last ∈ orl0, vs[(r0 ' + qrl).last].next ≠ null ∧ vs[vs[(r0 ' + qrl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(r0 ' + qrl).last].next].deqID.tid)) = Claimed(vs[vs[(r0 ' + qrl).last].next].deqID.tid, vs[vs[(r0 ' + qrl).last].next].val), r = phead0 ∨ r ∈ qrl0, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead ∈ (r0 ' + qrl).butlast ∨ phead = (r0 ' + qrl).last, phead0 ∈ orl0 ∨ phead0 = phead2, (r0 ' + qrl).last = r0 ∨ (r0 ' + qrl).last ∈ qrl, r0 ∈ (r0 ' + qrl).butlast ∨ r0 = (r0 ' + qrl).last ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null |
⊦ y ≠ [] → (x + y).last = y.last
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), qrl = [], vs[r].deqID ≠ None, (r0 ' + qrl).last ≠ phead2, ps[(r0 ' + qrl).last].next ≠ (r0 ' + qrl).last, vs[phead2].next ≠ null, vs[phead2].next ≠ (r0 ' + qrl).last, ps[(r0 ' + qrl).last].next ≠ phead2, phead ≠ ps[(r0 ' + qrl).last].next, r ≠ ps[(r0 ' + qrl).last].next, r ≠ (r0 ' + qrl).last, r ≠ r0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((r0 ' + qrl) + ps[(r0 ' + qrl).last].next ') + orl0 + phead2 ', vs, ps, owns), markedp((r0 ' + qrl).butlast, ps), markedp((r0 ' + qrl).butlast, vs), nextnottid(tid, (r0 ' + qrl).last, vs), noid(tid, ((r0 ' + qrl) + ps[(r0 ' + qrl).last].next ') + orl0 + phead2 ', (r0 ' + qrl).last, vs), nonullRetRefs(((r0 ' + qrl) + ps[(r0 ' + qrl).last].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[(r0 ' + qrl).last].next].deqID), some?(vs[ps[(r0 ' + qrl).last].next].deqID), some?(ps[(r0 ' + qrl).last].deqID), some?(vs[(r0 ' + qrl).last].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, ¬ dups((r0 ' + qrl).butlast + orl0), ¬ dups((r0 ' + qrl).butlast), ¬ dups(orl0), ¬ r ∈ orl0, ¬ r ∈ (r0 ' + qrl).butlast, ¬ (r0 ' + qrl).last ∈ (r0 ' + qrl).butlast, ¬ phead2 ∈ orl0, ¬ phead2 ∈ (r0 ' + qrl).butlast, ¬ ps[(r0 ' + qrl).last].next ∈ (r0 ' + qrl).butlast, ¬ ps[(r0 ' + qrl).last].next ∈ orl0, ¬ (r0 ' + qrl).last ∈ orl0, vs[(r0 ' + qrl).last].next ≠ null ∧ vs[vs[(r0 ' + qrl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(r0 ' + qrl).last].next].deqID.tid)) = Claimed(vs[vs[(r0 ' + qrl).last].next].deqID.tid, vs[vs[(r0 ' + qrl).last].next].val), r0 ∈ (r0 ' + qrl).butlast ∨ r0 = (r0 ' + qrl).last, (r0 ' + qrl).last = r0 ∨ (r0 ' + qrl).last ∈ qrl, phead0 ∈ orl0 ∨ phead0 = phead2, phead ∈ (r0 ' + qrl).butlast ∨ phead = (r0 ' + qrl).last, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, r = phead0 ∨ r ∈ qrl0 ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), vs[r].deqID ≠ None, qrl.last ≠ phead2, ps[qrl.last].next ≠ qrl.last, vs[phead2].next ≠ null, vs[phead2].next ≠ qrl.last, ps[qrl.last].next ≠ phead2, phead ≠ ps[qrl.last].next, qrl ≠ [], r ≠ ps[qrl.last].next, r ≠ qrl.last, r ≠ r0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((r0 ' + qrl) + ps[qrl.last].next ') + orl0 + phead2 ', vs, ps, owns), markedp((r0 ' + qrl).butlast, ps), markedp((r0 ' + qrl).butlast, vs), nextnottid(tid, qrl.last, vs), noid(tid, ((r0 ' + qrl) + ps[qrl.last].next ') + orl0 + phead2 ', qrl.last, vs), nonullRetRefs(((r0 ' + qrl) + ps[qrl.last].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[qrl.last].next].deqID), some?(vs[ps[qrl.last].next].deqID), some?(ps[qrl.last].deqID), some?(vs[qrl.last].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, ¬ dups((r0 ' + qrl).butlast + orl0), ¬ dups((r0 ' + qrl).butlast), ¬ dups(orl0), ¬ r ∈ orl0, ¬ r ∈ (r0 ' + qrl).butlast, ¬ qrl.last ∈ (r0 ' + qrl).butlast, ¬ phead2 ∈ orl0, ¬ phead2 ∈ (r0 ' + qrl).butlast, ¬ ps[qrl.last].next ∈ (r0 ' + qrl).butlast, ¬ ps[qrl.last].next ∈ orl0, ¬ qrl.last ∈ orl0, vs[qrl.last].next ≠ null ∧ vs[vs[qrl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[qrl.last].next].deqID.tid)) = Claimed(vs[vs[qrl.last].next].deqID.tid, vs[vs[qrl.last].next].val), r0 ∈ (r0 ' + qrl).butlast ∨ r0 = qrl.last, qrl.last = r0 ∨ qrl.last ∈ qrl, phead0 ∈ orl0 ∨ phead0 = phead2, phead ∈ (r0 ' + qrl).butlast ∨ phead = qrl.last, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, r = phead0 ∨ r ∈ qrl0 ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null
Used terms: r0 ', qrl
| ⊦ y ≠ [] → (x + y).last = y.last |
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), qrl = [], vs[r].deqID ≠ None, (r0 ' + qrl).last ≠ phead2, ps[(r0 ' + qrl).last].next ≠ (r0 ' + qrl).last, vs[phead2].next ≠ null, vs[phead2].next ≠ (r0 ' + qrl).last, ps[(r0 ' + qrl).last].next ≠ phead2, phead ≠ ps[(r0 ' + qrl).last].next, r ≠ ps[(r0 ' + qrl).last].next, r ≠ (r0 ' + qrl).last, r ≠ r0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((r0 ' + qrl) + ps[(r0 ' + qrl).last].next ') + orl0 + phead2 ', vs, ps, owns), markedp((r0 ' + qrl).butlast, ps), markedp((r0 ' + qrl).butlast, vs), nextnottid(tid, (r0 ' + qrl).last, vs), noid(tid, ((r0 ' + qrl) + ps[(r0 ' + qrl).last].next ') + orl0 + phead2 ', (r0 ' + qrl).last, vs), nonullRetRefs(((r0 ' + qrl) + ps[(r0 ' + qrl).last].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[(r0 ' + qrl).last].next].deqID), some?(vs[ps[(r0 ' + qrl).last].next].deqID), some?(ps[(r0 ' + qrl).last].deqID), some?(vs[(r0 ' + qrl).last].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, ¬ dups((r0 ' + qrl).butlast + orl0), ¬ dups((r0 ' + qrl).butlast), ¬ dups(orl0), ¬ r ∈ orl0, ¬ r ∈ (r0 ' + qrl).butlast, ¬ (r0 ' + qrl).last ∈ (r0 ' + qrl).butlast, ¬ phead2 ∈ orl0, ¬ phead2 ∈ (r0 ' + qrl).butlast, ¬ ps[(r0 ' + qrl).last].next ∈ (r0 ' + qrl).butlast, ¬ ps[(r0 ' + qrl).last].next ∈ orl0, ¬ (r0 ' + qrl).last ∈ orl0, vs[(r0 ' + qrl).last].next ≠ null ∧ vs[vs[(r0 ' + qrl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(r0 ' + qrl).last].next].deqID.tid)) = Claimed(vs[vs[(r0 ' + qrl).last].next].deqID.tid, vs[vs[(r0 ' + qrl).last].next].val), r0 ∈ (r0 ' + qrl).butlast ∨ r0 = (r0 ' + qrl).last, (r0 ' + qrl).last = r0 ∨ (r0 ' + qrl).last ∈ qrl, phead0 ∈ orl0 ∨ phead0 = phead2, phead ∈ (r0 ' + qrl).butlast ∨ phead = (r0 ' + qrl).last, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, r = phead0 ∨ r ∈ qrl0 ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null |
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, ps[r0].deqID = vs[r0].deqID, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, ps[r0].next = vs[r0].next, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[r0].val = vs[r0].val, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(r0) = None, owns(vs[phead2].next) = Weak(tid), vs[r].deqID ≠ None, vs[r0].next ≠ phead2, vs[phead2].next ≠ r0, vs[phead2].next ≠ null, vs[r0].next ≠ r0, r ≠ r0, r ≠ vs[r0].next, r0 ≠ null, r0 ≠ phead2, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[r0].next ' + orl0 + phead2 ', vs, ps, owns), nextnottid(tid, r0, vs), noid(tid, r0 ' + vs[r0].next ' + orl0 + phead2 ', r0, vs), nonullRetRefs(r0 ' + vs[r0].next ' + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vs[r0].next].deqID), some?(vs[vs[r0].next].deqID), some?(vs[r0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, r0 ∈ vs, r0 ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, ¬ dups(orl0), ¬ weak?(vs[r0].deqID), ¬ r0 ∈ orl0, ¬ vs[r0].next ∈ orl0, ¬ phead2 ∈ orl0, ¬ r ∈ orl0, vs[r0].next ≠ null → rvowns(vretRefs(vs[vs[r0].next].deqID.tid)) = Claimed(vs[vs[r0].next].deqID.tid, vs[vs[r0].next].val), phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, r = phead0 ∨ r ∈ qrl0, phead0 ∈ orl0 ∨ phead0 = phead2 ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null
Used simplifier rules: ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ a '.last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ [] + x = x; (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ markedp([], vs); (s)
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, ps[r0].deqID = vs[r0].deqID, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, ps[r0].next = vs[r0].next, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[r0].val = vs[r0].val, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(r0) = None, owns(vs[phead2].next) = Weak(tid), vs[r].deqID ≠ None, vs[r0].next ≠ phead2, vs[phead2].next ≠ r0, vs[phead2].next ≠ null, vs[r0].next ≠ r0, r ≠ r0, r ≠ vs[r0].next, r0 ≠ null, r0 ≠ phead2, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[r0].next ' + orl0 + phead2 ', vs, ps, owns), nextnottid(tid, r0, vs), noid(tid, r0 ' + vs[r0].next ' + orl0 + phead2 ', r0, vs), nonullRetRefs(r0 ' + vs[r0].next ' + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vs[r0].next].deqID), some?(vs[vs[r0].next].deqID), some?(vs[r0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, r0 ∈ vs, r0 ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, ¬ dups(orl0), ¬ weak?(vs[r0].deqID), ¬ r0 ∈ orl0, ¬ vs[r0].next ∈ orl0, ¬ phead2 ∈ orl0, ¬ r ∈ orl0, vs[r0].next ≠ null → rvowns(vretRefs(vs[vs[r0].next].deqID.tid)) = Claimed(vs[vs[r0].next].deqID.tid, vs[vs[r0].next].val), phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, r = phead0 ∨ r ∈ qrl0, phead0 ∈ orl0 ∨ phead0 = phead2 ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null |
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[r0].deqID = vs[r0].deqID, vs[vs[r0].next].deqID = Some(tid0), ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[r0].next = vs[r0].next, ps[r0].val = vs[r0].val, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), owns(r0) = None, vs[r].deqID ≠ None, vs[r0].next ≠ phead2, vs[phead2].next ≠ r0, vs[phead2].next ≠ null, vs[r0].next ≠ r0, r ≠ r0, r ≠ vs[r0].next, r0 ≠ null, r0 ≠ phead2, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[r0].next ' + orl0 + phead2 ', vs, ps, owns), nextnottid(tid, r0, vs), noid(tid, r0 ' + vs[r0].next ' + orl0 + phead2 ', r0, vs), nonullRetRefs(r0 ' + vs[r0].next ' + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[r0].deqID), some?(vs[vs[r0].next].deqID), some?(ps[vs[r0].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], r0 ∈ ps, r0 ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ weak?(vs[r0].deqID), ¬ r0 ∈ orl0, ¬ vs[r0].next ∈ orl0, ¬ phead2 ∈ orl0, ¬ r ∈ orl0, vs[r0].next ≠ null → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[r0].next].val), phead0 ∈ orl0 ∨ phead0 = phead2, r = phead0 ∨ r ∈ qrl0, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null
Used simplifier rules: ⊦ some?(opttid) → (tid = opttid.tid ↔ opttid = Some(tid)); (elim) Used terms: vs[vs[r0].next].deqID, tid0
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[r0].deqID = vs[r0].deqID, vs[vs[r0].next].deqID = Some(tid0), ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[r0].next = vs[r0].next, ps[r0].val = vs[r0].val, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), owns(r0) = None, vs[r].deqID ≠ None, vs[r0].next ≠ phead2, vs[phead2].next ≠ r0, vs[phead2].next ≠ null, vs[r0].next ≠ r0, r ≠ r0, r ≠ vs[r0].next, r0 ≠ null, r0 ≠ phead2, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[r0].next ' + orl0 + phead2 ', vs, ps, owns), nextnottid(tid, r0, vs), noid(tid, r0 ' + vs[r0].next ' + orl0 + phead2 ', r0, vs), nonullRetRefs(r0 ' + vs[r0].next ' + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[r0].deqID), some?(vs[vs[r0].next].deqID), some?(ps[vs[r0].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], r0 ∈ ps, r0 ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ weak?(vs[r0].deqID), ¬ r0 ∈ orl0, ¬ vs[r0].next ∈ orl0, ¬ phead2 ∈ orl0, ¬ r ∈ orl0, vs[r0].next ≠ null → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[r0].next].val), phead0 ∈ orl0 ∨ phead0 = phead2, r = phead0 ∨ r ∈ qrl0, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null |
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[r0].deqID = vs[r0].deqID, vs[vs[r0].next].deqID = Some(tid0), ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[r0].next = vs[r0].next, ps[r0].val = vs[r0].val, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), owns(r0) = None, vs[r].deqID ≠ None, vs[r0].next ≠ r0, vs[phead2].next ≠ null, vs[phead2].next ≠ r0, vs[r0].next ≠ phead2, r ≠ vs[r0].next, r ≠ r0, r0 ≠ phead2, r0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[r0].next ' + orl0 + phead2 ', vs, ps, owns), nextnottid(tid, r0, vs), noid(tid, r0 ' + vs[r0].next ' + orl0 + phead2 ', r0, vs), nonullRetRefs(r0 ' + vs[r0].next ' + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[r0].deqID), some?(ps[vs[r0].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], r0 ∈ ps, r0 ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ weak?(vs[r0].deqID), ¬ r ∈ orl0, ¬ phead2 ∈ orl0, ¬ vs[r0].next ∈ orl0, ¬ r0 ∈ orl0, vs[r0].next ≠ null → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[r0].next].val), phead0 ∈ orl0 ∨ phead0 = phead2, r = phead0 ∨ r ∈ qrl0, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null
Used simplifier rules: ⊦ some?(Some(tid)); (s)
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[r0].deqID = vs[r0].deqID, vs[vs[r0].next].deqID = Some(tid0), ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[r0].next = vs[r0].next, ps[r0].val = vs[r0].val, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), owns(r0) = None, vs[r].deqID ≠ None, vs[r0].next ≠ r0, vs[phead2].next ≠ null, vs[phead2].next ≠ r0, vs[r0].next ≠ phead2, r ≠ vs[r0].next, r ≠ r0, r0 ≠ phead2, r0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[r0].next ' + orl0 + phead2 ', vs, ps, owns), nextnottid(tid, r0, vs), noid(tid, r0 ' + vs[r0].next ' + orl0 + phead2 ', r0, vs), nonullRetRefs(r0 ' + vs[r0].next ' + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[r0].deqID), some?(ps[vs[r0].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], r0 ∈ ps, r0 ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ weak?(vs[r0].deqID), ¬ r ∈ orl0, ¬ phead2 ∈ orl0, ¬ vs[r0].next ∈ orl0, ¬ r0 ∈ orl0, vs[r0].next ≠ null → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[r0].next].val), phead0 ∈ orl0 ∨ phead0 = phead2, r = phead0 ∨ r ∈ qrl0, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null |
Used simplifier rules: reflist freely generated by [], +;; ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws) ⊦ 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) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a + x = a ' + x; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ some?(Some(tid)); (s) ⊦ ¬ weak?(Some(tid)); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ unmarkedp([], vs); (s) ⊦ [] + x = x; (s) ⊦ listp(r ' + r0 ', 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 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s)
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), vs[r].deqID ≠ None, qrl.last ≠ phead2, ps[qrl.last].next ≠ qrl.last, vs[phead2].next ≠ null, vs[phead2].next ≠ qrl.last, ps[qrl.last].next ≠ phead2, phead ≠ ps[qrl.last].next, qrl ≠ [], r ≠ ps[qrl.last].next, r ≠ qrl.last, r ≠ r0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((r0 ' + qrl) + ps[qrl.last].next ') + orl0 + phead2 ', vs, ps, owns), markedp((r0 ' + qrl).butlast, ps), markedp((r0 ' + qrl).butlast, vs), nextnottid(tid, qrl.last, vs), noid(tid, ((r0 ' + qrl) + ps[qrl.last].next ') + orl0 + phead2 ', qrl.last, vs), nonullRetRefs(((r0 ' + qrl) + ps[qrl.last].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[qrl.last].next].deqID), some?(vs[ps[qrl.last].next].deqID), some?(ps[qrl.last].deqID), some?(vs[qrl.last].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, ¬ dups((r0 ' + qrl).butlast + orl0), ¬ dups((r0 ' + qrl).butlast), ¬ dups(orl0), ¬ r ∈ orl0, ¬ r ∈ (r0 ' + qrl).butlast, ¬ qrl.last ∈ (r0 ' + qrl).butlast, ¬ phead2 ∈ orl0, ¬ phead2 ∈ (r0 ' + qrl).butlast, ¬ ps[qrl.last].next ∈ (r0 ' + qrl).butlast, ¬ ps[qrl.last].next ∈ orl0, ¬ qrl.last ∈ orl0, vs[qrl.last].next ≠ null ∧ vs[vs[qrl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[qrl.last].next].deqID.tid)) = Claimed(vs[vs[qrl.last].next].deqID.tid, vs[vs[qrl.last].next].val), r0 ∈ (r0 ' + qrl).butlast ∨ r0 = qrl.last, qrl.last = r0 ∨ qrl.last ∈ qrl, phead0 ∈ orl0 ∨ phead0 = phead2, phead ∈ (r0 ' + qrl).butlast ∨ phead = qrl.last, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, r = phead0 ∨ r ∈ qrl0 ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null |
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), vs[r].deqID ≠ None, qrl.last ≠ phead2, qrl.last ≠ r0, ps[qrl.last].next ≠ qrl.last, vs[phead2].next ≠ null, vs[phead2].next ≠ qrl.last, ps[qrl.last].next ≠ phead2, ps[qrl.last].next ≠ r0, phead ≠ ps[qrl.last].next, phead2 ≠ r0, qrl ≠ [], r ≠ ps[qrl.last].next, r ≠ qrl.last, r ≠ r0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((r0 ' + qrl) + ps[qrl.last].next ') + orl0 + phead2 ', vs, ps, owns), markedp(qrl.butlast, vs), markedp(qrl.butlast, ps), nextnottid(tid, qrl.last, vs), noid(tid, ((r0 ' + qrl) + ps[qrl.last].next ') + orl0 + phead2 ', qrl.last, vs), nonullRetRefs(((r0 ' + qrl) + ps[qrl.last].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[qrl.last].deqID), some?(ps[qrl.last].deqID), some?(vs[ps[qrl.last].next].deqID), some?(ps[ps[qrl.last].next].deqID), some?(vs[r0].deqID), some?(ps[r0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(qrl.butlast + orl0), ¬ dups(qrl.butlast), ¬ dups(orl0), ¬ ps[qrl.last].next ∈ orl0, ¬ qrl.last ∈ orl0, ¬ r0 ∈ qrl.butlast, ¬ r0 ∈ orl0, ¬ r ∈ orl0, ¬ r ∈ qrl.butlast, ¬ qrl.last ∈ qrl.butlast, ¬ phead2 ∈ orl0, ¬ phead2 ∈ qrl.butlast, ¬ ps[qrl.last].next ∈ qrl.butlast, vs[qrl.last].next ≠ null ∧ vs[vs[qrl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[qrl.last].next].deqID.tid)) = Claimed(vs[vs[qrl.last].next].deqID.tid, vs[vs[qrl.last].next].val), r = phead0 ∨ r ∈ qrl0, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead0 ∈ orl0 ∨ phead0 = phead2, phead = r0 ∨ phead ∈ qrl.butlast ∨ phead = qrl.last ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ ¬ a ∈ x → (a ∈ b ' + x ↔ a = b); (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s)
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), vs[r].deqID ≠ None, qrl.last ≠ phead2, qrl.last ≠ r0, ps[qrl.last].next ≠ qrl.last, vs[phead2].next ≠ null, vs[phead2].next ≠ qrl.last, ps[qrl.last].next ≠ phead2, ps[qrl.last].next ≠ r0, phead ≠ ps[qrl.last].next, phead2 ≠ r0, qrl ≠ [], r ≠ ps[qrl.last].next, r ≠ qrl.last, r ≠ r0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((r0 ' + qrl) + ps[qrl.last].next ') + orl0 + phead2 ', vs, ps, owns), markedp(qrl.butlast, vs), markedp(qrl.butlast, ps), nextnottid(tid, qrl.last, vs), noid(tid, ((r0 ' + qrl) + ps[qrl.last].next ') + orl0 + phead2 ', qrl.last, vs), nonullRetRefs(((r0 ' + qrl) + ps[qrl.last].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[qrl.last].deqID), some?(ps[qrl.last].deqID), some?(vs[ps[qrl.last].next].deqID), some?(ps[ps[qrl.last].next].deqID), some?(vs[r0].deqID), some?(ps[r0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(qrl.butlast + orl0), ¬ dups(qrl.butlast), ¬ dups(orl0), ¬ ps[qrl.last].next ∈ orl0, ¬ qrl.last ∈ orl0, ¬ r0 ∈ qrl.butlast, ¬ r0 ∈ orl0, ¬ r ∈ orl0, ¬ r ∈ qrl.butlast, ¬ qrl.last ∈ qrl.butlast, ¬ phead2 ∈ orl0, ¬ phead2 ∈ qrl.butlast, ¬ ps[qrl.last].next ∈ qrl.butlast, vs[qrl.last].next ≠ null ∧ vs[vs[qrl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[qrl.last].next].deqID.tid)) = Claimed(vs[vs[qrl.last].next].deqID.tid, vs[vs[qrl.last].next].val), r = phead0 ∨ r ∈ qrl0, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead0 ∈ orl0 ∨ phead0 = phead2, phead = r0 ∨ phead ∈ qrl.butlast ∨ phead = qrl.last ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null |
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), qrl = qrl1 + r1 ', vs[r].deqID ≠ None, ps[r1].next ≠ r1, vs[phead2].next ≠ null, vs[phead2].next ≠ r1, ps[r1].next ≠ phead2, ps[r1].next ≠ r0, phead ≠ ps[r1].next, phead2 ≠ r0, qrl ≠ [], r ≠ ps[r1].next, r ≠ r1, r ≠ r0, r1 ≠ phead2, r1 ≠ r0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((r0 ' + qrl) + ps[r1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(qrl1, ps), markedp(qrl1, vs), nextnottid(tid, r1, vs), noid(tid, ((r0 ' + qrl) + ps[r1].next ') + orl0 + phead2 ', r1, vs), nonullRetRefs(((r0 ' + qrl) + ps[r1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[r0].deqID), some?(vs[r0].deqID), some?(ps[ps[r1].next].deqID), some?(vs[ps[r1].next].deqID), some?(ps[r1].deqID), some?(vs[r1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, ¬ dups(qrl1 + orl0), ¬ dups(qrl1), ¬ dups(orl0), ¬ ps[r1].next ∈ orl0, ¬ r1 ∈ orl0, ¬ r0 ∈ qrl1, ¬ r0 ∈ orl0, ¬ r ∈ orl0, ¬ r ∈ qrl1, ¬ r1 ∈ qrl1, ¬ phead2 ∈ orl0, ¬ phead2 ∈ qrl1, ¬ ps[r1].next ∈ qrl1, vs[r1].next ≠ null ∧ vs[vs[r1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[r1].next].deqID.tid)) = Claimed(vs[vs[r1].next].deqID.tid, vs[vs[r1].next].val), phead = r0 ∨ phead ∈ qrl1 ∨ phead = r1, phead0 ∈ orl0 ∨ phead0 = phead2, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, r = phead0 ∨ r ∈ qrl0 ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl, r1, y
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), qrl = qrl1 + r1 ', vs[r].deqID ≠ None, ps[r1].next ≠ r1, vs[phead2].next ≠ null, vs[phead2].next ≠ r1, ps[r1].next ≠ phead2, ps[r1].next ≠ r0, phead ≠ ps[r1].next, phead2 ≠ r0, qrl ≠ [], r ≠ ps[r1].next, r ≠ r1, r ≠ r0, r1 ≠ phead2, r1 ≠ r0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((r0 ' + qrl) + ps[r1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(qrl1, ps), markedp(qrl1, vs), nextnottid(tid, r1, vs), noid(tid, ((r0 ' + qrl) + ps[r1].next ') + orl0 + phead2 ', r1, vs), nonullRetRefs(((r0 ' + qrl) + ps[r1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[r0].deqID), some?(vs[r0].deqID), some?(ps[ps[r1].next].deqID), some?(vs[ps[r1].next].deqID), some?(ps[r1].deqID), some?(vs[r1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, ¬ dups(qrl1 + orl0), ¬ dups(qrl1), ¬ dups(orl0), ¬ ps[r1].next ∈ orl0, ¬ r1 ∈ orl0, ¬ r0 ∈ qrl1, ¬ r0 ∈ orl0, ¬ r ∈ orl0, ¬ r ∈ qrl1, ¬ r1 ∈ qrl1, ¬ phead2 ∈ orl0, ¬ phead2 ∈ qrl1, ¬ ps[r1].next ∈ qrl1, vs[r1].next ≠ null ∧ vs[vs[r1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[r1].next].deqID.tid)) = Claimed(vs[vs[r1].next].deqID.tid, vs[vs[r1].next].val), phead = r0 ∨ phead ∈ qrl1 ∨ phead = r1, phead0 ∈ orl0 ∨ phead0 = phead2, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, r = phead0 ∨ r ∈ qrl0 ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null |
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), vs[r].deqID ≠ None, ps[r1].next ≠ r1, vs[phead2].next ≠ null, vs[phead2].next ≠ r1, ps[r1].next ≠ phead2, ps[r1].next ≠ r0, phead ≠ ps[r1].next, phead2 ≠ r0, r ≠ ps[r1].next, r ≠ r1, r ≠ r0, r1 ≠ phead2, r1 ≠ r0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((r0 ' + qrl1 + r1 ') + ps[r1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(qrl1, vs), markedp(qrl1, ps), nextnottid(tid, r1, vs), noid(tid, ((r0 ' + qrl1 + r1 ') + ps[r1].next ') + orl0 + phead2 ', r1, vs), nonullRetRefs(((r0 ' + qrl1 + r1 ') + ps[r1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[r1].deqID), some?(ps[r1].deqID), some?(vs[ps[r1].next].deqID), some?(ps[ps[r1].next].deqID), some?(vs[r0].deqID), some?(ps[r0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(qrl1 + orl0), ¬ dups(qrl1), ¬ dups(orl0), ¬ ps[r1].next ∈ orl0, ¬ r1 ∈ orl0, ¬ r0 ∈ qrl1, ¬ r0 ∈ orl0, ¬ r ∈ orl0, ¬ r ∈ qrl1, ¬ r1 ∈ qrl1, ¬ phead2 ∈ orl0, ¬ phead2 ∈ qrl1, ¬ ps[r1].next ∈ qrl1, vs[r1].next ≠ null ∧ vs[vs[r1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[r1].next].deqID.tid)) = Claimed(vs[vs[r1].next].deqID.tid, vs[vs[r1].next].val), r = phead0 ∨ r ∈ qrl0, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead0 ∈ orl0 ∨ phead0 = phead2, phead = r0 ∨ phead ∈ qrl1 ∨ phead = r1 ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ x + a ' ≠ []; (s)
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), vs[r].deqID ≠ None, ps[r1].next ≠ r1, vs[phead2].next ≠ null, vs[phead2].next ≠ r1, ps[r1].next ≠ phead2, ps[r1].next ≠ r0, phead ≠ ps[r1].next, phead2 ≠ r0, r ≠ ps[r1].next, r ≠ r1, r ≠ r0, r1 ≠ phead2, r1 ≠ r0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((r0 ' + qrl1 + r1 ') + ps[r1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(qrl1, vs), markedp(qrl1, ps), nextnottid(tid, r1, vs), noid(tid, ((r0 ' + qrl1 + r1 ') + ps[r1].next ') + orl0 + phead2 ', r1, vs), nonullRetRefs(((r0 ' + qrl1 + r1 ') + ps[r1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[r1].deqID), some?(ps[r1].deqID), some?(vs[ps[r1].next].deqID), some?(ps[ps[r1].next].deqID), some?(vs[r0].deqID), some?(ps[r0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(qrl1 + orl0), ¬ dups(qrl1), ¬ dups(orl0), ¬ ps[r1].next ∈ orl0, ¬ r1 ∈ orl0, ¬ r0 ∈ qrl1, ¬ r0 ∈ orl0, ¬ r ∈ orl0, ¬ r ∈ qrl1, ¬ r1 ∈ qrl1, ¬ phead2 ∈ orl0, ¬ phead2 ∈ qrl1, ¬ ps[r1].next ∈ qrl1, vs[r1].next ≠ null ∧ vs[vs[r1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[r1].next].deqID.tid)) = Claimed(vs[vs[r1].next].deqID.tid, vs[vs[r1].next].val), r = phead0 ∨ r ∈ qrl0, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead0 ∈ orl0 ∨ phead0 = phead2, phead = r0 ∨ phead ∈ qrl1 ∨ phead = r1 ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null |
Used simplifier rules: reflist freely generated by [], +;; ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a + x = a ' + x; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ unmarkedp([], vs); (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s)
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ noid(tid, ((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, phead1, vs), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ⊦ |
⊦ noid(tid, rl, r, vs) → (noid(tid, rl0, r, vs0) ↔ (∀ r0. (r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) → r0 ≠ r ∧ r0 ∈ rl0 from r → vs0[r0].deqID ≠ Some(tid)))
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), ∃ r0. ¬ ( (r0 ≠ phead1 ∧ r0 ∈ ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ' from phead1 → vs[r0].deqID ≠ Some(tid)) → r0 ≠ phead1 ∧ r0 ∈ ((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0 from phead1 → vs[r0].deqID ≠ Some(tid)), phead0 ∈ orl0 ∨ phead0 = phead2, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', tid, phead1, vs, ((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0, vs
| ⊦ noid(tid, rl, r, vs) → (noid(tid, rl0, r, vs0) ↔ (∀ r0. (r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) → r0 ≠ r ∧ r0 ∈ rl0 from r → vs0[r0].deqID ≠ Some(tid))) |
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), ∃ r0. ¬ ( (r0 ≠ phead1 ∧ r0 ∈ ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ' from phead1 → vs[r0].deqID ≠ Some(tid)) → r0 ≠ phead1 ∧ r0 ∈ ((orl + phead1 ') + ps[phead1].next ') + phead0 ' + qrl0 from phead1 → vs[r0].deqID ≠ Some(tid)), phead0 ∈ orl0 ∨ phead0 = phead2, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next ⊦ |
(orl0 + phead2 ') + qrl0.last ' = phead0 ' + qrl0, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[qrl0.last].deqID = None, vs[r0].deqID = Some(tid), qrl0.last = vs[phead2].next, vs[qrl0.last].next = null, ps[phead2].next = null, ps[qrl0.last] = vs[qrl0.last], dom vrvHp = dom prvHp, owns(qrl0.last) = Weak(tid), qrl0.last ≠ null, qrl0.last ≠ phead1, ps[phead1].next ≠ phead1, ps[phead1].next ≠ phead2, phead ≠ ps[phead1].next, phead0 ≠ qrl0.last, phead1 ≠ phead2, qrl0 ≠ [], r0 ≠ phead2, r0 ≠ ps[phead1].next, r0 ≠ phead1, r0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, qrl0.last, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, qrl0.last ∈ vs, qrl0.last ∈ ps, phead ∈ vs, phead ∈ ps, qrl0.last ∈ ps[phead2, ps[phead2].next:= qrl0.last], r0 ∈ qrl0, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ r0 ∈ orl0, ¬ phead1 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead2 ∈ orl, ¬ ps[phead1].next ∈ orl, ¬ ps[phead1].next ∈ orl0, ¬ phead1 ∈ orl0, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead ∈ orl ∨ phead = phead1, phead0 = phead2 ∨ phead0 ∈ orl0, phead0 ∈ orl0 ∨ phead0 = phead2 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] inapp-10: ⊦ a ' + x = y + b ' ∧ a ≠ b → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] lapp-04: ⊦ a ' + x = y + b ' ∧ a ≠ b → x.last = b; (forward) from specification list-last[reflist] inapp-13: ⊦ a ' + x = y + b ' ∧ c ∈ x ∧ c ≠ b → c ∈ y; (forward) from specification list[reflist] ⊦ ¬ a ∈ y → (y + c ' + z = a ' + z0 ↔ y = [] ∧ c = a ∧ z = z0); (ws) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| (orl0 + phead2 ') + qrl0.last ' = phead0 ' + qrl0, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[qrl0.last].deqID = None, vs[r0].deqID = Some(tid), qrl0.last = vs[phead2].next, vs[qrl0.last].next = null, ps[phead2].next = null, ps[qrl0.last] = vs[qrl0.last], dom vrvHp = dom prvHp, owns(qrl0.last) = Weak(tid), qrl0.last ≠ null, qrl0.last ≠ phead1, ps[phead1].next ≠ phead1, ps[phead1].next ≠ phead2, phead ≠ ps[phead1].next, phead0 ≠ qrl0.last, phead1 ≠ phead2, qrl0 ≠ [], r0 ≠ phead2, r0 ≠ ps[phead1].next, r0 ≠ phead1, r0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, qrl0.last, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, qrl0.last ∈ vs, qrl0.last ∈ ps, phead ∈ vs, phead ∈ ps, qrl0.last ∈ ps[phead2, ps[phead2].next:= qrl0.last], r0 ∈ qrl0, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ r0 ∈ orl0, ¬ phead1 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead2 ∈ orl, ¬ ps[phead1].next ∈ orl, ¬ ps[phead1].next ∈ orl0, ¬ phead1 ∈ orl0, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead ∈ orl ∨ phead = phead1, phead0 = phead2 ∨ phead0 ∈ orl0, phead0 ∈ orl0 ∨ phead0 = phead2 ⊦ |
Used simplifier rules: ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ x + a ' ≠ []; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ inapp-13: ⊦ a ' + x = y + b ' ∧ c ∈ x ∧ c ≠ b → c ∈ y; (forward) from specification list[reflist] list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s) ⊦ None ≠ Some(tid); (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl0, r, y
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead2].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ noowns(tid, owns(vs[phead2].next; None)), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ⊦ |
⊦ oneweakowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Weak(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ noowns(tid, owns(vs[phead2].next; None)), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), ∀ r0. r0 ≠ vs[phead2].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, phead0 ∈ orl0 ∨ phead0 = phead2, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next ⊦
Used terms: ps, tid, owns, vs[phead2].next, vs
| ⊦ oneweakowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Weak(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid) |
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ noowns(tid, owns(vs[phead2].next; None)), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), ∀ r0. r0 ≠ vs[phead2].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, phead0 ∈ orl0 ∨ phead0 = phead2, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next ⊦ |
⊦ noowns(tid, owns) ↔ (∀ r. owns(r) ≠ None → owns(r).tid ≠ tid)
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), ∀ r0. r0 ≠ vs[phead2].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, ∃ r. ¬(owns(vs[phead2].next; None)(r) ≠ None → owns(vs[phead2].next; None)(r).tid ≠ tid), phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ⊦
Used terms: tid, owns(vs[phead2].next; None)
| ⊦ noowns(tid, owns) ↔ (∀ r. owns(r) ≠ None → owns(r).tid ≠ tid) |
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[vs[phead2].next].deqID = None, ps[phead2].deqID = None, vs[phead2].deqID = None, ps[phead2].next = null, vs[vs[phead2].next].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, phead1, vs), noid(tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[ps[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vs[phead2].next ∈ ps, vs[phead2].next ∈ vs, vs[phead2].next ∈ qrl0, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), ∀ r0. r0 ≠ vs[phead2].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, ∃ r. ¬(owns(vs[phead2].next; None)(r) ≠ None → owns(vs[phead2].next; None)(r).tid ≠ tid), phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ⊦ |
(orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(owns(r).tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, vs[phead2].next ≠ r, None ≠ owns(r), phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(owns(r).tid, phead1, vs), noid(owns(r).tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), ∀ r0. r0 ≠ vs[phead2].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ owns(r).tid, phead0 ∈ orl0 ∨ phead0 = phead2, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next ⊦
| (orl0 + phead2 ') + vs[phead2].next ' = phead0 ' + qrl0, vs[phead2].deqID = None, ps[phead2].deqID = None, vs[vs[phead2].next].deqID = None, vs[vs[phead2].next].next = null, ps[phead2].next = null, ps[vs[phead2].next] = vs[vs[phead2].next], dom vrvHp = dom prvHp, owns(vs[phead2].next) = Weak(owns(r).tid), ps[phead1].next ≠ phead2, vs[phead2].next ≠ phead1, vs[phead2].next ≠ null, ps[phead1].next ≠ phead1, vs[phead2].next ≠ r, None ≠ owns(r), phead ≠ ps[phead1].next, phead1 ≠ phead2, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(owns(r).tid, phead1, vs), noid(owns(r).tid, ((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', phead1, vs), nonullRetRefs(((orl + phead1 ') + ps[phead1].next ') + orl0 + phead2 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[ps[phead1].next].deqID), some?(vs[ps[phead1].next].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead2].next ∈ ps[phead2, ps[phead2].next:= vs[phead2].next], vs[phead2].next ∈ qrl0, vs[phead2].next ∈ vs, vs[phead2].next ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ ps[phead1].next ∈ orl0, ¬ ps[phead1].next ∈ orl, ¬ phead2 ∈ orl, ¬ phead2 ∈ orl0, ¬ phead1 ∈ orl, vs[phead1].next ≠ null ∧ vs[vs[phead1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead1].next].deqID.tid)) = Claimed(vs[vs[phead1].next].deqID.tid, vs[vs[phead1].next].val), ∀ r0. r0 ≠ vs[phead2].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ owns(r).tid, phead0 ∈ orl0 ∨ phead0 = phead2, phead ∈ orl ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead2 ∨ phead0 = vs[phead2].next ⊦ |
Used terms: r
| qrl + vs[vtail].next ' = phead0 ' + qrl0, vs[qrl.last].deqID = None, ps[vtail].next = null, vs[qrl.last].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vtail = (orl + qrl.butlast).last, vs[vtail].next ≠ null, orl ≠ [], qrl ≠ [], 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ qrl ∨ phead0 = vs[vtail].next, vs[vtail].next = phead0 ∨ vs[vtail].next ∈ qrl0, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (vtail ∈ orl ∨ vtail ∈ qrl ∨ vtail = vs[vtail].next) ∧ vs[vtail].next ∈ ps[vtail, ps[vtail].next:= vs[vtail].next] ∧ vs[vtail].next ∈ vs ∧ listp(orl + phead0 ' + qrl0, vs, ps[vtail, ps[vtail].next:= vs[vtail].next], owns(vs[vtail].next; None)) ∧ ¬ vs[vtail].next ∈ orl ∧ ¬ vs[vtail].next ∈ qrl ∧ markedp(orl, ps[vtail, ps[vtail].next:= vs[vtail].next]) ∧ unmarkedp(qrl, ps[vtail, ps[vtail].next:= vs[vtail].next]) ∧ ps[vtail, ps[vtail].next:= vs[vtail].next][vs[vtail].next].deqID = None ∧ nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ∧ vs[vs[vtail].next].deqID = None) ∧ (vtail = vs[vtail].next ∨ vtail = (orl + qrl).last ∧ vs[vs[(orl + qrl).last].next].deqID = None ∧ vs[vs[(orl + qrl).last].next].next = null) ∧ noid(tid, orl + phead0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[vtail].next; None)) |
qrl + vs[(orl + qrl.butlast).last].next ' = phead0 ' + qrl0, vs[qrl.last].deqID = None, ps[(orl + qrl.butlast).last].next = null, vs[qrl.last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + qrl.butlast).last].next) = Weak(tid), vs[(orl + qrl.butlast).last].next ≠ null, orl ≠ [], qrl ≠ [], 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), oneweakowns(tid, vs[(orl + qrl.butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead0 ∈ qrl, vs[(orl + qrl.butlast).last].next ∈ qrl0, phead ∈ orl, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ((orl + qrl.butlast).last ∈ orl ∨ (orl + qrl.butlast).last ∈ qrl ∨ (orl + qrl.butlast).last = vs[(orl + qrl.butlast).last].next) ∧ vs[(orl + qrl.butlast).last].next ∈ ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next] ∧ vs[(orl + qrl.butlast).last].next ∈ vs ∧ listp (orl + phead0 ' + qrl0, vs, ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next], owns(vs[(orl + qrl.butlast).last].next; None)) ∧ ¬ vs[(orl + qrl.butlast).last].next ∈ orl ∧ ¬ vs[(orl + qrl.butlast).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next]) ∧ ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][vs[(orl + qrl.butlast).last].next].deqID = None ∧ nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ∧ vs[vs[(orl + qrl.butlast).last].next].deqID = None) ∧ ((orl + qrl.butlast).last = vs[(orl + qrl.butlast).last].next ∨ (orl + qrl.butlast).last = qrl.last ∧ vs[null].deqID = None ∧ vs[null].next = null) ∧ noid(tid, orl + phead0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl.butlast).last].next; None))
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ a ∈ x → a ∈ x + y; (s) ⊦ a ∈ y → a ∈ x + y; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] inapp-08: ⊦ a ' + x = y + b ' ∧ y ≠ [] → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] ⊦ y ≠ [] → (x + y).last = y.last; (s)
| qrl + vs[(orl + qrl.butlast).last].next ' = phead0 ' + qrl0, vs[qrl.last].deqID = None, ps[(orl + qrl.butlast).last].next = null, vs[qrl.last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + qrl.butlast).last].next) = Weak(tid), vs[(orl + qrl.butlast).last].next ≠ null, orl ≠ [], qrl ≠ [], 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), oneweakowns(tid, vs[(orl + qrl.butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead0 ∈ qrl, vs[(orl + qrl.butlast).last].next ∈ qrl0, phead ∈ orl, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ((orl + qrl.butlast).last ∈ orl ∨ (orl + qrl.butlast).last ∈ qrl ∨ (orl + qrl.butlast).last = vs[(orl + qrl.butlast).last].next) ∧ vs[(orl + qrl.butlast).last].next ∈ ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next] ∧ vs[(orl + qrl.butlast).last].next ∈ vs ∧ listp (orl + phead0 ' + qrl0, vs, ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next], owns(vs[(orl + qrl.butlast).last].next; None)) ∧ ¬ vs[(orl + qrl.butlast).last].next ∈ orl ∧ ¬ vs[(orl + qrl.butlast).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next]) ∧ ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][vs[(orl + qrl.butlast).last].next].deqID = None ∧ nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ∧ vs[vs[(orl + qrl.butlast).last].next].deqID = None) ∧ ((orl + qrl.butlast).last = vs[(orl + qrl.butlast).last].next ∨ (orl + qrl.butlast).last = qrl.last ∧ vs[null].deqID = None ∧ vs[null].next = null) ∧ noid(tid, orl + phead0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl.butlast).last].next; None)) |
qrl + vs[(orl + qrl.butlast).last].next ' = phead0 ' + qrl0, vs[qrl.last].deqID = None, vs[qrl.last].next = null, ps[(orl + qrl.butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + qrl.butlast).last].next) = Weak(tid), qrl = vhead0 + orl0, vs[(orl + qrl.butlast).last].next ≠ null, orl ≠ [], qrl ≠ [], 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), oneweakowns(tid, vs[(orl + qrl.butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, vs[(orl + qrl.butlast).last].next ∈ qrl0, phead0 ∈ qrl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ((orl + qrl.butlast).last ∈ orl ∨ (orl + qrl.butlast).last ∈ qrl ∨ (orl + qrl.butlast).last = vs[(orl + qrl.butlast).last].next) ∧ vs[(orl + qrl.butlast).last].next ∈ ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next] ∧ vs[(orl + qrl.butlast).last].next ∈ vs ∧ listp (orl + phead0 ' + qrl0, vs, ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next], owns(vs[(orl + qrl.butlast).last].next; None)) ∧ ¬ vs[(orl + qrl.butlast).last].next ∈ orl ∧ ¬ vs[(orl + qrl.butlast).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next]) ∧ ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][vs[(orl + qrl.butlast).last].next].deqID = None ∧ nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ∧ vs[vs[(orl + qrl.butlast).last].next].deqID = None) ∧ ((orl + qrl.butlast).last = vs[(orl + qrl.butlast).last].next ∨ (orl + qrl.butlast).last = qrl.last ∧ vs[null].deqID = None ∧ vs[null].next = null) ∧ noid(tid, orl + phead0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl.butlast).last].next; None))
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, tail
| qrl + vs[(orl + qrl.butlast).last].next ' = phead0 ' + qrl0, vs[qrl.last].deqID = None, vs[qrl.last].next = null, ps[(orl + qrl.butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + qrl.butlast).last].next) = Weak(tid), qrl = vhead0 + orl0, vs[(orl + qrl.butlast).last].next ≠ null, orl ≠ [], qrl ≠ [], 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), oneweakowns(tid, vs[(orl + qrl.butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, vs[(orl + qrl.butlast).last].next ∈ qrl0, phead0 ∈ qrl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ((orl + qrl.butlast).last ∈ orl ∨ (orl + qrl.butlast).last ∈ qrl ∨ (orl + qrl.butlast).last = vs[(orl + qrl.butlast).last].next) ∧ vs[(orl + qrl.butlast).last].next ∈ ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next] ∧ vs[(orl + qrl.butlast).last].next ∈ vs ∧ listp (orl + phead0 ' + qrl0, vs, ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next], owns(vs[(orl + qrl.butlast).last].next; None)) ∧ ¬ vs[(orl + qrl.butlast).last].next ∈ orl ∧ ¬ vs[(orl + qrl.butlast).last].next ∈ qrl ∧ markedp(orl, ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next]) ∧ unmarkedp(qrl, ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next]) ∧ ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][vs[(orl + qrl.butlast).last].next].deqID = None ∧ nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ∧ vs[vs[(orl + qrl.butlast).last].next].deqID = None) ∧ ((orl + qrl.butlast).last = vs[(orl + qrl.butlast).last].next ∨ (orl + qrl.butlast).last = qrl.last ∧ vs[null].deqID = None ∧ vs[null].next = null) ∧ noid(tid, orl + phead0 ' + qrl0, vhead, vs) ∧ noowns(tid, owns(vs[(orl + qrl.butlast).last].next; None)) |
ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, vs[(phead0 ' + orl0).last].next = null, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid), vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ ( (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0 ∨ (orl + (phead0 ' + orl0).butlast).last = vs[(orl + (phead0 ' + orl0).butlast).last].next) ∧ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next] ∧ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ vs ∧ listp (orl + phead0 ' + orl0 + vs[(orl + (phead0 ' + orl0).butlast).last].next ', vs, ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next], owns(vs[(orl + (phead0 ' + orl0).butlast).last].next; None)) ∧ ¬ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ orl ∧ vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ phead0 ∧ ¬ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ orl0 ∧ markedp (orl, ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next]) ∧ ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next] [phead0 ] .deqID = None ∧ unmarkedp (orl0, ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next]) ∧ ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next] [vs[(orl + (phead0 ' + orl0).butlast).last].next ] .deqID = None ∧ nonullRetRefs(orl + phead0 ' + orl0 + vs[(orl + (phead0 ' + orl0).butlast).last].next ', vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(orl0, vs) ∧ vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ∧ vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].deqID = None) ∧ ( (orl + (phead0 ' + orl0).butlast).last = vs[(orl + (phead0 ' + orl0).butlast).last].next ∨ (orl + (phead0 ' + orl0).butlast).last = (phead0 ' + orl0).last ∧ vs[null].deqID = None ∧ vs[null].next = null) ∧ noid(tid, orl + phead0 ' + orl0 + vs[(orl + (phead0 ' + orl0).butlast).last].next ', vhead, vs) ∧ noowns(tid, owns(vs[(orl + (phead0 ' + orl0).butlast).last].next; None))
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ' + x ≠ []; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)
| ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, vs[(phead0 ' + orl0).last].next = null, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid), vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ ( (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0 ∨ (orl + (phead0 ' + orl0).butlast).last = vs[(orl + (phead0 ' + orl0).butlast).last].next) ∧ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next] ∧ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ vs ∧ listp (orl + phead0 ' + orl0 + vs[(orl + (phead0 ' + orl0).butlast).last].next ', vs, ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next], owns(vs[(orl + (phead0 ' + orl0).butlast).last].next; None)) ∧ ¬ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ orl ∧ vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ phead0 ∧ ¬ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ orl0 ∧ markedp (orl, ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next]) ∧ ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next] [phead0 ] .deqID = None ∧ unmarkedp (orl0, ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next]) ∧ ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next] [vs[(orl + (phead0 ' + orl0).butlast).last].next ] .deqID = None ∧ nonullRetRefs(orl + phead0 ' + orl0 + vs[(orl + (phead0 ' + orl0).butlast).last].next ', vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(orl0, vs) ∧ vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ∧ vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].deqID = None) ∧ ( (orl + (phead0 ' + orl0).butlast).last = vs[(orl + (phead0 ' + orl0).butlast).last].next ∨ (orl + (phead0 ' + orl0).butlast).last = (phead0 ' + orl0).last ∧ vs[null].deqID = None ∧ vs[null].next = null) ∧ noid(tid, orl + phead0 ' + orl0 + vs[(orl + (phead0 ' + orl0).butlast).last].next ', vhead, vs) ∧ noowns(tid, owns(vs[(orl + (phead0 ' + orl0).butlast).last].next; None)) |
⊦ y ≠ [] → (x + y).last = y.last
vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, orl0 = [], owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid), vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ ( (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0 ∨ (orl + (phead0 ' + orl0).butlast).last = vs[(orl + (phead0 ' + orl0).butlast).last].next) ∧ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next] ∧ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ vs ∧ listp (orl + phead0 ' + orl0 + vs[(orl + (phead0 ' + orl0).butlast).last].next ', vs, ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next], owns(vs[(orl + (phead0 ' + orl0).butlast).last].next; None)) ∧ ¬ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ orl ∧ vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ phead0 ∧ ¬ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ orl0 ∧ markedp (orl, ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next]) ∧ ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next] [phead0 ] .deqID = None ∧ unmarkedp (orl0, ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next]) ∧ ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next] [vs[(orl + (phead0 ' + orl0).butlast).last].next ] .deqID = None ∧ nonullRetRefs(orl + phead0 ' + orl0 + vs[(orl + (phead0 ' + orl0).butlast).last].next ', vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(orl0, vs) ∧ vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ∧ vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].deqID = None) ∧ ( (orl + (phead0 ' + orl0).butlast).last = vs[(orl + (phead0 ' + orl0).butlast).last].next ∨ (orl + (phead0 ' + orl0).butlast).last = (phead0 ' + orl0).last ∧ vs[null].deqID = None ∧ vs[null].next = null) ∧ noid(tid, orl + phead0 ' + orl0 + vs[(orl + (phead0 ' + orl0).butlast).last].next ', vhead, vs) ∧ noowns(tid, owns(vs[(orl + (phead0 ' + orl0).butlast).last].next; None))
vs[orl0.last].deqID = None, ps[phead0].deqID = None, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[orl0.last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid), vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], orl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ ( (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0 ∨ (orl + (phead0 ' + orl0).butlast).last = vs[(orl + (phead0 ' + orl0).butlast).last].next) ∧ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next] ∧ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ vs ∧ listp (orl + phead0 ' + orl0 + vs[(orl + (phead0 ' + orl0).butlast).last].next ', vs, ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next], owns(vs[(orl + (phead0 ' + orl0).butlast).last].next; None)) ∧ ¬ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ orl ∧ vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ phead0 ∧ ¬ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ orl0 ∧ markedp (orl, ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next]) ∧ ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next] [phead0 ] .deqID = None ∧ unmarkedp (orl0, ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next]) ∧ ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next] [vs[(orl + (phead0 ' + orl0).butlast).last].next ] .deqID = None ∧ nonullRetRefs(orl + phead0 ' + orl0 + vs[(orl + (phead0 ' + orl0).butlast).last].next ', vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(orl0, vs) ∧ vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ∧ vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].deqID = None) ∧ ( (orl + (phead0 ' + orl0).butlast).last = vs[(orl + (phead0 ' + orl0).butlast).last].next ∨ (orl + (phead0 ' + orl0).butlast).last = orl0.last ∧ vs[null].deqID = None ∧ vs[null].next = null) ∧ noid(tid, orl + phead0 ' + orl0 + vs[(orl + (phead0 ' + orl0).butlast).last].next ', vhead, vs) ∧ noowns(tid, owns(vs[(orl + (phead0 ' + orl0).butlast).last].next; None))
Used terms: phead0 ', orl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, orl0 = [], owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid), vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ ( (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0 ∨ (orl + (phead0 ' + orl0).butlast).last = vs[(orl + (phead0 ' + orl0).butlast).last].next) ∧ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next] ∧ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ vs ∧ listp (orl + phead0 ' + orl0 + vs[(orl + (phead0 ' + orl0).butlast).last].next ', vs, ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next], owns(vs[(orl + (phead0 ' + orl0).butlast).last].next; None)) ∧ ¬ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ orl ∧ vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ phead0 ∧ ¬ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ orl0 ∧ markedp (orl, ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next]) ∧ ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next] [phead0 ] .deqID = None ∧ unmarkedp (orl0, ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next]) ∧ ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next] [vs[(orl + (phead0 ' + orl0).butlast).last].next ] .deqID = None ∧ nonullRetRefs(orl + phead0 ' + orl0 + vs[(orl + (phead0 ' + orl0).butlast).last].next ', vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(orl0, vs) ∧ vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ∧ vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].deqID = None) ∧ ( (orl + (phead0 ' + orl0).butlast).last = vs[(orl + (phead0 ' + orl0).butlast).last].next ∨ (orl + (phead0 ' + orl0).butlast).last = (phead0 ' + orl0).last ∧ vs[null].deqID = None ∧ vs[null].next = null) ∧ noid(tid, orl + phead0 ' + orl0 + vs[(orl + (phead0 ' + orl0).butlast).last].next ', vhead, vs) ∧ noowns(tid, owns(vs[(orl + (phead0 ' + orl0).butlast).last].next; None)) |
ps[phead0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, ps[orl.last].next = null, dom vrvHp = dom prvHp, owns(vs[orl.last].next) = Weak(tid), vs[orl.last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[orl.last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl), ¬ phead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ⊦
Used simplifier rules: ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ [] + x = x; (s) ⊦ a '.last = a; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ a ∈ []; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ ¬ dups([]); (s)
| ps[phead0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, ps[orl.last].next = null, dom vrvHp = dom prvHp, owns(vs[orl.last].next) = Weak(tid), vs[orl.last].next ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[orl.last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl), ¬ phead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ⊦ |
vs[phead0].deqID = None, ps[phead0].deqID = None, ps[vhead0].next = null, vs[phead0].next = null, dom vrvHp = dom prvHp, orl = orl0 + vhead0 ', owns(vs[vhead0].next) = Weak(tid), vs[vhead0].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ phead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, vhead0, y
| vs[phead0].deqID = None, ps[phead0].deqID = None, ps[vhead0].next = null, vs[phead0].next = null, dom vrvHp = dom prvHp, orl = orl0 + vhead0 ', owns(vs[vhead0].next) = Weak(tid), vs[vhead0].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ phead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ⊦ |
ps[phead0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, ps[vhead0].next = null, dom vrvHp = dom prvHp, owns(vs[vhead0].next) = Weak(tid), vs[vhead0].next ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + vhead0 ') + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, ¬ dups(orl0), ¬ vhead0 ∈ orl0, ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0, phead ∈ orl0 ∨ phead = vhead0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| ps[phead0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, ps[vhead0].next = null, dom vrvHp = dom prvHp, owns(vs[vhead0].next) = Weak(tid), vs[vhead0].next ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + vhead0 ') + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, ¬ dups(orl0), ¬ vhead0 ∈ orl0, ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0, phead ∈ orl0 ∨ phead = vhead0 ⊦ |
⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])
Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ listp(r ' + r0 ', 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 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, orl0, owns, vhead0 ' + phead0 ', vs
| ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []) |
| vs[orl0.last].deqID = None, ps[phead0].deqID = None, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[orl0.last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid), vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], orl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ ( (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0 ∨ (orl + (phead0 ' + orl0).butlast).last = vs[(orl + (phead0 ' + orl0).butlast).last].next) ∧ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next] ∧ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ vs ∧ listp (orl + phead0 ' + orl0 + vs[(orl + (phead0 ' + orl0).butlast).last].next ', vs, ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next], owns(vs[(orl + (phead0 ' + orl0).butlast).last].next; None)) ∧ ¬ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ orl ∧ vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ phead0 ∧ ¬ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ orl0 ∧ markedp (orl, ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next]) ∧ ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next] [phead0 ] .deqID = None ∧ unmarkedp (orl0, ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next]) ∧ ps[(orl + (phead0 ' + orl0).butlast).last, ps[(orl + (phead0 ' + orl0).butlast).last].next:= vs[(orl + (phead0 ' + orl0).butlast).last].next] [vs[(orl + (phead0 ' + orl0).butlast).last].next ] .deqID = None ∧ nonullRetRefs(orl + phead0 ' + orl0 + vs[(orl + (phead0 ' + orl0).butlast).last].next ', vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(orl0, vs) ∧ vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ∧ vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].deqID = None) ∧ ( (orl + (phead0 ' + orl0).butlast).last = vs[(orl + (phead0 ' + orl0).butlast).last].next ∨ (orl + (phead0 ' + orl0).butlast).last = orl0.last ∧ vs[null].deqID = None ∧ vs[null].next = null) ∧ noid(tid, orl + phead0 ' + orl0 + vs[(orl + (phead0 ' + orl0).butlast).last].next ', vhead, vs) ∧ noowns(tid, owns(vs[(orl + (phead0 ' + orl0).butlast).last].next; None)) |
ps[phead0].deqID = None, vs[orl0.last].deqID = None, vs[orl0.last].next = null, ps[(phead0 ' + orl0.butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(phead0 ' + orl0.butlast).last].next) = Weak(tid), vs[(phead0 ' + orl0.butlast).last].next ≠ null, orl ≠ [], orl0 ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl0.butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ ( (phead0 ' + orl0.butlast).last ∈ orl ∨ (phead0 ' + orl0.butlast).last = phead0 ∨ (phead0 ' + orl0.butlast).last ∈ orl0 ∨ (phead0 ' + orl0.butlast).last = vs[(phead0 ' + orl0.butlast).last].next) ∧ vs[(phead0 ' + orl0.butlast).last].next ∈ ps[(phead0 ' + orl0.butlast).last, ps[(phead0 ' + orl0.butlast).last].next:= vs[(phead0 ' + orl0.butlast).last].next] ∧ vs[(phead0 ' + orl0.butlast).last].next ∈ vs ∧ listp (orl + phead0 ' + orl0 + vs[(phead0 ' + orl0.butlast).last].next ', vs, ps[(phead0 ' + orl0.butlast).last, ps[(phead0 ' + orl0.butlast).last].next:= vs[(phead0 ' + orl0.butlast).last].next], owns(vs[(phead0 ' + orl0.butlast).last].next; None)) ∧ ¬ vs[(phead0 ' + orl0.butlast).last].next ∈ orl ∧ vs[(phead0 ' + orl0.butlast).last].next ≠ phead0 ∧ ¬ vs[(phead0 ' + orl0.butlast).last].next ∈ orl0 ∧ markedp(orl, ps[(phead0 ' + orl0.butlast).last, ps[(phead0 ' + orl0.butlast).last].next:= vs[(phead0 ' + orl0.butlast).last].next]) ∧ ps[(phead0 ' + orl0.butlast).last, ps[(phead0 ' + orl0.butlast).last].next:= vs[(phead0 ' + orl0.butlast).last].next][phead0].deqID = None ∧ unmarkedp(orl0, ps[(phead0 ' + orl0.butlast).last, ps[(phead0 ' + orl0.butlast).last].next:= vs[(phead0 ' + orl0.butlast).last].next]) ∧ ps[(phead0 ' + orl0.butlast).last, ps[(phead0 ' + orl0.butlast).last].next:= vs[(phead0 ' + orl0.butlast).last].next] [vs[(phead0 ' + orl0.butlast).last].next ] .deqID = None ∧ nonullRetRefs(orl + phead0 ' + orl0 + vs[(phead0 ' + orl0.butlast).last].next ', vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(orl0, vs) ∧ vs[vs[(phead0 ' + orl0.butlast).last].next].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ∧ vs[vs[(phead0 ' + orl0.butlast).last].next].deqID = None) ∧ ( (phead0 ' + orl0.butlast).last = vs[(phead0 ' + orl0.butlast).last].next ∨ (phead0 ' + orl0.butlast).last = orl0.last ∧ vs[null].deqID = None ∧ vs[null].next = null) ∧ noid(tid, orl + phead0 ' + orl0 + vs[(phead0 ' + orl0.butlast).last].next ', vhead, vs) ∧ noowns(tid, owns(vs[(phead0 ' + orl0.butlast).last].next; None))
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s)
| ps[phead0].deqID = None, vs[orl0.last].deqID = None, vs[orl0.last].next = null, ps[(phead0 ' + orl0.butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(phead0 ' + orl0.butlast).last].next) = Weak(tid), vs[(phead0 ' + orl0.butlast).last].next ≠ null, orl ≠ [], orl0 ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl0.butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ ( (phead0 ' + orl0.butlast).last ∈ orl ∨ (phead0 ' + orl0.butlast).last = phead0 ∨ (phead0 ' + orl0.butlast).last ∈ orl0 ∨ (phead0 ' + orl0.butlast).last = vs[(phead0 ' + orl0.butlast).last].next) ∧ vs[(phead0 ' + orl0.butlast).last].next ∈ ps[(phead0 ' + orl0.butlast).last, ps[(phead0 ' + orl0.butlast).last].next:= vs[(phead0 ' + orl0.butlast).last].next] ∧ vs[(phead0 ' + orl0.butlast).last].next ∈ vs ∧ listp (orl + phead0 ' + orl0 + vs[(phead0 ' + orl0.butlast).last].next ', vs, ps[(phead0 ' + orl0.butlast).last, ps[(phead0 ' + orl0.butlast).last].next:= vs[(phead0 ' + orl0.butlast).last].next], owns(vs[(phead0 ' + orl0.butlast).last].next; None)) ∧ ¬ vs[(phead0 ' + orl0.butlast).last].next ∈ orl ∧ vs[(phead0 ' + orl0.butlast).last].next ≠ phead0 ∧ ¬ vs[(phead0 ' + orl0.butlast).last].next ∈ orl0 ∧ markedp(orl, ps[(phead0 ' + orl0.butlast).last, ps[(phead0 ' + orl0.butlast).last].next:= vs[(phead0 ' + orl0.butlast).last].next]) ∧ ps[(phead0 ' + orl0.butlast).last, ps[(phead0 ' + orl0.butlast).last].next:= vs[(phead0 ' + orl0.butlast).last].next][phead0].deqID = None ∧ unmarkedp(orl0, ps[(phead0 ' + orl0.butlast).last, ps[(phead0 ' + orl0.butlast).last].next:= vs[(phead0 ' + orl0.butlast).last].next]) ∧ ps[(phead0 ' + orl0.butlast).last, ps[(phead0 ' + orl0.butlast).last].next:= vs[(phead0 ' + orl0.butlast).last].next] [vs[(phead0 ' + orl0.butlast).last].next ] .deqID = None ∧ nonullRetRefs(orl + phead0 ' + orl0 + vs[(phead0 ' + orl0.butlast).last].next ', vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(orl0, vs) ∧ vs[vs[(phead0 ' + orl0.butlast).last].next].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ∧ vs[vs[(phead0 ' + orl0.butlast).last].next].deqID = None) ∧ ( (phead0 ' + orl0.butlast).last = vs[(phead0 ' + orl0.butlast).last].next ∨ (phead0 ' + orl0.butlast).last = orl0.last ∧ vs[null].deqID = None ∧ vs[null].next = null) ∧ noid(tid, orl + phead0 ' + orl0 + vs[(phead0 ' + orl0.butlast).last].next ', vhead, vs) ∧ noowns(tid, owns(vs[(phead0 ' + orl0.butlast).last].next; None)) |
vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[(phead0 ' + orl1).last].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl0 = orl1 + vhead0 ', owns(vs[(phead0 ' + orl1).last].next) = Weak(tid), vs[(phead0 ' + orl1).last].next ≠ null, orl ≠ [], orl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl1).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ ( (phead0 ' + orl1).last ∈ orl ∨ (phead0 ' + orl1).last = phead0 ∨ (phead0 ' + orl1).last ∈ orl0 ∨ (phead0 ' + orl1).last = vs[(phead0 ' + orl1).last].next) ∧ vs[(phead0 ' + orl1).last].next ∈ ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next] ∧ vs[(phead0 ' + orl1).last].next ∈ vs ∧ listp (orl + phead0 ' + orl0 + vs[(phead0 ' + orl1).last].next ', vs, ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next], owns(vs[(phead0 ' + orl1).last].next; None)) ∧ ¬ vs[(phead0 ' + orl1).last].next ∈ orl ∧ vs[(phead0 ' + orl1).last].next ≠ phead0 ∧ ¬ vs[(phead0 ' + orl1).last].next ∈ orl0 ∧ markedp(orl, ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next]) ∧ ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next][phead0].deqID = None ∧ unmarkedp(orl0, ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next]) ∧ ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next][vs[(phead0 ' + orl1).last].next].deqID = None ∧ nonullRetRefs(orl + phead0 ' + orl0 + vs[(phead0 ' + orl1).last].next ', vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(orl0, vs) ∧ vs[vs[(phead0 ' + orl1).last].next].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ∧ vs[vs[(phead0 ' + orl1).last].next].deqID = None) ∧ ((phead0 ' + orl1).last = vs[(phead0 ' + orl1).last].next ∨ (phead0 ' + orl1).last = vhead0 ∧ vs[null].deqID = None ∧ vs[null].next = null) ∧ noid(tid, orl + phead0 ' + orl0 + vs[(phead0 ' + orl1).last].next ', vhead, vs) ∧ noowns(tid, owns(vs[(phead0 ' + orl1).last].next; None))
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, vhead0, y
| vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[(phead0 ' + orl1).last].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl0 = orl1 + vhead0 ', owns(vs[(phead0 ' + orl1).last].next) = Weak(tid), vs[(phead0 ' + orl1).last].next ≠ null, orl ≠ [], orl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl1).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ ( (phead0 ' + orl1).last ∈ orl ∨ (phead0 ' + orl1).last = phead0 ∨ (phead0 ' + orl1).last ∈ orl0 ∨ (phead0 ' + orl1).last = vs[(phead0 ' + orl1).last].next) ∧ vs[(phead0 ' + orl1).last].next ∈ ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next] ∧ vs[(phead0 ' + orl1).last].next ∈ vs ∧ listp (orl + phead0 ' + orl0 + vs[(phead0 ' + orl1).last].next ', vs, ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next], owns(vs[(phead0 ' + orl1).last].next; None)) ∧ ¬ vs[(phead0 ' + orl1).last].next ∈ orl ∧ vs[(phead0 ' + orl1).last].next ≠ phead0 ∧ ¬ vs[(phead0 ' + orl1).last].next ∈ orl0 ∧ markedp(orl, ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next]) ∧ ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next][phead0].deqID = None ∧ unmarkedp(orl0, ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next]) ∧ ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next][vs[(phead0 ' + orl1).last].next].deqID = None ∧ nonullRetRefs(orl + phead0 ' + orl0 + vs[(phead0 ' + orl1).last].next ', vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(orl0, vs) ∧ vs[vs[(phead0 ' + orl1).last].next].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ∧ vs[vs[(phead0 ' + orl1).last].next].deqID = None) ∧ ((phead0 ' + orl1).last = vs[(phead0 ' + orl1).last].next ∨ (phead0 ' + orl1).last = vhead0 ∧ vs[null].deqID = None ∧ vs[null].next = null) ∧ noid(tid, orl + phead0 ' + orl0 + vs[(phead0 ' + orl1).last].next ', vhead, vs) ∧ noowns(tid, owns(vs[(phead0 ' + orl1).last].next; None)) |
ps[phead0].deqID = None, vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].next = null, ps[(phead0 ' + orl1).last].next = null, dom vrvHp = dom prvHp, owns(vs[(phead0 ' + orl1).last].next) = Weak(tid), vs[(phead0 ' + orl1).last].next ≠ null, orl ≠ [], phead0 ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl1).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ phead0 ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦ vs[(phead0 ' + orl1).last].next ∈ ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next] ∧ vs[(phead0 ' + orl1).last].next ∈ vs ∧ listp (orl + phead0 ' + (orl1 + vhead0 ') + vs[(phead0 ' + orl1).last].next ', vs, ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next], owns(vs[(phead0 ' + orl1).last].next; None)) ∧ ¬ vs[(phead0 ' + orl1).last].next ∈ orl ∧ vs[(phead0 ' + orl1).last].next ≠ phead0 ∧ ¬ vs[(phead0 ' + orl1).last].next ∈ orl1 ∧ vs[(phead0 ' + orl1).last].next ≠ vhead0 ∧ markedp(orl, ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next]) ∧ ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next][phead0].deqID = None ∧ unmarkedp(orl1, ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next]) ∧ ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next][vhead0].deqID = None ∧ ps[(phead0 ' + orl1).last].deqID = None ∧ nonullRetRefs(orl + phead0 ' + (orl1 + vhead0 ') + vs[(phead0 ' + orl1).last].next ', vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(orl1, vs) ∧ vs[vs[(phead0 ' + orl1).last].next].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[vs[(phead0 ' + orl1).last].next].deqID = None) ∧ (phead0 ' + orl1).last = vs[(phead0 ' + orl1).last].next ∧ noid(tid, orl + phead0 ' + (orl1 + vhead0 ') + vs[(phead0 ' + orl1).last].next ', vhead, vs) ∧ noowns(tid, owns(vs[(phead0 ' + orl1).last].next; None))
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| ps[phead0].deqID = None, vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].next = null, ps[(phead0 ' + orl1).last].next = null, dom vrvHp = dom prvHp, owns(vs[(phead0 ' + orl1).last].next) = Weak(tid), vs[(phead0 ' + orl1).last].next ≠ null, orl ≠ [], phead0 ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl1).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ phead0 ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦ vs[(phead0 ' + orl1).last].next ∈ ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next] ∧ vs[(phead0 ' + orl1).last].next ∈ vs ∧ listp (orl + phead0 ' + (orl1 + vhead0 ') + vs[(phead0 ' + orl1).last].next ', vs, ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next], owns(vs[(phead0 ' + orl1).last].next; None)) ∧ ¬ vs[(phead0 ' + orl1).last].next ∈ orl ∧ vs[(phead0 ' + orl1).last].next ≠ phead0 ∧ ¬ vs[(phead0 ' + orl1).last].next ∈ orl1 ∧ vs[(phead0 ' + orl1).last].next ≠ vhead0 ∧ markedp(orl, ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next]) ∧ ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next][phead0].deqID = None ∧ unmarkedp(orl1, ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next]) ∧ ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next][vhead0].deqID = None ∧ ps[(phead0 ' + orl1).last].deqID = None ∧ nonullRetRefs(orl + phead0 ' + (orl1 + vhead0 ') + vs[(phead0 ' + orl1).last].next ', vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(orl1, vs) ∧ vs[vs[(phead0 ' + orl1).last].next].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[vs[(phead0 ' + orl1).last].next].deqID = None) ∧ (phead0 ' + orl1).last = vs[(phead0 ' + orl1).last].next ∧ noid(tid, orl + phead0 ' + (orl1 + vhead0 ') + vs[(phead0 ' + orl1).last].next ', vhead, vs) ∧ noowns(tid, owns(vs[(phead0 ' + orl1).last].next; None)) |
⊦ y ≠ [] → (x + y).last = y.last
ps[vhead0].deqID = None, vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[(phead0 ' + orl1).last].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl1 = [], owns(vs[(phead0 ' + orl1).last].next) = Weak(tid), vs[(phead0 ' + orl1).last].next ≠ null, orl ≠ [], phead0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl1).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ phead0 ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦ vs[(phead0 ' + orl1).last].next ∈ ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next] ∧ vs[(phead0 ' + orl1).last].next ∈ vs ∧ listp (orl + phead0 ' + (orl1 + vhead0 ') + vs[(phead0 ' + orl1).last].next ', vs, ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next], owns(vs[(phead0 ' + orl1).last].next; None)) ∧ ¬ vs[(phead0 ' + orl1).last].next ∈ orl ∧ vs[(phead0 ' + orl1).last].next ≠ phead0 ∧ ¬ vs[(phead0 ' + orl1).last].next ∈ orl1 ∧ vs[(phead0 ' + orl1).last].next ≠ vhead0 ∧ markedp(orl, ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next]) ∧ ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next][phead0].deqID = None ∧ unmarkedp(orl1, ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next]) ∧ ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next][vhead0].deqID = None ∧ ps[(phead0 ' + orl1).last].deqID = None ∧ nonullRetRefs(orl + phead0 ' + (orl1 + vhead0 ') + vs[(phead0 ' + orl1).last].next ', vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(orl1, vs) ∧ vs[vs[(phead0 ' + orl1).last].next].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[vs[(phead0 ' + orl1).last].next].deqID = None) ∧ (phead0 ' + orl1).last = vs[(phead0 ' + orl1).last].next ∧ noid(tid, orl + phead0 ' + (orl1 + vhead0 ') + vs[(phead0 ' + orl1).last].next ', vhead, vs) ∧ noowns(tid, owns(vs[(phead0 ' + orl1).last].next; None))
ps[vhead0].deqID = None, vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[orl1.last].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, owns(vs[orl1.last].next) = Weak(tid), vs[orl1.last].next ≠ null, orl ≠ [], orl1 ≠ [], phead0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[orl1.last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ phead0 ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦ vs[orl1.last].next ∈ ps[orl1.last, ps[orl1.last].next:= vs[orl1.last].next] ∧ vs[orl1.last].next ∈ vs ∧ listp (orl + phead0 ' + (orl1 + vhead0 ') + vs[orl1.last].next ', vs, ps[orl1.last, ps[orl1.last].next:= vs[orl1.last].next], owns(vs[orl1.last].next; None)) ∧ ¬ vs[orl1.last].next ∈ orl ∧ vs[orl1.last].next ≠ phead0 ∧ ¬ vs[orl1.last].next ∈ orl1 ∧ vs[orl1.last].next ≠ vhead0 ∧ markedp(orl, ps[orl1.last, ps[orl1.last].next:= vs[orl1.last].next]) ∧ ps[orl1.last, ps[orl1.last].next:= vs[orl1.last].next][phead0].deqID = None ∧ unmarkedp(orl1, ps[orl1.last, ps[orl1.last].next:= vs[orl1.last].next]) ∧ ps[orl1.last, ps[orl1.last].next:= vs[orl1.last].next][vhead0].deqID = None ∧ ps[orl1.last].deqID = None ∧ nonullRetRefs(orl + phead0 ' + (orl1 + vhead0 ') + vs[orl1.last].next ', vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(orl1, vs) ∧ vs[vs[orl1.last].next].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[vs[orl1.last].next].deqID = None) ∧ orl1.last = vs[orl1.last].next ∧ noid(tid, orl + phead0 ' + (orl1 + vhead0 ') + vs[orl1.last].next ', vhead, vs) ∧ noowns(tid, owns(vs[orl1.last].next; None))
Used terms: phead0 ', orl1
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps[vhead0].deqID = None, vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[(phead0 ' + orl1).last].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl1 = [], owns(vs[(phead0 ' + orl1).last].next) = Weak(tid), vs[(phead0 ' + orl1).last].next ≠ null, orl ≠ [], phead0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl1).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ phead0 ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦ vs[(phead0 ' + orl1).last].next ∈ ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next] ∧ vs[(phead0 ' + orl1).last].next ∈ vs ∧ listp (orl + phead0 ' + (orl1 + vhead0 ') + vs[(phead0 ' + orl1).last].next ', vs, ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next], owns(vs[(phead0 ' + orl1).last].next; None)) ∧ ¬ vs[(phead0 ' + orl1).last].next ∈ orl ∧ vs[(phead0 ' + orl1).last].next ≠ phead0 ∧ ¬ vs[(phead0 ' + orl1).last].next ∈ orl1 ∧ vs[(phead0 ' + orl1).last].next ≠ vhead0 ∧ markedp(orl, ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next]) ∧ ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next][phead0].deqID = None ∧ unmarkedp(orl1, ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next]) ∧ ps[(phead0 ' + orl1).last, ps[(phead0 ' + orl1).last].next:= vs[(phead0 ' + orl1).last].next][vhead0].deqID = None ∧ ps[(phead0 ' + orl1).last].deqID = None ∧ nonullRetRefs(orl + phead0 ' + (orl1 + vhead0 ') + vs[(phead0 ' + orl1).last].next ', vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(orl1, vs) ∧ vs[vs[(phead0 ' + orl1).last].next].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[vs[(phead0 ' + orl1).last].next].deqID = None) ∧ (phead0 ' + orl1).last = vs[(phead0 ' + orl1).last].next ∧ noid(tid, orl + phead0 ' + (orl1 + vhead0 ') + vs[(phead0 ' + orl1).last].next ', vhead, vs) ∧ noowns(tid, owns(vs[(phead0 ' + orl1).last].next; None)) |
ps[phead0].deqID = None, vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].next = null, ps[phead0].next = null, dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), vs[phead0].next ≠ null, orl ≠ [], phead0 ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl), ¬ phead0 ∈ orl, ¬ vhead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ⊦
Used simplifier rules: ⊦ a '.last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ unmarkedp([], vs); (s) ⊦ [] + x = x; (s) ⊦ a ≠ b → st[b, d][a] = st[a]; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ ¬ node ∈ rl → (markedp(rl, vs[node, nd]) ↔ markedp(rl, vs)); (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s)
| ps[phead0].deqID = None, vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].next = null, ps[phead0].next = null, dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), vs[phead0].next ≠ null, orl ≠ [], phead0 ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl), ¬ phead0 ∈ orl, ¬ vhead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ⊦ |
⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])
Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ listp(r ' + r0 ', 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 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, orl, owns, phead0 ' + vhead0 ', vs
| ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []) |
| ps[vhead0].deqID = None, vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[orl1.last].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, owns(vs[orl1.last].next) = Weak(tid), vs[orl1.last].next ≠ null, orl ≠ [], orl1 ≠ [], phead0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[orl1.last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ phead0 ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦ vs[orl1.last].next ∈ ps[orl1.last, ps[orl1.last].next:= vs[orl1.last].next] ∧ vs[orl1.last].next ∈ vs ∧ listp (orl + phead0 ' + (orl1 + vhead0 ') + vs[orl1.last].next ', vs, ps[orl1.last, ps[orl1.last].next:= vs[orl1.last].next], owns(vs[orl1.last].next; None)) ∧ ¬ vs[orl1.last].next ∈ orl ∧ vs[orl1.last].next ≠ phead0 ∧ ¬ vs[orl1.last].next ∈ orl1 ∧ vs[orl1.last].next ≠ vhead0 ∧ markedp(orl, ps[orl1.last, ps[orl1.last].next:= vs[orl1.last].next]) ∧ ps[orl1.last, ps[orl1.last].next:= vs[orl1.last].next][phead0].deqID = None ∧ unmarkedp(orl1, ps[orl1.last, ps[orl1.last].next:= vs[orl1.last].next]) ∧ ps[orl1.last, ps[orl1.last].next:= vs[orl1.last].next][vhead0].deqID = None ∧ ps[orl1.last].deqID = None ∧ nonullRetRefs(orl + phead0 ' + (orl1 + vhead0 ') + vs[orl1.last].next ', vs, vretRefs, pretRefs) ∧ ( orl.last = vhead ∧ unmarkedp(orl1, vs) ∧ vs[vs[orl1.last].next].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[vs[orl1.last].next].deqID = None) ∧ orl1.last = vs[orl1.last].next ∧ noid(tid, orl + phead0 ' + (orl1 + vhead0 ') + vs[orl1.last].next ', vhead, vs) ∧ noowns(tid, owns(vs[orl1.last].next; None)) |
ps[phead0].deqID = None, vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].next = null, ps[orl1.last].next = null, dom vrvHp = dom prvHp, owns(vs[orl1.last].next) = Weak(tid), vs[orl1.last].next ≠ null, orl ≠ [], orl1 ≠ [], phead0 ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[orl1.last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ phead0 ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦
Used simplifier rules: ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s)
| ps[phead0].deqID = None, vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].next = null, ps[orl1.last].next = null, dom vrvHp = dom prvHp, owns(vs[orl1.last].next) = Weak(tid), vs[orl1.last].next ≠ null, orl ≠ [], orl1 ≠ [], phead0 ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[orl1.last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ phead0 ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦ |
ps[vhead0].deqID = None, vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[vhead1].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl1 = orl0 + vhead1 ', owns(vs[vhead1].next) = Weak(tid), vs[vhead1].next ≠ null, orl ≠ [], orl1 ≠ [], phead0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead1].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ phead0 ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl1, vhead1, y
| ps[vhead0].deqID = None, vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[vhead1].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl1 = orl0 + vhead1 ', owns(vs[vhead1].next) = Weak(tid), vs[vhead1].next ≠ null, orl ≠ [], orl1 ≠ [], phead0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead1].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ phead0 ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦ |
ps[phead0].deqID = None, vs[vhead0].deqID = None, ps[vhead0].deqID = None, ps[vhead1].deqID = None, vs[vhead0].next = null, ps[vhead1].next = null, dom vrvHp = dom prvHp, owns(vs[vhead1].next) = Weak(tid), vs[vhead1].next ≠ null, orl ≠ [], phead0 ≠ vhead0, phead0 ≠ vhead1, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + (orl0 + vhead1 ') + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + (orl0 + vhead1 ') + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + (orl0 + vhead1 ') + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead1].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead1 ∈ orl, ¬ vhead1 ∈ orl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∧ vs[vhead1].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ∧ vs[vhead1].deqID = None ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| ps[phead0].deqID = None, vs[vhead0].deqID = None, ps[vhead0].deqID = None, ps[vhead1].deqID = None, vs[vhead0].next = null, ps[vhead1].next = null, dom vrvHp = dom prvHp, owns(vs[vhead1].next) = Weak(tid), vs[vhead1].next ≠ null, orl ≠ [], phead0 ≠ vhead0, phead0 ≠ vhead1, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + (orl0 + vhead1 ') + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + (orl0 + vhead1 ') + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + (orl0 + vhead1 ') + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead1].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead1 ∈ orl, ¬ vhead1 ∈ orl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∧ vs[vhead1].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ∧ vs[vhead1].deqID = None ⊦ |
⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])
Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ listp(r ' + r0 ', 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 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, orl + phead0 ' + orl0, owns, vhead1 ' + vhead0 ', vs
| ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []) |
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.