| ⊦ ls.tid ≠ tid0 ∧ ( (gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( 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, E9, a) ∧ pcstepf(gs, ls, E9, a) = E10 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E9, a).orl) ∧ gstepf(gs, ls, E9, a).vtail ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl from gs.vtail ∧ gstepf(gs, ls, E9, a).phead ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl from gs.phead ∧ gstepf(gs, ls, E9, a).vhead ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps, gstepf(gs, ls, E9, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E9, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E9, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E9, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E9, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E9, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E9, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E9, a).vhead, gstepf(gs, ls, E9, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E9, a).owns) |
ls.nxt = null, 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, E9, a) = E10, ls.node ≠ null, gs.orl ≠ [], ls.tid ≠ tid0, 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, E9, 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.vs[ls.lst].next = null → gs.vtail = ls.lst, 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 ⊦ (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E9, a).orl) ∧ gstepf(gs, ls, E9, a).vtail ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl from gs.vtail ∧ gstepf(gs, ls, E9, a).phead ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl from gs.phead ∧ gstepf(gs, ls, E9, a).vhead ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps, gstepf(gs, ls, E9, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E9, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E9, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E9, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E9, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E9, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E9, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E9, a).vhead, gstepf(gs, ls, E9, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E9, a).owns)
| ls.nxt = null, 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, E9, a) = E10, ls.node ≠ null, gs.orl ≠ [], ls.tid ≠ tid0, 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, E9, 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.vs[ls.lst].next = null → gs.vtail = ls.lst, 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 ⊦ (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E9, a).orl) ∧ gstepf(gs, ls, E9, a).vtail ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl from gs.vtail ∧ gstepf(gs, ls, E9, a).phead ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl from gs.phead ∧ gstepf(gs, ls, E9, a).vhead ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps, gstepf(gs, ls, E9, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E9, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E9, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E9, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E9, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E9, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E9, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E9, a).vhead, gstepf(gs, ls, E9, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E9, a).owns) |
ls.nxt = null, gs.owns(ls.node) = Some(ls.tid), gs.vs[ls.node] = mk(ls.value, None, null), gs.ps[ls.node] = mk(ls.value, None, null), dom gs.vrvHp = dom gs.prvHp, ls.node ≠ null, gs.orl ≠ [], ls.tid ≠ tid0, 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), 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, ls.node ∈ gs.ps, ls.node ∈ gs.vs, ¬ ls.success, ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), ¬ ls.node ∈ gs.orl, ¬ ls.node ∈ gs.qrl, gs.vs[ls.lst].next = null → gs.vtail = ls.lst, gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null, ls.lst ∈ gs.orl ∨ ls.lst ∈ gs.qrl, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs) ⊦ (∃ rl. gs.orl + gs.qrl + rl = ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl + ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl) ∧ (∃ rl0. gs.orl + rl0 = ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl) ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vtail ∈ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .orl + ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .qrl from gs.vtail ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).phead ∈ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .orl + ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .qrl from gs.phead ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vhead ∈ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .orl + ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).ps, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).owns) ∧ gs.vretRefs(tid0) = ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vretRefs (tid0) ∧ ( gs.pretRefs(tid0) = ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .pretRefs (tid0) ∨ gs.vretRefs(tid0) = ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .pretRefs (tid0)) ∧ rvownsrely (tid0, gs.rvowns, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vretRefs, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vrvHp) ∧ dom gs.prvHp ⊆ dom ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vrvHp ∧ prvHpRely (gs.vrvHp, gs.prvHp, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl + ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vhead, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs) ∧ ownsRely (tid0, gs.owns, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).owns)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] 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 ⊦ gstepf(gs, ls, E9, a) = ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]) .owns:= gs.owns(ls.node; Weak(ls.tid)) ;gs ); (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ pre(gs, ls, E9, a) ↔ a = τ; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ pcstepf(gs, ls, E9, a) = E10; (s)
| ls.nxt = null, gs.owns(ls.node) = Some(ls.tid), gs.vs[ls.node] = mk(ls.value, None, null), gs.ps[ls.node] = mk(ls.value, None, null), dom gs.vrvHp = dom gs.prvHp, ls.node ≠ null, gs.orl ≠ [], ls.tid ≠ tid0, 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), 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, ls.node ∈ gs.ps, ls.node ∈ gs.vs, ¬ ls.success, ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), ¬ ls.node ∈ gs.orl, ¬ ls.node ∈ gs.qrl, gs.vs[ls.lst].next = null → gs.vtail = ls.lst, gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null, ls.lst ∈ gs.orl ∨ ls.lst ∈ gs.qrl, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs) ⊦ (∃ rl. gs.orl + gs.qrl + rl = ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl + ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl) ∧ (∃ rl0. gs.orl + rl0 = ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl) ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vtail ∈ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .orl + ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .qrl from gs.vtail ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).phead ∈ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .orl + ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .qrl from gs.phead ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vhead ∈ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .orl + ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).ps, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).owns) ∧ gs.vretRefs(tid0) = ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vretRefs (tid0) ∧ ( gs.pretRefs(tid0) = ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .pretRefs (tid0) ∨ gs.vretRefs(tid0) = ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .pretRefs (tid0)) ∧ rvownsrely (tid0, gs.rvowns, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vretRefs, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vrvHp) ∧ dom gs.prvHp ⊆ dom ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vrvHp ∧ prvHpRely (gs.vrvHp, gs.prvHp, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl + ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vhead, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs) ∧ ownsRely (tid0, gs.owns, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).owns) |
ls.nxt = null, ps[ls.node] = mk(ls.value, None, null), vs[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, ls.tid ≠ tid0, 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(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ ls.node ∈ orl, ¬ ls.node ∈ 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[ls.lst].next = null → vtail = ls.lst, 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 ⊦ (∃ rl. orl + qrl + rl = ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).qrl) ∧ (∃ rl0. orl + rl0 = ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl) ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vtail ∈ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).qrl from vtail ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).phead ∈ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).qrl from phead ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vhead ∈ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).qrl from vhead ∧ equalrl (orl + qrl, vs, ps, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).ps) ∧ equalowns (vs, ps, owns, tid0, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).ps, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).owns) ∧ vretRefs(tid0) = ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vretRefs(tid0) ∧ ( pretRefs(tid0) = ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).pretRefs(tid0) ∨ vretRefs(tid0) = ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).pretRefs(tid0)) ∧ rvownsrely (tid0, rvowns, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vretRefs, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vrvHp) ∧ dom prvHp ⊆ dom ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vrvHp ∧ prvHpRely (vrvHp, prvHp, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).prvHp) ∧ noidRely (tid0, orl + qrl, vs, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).qrl, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs) ∧ nextnottidRely (tid0, vhead, vs, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vhead, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs) ∧ ownsRely(tid0, owns, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).owns)
Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ((ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns); (elim) Used terms: qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs
| ls.nxt = null, ps[ls.node] = mk(ls.value, None, null), vs[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, ls.tid ≠ tid0, 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(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ ls.node ∈ orl, ¬ ls.node ∈ 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[ls.lst].next = null → vtail = ls.lst, 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 ⊦ (∃ rl. orl + qrl + rl = ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).qrl) ∧ (∃ rl0. orl + rl0 = ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl) ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vtail ∈ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).qrl from vtail ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).phead ∈ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).qrl from phead ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vhead ∈ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).qrl from vhead ∧ equalrl (orl + qrl, vs, ps, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).ps) ∧ equalowns (vs, ps, owns, tid0, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).ps, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).owns) ∧ vretRefs(tid0) = ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vretRefs(tid0) ∧ ( pretRefs(tid0) = ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).pretRefs(tid0) ∨ vretRefs(tid0) = ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).pretRefs(tid0)) ∧ rvownsrely (tid0, rvowns, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vretRefs, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vrvHp) ∧ dom prvHp ⊆ dom ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vrvHp ∧ prvHpRely (vrvHp, prvHp, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).prvHp) ∧ noidRely (tid0, orl + qrl, vs, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).qrl, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs) ∧ nextnottidRely (tid0, vhead, vs, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vhead, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs) ∧ ownsRely(tid0, owns, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).owns) |
ls.nxt = null, vs[ls.node] = mk(ls.value, None, null), ps[ls.node] = mk(ls.value, None, null), dom vrvHp = dom prvHp, owns(ls.node) = Some(ls.tid), ls.node ≠ null, ls.tid ≠ tid0, 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 ∈ orl, ls.node ∈ ps, ls.node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ ls.node ∈ orl, ¬ ls.node ∈ qrl, vs[ls.lst].next = null → vtail = ls.lst, vs[vhead].next ≠ null ∧ vs[vs[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) ⊦ (∃ rl. orl + qrl + rl = ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ (∃ rl0. orl + rl0 = ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl) ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vtail ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from phead ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vhead ∧ equalrl (orl + qrl, vs, ps, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ equalowns (vs, ps, owns, tid0, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ vretRefs(tid0) = ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ∧ ( pretRefs(tid0) = ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0) ∨ vretRefs(tid0) = ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0)) ∧ rvownsrely (tid0, rvowns, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ dom prvHp ⊆ dom ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ prvHpRely (vrvHp, prvHp, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ noidRely (tid0, orl + qrl, vs, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ nextnottidRely (tid0, vhead, vs, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ownsRely (tid0, owns, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns:= owns0 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns0, rvowns); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs:= ps2 = mkgs (ps, ps2, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns); (s)
| ls.nxt = null, vs[ls.node] = mk(ls.value, None, null), ps[ls.node] = mk(ls.value, None, null), dom vrvHp = dom prvHp, owns(ls.node) = Some(ls.tid), ls.node ≠ null, ls.tid ≠ tid0, 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 ∈ orl, ls.node ∈ ps, ls.node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ ls.node ∈ orl, ¬ ls.node ∈ qrl, vs[ls.lst].next = null → vtail = ls.lst, vs[vhead].next ≠ null ∧ vs[vs[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) ⊦ (∃ rl. orl + qrl + rl = ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ (∃ rl0. orl + rl0 = ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl) ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vtail ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from phead ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vhead ∧ equalrl (orl + qrl, vs, ps, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ equalowns (vs, ps, owns, tid0, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ vretRefs(tid0) = ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ∧ ( pretRefs(tid0) = ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0) ∨ vretRefs(tid0) = ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0)) ∧ rvownsrely (tid0, rvowns, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ dom prvHp ⊆ dom ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ prvHpRely (vrvHp, prvHp, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ noidRely (tid0, orl + qrl, vs, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ nextnottidRely (tid0, vhead, vs, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ownsRely (tid0, owns, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) |
ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), nxt = null, owns(node) = Some(tid), ¬ success, node ≠ null, orl ≠ [], tid ≠ tid0, 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), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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[lst].next = null → vtail = lst, 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 ⊦ (∃ rl. orl + qrl + rl = ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ (∃ rl0. orl + rl0 = ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl) ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vtail ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from phead ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vhead ∧ equalrl (orl + qrl, vs, ps, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ equalowns (vs, ps, owns, tid0, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ vretRefs(tid0) = ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ∧ ( pretRefs(tid0) = ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0) ∨ vretRefs(tid0) = ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0)) ∧ rvownsrely (tid0, rvowns, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ dom prvHp ⊆ dom ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ prvHpRely (vrvHp, prvHp, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ noidRely (tid0, orl + qrl, vs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ nextnottidRely (tid0, vhead, vs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ownsRely (tid0, owns, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns)
Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ( (tid = ls.tid ∧ value = ls.value) ∧ optval = ls.optval) ∧ node = ls.node) ∧ nd = ls.nd) ∧ (success ↔ ls.success)) ∧ lst = ls.lst) ∧ nxt = ls.nxt) ∧ rvref = ls.rvref) ∧ optval0 = ls.optval0) ∧ first = ls.first) ∧ othertid = ls.othertid) ∧ addr = ls.addr ↔ ls = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr); (elim) Used terms: value, nxt, optval, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval
| ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), nxt = null, owns(node) = Some(tid), ¬ success, node ≠ null, orl ≠ [], tid ≠ tid0, 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), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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[lst].next = null → vtail = lst, 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 ⊦ (∃ rl. orl + qrl + rl = ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ (∃ rl0. orl + rl0 = ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl) ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vtail ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from phead ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vhead ∧ equalrl (orl + qrl, vs, ps, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ equalowns (vs, ps, owns, tid0, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ vretRefs(tid0) = ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ∧ ( pretRefs(tid0) = ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0) ∨ vretRefs(tid0) = ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0)) ∧ rvownsrely (tid0, rvowns, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ dom prvHp ⊆ dom ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ prvHpRely (vrvHp, prvHp, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ noidRely (tid0, orl + qrl, vs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ nextnottidRely (tid0, vhead, vs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ownsRely (tid0, owns, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) |
vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, orl ≠ [], tid ≠ tid0, 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 ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ qrl, vs[lst].next = null → vtail = lst, vs[vhead].next ≠ null ∧ vs[vs[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) ⊦ (∃ rl. orl + qrl + rl = ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ (∃ rl0. orl + rl0 = ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl) ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vtail ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from phead ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vhead ∧ equalrl (orl + qrl, vs, ps, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ equalowns (vs, ps, owns, tid0, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ vretRefs(tid0) = ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ∧ ( pretRefs(tid0) = ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0) ∨ vretRefs(tid0) = ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0)) ∧ rvownsrely (tid0, rvowns, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ dom prvHp ⊆ dom ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ prvHpRely (vrvHp, prvHp, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ noidRely (tid0, orl + qrl, vs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ nextnottidRely (tid0, vhead, vs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ownsRely (tid0, owns, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns)
| vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, orl ≠ [], tid ≠ tid0, 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 ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ qrl, vs[lst].next = null → vtail = lst, vs[vhead].next ≠ null ∧ vs[vs[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) ⊦ (∃ rl. orl + qrl + rl = ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ (∃ rl0. orl + rl0 = ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl) ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vtail ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from phead ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vhead ∧ equalrl (orl + qrl, vs, ps, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ equalowns (vs, ps, owns, tid0, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ vretRefs(tid0) = ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ∧ ( pretRefs(tid0) = ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0) ∨ vretRefs(tid0) = ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0)) ∧ rvownsrely (tid0, rvowns, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ dom prvHp ⊆ dom ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ prvHpRely (vrvHp, prvHp, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ noidRely (tid0, orl + qrl, vs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ nextnottidRely (tid0, vhead, vs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ownsRely (tid0, owns, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) |
((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, orl ≠ [], tid ≠ tid0, 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), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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[lst].next = null → vtail = lst, 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 ⊦ (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0)
Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ((ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns); (elim) Used terms: qrl0, ps0, phead0, vrvHp0, vretRefs0, vhead0, vtail0, ((ps ⊕ vs)[lst].next = null ⊃ mkgs (ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0
| ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, orl ≠ [], tid ≠ tid0, 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), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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[lst].next = null → vtail = lst, 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 ⊦ (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0) |
⊦ (ps ⊕ vs)[r] = (r ∈ vs ⊃ vs[r];ps[r])
((lst ∈ vs ⊃ vs[lst];ps[lst]).next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, orl ≠ [], tid ≠ tid0, 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 ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ qrl, vs[lst].next = null → vtail = lst, vs[vhead].next ≠ null ∧ vs[vs[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) ⊦ (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0)
Used terms: ps, vs, lst
| ⊦ (ps ⊕ vs)[r] = (r ∈ vs ⊃ vs[r];ps[r]) |
| ((lst ∈ vs ⊃ vs[lst];ps[lst]).next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, orl ≠ [], tid ≠ tid0, 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 ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ qrl, vs[lst].next = null → vtail = lst, vs[vhead].next ≠ null ∧ vs[vs[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) ⊦ (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0) |
(lst ∈ vs ⊃ vs[lst];ps[lst]).next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), owns(node) = Some(tid), node ≠ null, orl ≠ [], tid ≠ tid0, 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), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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[lst].next = null → vtail = lst, 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 ⊦ (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0)
ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), owns(node) = Some(tid), (lst ∈ vs ⊃ vs[lst];ps[lst]).next ≠ null, node ≠ null, orl ≠ [], tid ≠ tid0, 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), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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[lst].next = null → vtail = lst, 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 ⊦ (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0)
| (lst ∈ vs ⊃ vs[lst];ps[lst]).next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), owns(node) = Some(tid), node ≠ null, orl ≠ [], tid ≠ tid0, 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), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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[lst].next = null → vtail = lst, 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 ⊦ (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0) |
(lst ∈ vs ⊃ vs[lst];ps0[lst]).next = null, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ orl0, ¬ node ∈ qrl0, vs[lst].next = null → vtail0 = lst, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0 ∧ equalrl(orl0 + qrl0, vs, ps0, vs[lst, vs[lst].next:= node], ps0) ∧ equalowns(vs, ps0, owns, tid0, vs[lst, vs[lst].next:= node], ps0, owns(node; Weak(tid))) ∧ noidRely(tid0, orl0 + qrl0, vs, orl0 + qrl0, vs[lst, vs[lst].next:= node]) ∧ nextnottidRely(tid0, vhead0, vs, vhead0, vs[lst, vs[lst].next:= node]) ∧ ownsRely(tid0, owns, owns(node; Weak(tid)))
Used simplifier rules: ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ x = x + y ↔ y = []; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) = mkgs (ps1, ps2, phead2, phead3, phead4, vretRefs1, vretRefs2, vrvHp1, vrvHp2, qrl1, qrl2, owns0, rvowns0) ↔ ps = ps1 ∧ ps0 = ps2 ∧ phead = phead2 ∧ phead0 = phead3 ∧ phead1 = phead4 ∧ vretRefs = vretRefs1 ∧ vretRefs0 = vretRefs2 ∧ vrvHp = vrvHp1 ∧ vrvHp0 = vrvHp2 ∧ qrl = qrl1 ∧ qrl0 = qrl2 ∧ owns = owns0 ∧ rvowns = rvowns0; (ws)
| (lst ∈ vs ⊃ vs[lst];ps0[lst]).next = null, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ orl0, ¬ node ∈ qrl0, vs[lst].next = null → vtail0 = lst, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0 ∧ equalrl(orl0 + qrl0, vs, ps0, vs[lst, vs[lst].next:= node], ps0) ∧ equalowns(vs, ps0, owns, tid0, vs[lst, vs[lst].next:= node], ps0, owns(node; Weak(tid))) ∧ noidRely(tid0, orl0 + qrl0, vs, orl0 + qrl0, vs[lst, vs[lst].next:= node]) ∧ nextnottidRely(tid0, vhead0, vs, vhead0, vs[lst, vs[lst].next:= node]) ∧ ownsRely(tid0, owns, owns(node; Weak(tid))) |
⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns))
(lst ∈ vs ⊃ vs[lst];ps0[lst]).next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ orl0, ¬ node ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vs[lst].next = null → vtail0 = lst, listp(orl0 + qrl0, vs, ps0, owns) ∧ lst ∈ orl0 + qrl0 → (∃ rl1, rl2. orl0 + qrl0 = rl1 + lst ' + rl2 ∧ listp(lst ' + rl2, vs, ps0, owns)), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0 ∧ equalrl(orl0 + qrl0, vs, ps0, vs[lst, vs[lst].next:= node], ps0) ∧ equalowns(vs, ps0, owns, tid0, vs[lst, vs[lst].next:= node], ps0, owns(node; Weak(tid))) ∧ noidRely(tid0, orl0 + qrl0, vs, orl0 + qrl0, vs[lst, vs[lst].next:= node]) ∧ nextnottidRely(tid0, vhead0, vs, vhead0, vs[lst, vs[lst].next:= node]) ∧ ownsRely(tid0, owns, owns(node; Weak(tid)))
Used terms: ps0, orl0 + qrl0, owns, lst, vs
| ⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns)) |
| (lst ∈ vs ⊃ vs[lst];ps0[lst]).next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ orl0, ¬ node ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vs[lst].next = null → vtail0 = lst, listp(orl0 + qrl0, vs, ps0, owns) ∧ lst ∈ orl0 + qrl0 → (∃ rl1, rl2. orl0 + qrl0 = rl1 + lst ' + rl2 ∧ listp(lst ' + rl2, vs, ps0, owns)), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0 ∧ equalrl(orl0 + qrl0, vs, ps0, vs[lst, vs[lst].next:= node], ps0) ∧ equalowns(vs, ps0, owns, tid0, vs[lst, vs[lst].next:= node], ps0, owns(node; Weak(tid))) ∧ noidRely(tid0, orl0 + qrl0, vs, orl0 + qrl0, vs[lst, vs[lst].next:= node]) ∧ nextnottidRely(tid0, vhead0, vs, vhead0, vs[lst, vs[lst].next:= node]) ∧ ownsRely(tid0, owns, owns(node; Weak(tid))) |
orl0 + qrl0 = rl1 + lst ' + rl2, (lst ∈ vs ⊃ vs[lst];ps0[lst]).next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ null, node ≠ lst, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl2, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vs[lst].next = null → vtail0 = lst, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0 ∧ equalrl(orl0 + qrl0, vs, ps0, vs[lst, vs[lst].next:= node], ps0) ∧ equalowns(vs, ps0, owns, tid0, vs[lst, vs[lst].next:= node], ps0, owns(node; Weak(tid))) ∧ noidRely(tid0, orl0 + qrl0, vs, orl0 + qrl0, vs[lst, vs[lst].next:= node]) ∧ nextnottidRely(tid0, vhead0, vs, vhead0, vs[lst, vs[lst].next:= node]) ∧ ownsRely(tid0, owns, owns(node; Weak(tid)))
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| orl0 + qrl0 = rl1 + lst ' + rl2, (lst ∈ vs ⊃ vs[lst];ps0[lst]).next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ null, node ≠ lst, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl2, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vs[lst].next = null → vtail0 = lst, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0 ∧ equalrl(orl0 + qrl0, vs, ps0, vs[lst, vs[lst].next:= node], ps0) ∧ equalowns(vs, ps0, owns, tid0, vs[lst, vs[lst].next:= node], ps0, owns(node; Weak(tid))) ∧ noidRely(tid0, orl0 + qrl0, vs, orl0 + qrl0, vs[lst, vs[lst].next:= node]) ∧ nextnottidRely(tid0, vhead0, vs, vhead0, vs[lst, vs[lst].next:= node]) ∧ ownsRely(tid0, owns, owns(node; Weak(tid))) |
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ null, node ≠ lst, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ vs, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl2, vs[lst].next = null → vtail0 = lst, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0 ∧ equalrl(orl0 + qrl0, vs, ps0, vs[lst, vs[lst].next:= node], ps0) ∧ equalowns(vs, ps0, owns, tid0, vs[lst, vs[lst].next:= node], ps0, owns(node; Weak(tid))) ∧ noidRely(tid0, orl0 + qrl0, vs, orl0 + qrl0, vs[lst, vs[lst].next:= node]) ∧ nextnottidRely(tid0, vhead0, vs, vhead0, vs[lst, vs[lst].next:= node]) ∧ ownsRely(tid0, owns, owns(node; Weak(tid)))
Used simplifier rules: ⊦ ¬ 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]
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ null, node ≠ lst, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ vs, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl2, vs[lst].next = null → vtail0 = lst, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0 ∧ equalrl(orl0 + qrl0, vs, ps0, vs[lst, vs[lst].next:= node], ps0) ∧ equalowns(vs, ps0, owns, tid0, vs[lst, vs[lst].next:= node], ps0, owns(node; Weak(tid))) ∧ noidRely(tid0, orl0 + qrl0, vs, orl0 + qrl0, vs[lst, vs[lst].next:= node]) ∧ nextnottidRely(tid0, vhead0, vs, vhead0, vs[lst, vs[lst].next:= node]) ∧ ownsRely(tid0, owns, owns(node; Weak(tid))) |
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ vs, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ lst ∈ orl0 + qrl0 from lst ∧ vhead0 ∈ orl0 + qrl0 from vhead0 ∧ equalrl(orl0 + qrl0, vs, ps0, vs[lst, vs[lst].next:= node], ps0) ∧ equalowns(vs, ps0, owns, tid0, vs[lst, vs[lst].next:= node], ps0, owns(node; Weak(tid))) ∧ noidRely(tid0, orl0 + qrl0, vs, orl0 + qrl0, vs[lst, vs[lst].next:= node]) ∧ nextnottidRely(tid0, vhead0, vs, vhead0, vs[lst, vs[lst].next:= node]) ∧ ownsRely(tid0, owns, owns(node; Weak(tid)))
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ vs, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ lst ∈ orl0 + qrl0 from lst ∧ vhead0 ∈ orl0 + qrl0 from vhead0 ∧ equalrl(orl0 + qrl0, vs, ps0, vs[lst, vs[lst].next:= node], ps0) ∧ equalowns(vs, ps0, owns, tid0, vs[lst, vs[lst].next:= node], ps0, owns(node; Weak(tid))) ∧ noidRely(tid0, orl0 + qrl0, vs, orl0 + qrl0, vs[lst, vs[lst].next:= node]) ∧ nextnottidRely(tid0, vhead0, vs, vhead0, vs[lst, vs[lst].next:= node]) ∧ ownsRely(tid0, owns, owns(node; Weak(tid))) |
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ orl0 + qrl0 from vhead0, ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ equalrl(orl0 + qrl0, vs, ps0, vs[lst, vs[lst].next:= node], ps0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ equalowns(vs, ps0, owns, tid0, vs[lst, vs[lst].next:= node], ps0, owns(node; Weak(tid))), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ noidRely(tid0, orl0 + qrl0, vs, orl0 + qrl0, vs[lst, vs[lst].next:= node]), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ nextnottidRely(tid0, vhead0, vs, vhead0, vs[lst, vs[lst].next:= node]), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ ownsRely(tid0, owns, owns(node; Weak(tid))), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
Used simplifier rules: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ∈ rl → r ∈ rl from r; (ss)
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ orl0 + qrl0 from vhead0, ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ vs, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl0 + qrl0 from vhead0, ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦
Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: orl0, qrl0, vhead0
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ vs, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl0 + qrl0 from vhead0, ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ |
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ qrl0 from vhead0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ qrl0 from vhead0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, phead, y
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ equalrl(orl0 + qrl0, vs, ps0, vs[lst, vs[lst].next:= node], ps0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ (vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val))
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ vs, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∃ r. ¬ ( r ∈ orl0 + qrl0 → vs[r].val = vs[lst, vs[lst].next:= node][r].val ∧ ps0[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs[lst, vs[lst].next:= node][r].deqID = vs[r].deqID) ∧ (ps0[r].deqID ≠ None → ps0[r].deqID = ps0[r].deqID) ∧ (vs[r].next ≠ null → vs[lst, vs[lst].next:= node][r].next = vs[r].next) ∧ (ps0[r].next ≠ null → ps0[r].next = ps0[r].next) ∧ ( vs[(orl0 + qrl0).last].next ≠ null → vs[lst, vs[lst].next:= node][(orl0 + qrl0).last].next = vs[(orl0 + qrl0).last].next ∧ vs[lst, vs[lst].next:= node][vs[lst, vs[lst].next:= node][(orl0 + qrl0).last].next].val = vs[vs[lst, vs[lst].next:= node][(orl0 + qrl0).last].next].val)), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦
Used terms: ps0, orl0 + qrl0, ps0, vs[lst, vs[lst].next:= node], vs
| ⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ (vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val)) |
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ vs, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∃ r. ¬ ( r ∈ orl0 + qrl0 → vs[r].val = vs[lst, vs[lst].next:= node][r].val ∧ ps0[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs[lst, vs[lst].next:= node][r].deqID = vs[r].deqID) ∧ (ps0[r].deqID ≠ None → ps0[r].deqID = ps0[r].deqID) ∧ (vs[r].next ≠ null → vs[lst, vs[lst].next:= node][r].next = vs[r].next) ∧ (ps0[r].next ≠ null → ps0[r].next = ps0[r].next) ∧ ( vs[(orl0 + qrl0).last].next ≠ null → vs[lst, vs[lst].next:= node][(orl0 + qrl0).last].next = vs[(orl0 + qrl0).last].next ∧ vs[lst, vs[lst].next:= node][vs[lst, vs[lst].next:= node][(orl0 + qrl0).last].next].val = vs[vs[lst, vs[lst].next:= node][(orl0 + qrl0).last].next].val)), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ |
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, r ∈ orl0 ∨ r ∈ qrl0 ⊦ vs[r].val = vs[lst, vs[lst].next:= node][r].val ∧ (vs[r].deqID ≠ None → vs[lst, vs[lst].next:= node][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[lst, vs[lst].next:= node][r].next = vs[r].next) ∧ ( vs[(orl0 + qrl0).last].next ≠ null → vs[lst, vs[lst].next:= node][(orl0 + qrl0).last].next = vs[(orl0 + qrl0).last].next ∧ vs[lst, vs[lst].next:= node][vs[lst, vs[lst].next:= node][(orl0 + qrl0).last].next].val = vs[vs[lst, vs[lst].next:= node][(orl0 + qrl0).last].next].val)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, r ∈ orl0 ∨ r ∈ qrl0 ⊦ vs[r].val = vs[lst, vs[lst].next:= node][r].val ∧ (vs[r].deqID ≠ None → vs[lst, vs[lst].next:= node][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[lst, vs[lst].next:= node][r].next = vs[r].next) ∧ ( vs[(orl0 + qrl0).last].next ≠ null → vs[lst, vs[lst].next:= node][(orl0 + qrl0).last].next = vs[(orl0 + qrl0).last].next ∧ vs[lst, vs[lst].next:= node][vs[lst, vs[lst].next:= node][(orl0 + qrl0).last].next].val = vs[vs[lst, vs[lst].next:= node][(orl0 + qrl0).last].next].val) |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (nd.next:= nxt).val = nd.val; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) Used terms: vs, lst, vs[lst].next:= node, r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ equalowns(vs, ps0, owns, tid0, vs[lst, vs[lst].next:= node], ps0, owns(node; Weak(tid))), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
⊦ equalowns(vs, ps, owns, tid, vs0, ps0, owns0) ↔ (∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r))
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ vs, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∃ r. ¬ ( r ∈ vs ∧ r ∈ ps0 ∧ (owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(node; Weak(tid))(r) ≠ None) → r ∈ vs[lst, vs[lst].next:= node] ∧ r ∈ ps0 ∧ vs[lst, vs[lst].next:= node][r] = vs[r] ∧ (ps0[r].next = ps0[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps0[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps0[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns(node; Weak(tid))(r) = owns(r)), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦
Used terms: ps0, ps0, tid0, owns, vs[lst, vs[lst].next:= node], owns(node; Weak(tid)), vs
| ⊦ equalowns(vs, ps, owns, tid, vs0, ps0, owns0) ↔ (∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r)) |
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ vs, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∃ r. ¬ ( r ∈ vs ∧ r ∈ ps0 ∧ (owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(node; Weak(tid))(r) ≠ None) → r ∈ vs[lst, vs[lst].next:= node] ∧ r ∈ ps0 ∧ vs[lst, vs[lst].next:= node][r] = vs[r] ∧ (ps0[r].next = ps0[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps0[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps0[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns(node; Weak(tid))(r) = owns(r)), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ |
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ null, node ≠ lst, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ vs, r ∈ ps0, r ∈ vs, r ∈ vs[lst, vs[lst].next:= node], ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl2, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ (node = r ⊃ Weak(tid);owns(r)) ≠ None, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ (node = r ⊃ Weak(tid);owns(r)) = owns(r) ∧ vs[lst, vs[lst].next:= node][r] = vs[r]
Used simplifier rules: ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws)
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ null, node ≠ lst, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ vs, r ∈ ps0, r ∈ vs, r ∈ vs[lst, vs[lst].next:= node], ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl2, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ (node = r ⊃ Weak(tid);owns(r)) ≠ None, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ (node = r ⊃ Weak(tid);owns(r)) = owns(r) ∧ vs[lst, vs[lst].next:= node][r] = vs[r] |
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ r, node ≠ null, node ≠ lst, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), r ∈ vs[lst, vs[lst].next:= node], r ∈ vs, r ∈ ps0, lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl2, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ (node = r ⊃ Weak(tid);owns(r)) ≠ None ⊦ (node = r ⊃ Weak(tid);owns(r)) = owns(r) ∧ vs[lst, vs[lst].next:= node][r] = vs[r]
Used simplifier rules: ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s) ⊦ None ≠ Weak(tid); (s) ⊦ a ≠ b → st[b, d][a] = st[a]; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ Some(tid) = Some(tid0) ↔ tid = tid0; (s) ⊦ Some(tid) ≠ Weak(tid0); (s) Used formulas: node = r
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ r, node ≠ null, node ≠ lst, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), r ∈ vs[lst, vs[lst].next:= node], r ∈ vs, r ∈ ps0, lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl2, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ (node = r ⊃ Weak(tid);owns(r)) ≠ None ⊦ (node = r ⊃ Weak(tid);owns(r)) = owns(r) ∧ vs[lst, vs[lst].next:= node][r] = vs[r] |
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), vs[lst, vs[lst].next:= node][r] ≠ vs[r], node ≠ r, node ≠ null, node ≠ lst, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ vs, r ∈ ps0, r ∈ vs, r ∈ vs[lst, vs[lst].next:= node], ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl2, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None ⊦
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), vs[lst, vs[lst].next:= node][r] ≠ vs[r], node ≠ r, node ≠ null, node ≠ lst, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ vs, r ∈ ps0, r ∈ vs, r ∈ vs[lst, vs[lst].next:= node], ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl2, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), r = lst, vs[lst, vs[lst].next:= node][r] ≠ vs[r], node ≠ r, node ≠ null, node ≠ lst, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), r ∈ vs[lst, vs[lst].next:= node], r ∈ vs, r ∈ ps0, lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl2, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
Used terms: vs, lst, vs[lst].next:= node, r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), r = lst, vs[lst, vs[lst].next:= node][r] ≠ vs[r], node ≠ r, node ≠ null, node ≠ lst, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), r ∈ vs[lst, vs[lst].next:= node], r ∈ vs, r ∈ ps0, lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl2, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), vs[lst].next:= node ≠ vs[lst], node ≠ null, node ≠ lst, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ ps0, lst ∈ vs, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl2, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), owns(lst) = Some(tid0) ∨ owns(lst) = Weak(tid0) ∧ owns(lst) ≠ None ⊦
Used simplifier rules: ⊦ a ∈ st[a, d]; (s) ⊦ a = b → st[b, d][a] = d; (s)
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), vs[lst].next:= node ≠ vs[lst], node ≠ null, node ≠ lst, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ ps0, lst ∈ vs, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl2, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), owns(lst) = Some(tid0) ∨ owns(lst) = Weak(tid0) ∧ owns(lst) ≠ None ⊦ |
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, mk(val, opttid, nxt) = vs[lst], nxt0 = node, owns(node) = Some(tid), mk(val, opttid, nxt0) ≠ vs[lst], node ≠ null, node ≠ lst, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, lst ∈ ps0, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl2, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), owns(lst) = Some(tid0) ∨ owns(lst) = Weak(tid0) ∧ owns(lst) ≠ None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, mk(val, opttid, nxt) = vs[lst], nxt0 = node, owns(node) = Some(tid), mk(val, opttid, nxt0) ≠ vs[lst], node ≠ null, node ≠ lst, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, lst ∈ ps0, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl2, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), owns(lst) = Some(tid0) ∨ owns(lst) = Weak(tid0) ∧ owns(lst) ≠ None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
orl0 + qrl0 = rl1 + lst ' + rl2, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, mk(val, opttid, null) = vs[lst], owns(node) = Some(tid), node ≠ null, node ≠ lst, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ ps0, lst ∈ vs, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl2, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), owns(lst) = Some(tid0) ∨ owns(lst) = Weak(tid0) ∧ owns(lst) ≠ None ⊦
Used simplifier rules: ⊦ mk(val, opttid, nxt) = mk(val0, opttid0, nxt0) ↔ val = val0 ∧ opttid = opttid0 ∧ nxt = nxt0; (ws) ⊦ mk(val, opttid, nxt).next = nxt; (s)
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, mk(val, opttid, null) = vs[lst], owns(node) = Some(tid), node ≠ null, node ≠ lst, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ ps0, lst ∈ vs, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl2, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), owns(lst) = Some(tid0) ∨ owns(lst) = Weak(tid0) ∧ owns(lst) ≠ None ⊦ |
Used simplifier rules: reflist freely generated by [], +;; ⊦ 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) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ mk(val, opttid, nxt).next = nxt; (s) ⊦ mk(val, opttid, nxt).val = val; (s) ⊦ None ≠ Some(tid); (s) ⊦ 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) ⊦ ¬ a ∈ []; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist]
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ noidRely(tid0, orl0 + qrl0, vs, orl0 + qrl0, vs[lst, vs[lst].next:= node]), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
⊦ noidRely(tid, rl, vs, rl0, vs0) ↔ (∀ r. noid(tid, rl, r, vs) → noid(tid, rl0, r, vs0))
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ vs, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∃ r. ¬(noid(tid0, orl0 + qrl0, r, vs) → noid(tid0, orl0 + qrl0, r, vs[lst, vs[lst].next:= node])), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦
Used terms: orl0 + qrl0, tid0, vs[lst, vs[lst].next:= node], orl0 + qrl0, vs
| ⊦ noidRely(tid, rl, vs, rl0, vs0) ↔ (∀ r. noid(tid, rl, r, vs) → noid(tid, rl0, r, vs0)) |
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ vs, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∃ r. ¬(noid(tid0, orl0 + qrl0, r, vs) → noid(tid0, orl0 + qrl0, r, vs[lst, vs[lst].next:= node])), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ |
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst, vs[lst].next:= node][r0].deqID = Some(tid0), vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), vs[r0].deqID ≠ Some(tid0), node ≠ lst, node ≠ null, orl0 ≠ [], r0 ≠ r, tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid0, orl0 + qrl0, r, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, r0 ∈ orl0 + qrl0 from r, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
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)
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst, vs[lst].next:= node][r0].deqID = Some(tid0), vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), vs[r0].deqID ≠ Some(tid0), node ≠ lst, node ≠ null, orl0 ≠ [], r0 ≠ r, tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid0, orl0 + qrl0, r, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, r0 ∈ orl0 + qrl0 from r, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) Used terms: vs, lst, vs[lst].next:= node, r0
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ nextnottidRely(tid0, vhead0, vs, vhead0, vs[lst, vs[lst].next:= node]), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
⊦ nextnottidRely(tid, vhead, vs, vhead0, vs0) ↔ nextnottid(tid, vhead, vs) → nextnottid(tid, vhead0, vs0)
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid0, vhead0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ vs, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ nextnottid(tid0, vhead0, vs[lst, vs[lst].next:= node]), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦
Used terms: vhead0, vhead0, tid0, vs[lst, vs[lst].next:= node], vs
| ⊦ nextnottidRely(tid, vhead, vs, vhead0, vs0) ↔ nextnottid(tid, vhead, vs) → nextnottid(tid, vhead0, vs0) |
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid0, vhead0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ vs, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ nextnottid(tid0, vhead0, vs[lst, vs[lst].next:= node]), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ |
⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid)
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst, vs[lst].next:= node][vs[lst, vs[lst].next:= node][vhead0].next].deqID = Some(tid0), vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), vs[lst, vs[lst].next:= node][vhead0].next ≠ null, node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), nextnottid(tid0, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
Used terms: tid0, vhead0, vs[lst, vs[lst].next:= node]
| ⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid) |
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst, vs[lst].next:= node][vs[lst, vs[lst].next:= node][vhead0].next].deqID = Some(tid0), vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), vs[lst, vs[lst].next:= node][vhead0].next ≠ null, node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), nextnottid(tid0, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid)
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst, vs[lst].next:= node][vs[lst, vs[lst].next:= node][vhead0].next].deqID = Some(tid0), vs[lst].next = null, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), vs[lst, vs[lst].next:= node][vhead0].next ≠ null, node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ vs, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦
Used terms: tid0, vhead0, vs
| ⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid) |
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst, vs[lst].next:= node][vs[lst, vs[lst].next:= node][vhead0].next].deqID = Some(tid0), vs[lst].next = null, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), vs[lst, vs[lst].next:= node][vhead0].next ≠ null, node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ vs, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst, vs[lst].next:= node][vs[lst, vs[lst].next:= node][vhead0].next].deqID = Some(tid0), vs[lst, vs[lst].next:= node][vhead0].next = lst, vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), vs[lst, vs[lst].next:= node][vhead0].next ≠ null, node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
orl0 + qrl0 = rl1 + lst ' + rl2, vs[vs[lst, vs[lst].next:= node][vhead0].next].deqID = Some(tid0), vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), vs[lst, vs[lst].next:= node][vhead0].next ≠ lst, vs[lst, vs[lst].next:= node][vhead0].next ≠ null, node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
Used terms: vs, lst, vs[lst].next:= node, vs[lst, vs[lst].next:= node][vhead0].next
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst, vs[lst].next:= node][vs[lst, vs[lst].next:= node][vhead0].next].deqID = Some(tid0), vs[lst, vs[lst].next:= node][vhead0].next = lst, vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), vs[lst, vs[lst].next:= node][vhead0].next ≠ null, node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].deqID = Some(tid0), vs[lst].next = null, vs[lst, vs[lst].next:= node][vhead0].next = lst, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), lst ≠ null, node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ vs, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦
Used simplifier rules: ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ a = b → st[b, d][a] = d; (s)
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].deqID = Some(tid0), vs[lst].next = null, vs[lst, vs[lst].next:= node][vhead0].next = lst, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), lst ≠ null, node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ vs, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).next = nxt; (s) Used terms: vs, lst, vs[lst].next:= node, vhead0
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[vs[lst, vs[lst].next:= node][vhead0].next].deqID = Some(tid0), vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), vs[lst, vs[lst].next:= node][vhead0].next ≠ lst, vs[lst, vs[lst].next:= node][vhead0].next ≠ null, node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).next = nxt; (s) ⊦ mk(val, opttid, nxt).deqID = opttid; (s) ⊦ None ≠ Some(tid); (s) Used terms: vs, lst, vs[lst].next:= node, vhead0
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ ownsRely(tid0, owns, owns(node; Weak(tid))), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
⊦ ownsRely(tid, owns, owns0) ↔ (∀ r. (owns(r) ≠ None → owns(r).tid ≠ tid) ∧ owns0(r) ≠ None → owns0(r).tid ≠ tid)
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ vs, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∃ r. ¬((owns(r) ≠ None → owns(r).tid ≠ tid0) ∧ owns(node; Weak(tid))(r) ≠ None → owns(node; Weak(tid))(r).tid ≠ tid0), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦
Used terms: tid0, owns, owns(node; Weak(tid))
| ⊦ ownsRely(tid, owns, owns0) ↔ (∀ r. (owns(r) ≠ None → owns(r).tid ≠ tid) ∧ owns0(r) ≠ None → owns0(r).tid ≠ tid) |
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, vs[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst ' + rl2, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ orl0, node ∈ ps0, node ∈ vs, lst ∈ vs, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∃ r. ¬((owns(r) ≠ None → owns(r).tid ≠ tid0) ∧ owns(node; Weak(tid))(r) ≠ None → owns(node; Weak(tid))(r).tid ≠ tid0), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ |
orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), (node = r ⊃ Weak(tid);owns(r)) ≠ None, node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ (node = r ⊃ Weak(tid);owns(r)).tid, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), owns(r) ≠ None → owns(r).tid ≠ (node = r ⊃ Weak(tid);owns(r)).tid, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦
| orl0 + qrl0 = rl1 + lst ' + rl2, vs[lst].next = null, ps0[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), (node = r ⊃ Weak(tid);owns(r)) ≠ None, node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ (node = r ⊃ Weak(tid);owns(r)).tid, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid, vhead0, vs), noid(tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid, node, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs, node ∈ vs, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), owns(r) ≠ None → owns(r).tid ≠ (node = r ⊃ Weak(tid);owns(r)).tid, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ |
Used simplifier rules: ⊦ None ≠ Weak(tid); (s) ⊦ Weak(tid).tid = tid; (s)
| ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), owns(node) = Some(tid), (lst ∈ vs ⊃ vs[lst];ps[lst]).next ≠ null, node ≠ null, orl ≠ [], tid ≠ tid0, 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), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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[lst].next = null → vtail = lst, 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 ⊦ (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0) |
vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), (lst ∈ vs0 ⊃ vs0[lst];ps0[lst]).next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[lst].next = null → vtail0 = lst, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0
Used simplifier rules: ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ ownsRely(tid, owns, owns); (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ equalowns(vs, ps, owns, tid, vs, ps, owns); (s) ⊦ equalrl(rl, vs, ps, vs, ps); (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ x = x + y ↔ y = []; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) = mkgs (ps1, ps2, phead2, phead3, phead4, vretRefs1, vretRefs2, vrvHp1, vrvHp2, qrl1, qrl2, owns0, rvowns0) ↔ ps = ps1 ∧ ps0 = ps2 ∧ phead = phead2 ∧ phead0 = phead3 ∧ phead1 = phead4 ∧ vretRefs = vretRefs1 ∧ vretRefs0 = vretRefs2 ∧ vrvHp = vrvHp1 ∧ vrvHp0 = vrvHp2 ∧ qrl = qrl1 ∧ qrl0 = qrl2 ∧ owns = owns0 ∧ rvowns = rvowns0; (ws)
| vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), (lst ∈ vs0 ⊃ vs0[lst];ps0[lst]).next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[lst].next = null → vtail0 = lst, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0 |
ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), vs0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs0[lst].next = null → vtail0 = lst, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0
Used simplifier rules: ⊦ ¬ 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]
| ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), vs0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs0[lst].next = null → vtail0 = lst, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0 |
vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), vs0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0
| vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), vs0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0 |
ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), vs0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vtail0 ∈ orl0 + qrl0 from vtail0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦
ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), vs0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ orl0 + qrl0 from vhead0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦
| ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), vs0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vtail0 ∈ orl0 + qrl0 from vtail0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ |
vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), (orl0 + qrl0.butlast).last ≠ qrl0.last, vs0[lst].next ≠ null, node ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(qrl0.tail, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s)
| vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), (orl0 + qrl0.butlast).last ≠ qrl0.last, vs0[lst].next ≠ null, node ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(qrl0.tail, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0 ⊦ |
vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), qrl0 = phead + orl, (orl0 + qrl0.butlast).last ≠ qrl0.last, vs0[lst].next ≠ null, node ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl0, head, tail
| vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), qrl0 = phead + orl, (orl0 + qrl0.butlast).last ≠ qrl0.last, vs0[lst].next ≠ null, node ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
vs0[(phead ' + orl).last].deqID = None, ps0[phead].deqID = None, vs0[(phead ' + orl).last].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, vs0[lst].next ≠ null, node ≠ null, node ≠ phead, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from (orl0 + (phead ' + orl).butlast).last, ¬ node ∈ orl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl ⊦
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 = a ' + x; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ' + x ≠ []; (s)
| vs0[(phead ' + orl).last].deqID = None, ps0[phead].deqID = None, vs0[(phead ' + orl).last].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, vs0[lst].next ≠ null, node ≠ null, node ≠ phead, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from (orl0 + (phead ' + orl).butlast).last, ¬ node ∈ orl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl ⊦ |
⊦ y ≠ [] → (x + y).butlast = x + y.butlast
ps0[phead].deqID = None, vs0[(phead ' + orl).last].deqID = None, vs0[(phead ' + orl).last].next = null, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl = [], owns0(node) = Some(tid), (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, vs0[lst].next ≠ null, node ≠ null, node ≠ phead, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from (orl0 + (phead ' + orl).butlast).last, ¬ node ∈ orl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦
ps0[phead].deqID = None, vs0[(phead ' + orl).last].deqID = None, vs0[(phead ' + orl).last].next = null, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), (orl0 + phead ' + orl.butlast).last ≠ (phead ' + orl).last, vs0[lst].next ≠ null, node ≠ null, node ≠ phead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + phead ' + orl.butlast).last ∈ orl0 + phead ' + orl from (orl0 + phead ' + orl.butlast).last, ¬ node ∈ orl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦
Used terms: phead ', orl
| ⊦ y ≠ [] → (x + y).butlast = x + y.butlast |
| ps0[phead].deqID = None, vs0[(phead ' + orl).last].deqID = None, vs0[(phead ' + orl).last].next = null, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl = [], owns0(node) = Some(tid), (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, vs0[lst].next ≠ null, node ≠ null, node ≠ phead, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from (orl0 + (phead ' + orl).butlast).last, ¬ node ∈ orl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦ |
ps0[phead].deqID = None, vs0[phead].deqID = None, vs0[phead].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), orl0.last ≠ phead, vs0[lst].next ≠ null, node ≠ null, node ≠ phead, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ', vhead0, vs0), nonullRetRefs(orl0 + phead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, lst ∈ orl0, lst ∈ vs0, lst ∈ ps0, ¬ dups(orl0), ¬ node ∈ orl0, ¬ phead ∈ orl0, ¬ orl0.last ∈ orl0 + phead ' from orl0.last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ⊦
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 ∈ []; (s) ⊦ unmarkedp([], vs); (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ a '.last = a; (s)
| ps0[phead].deqID = None, vs0[phead].deqID = None, vs0[phead].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), orl0.last ≠ phead, vs0[lst].next ≠ null, node ≠ null, node ≠ phead, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ', vhead0, vs0), nonullRetRefs(orl0 + phead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, lst ∈ orl0, lst ∈ vs0, lst ∈ ps0, ¬ dups(orl0), ¬ node ∈ orl0, ¬ phead ∈ orl0, ¬ orl0.last ∈ orl0 + phead ' from orl0.last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, vhead, y
| ps0[phead].deqID = None, vs0[(phead ' + orl).last].deqID = None, vs0[(phead ' + orl).last].next = null, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), (orl0 + phead ' + orl.butlast).last ≠ (phead ' + orl).last, vs0[lst].next ≠ null, node ≠ null, node ≠ phead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + phead ' + orl.butlast).last ∈ orl0 + phead ' + orl from (orl0 + phead ' + orl.butlast).last, ¬ node ∈ orl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦ |
ps0[phead].deqID = None, vs0[orl.last].deqID = None, vs0[orl.last].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), (phead ' + orl.butlast).last ≠ orl.last, vs0[lst].next ≠ null, node ≠ null, node ≠ phead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ node ∈ orl0, ¬ node ∈ orl, ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (phead ' + orl.butlast).last ∈ orl0 + phead ' + orl from (phead ' + orl.butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl ⊦
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).last = x.last; (s)
| ps0[phead].deqID = None, vs0[orl.last].deqID = None, vs0[orl.last].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), (phead ' + orl.butlast).last ≠ orl.last, vs0[lst].next ≠ null, node ≠ null, node ≠ phead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ node ∈ orl0, ¬ node ∈ orl, ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (phead ' + orl.butlast).last ∈ orl0 + phead ' + orl from (phead ' + orl.butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl ⊦ |
vs0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].next = null, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl = orl1 + vhead ', owns0(node) = Some(tid), (phead ' + orl1).last ≠ vhead, vs0[lst].next ≠ null, node ≠ null, node ≠ phead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ node ∈ orl0, ¬ node ∈ orl, ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (phead ' + orl1).last ∈ orl0 + phead ' + orl from (phead ' + orl1).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, vhead, y
| vs0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].next = null, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl = orl1 + vhead ', owns0(node) = Some(tid), (phead ' + orl1).last ≠ vhead, vs0[lst].next ≠ null, node ≠ null, node ≠ phead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ node ∈ orl0, ¬ node ∈ orl, ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (phead ' + orl1).last ∈ orl0 + phead ' + orl from (phead ' + orl1).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦ |
ps0[phead].deqID = None, vs0[vhead].deqID = None, ps0[vhead].deqID = None, vs0[vhead].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), (phead ' + orl1).last ≠ vhead, vs0[lst].next ≠ null, node ≠ null, node ≠ phead, node ≠ vhead, orl0 ≠ [], phead ≠ vhead, tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl1 + vhead ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl1 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl1 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl1, ps0), lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ phead ∈ orl0, ¬ (phead ' + orl1).last ∈ orl0 + phead ' + orl1 + vhead ' from (phead ' + orl1).last, ¬ vhead ∈ orl0, ¬ vhead ∈ orl1, ¬ node ∈ orl0, ¬ node ∈ orl1, ¬ phead ∈ orl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl1, vs0), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl1 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| ps0[phead].deqID = None, vs0[vhead].deqID = None, ps0[vhead].deqID = None, vs0[vhead].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), (phead ' + orl1).last ≠ vhead, vs0[lst].next ≠ null, node ≠ null, node ≠ phead, node ≠ vhead, orl0 ≠ [], phead ≠ vhead, tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl1 + vhead ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl1 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl1 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl1, ps0), lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ phead ∈ orl0, ¬ (phead ' + orl1).last ∈ orl0 + phead ' + orl1 + vhead ' from (phead ' + orl1).last, ¬ vhead ∈ orl0, ¬ vhead ∈ orl1, ¬ node ∈ orl0, ¬ node ∈ orl1, ¬ phead ∈ orl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl1, vs0), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl1 ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
ps0[vhead].deqID = None, vs0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].next = null, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), orl1.last ≠ vhead, vs0[lst].next ≠ null, node ≠ null, node ≠ phead, node ≠ vhead, orl0 ≠ [], orl1 ≠ [], phead ≠ vhead, tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl1 + vhead ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl1 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl1 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl1, ps0), node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ phead ∈ orl0, ¬ orl1.last ∈ orl0 + phead ' + orl1 + vhead ' from orl1.last, ¬ vhead ∈ orl0, ¬ vhead ∈ orl1, ¬ node ∈ orl0, ¬ node ∈ orl1, ¬ phead ∈ orl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl1, orl0.last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl1, vs0) ⊦
Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: phead ', orl1
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps0[vhead].deqID = None, vs0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].next = null, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), orl1.last ≠ vhead, vs0[lst].next ≠ null, node ≠ null, node ≠ phead, node ≠ vhead, orl0 ≠ [], orl1 ≠ [], phead ≠ vhead, tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl1 + vhead ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl1 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl1 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl1, ps0), node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ phead ∈ orl0, ¬ orl1.last ∈ orl0 + phead ' + orl1 + vhead ' from orl1.last, ¬ vhead ∈ orl0, ¬ vhead ∈ orl1, ¬ node ∈ orl0, ¬ node ∈ orl1, ¬ phead ∈ orl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl1, orl0.last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl1, vs0) ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ∈ rl1 + r ' + rl2 from r; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl1, lst0, y
| ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), vs0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ orl0 + qrl0 from vhead0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ |
vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl0 = qrl + vtail ', owns0(node) = Some(tid), vs0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ orl0 + qrl0 from vhead0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, vtail = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ qrl ≠ [] ∧ qrl.last = vhead0 ∧ phead0 ≠ vtail ∧ unmarkedp(qrl0, vs0) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, vtail, y
| vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl0 = qrl + vtail ', owns0(node) = Some(tid), vs0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ orl0 + qrl0 from vhead0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, vtail = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ qrl ≠ [] ∧ qrl.last = vhead0 ∧ phead0 ≠ vtail ∧ unmarkedp(qrl0, vs0) ⊦ |
ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), vs0[lst].next ≠ null, node ≠ null, node ≠ vtail, tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((qrl + vtail ') + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(qrl, ps0), nextnottid(tid, vhead0, vs0), noid(tid, (qrl + vtail ') + qrl0, vhead0, vs0), nonullRetRefs((qrl + vtail ') + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[vtail].deqID), some?(ps0[vtail].deqID), unmarkedp(qrl0, ps0), node ∈ vs0, node ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, ¬ dups(qrl + qrl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ node ∈ qrl0, ¬ vtail ∈ qrl, ¬ vtail ∈ qrl0, ¬ vhead0 ∈ (qrl + vtail ') + qrl0 from vhead0, ¬ node ∈ qrl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ qrl ≠ [] ∧ qrl.last = vhead0 ∧ phead0 ≠ vtail ∧ unmarkedp(qrl0, vs0), phead0 ∈ qrl ∨ phead0 = vtail, lst ∈ qrl ∨ lst = vtail ∨ lst ∈ qrl0, vtail0 = (vtail ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), vs0[lst].next ≠ null, node ≠ null, node ≠ vtail, tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((qrl + vtail ') + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(qrl, ps0), nextnottid(tid, vhead0, vs0), noid(tid, (qrl + vtail ') + qrl0, vhead0, vs0), nonullRetRefs((qrl + vtail ') + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[vtail].deqID), some?(ps0[vtail].deqID), unmarkedp(qrl0, ps0), node ∈ vs0, node ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs0, ¬ dups(qrl + qrl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ node ∈ qrl0, ¬ vtail ∈ qrl, ¬ vtail ∈ qrl0, ¬ vhead0 ∈ (qrl + vtail ') + qrl0 from vhead0, ¬ node ∈ qrl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ qrl ≠ [] ∧ qrl.last = vhead0 ∧ phead0 ≠ vtail ∧ unmarkedp(qrl0, vs0), phead0 ∈ qrl ∨ phead0 = vtail, lst ∈ qrl ∨ lst = vtail ∨ lst ∈ qrl0, vtail0 = (vtail ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
Used simplifier rules: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) Used terms: qrl + vtail ', qrl0, vhead0
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
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.