| ⊦ ( (gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E6, a) ∧ pcstepf(gs, ls, E6, a) = E7 → ( gstepf(gs, ls, E6, a).owns(lstepf(gs, ls, E6, a).node) = Some(lstepf(gs, ls, E6, a).tid) ∧ lstepf(gs, ls, E6, a).lst ∈ gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl ∧ (lstepf(gs, ls, E6, a).nxt ≠ null → lstepf(gs, ls, E6, a).nxt = gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).lst].next) ∧ (gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).lst].next = null → gstepf(gs, ls, E6, a).vtail = lstepf(gs, ls, E6, a).lst)) ∧ ( listp(gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vs, gstepf(gs, ls, E6, a).ps, gstepf(gs, ls, E6, a).owns) ∧ ¬ dups(gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl) ∧ markedp(gstepf(gs, ls, E6, a).orl, gstepf(gs, ls, E6, a).ps) ∧ markedp(gstepf(gs, ls, E6, a).orl, gstepf(gs, ls, E6, a).vs) ∧ unmarkedp(gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).ps) ∧ gstepf(gs, ls, E6, a).orl ≠ [] ∧ gstepf(gs, ls, E6, a).phead ∈ gstepf(gs, ls, E6, a).orl ∧ rvownerok(gstepf(gs, ls, E6, a).vretRefs, gstepf(gs, ls, E6, a).vrvHp, gstepf(gs, ls, E6, a).rvowns) ∧ allocrv(gstepf(gs, ls, E6, a).vretRefs, gstepf(gs, ls, E6, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vs, gstepf(gs, ls, E6, a).vretRefs, gstepf(gs, ls, E6, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E6, a).pretRefs, gstepf(gs, ls, E6, a).prvHp, gstepf(gs, ls, E6, a).rvowns) ∧ allocrv(gstepf(gs, ls, E6, a).pretRefs, gstepf(gs, ls, E6, a).prvHp) ∧ dom gstepf(gs, ls, E6, a).vrvHp = dom gstepf(gs, ls, E6, a).prvHp ∧ ( gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next ≠ null ∧ gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E6, a).rvowns (gstepf(gs, ls, E6, a).vretRefs(gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].deqID.tid, gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E6, a).orl.last = gstepf(gs, ls, E6, a).vhead ∧ (gstepf(gs, ls, E6, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E6, a).qrl.tail, gstepf(gs, ls, E6, a).vs)) ∨ gstepf(gs, ls, E6, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E6, a).orl.butlast.last = gstepf(gs, ls, E6, a).vhead ∧ gstepf(gs, ls, E6, a).phead ≠ gstepf(gs, ls, E6, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vs)) ∧ ( gstepf(gs, ls, E6, a).vtail = (gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl).last ∨ gstepf(gs, ls, E6, a).qrl ≠ [] ∧ gstepf(gs, ls, E6, a).vtail = (gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl.butlast).last ∧ gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E6, a).vs[(gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).ps ∧ lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).vs ∧ lstepf(gs, ls, E6, a).node ≠ null ∧ ¬ lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).orl ∧ ¬ lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).qrl) ∧ gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).node] = mk(lstepf(gs, ls, E6, a).value, None, null) ∧ gstepf(gs, ls, E6, a).ps[lstepf(gs, ls, E6, a).node] = gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).node] ∧ ¬ lstepf(gs, ls, E6, a).success ∧ nextnottid(lstepf(gs, ls, E6, a).tid, gstepf(gs, ls, E6, a).vhead, gstepf(gs, ls, E6, a).vs) ∧ noid(lstepf(gs, ls, E6, a).tid, gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vhead, gstepf(gs, ls, E6, a).vs) ∧ oneowns(lstepf(gs, ls, E6, a).tid, lstepf(gs, ls, E6, a).node, gstepf(gs, ls, E6, a).owns, gstepf(gs, ls, E6, a).vs, gstepf(gs, ls, E6, a).ps) |
gs.owns(ls.node) = Some(ls.tid), gs.vs[ls.node] = mk(ls.value, None, null), gs.ps[ls.node] = gs.vs[ls.node], dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, E6, a) = E7, ls.node ≠ null, gs.orl ≠ [], allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), pre(gs, ls, E6, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.lst ∈ gs.orl + gs.qrl, gs.phead ∈ gs.orl, ls.node ∈ gs.ps, ls.node ∈ gs.vs, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), ¬ ls.node ∈ gs.qrl, ¬ ls.node ∈ gs.orl, gs.ps[ls.lst].next = null → ls.lst = gs.vtail, gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( gstepf(gs, ls, E6, a).owns(lstepf(gs, ls, E6, a).node) = Some(lstepf(gs, ls, E6, a).tid) ∧ lstepf(gs, ls, E6, a).lst ∈ gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl ∧ (lstepf(gs, ls, E6, a).nxt ≠ null → lstepf(gs, ls, E6, a).nxt = gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).lst].next) ∧ (gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).lst].next = null → gstepf(gs, ls, E6, a).vtail = lstepf(gs, ls, E6, a).lst)) ∧ ( listp(gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vs, gstepf(gs, ls, E6, a).ps, gstepf(gs, ls, E6, a).owns) ∧ ¬ dups(gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl) ∧ markedp(gstepf(gs, ls, E6, a).orl, gstepf(gs, ls, E6, a).ps) ∧ markedp(gstepf(gs, ls, E6, a).orl, gstepf(gs, ls, E6, a).vs) ∧ unmarkedp(gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).ps) ∧ gstepf(gs, ls, E6, a).orl ≠ [] ∧ gstepf(gs, ls, E6, a).phead ∈ gstepf(gs, ls, E6, a).orl ∧ rvownerok(gstepf(gs, ls, E6, a).vretRefs, gstepf(gs, ls, E6, a).vrvHp, gstepf(gs, ls, E6, a).rvowns) ∧ allocrv(gstepf(gs, ls, E6, a).vretRefs, gstepf(gs, ls, E6, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vs, gstepf(gs, ls, E6, a).vretRefs, gstepf(gs, ls, E6, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E6, a).pretRefs, gstepf(gs, ls, E6, a).prvHp, gstepf(gs, ls, E6, a).rvowns) ∧ allocrv(gstepf(gs, ls, E6, a).pretRefs, gstepf(gs, ls, E6, a).prvHp) ∧ dom gstepf(gs, ls, E6, a).vrvHp = dom gstepf(gs, ls, E6, a).prvHp ∧ ( gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next ≠ null ∧ gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E6, a).rvowns (gstepf(gs, ls, E6, a).vretRefs(gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].deqID.tid, gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E6, a).orl.last = gstepf(gs, ls, E6, a).vhead ∧ (gstepf(gs, ls, E6, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E6, a).qrl.tail, gstepf(gs, ls, E6, a).vs)) ∨ gstepf(gs, ls, E6, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E6, a).orl.butlast.last = gstepf(gs, ls, E6, a).vhead ∧ gstepf(gs, ls, E6, a).phead ≠ gstepf(gs, ls, E6, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vs)) ∧ ( gstepf(gs, ls, E6, a).vtail = (gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl).last ∨ gstepf(gs, ls, E6, a).qrl ≠ [] ∧ gstepf(gs, ls, E6, a).vtail = (gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl.butlast).last ∧ gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E6, a).vs[(gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).ps ∧ lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).vs ∧ lstepf(gs, ls, E6, a).node ≠ null ∧ ¬ lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).orl ∧ ¬ lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).qrl) ∧ gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).node] = mk(lstepf(gs, ls, E6, a).value, None, null) ∧ gstepf(gs, ls, E6, a).ps[lstepf(gs, ls, E6, a).node] = gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).node] ∧ ¬ lstepf(gs, ls, E6, a).success ∧ nextnottid(lstepf(gs, ls, E6, a).tid, gstepf(gs, ls, E6, a).vhead, gstepf(gs, ls, E6, a).vs) ∧ noid(lstepf(gs, ls, E6, a).tid, gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vhead, gstepf(gs, ls, E6, a).vs) ∧ oneowns(lstepf(gs, ls, E6, a).tid, lstepf(gs, ls, E6, a).node, gstepf(gs, ls, E6, a).owns, gstepf(gs, ls, E6, a).vs, gstepf(gs, ls, E6, a).ps)
| gs.owns(ls.node) = Some(ls.tid), gs.vs[ls.node] = mk(ls.value, None, null), gs.ps[ls.node] = gs.vs[ls.node], dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, E6, a) = E7, ls.node ≠ null, gs.orl ≠ [], allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), pre(gs, ls, E6, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.lst ∈ gs.orl + gs.qrl, gs.phead ∈ gs.orl, ls.node ∈ gs.ps, ls.node ∈ gs.vs, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), ¬ ls.node ∈ gs.qrl, ¬ ls.node ∈ gs.orl, gs.ps[ls.lst].next = null → ls.lst = gs.vtail, gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( gstepf(gs, ls, E6, a).owns(lstepf(gs, ls, E6, a).node) = Some(lstepf(gs, ls, E6, a).tid) ∧ lstepf(gs, ls, E6, a).lst ∈ gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl ∧ (lstepf(gs, ls, E6, a).nxt ≠ null → lstepf(gs, ls, E6, a).nxt = gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).lst].next) ∧ (gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).lst].next = null → gstepf(gs, ls, E6, a).vtail = lstepf(gs, ls, E6, a).lst)) ∧ ( listp(gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vs, gstepf(gs, ls, E6, a).ps, gstepf(gs, ls, E6, a).owns) ∧ ¬ dups(gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl) ∧ markedp(gstepf(gs, ls, E6, a).orl, gstepf(gs, ls, E6, a).ps) ∧ markedp(gstepf(gs, ls, E6, a).orl, gstepf(gs, ls, E6, a).vs) ∧ unmarkedp(gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).ps) ∧ gstepf(gs, ls, E6, a).orl ≠ [] ∧ gstepf(gs, ls, E6, a).phead ∈ gstepf(gs, ls, E6, a).orl ∧ rvownerok(gstepf(gs, ls, E6, a).vretRefs, gstepf(gs, ls, E6, a).vrvHp, gstepf(gs, ls, E6, a).rvowns) ∧ allocrv(gstepf(gs, ls, E6, a).vretRefs, gstepf(gs, ls, E6, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vs, gstepf(gs, ls, E6, a).vretRefs, gstepf(gs, ls, E6, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E6, a).pretRefs, gstepf(gs, ls, E6, a).prvHp, gstepf(gs, ls, E6, a).rvowns) ∧ allocrv(gstepf(gs, ls, E6, a).pretRefs, gstepf(gs, ls, E6, a).prvHp) ∧ dom gstepf(gs, ls, E6, a).vrvHp = dom gstepf(gs, ls, E6, a).prvHp ∧ ( gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next ≠ null ∧ gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E6, a).rvowns (gstepf(gs, ls, E6, a).vretRefs(gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].deqID.tid, gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E6, a).orl.last = gstepf(gs, ls, E6, a).vhead ∧ (gstepf(gs, ls, E6, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E6, a).qrl.tail, gstepf(gs, ls, E6, a).vs)) ∨ gstepf(gs, ls, E6, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E6, a).orl.butlast.last = gstepf(gs, ls, E6, a).vhead ∧ gstepf(gs, ls, E6, a).phead ≠ gstepf(gs, ls, E6, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vs)) ∧ ( gstepf(gs, ls, E6, a).vtail = (gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl).last ∨ gstepf(gs, ls, E6, a).qrl ≠ [] ∧ gstepf(gs, ls, E6, a).vtail = (gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl.butlast).last ∧ gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E6, a).vs[(gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).ps ∧ lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).vs ∧ lstepf(gs, ls, E6, a).node ≠ null ∧ ¬ lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).orl ∧ ¬ lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).qrl) ∧ gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).node] = mk(lstepf(gs, ls, E6, a).value, None, null) ∧ gstepf(gs, ls, E6, a).ps[lstepf(gs, ls, E6, a).node] = gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).node] ∧ ¬ lstepf(gs, ls, E6, a).success ∧ nextnottid(lstepf(gs, ls, E6, a).tid, gstepf(gs, ls, E6, a).vhead, gstepf(gs, ls, E6, a).vs) ∧ noid(lstepf(gs, ls, E6, a).tid, gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vhead, gstepf(gs, ls, E6, a).vs) ∧ oneowns(lstepf(gs, ls, E6, a).tid, lstepf(gs, ls, E6, a).node, gstepf(gs, ls, E6, a).owns, gstepf(gs, ls, E6, a).vs, gstepf(gs, ls, E6, a).ps) |
gs.owns(ls.node) = Some(ls.tid), gs.ps[ls.node] = mk(ls.value, None, null), gs.vs[ls.node] = mk(ls.value, None, null), dom gs.vrvHp = dom gs.prvHp, ls.node ≠ null, gs.orl ≠ [], allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.node ∈ gs.vs, ls.node ∈ gs.ps, gs.phead ∈ gs.orl, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ ls.node ∈ gs.qrl, ¬ ls.node ∈ gs.orl, 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 = null → ls.lst = gs.vtail, 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.qrl, gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null ⊦ ((gs.ps ⊕ gs.vs)[ls.lst].next ≠ null → (gs.ps ⊕ gs.vs)[ls.lst].next = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)
Used simplifier rules: ⊦ gstepf(gs, ls, E6, τ) = gs; (s) ⊦ (ls.nxt:= node1).node = ls.node; (s) ⊦ lstepf(gs, ls, E6, τ) = ls.nxt:= (gs.ps ⊕ gs.vs)[ls.lst].next; (s) ⊦ (ls.nxt:= node1).tid = ls.tid; (s) ⊦ (ls.nxt:= node1).success ↔ ls.success; (s) ⊦ (ls.nxt:= node1).value = ls.value; (s) ⊦ (ls.nxt:= node1).lst = ls.lst; (s) ⊦ (ls.nxt:= node1).nxt = node1; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] fw-some-oneowns: ⊦ oneowns(tid, r0, owns, vs, ps) ∧ owns(r) = Some(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (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-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ pre(gs, ls, E6, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E6, a) = E7; (s)
| gs.owns(ls.node) = Some(ls.tid), gs.ps[ls.node] = mk(ls.value, None, null), gs.vs[ls.node] = mk(ls.value, None, null), dom gs.vrvHp = dom gs.prvHp, ls.node ≠ null, gs.orl ≠ [], allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.node ∈ gs.vs, ls.node ∈ gs.ps, gs.phead ∈ gs.orl, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ ls.node ∈ gs.qrl, ¬ ls.node ∈ gs.orl, 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 = null → ls.lst = gs.vtail, 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.qrl, gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null ⊦ ((gs.ps ⊕ gs.vs)[ls.lst].next ≠ null → (gs.ps ⊕ gs.vs)[ls.lst].next = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst) |
vs[ls.node] = mk(ls.value, None, null), ps[ls.node] = mk(ls.value, None, null), dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), owns(ls.node) = Some(ls.tid), ls.node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ls.node ∈ ps, ls.node ∈ vs, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ ls.node ∈ qrl, ¬ ls.node ∈ orl, ps[ls.lst].next = null → ls.lst = vtail, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ls.lst ∈ orl ∨ ls.lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ((ps ⊕ vs)[ls.lst].next ≠ null → (ps ⊕ vs)[ls.lst].next = vs[ls.lst].next) ∧ (vs[ls.lst].next = null → vtail = ls.lst)
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.node] = mk(ls.value, None, null), ps[ls.node] = mk(ls.value, None, null), dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), owns(ls.node) = Some(ls.tid), ls.node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ls.node ∈ ps, ls.node ∈ vs, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ ls.node ∈ qrl, ¬ ls.node ∈ orl, ps[ls.lst].next = null → ls.lst = vtail, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ls.lst ∈ orl ∨ ls.lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ((ps ⊕ vs)[ls.lst].next ≠ null → (ps ⊕ vs)[ls.lst].next = vs[ls.lst].next) ∧ (vs[ls.lst].next = null → vtail = ls.lst) |
ps[ls.node] = mk(ls.value, None, null), vs[ls.node] = mk(ls.value, None, null), dom vrvHp = dom prvHp, owns(ls.node) = Some(ls.tid), ls.node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), ls.node ∈ vs, ls.node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ ls.node ∈ qrl, ¬ ls.node ∈ 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), ps[ls.lst].next = null → ls.lst = vtail, 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 ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ((ps ⊕ vs)[ls.lst].next ≠ null → (ps ⊕ vs)[ls.lst].next = vs[ls.lst].next) ∧ (vs[ls.lst].next = null → vtail = ls.lst)
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
| ps[ls.node] = mk(ls.value, None, null), vs[ls.node] = mk(ls.value, None, null), dom vrvHp = dom prvHp, owns(ls.node) = Some(ls.tid), ls.node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), ls.node ∈ vs, ls.node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ ls.node ∈ qrl, ¬ ls.node ∈ 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), ps[ls.lst].next = null → ls.lst = vtail, 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 ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ((ps ⊕ vs)[ls.lst].next ≠ null → (ps ⊕ vs)[ls.lst].next = vs[ls.lst].next) ∧ (vs[ls.lst].next = null → vtail = ls.lst) |
vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(node) = Some(tid), ¬ success, node ≠ 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, ps[lst].next = null → lst = vtail, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ((ps ⊕ vs)[lst].next ≠ null → (ps ⊕ vs)[lst].next = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst)
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[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(node) = Some(tid), ¬ success, node ≠ 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, ps[lst].next = null → lst = vtail, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ((ps ⊕ vs)[lst].next ≠ null → (ps ⊕ vs)[lst].next = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst) |
ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ 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), ps[lst].next = null → lst = vtail, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ((ps ⊕ vs)[lst].next ≠ null → (ps ⊕ vs)[lst].next = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst)
| ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ 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), ps[lst].next = null → lst = vtail, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ((ps ⊕ vs)[lst].next ≠ null → (ps ⊕ vs)[lst].next = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst) |
vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, orl = qrl0 + vtail0 ', owns(node) = Some(tid), node ≠ 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, ps[lst].next = null → lst = vtail, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦ ((ps ⊕ vs)[lst].next ≠ null → (ps ⊕ vs)[lst].next = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst)
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, vtail0, y
| vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, orl = qrl0 + vtail0 ', owns(node) = Some(tid), node ≠ 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, ps[lst].next = null → lst = vtail, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦ ((ps ⊕ vs)[lst].next ≠ null → (ps ⊕ vs)[lst].next = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst) |
ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), node ∈ vs, node ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl, ¬ node ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[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 = null → lst = vtail, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ((ps ⊕ vs)[lst].next ≠ null → (ps ⊕ vs)[lst].next = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), node ∈ vs, node ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl, ¬ node ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[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 = null → lst = vtail, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ((ps ⊕ vs)[lst].next ≠ null → (ps ⊕ vs)[lst].next = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst) |
⊦ (ps ⊕ vs)[r] = (r ∈ vs ⊃ vs[r];ps[r])
vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ ps, node ∈ vs, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl, ¬ node ∈ qrl0, ps[lst].next = null → lst = vtail, vs[vhead].next ≠ null ∧ vs[vs[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 = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, phead ∈ qrl0 ∨ phead = vtail0, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦ ((lst ∈ vs ⊃ vs[lst];ps[lst]).next ≠ null → (lst ∈ vs ⊃ vs[lst];ps[lst]).next = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst)
Used terms: ps, vs, lst
| ⊦ (ps ⊕ vs)[r] = (r ∈ vs ⊃ vs[r];ps[r]) |
| vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ ps, node ∈ vs, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl, ¬ node ∈ qrl0, ps[lst].next = null → lst = vtail, vs[vhead].next ≠ null ∧ vs[vs[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 = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, phead ∈ qrl0 ∨ phead = vtail0, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦ ((lst ∈ vs ⊃ vs[lst];ps[lst]).next ≠ null → (lst ∈ vs ⊃ vs[lst];ps[lst]).next = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst) |
vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ vtail0, node ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ ps, node ∈ vs, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl), ¬ node ∈ qrl0, ¬ node ∈ qrl, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ps[lst].next = null → lst = vtail, vs[vhead].next ≠ null ∧ vs[vs[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 = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, phead ∈ qrl0 ∨ phead = vtail0, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦ (ps[lst].next ≠ null → (lst ∈ vs ⊃ vs[lst];ps[lst]).next = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst)
| vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ vtail0, node ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ ps, node ∈ vs, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl), ¬ node ∈ qrl0, ¬ node ∈ qrl, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ps[lst].next = null → lst = vtail, vs[vhead].next ≠ null ∧ vs[vs[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 = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, phead ∈ qrl0 ∨ phead = vtail0, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦ (ps[lst].next ≠ null → (lst ∈ vs ⊃ vs[lst];ps[lst]).next = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst) |
⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns))
ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ vtail0, node ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), node ∈ vs, node ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl), ¬ node ∈ qrl0, ¬ node ∈ qrl, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[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 = null → lst = vtail, listp((qrl0 + vtail0 ') + qrl, vs, ps, owns) ∧ lst ∈ (qrl0 + vtail0 ') + qrl → (∃ rl1, rl2. (qrl0 + vtail0 ') + qrl = rl1 + lst ' + rl2 ∧ listp(lst ' + rl2, vs, ps, owns)), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (ps[lst].next ≠ null → (lst ∈ vs ⊃ vs[lst];ps[lst]).next = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst)
Used terms: ps, (qrl0 + vtail0 ') + qrl, owns, lst, vs
| ⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns)) |
| ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ vtail0, node ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), node ∈ vs, node ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl), ¬ node ∈ qrl0, ¬ node ∈ qrl, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[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 = null → lst = vtail, listp((qrl0 + vtail0 ') + qrl, vs, ps, owns) ∧ lst ∈ (qrl0 + vtail0 ') + qrl → (∃ rl1, rl2. (qrl0 + vtail0 ') + qrl = rl1 + lst ' + rl2 ∧ listp(lst ' + rl2, vs, ps, owns)), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (ps[lst].next ≠ null → (lst ∈ vs ⊃ vs[lst];ps[lst]).next = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst) |
(qrl0 + vtail0 ') + qrl = rl1 + lst ' + rl2, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ vtail0, node ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + lst ' + rl2, vs, ps, owns), listp(lst ' + rl2, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + rl2, vhead, vs), nonullRetRefs(rl1 + lst ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ ps, node ∈ vs, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl), ¬ node ∈ qrl0, ¬ node ∈ qrl, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ps[lst].next = null → lst = vtail, vs[vhead].next ≠ null ∧ vs[vs[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 = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, phead ∈ qrl0 ∨ phead = vtail0, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦ (ps[lst].next ≠ null → (lst ∈ vs ⊃ vs[lst];ps[lst]).next = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst)
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)
| (qrl0 + vtail0 ') + qrl = rl1 + lst ' + rl2, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ vtail0, node ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + lst ' + rl2, vs, ps, owns), listp(lst ' + rl2, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + rl2, vhead, vs), nonullRetRefs(rl1 + lst ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ ps, node ∈ vs, ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl), ¬ node ∈ qrl0, ¬ node ∈ qrl, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ps[lst].next = null → lst = vtail, vs[vhead].next ≠ null ∧ vs[vs[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 = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, phead ∈ qrl0 ∨ phead = vtail0, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦ (ps[lst].next ≠ null → (lst ∈ vs ⊃ vs[lst];ps[lst]).next = vs[lst].next) ∧ (vs[lst].next = null → vtail = lst) |
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)
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.