| ⊦ ls.tid ≠ tid0 ∧ ( gs.owns(ls.node) = Some(ls.tid) ∧ ( 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) ∧ ¬ 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, E2, a) ∧ pcstepf(gs, ls, E2, a) = E3 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E2, a).orl) ∧ gstepf(gs, ls, E2, a).vtail ∈ gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl from gs.vtail ∧ gstepf(gs, ls, E2, a).phead ∈ gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl from gs.phead ∧ gstepf(gs, ls, E2, a).vhead ∈ gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps, gstepf(gs, ls, E2, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E2, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E2, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E2, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E2, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E2, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E2, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E2, a).vhead, gstepf(gs, ls, E2, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E2, a).owns) |
gs.owns(ls.node) = Some(ls.tid), dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, E2, a) = E3, 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, E2, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), 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[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, E2, a).orl + gstepf(gs, ls, E2, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E2, a).orl) ∧ gstepf(gs, ls, E2, a).vtail ∈ gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl from gs.vtail ∧ gstepf(gs, ls, E2, a).phead ∈ gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl from gs.phead ∧ gstepf(gs, ls, E2, a).vhead ∈ gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps, gstepf(gs, ls, E2, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E2, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E2, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E2, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E2, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E2, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E2, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E2, a).vhead, gstepf(gs, ls, E2, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E2, a).owns)
| gs.owns(ls.node) = Some(ls.tid), dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, E2, a) = E3, 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, E2, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), 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[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, E2, a).orl + gstepf(gs, ls, E2, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E2, a).orl) ∧ gstepf(gs, ls, E2, a).vtail ∈ gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl from gs.vtail ∧ gstepf(gs, ls, E2, a).phead ∈ gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl from gs.phead ∧ gstepf(gs, ls, E2, a).vhead ∈ gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps, gstepf(gs, ls, E2, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E2, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E2, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E2, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E2, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E2, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E2, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E2, a).vhead, gstepf(gs, ls, E2, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E2, a).owns) |
gs.owns(ls.node) = Some(ls.tid), dom gs.vrvHp = dom gs.prvHp, ls.node ≠ null, gs.orl ≠ [], ls.tid ≠ tid0, allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.node ∈ gs.vs, ls.node ∈ gs.ps, gs.phead ∈ gs.orl, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ ls.node ∈ gs.qrl, ¬ ls.node ∈ gs.orl, gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.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.qrl.last].next = null ⊦ gs.vtail ∈ gs.orl + gs.qrl from gs.vtail ∧ gs.vhead ∈ gs.orl + gs.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs.vs[ls.node, mk(ls.value, None, null)], gs.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs.vs[ls.node, mk(ls.value, None, null)], gs.ps, gs.owns) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs.orl + gs.qrl, gs.vs[ls.node, mk(ls.value, None, null)]) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs.vhead, gs.vs[ls.node, mk(ls.value, None, null)])
Used simplifier rules: ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ ownsRely(tid, owns, owns); (s) ⊦ (gs.vs:= ps0).owns = gs.owns; (s) ⊦ gstepf(gs, ls, E2, τ) = gs.vs:= gs.vs[ls.node, mk(ls.value, None, null)]; (s) ⊦ (gs.vs:= ps0).vs = ps0; (s) ⊦ (gs.vs:= ps0).vhead = gs.vhead; (s) ⊦ (gs.vs:= ps0).qrl = gs.qrl; (s) ⊦ (gs.vs:= ps0).orl = gs.orl; (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ (gs.vs:= ps0).prvHp = gs.prvHp; (s) ⊦ (gs.vs:= ps0).vrvHp = gs.vrvHp; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ (gs.vs:= ps0).vretRefs = gs.vretRefs; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.vs:= ps0).rvowns = gs.rvowns; (s) ⊦ (gs.vs:= ps0).pretRefs = gs.pretRefs; (s) ⊦ (gs.vs:= ps0).ps = gs.ps; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ 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) ⊦ (gs.vs:= ps0).phead = gs.phead; (s) ⊦ (gs.vs:= ps0).vtail = gs.vtail; (s) ⊦ x = x + y ↔ y = []; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] fw-some-oneowns: ⊦ oneowns(tid, r0, owns, vs, ps) ∧ owns(r) = Some(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ pre(gs, ls, E2, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E2, a) = E3; (s)
| gs.owns(ls.node) = Some(ls.tid), dom gs.vrvHp = dom gs.prvHp, ls.node ≠ null, gs.orl ≠ [], ls.tid ≠ tid0, allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.node ∈ gs.vs, ls.node ∈ gs.ps, gs.phead ∈ gs.orl, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ ls.node ∈ gs.qrl, ¬ ls.node ∈ gs.orl, gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.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.qrl.last].next = null ⊦ gs.vtail ∈ gs.orl + gs.qrl from gs.vtail ∧ gs.vhead ∈ gs.orl + gs.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs.vs[ls.node, mk(ls.value, None, null)], gs.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs.vs[ls.node, mk(ls.value, None, null)], gs.ps, gs.owns) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs.orl + gs.qrl, gs.vs[ls.node, mk(ls.value, None, null)]) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs.vhead, gs.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(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ls.node ∈ ps, ls.node ∈ vs, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ ls.node ∈ qrl, ¬ ls.node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs[ls.node, mk(ls.value, None, null)], ps) ∧ equalowns(vs, ps, owns, tid0, vs[ls.node, mk(ls.value, None, null)], ps, owns) ∧ noidRely(tid0, orl + qrl, vs, orl + qrl, vs[ls.node, mk(ls.value, None, null)]) ∧ nextnottidRely(tid0, vhead, vs, vhead, vs[ls.node, mk(ls.value, None, null)])
Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ((ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns); (elim) Used terms: qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs
| dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), 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 ∈ ps, phead ∈ vs, phead ∈ orl, ls.node ∈ ps, ls.node ∈ vs, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ ls.node ∈ qrl, ¬ ls.node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs[ls.node, mk(ls.value, None, null)], ps) ∧ equalowns(vs, ps, owns, tid0, vs[ls.node, mk(ls.value, None, null)], ps, owns) ∧ noidRely(tid0, orl + qrl, vs, orl + qrl, vs[ls.node, mk(ls.value, None, null)]) ∧ nextnottidRely(tid0, vhead, vs, vhead, vs[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(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), ls.node ∈ vs, ls.node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ ls.node ∈ qrl, ¬ ls.node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs[ls.node, mk(ls.value, None, null)], ps) ∧ equalowns(vs, ps, owns, tid0, vs[ls.node, mk(ls.value, None, null)], ps, owns) ∧ noidRely(tid0, orl + qrl, vs, orl + qrl, vs[ls.node, mk(ls.value, None, null)]) ∧ nextnottidRely(tid0, vhead, vs, vhead, vs[ls.node, mk(ls.value, None, null)])
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ
| dom vrvHp = dom prvHp, 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(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ ls.node ∈ qrl, ¬ ls.node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs[ls.node, mk(ls.value, None, null)], ps) ∧ equalowns(vs, ps, owns, tid0, vs[ls.node, mk(ls.value, None, null)], ps, owns) ∧ noidRely(tid0, orl + qrl, vs, orl + qrl, vs[ls.node, mk(ls.value, None, null)]) ∧ nextnottidRely(tid0, vhead, vs, vhead, vs[ls.node, mk(ls.value, None, null)]) |
dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(node) = Some(tid), ¬ success, node ≠ null, orl ≠ [], 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 ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs[node, mk(value, None, null)], ps) ∧ equalowns(vs, ps, owns, tid0, vs[node, mk(value, None, null)], ps, owns) ∧ noidRely(tid0, orl + qrl, vs, orl + qrl, vs[node, mk(value, None, null)]) ∧ nextnottidRely(tid0, vhead, vs, vhead, vs[node, mk(value, None, null)])
Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ( (tid = ls.tid ∧ value = ls.value) ∧ optval = ls.optval) ∧ node = ls.node) ∧ nd = ls.nd) ∧ (success ↔ ls.success)) ∧ lst = ls.lst) ∧ nxt = ls.nxt) ∧ rvref = ls.rvref) ∧ optval0 = ls.optval0) ∧ first = ls.first) ∧ othertid = ls.othertid) ∧ addr = ls.addr ↔ ls = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr); (elim) Used terms: value, nxt, optval, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval
| dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(node) = Some(tid), ¬ success, 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 ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs[node, mk(value, None, null)], ps) ∧ equalowns(vs, ps, owns, tid0, vs[node, mk(value, None, null)], ps, owns) ∧ noidRely(tid0, orl + qrl, vs, orl + qrl, vs[node, mk(value, None, null)]) ∧ nextnottidRely(tid0, vhead, vs, vhead, 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), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs[node, mk(value, None, null)], ps) ∧ equalowns(vs, ps, owns, tid0, vs[node, mk(value, None, null)], ps, owns) ∧ noidRely(tid0, orl + qrl, vs, orl + qrl, vs[node, mk(value, None, null)]) ∧ nextnottidRely(tid0, vhead, vs, vhead, 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), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs[node, mk(value, None, null)], ps) ∧ equalowns(vs, ps, owns, tid0, vs[node, mk(value, None, null)], ps, owns) ∧ noidRely(tid0, orl + qrl, vs, orl + qrl, vs[node, mk(value, None, null)]) ∧ nextnottidRely(tid0, vhead, vs, vhead, vs[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 ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vtail ∈ orl + qrl from vtail, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
dom vrvHp = dom prvHp, 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 ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl from vhead, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
dom vrvHp = dom prvHp, 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 ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ equalrl(orl + qrl, vs, ps, vs[node, mk(value, None, null)], ps), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
dom vrvHp = dom prvHp, 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 ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ equalowns(vs, ps, owns, tid0, vs[node, mk(value, None, null)], ps, owns), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
dom vrvHp = dom prvHp, 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 ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noidRely(tid0, orl + qrl, vs, orl + qrl, vs[node, mk(value, None, null)]), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
dom vrvHp = dom prvHp, 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 ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ nextnottidRely(tid0, vhead, vs, vhead, vs[node, mk(value, None, null)]), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
| dom vrvHp = dom prvHp, 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 ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vtail ∈ orl + qrl from vtail, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, owns(node) = Some(tid), (orl + qrl.butlast).last ≠ qrl.last, node ≠ null, orl ≠ [], qrl ≠ [], 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), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl.butlast).last ∈ orl + qrl from (orl + qrl.butlast).last, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
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)
| vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, owns(node) = Some(tid), (orl + qrl.butlast).last ≠ qrl.last, node ≠ null, orl ≠ [], qrl ≠ [], 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), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl.butlast).last ∈ orl + qrl from (orl + qrl.butlast).last, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, owns(node) = Some(tid), qrl = phead0 + orl0, (orl + qrl.butlast).last ≠ qrl.last, node ≠ null, orl ≠ [], qrl ≠ [], 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 ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl.butlast).last ∈ orl + qrl from (orl + qrl.butlast).last, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, tail
| vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, owns(node) = Some(tid), qrl = phead0 + orl0, (orl + qrl.butlast).last ≠ qrl.last, node ≠ null, orl ≠ [], qrl ≠ [], 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 ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl.butlast).last ∈ orl + qrl from (orl + qrl.butlast).last, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, owns(node) = Some(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, node ≠ null, node ≠ phead0, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ node ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl + phead0 ' + orl0 from (orl + (phead0 ' + orl0).butlast).last, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ' + x ≠ []; (s)
| vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, owns(node) = Some(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, node ≠ null, node ≠ phead0, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ node ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl + phead0 ' + orl0 from (orl + (phead0 ' + orl0).butlast).last, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
⊦ y ≠ [] → (x + y).butlast = x + y.butlast
ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, orl0 = [], owns(node) = Some(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, node ≠ null, node ≠ phead0, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ node ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl + phead0 ' + orl0 from (orl + (phead0 ' + orl0).butlast).last, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, owns(node) = Some(tid), (orl + phead0 ' + orl0.butlast).last ≠ (phead0 ' + orl0).last, node ≠ null, node ≠ phead0, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ node ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + phead0 ' + orl0.butlast).last ∈ orl + phead0 ' + orl0 from (orl + phead0 ' + orl0.butlast).last, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used terms: phead0 ', orl0
| ⊦ y ≠ [] → (x + y).butlast = x + y.butlast |
| ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, orl0 = [], owns(node) = Some(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, node ≠ null, node ≠ phead0, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ node ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl + phead0 ' + orl0 from (orl + (phead0 ' + orl0).butlast).last, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
ps[phead0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, owns(node) = Some(tid), orl.last ≠ phead0, node ≠ null, node ≠ phead0, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl), ¬ node ∈ orl, ¬ phead0 ∈ orl, ¬ orl.last ∈ orl + phead0 ' from orl.last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ⊦
Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ ¬ a ∈ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ a '.last = a; (s)
| ps[phead0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, owns(node) = Some(tid), orl.last ≠ phead0, node ≠ null, node ≠ phead0, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl), ¬ node ∈ orl, ¬ phead0 ∈ orl, ¬ orl.last ∈ orl + phead0 ' from orl.last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ⊦ |
Used simplifier rules: ⊦ x + 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: orl, vhead0, y
| ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, owns(node) = Some(tid), (orl + phead0 ' + orl0.butlast).last ≠ (phead0 ' + orl0).last, node ≠ null, node ≠ phead0, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ node ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + phead0 ' + orl0.butlast).last ∈ orl + phead0 ' + orl0 from (orl + phead0 ' + orl0.butlast).last, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
ps[phead0].deqID = None, vs[orl0.last].deqID = None, vs[orl0.last].next = null, dom vrvHp = dom prvHp, owns(node) = Some(tid), (phead0 ' + orl0.butlast).last ≠ orl0.last, node ≠ null, node ≠ phead0, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ node ∈ orl0, ¬ node ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl0.butlast).last ∈ orl + phead0 ' + orl0 from (phead0 ' + orl0.butlast).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
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)
| ps[phead0].deqID = None, vs[orl0.last].deqID = None, vs[orl0.last].next = null, dom vrvHp = dom prvHp, owns(node) = Some(tid), (phead0 ' + orl0.butlast).last ≠ orl0.last, node ≠ null, node ≠ phead0, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ node ∈ orl0, ¬ node ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl0.butlast).last ∈ orl + phead0 ' + orl0 from (phead0 ' + orl0.butlast).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
vs[vhead0].deqID = None, ps[phead0].deqID = None, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl0 = orl1 + vhead0 ', owns(node) = Some(tid), (phead0 ' + orl1).last ≠ vhead0, node ≠ null, node ≠ phead0, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ node ∈ orl0, ¬ node ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl1).last ∈ orl + phead0 ' + orl0 from (phead0 ' + orl1).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, vhead0, y
| vs[vhead0].deqID = None, ps[phead0].deqID = None, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl0 = orl1 + vhead0 ', owns(node) = Some(tid), (phead0 ' + orl1).last ≠ vhead0, node ≠ null, node ≠ phead0, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ node ∈ orl0, ¬ node ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl1).last ∈ orl + phead0 ' + orl0 from (phead0 ' + orl1).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
ps[phead0].deqID = None, vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].next = null, dom vrvHp = dom prvHp, owns(node) = Some(tid), (phead0 ' + orl1).last ≠ vhead0, node ≠ null, node ≠ phead0, node ≠ vhead0, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ (phead0 ' + orl1).last ∈ orl + phead0 ' + orl1 + vhead0 ' from (phead0 ' + orl1).last, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ node ∈ orl1, ¬ node ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| ps[phead0].deqID = None, vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].next = null, dom vrvHp = dom prvHp, owns(node) = Some(tid), (phead0 ' + orl1).last ≠ vhead0, node ≠ null, node ≠ phead0, node ≠ vhead0, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ (phead0 ' + orl1).last ∈ orl + phead0 ' + orl1 + vhead0 ' from (phead0 ' + orl1).last, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ node ∈ orl1, ¬ node ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
ps[vhead0].deqID = None, vs[vhead0].deqID = None, ps[phead0].deqID = None, vs[vhead0].next = null, dom vrvHp = dom prvHp, owns(node) = Some(tid), orl1.last ≠ vhead0, node ≠ null, node ≠ phead0, node ≠ vhead0, orl ≠ [], orl1 ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ orl1.last ∈ orl + phead0 ' + orl1 + vhead0 ' from orl1.last, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ node ∈ orl1, ¬ node ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦
Used simplifier rules: ⊦ 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: phead0 ', orl1
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps[vhead0].deqID = None, vs[vhead0].deqID = None, ps[phead0].deqID = None, vs[vhead0].next = null, dom vrvHp = dom prvHp, owns(node) = Some(tid), orl1.last ≠ vhead0, node ≠ null, node ≠ phead0, node ≠ vhead0, orl ≠ [], orl1 ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ orl1.last ∈ orl + phead0 ' + orl1 + vhead0 ' from orl1.last, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ node ∈ orl1, ¬ node ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (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, node0, y
| 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 ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl from vhead, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
dom vrvHp = dom prvHp, orl = qrl0 + vtail0 ', 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), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl from vhead, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, vtail0, y
| dom vrvHp = dom prvHp, orl = qrl0 + vtail0 ', 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), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl from vhead, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ ps, node ∈ vs, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ vhead ∈ (qrl0 + vtail0 ') + qrl from vhead, ¬ node ∈ qrl, ¬ node ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ ps, node ∈ vs, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ vhead ∈ (qrl0 + vtail0 ') + qrl from vhead, ¬ node ∈ qrl, ¬ node ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.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: qrl0 + vtail0 ', qrl, vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| 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 ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ equalrl(orl + qrl, vs, ps, vs[node, mk(value, None, null)], ps), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ 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))
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), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r. ¬ ( r ∈ orl + qrl → vs[r].val = vs[node, mk(value, None, null)][r].val ∧ ps[r].val = ps[r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps[r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs[node, mk(value, None, null)][(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][(orl + qrl).last].next].val = vs[vs[node, mk(value, None, null)][(orl + qrl).last].next].val)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used terms: ps, orl + qrl, ps, vs[node, mk(value, None, null)], 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)) |
| 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), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r. ¬ ( r ∈ orl + qrl → vs[r].val = vs[node, mk(value, None, null)][r].val ∧ ps[r].val = ps[r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps[r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs[node, mk(value, None, null)][(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][(orl + qrl).last].next].val = vs[vs[node, mk(value, None, null)][(orl + qrl).last].next].val)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
dom vrvHp = dom prvHp, 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 ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), r ∈ orl ∨ r ∈ qrl ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs[node, mk(value, None, null)][(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][(orl + qrl).last].next].val = vs[vs[node, mk(value, None, null)][(orl + qrl).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)
| 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 ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), r ∈ orl ∨ r ∈ qrl ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs[node, mk(value, None, null)][(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][(orl + qrl).last].next].val = vs[vs[node, mk(value, None, null)][(orl + qrl).last].next].val) |
⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns))
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), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp(orl + qrl, vs, ps, owns) ∧ (orl + qrl).last ∈ orl + qrl → (∃ rl1, rl2. orl + qrl = rl1 + (orl + qrl).last ' + rl2 ∧ listp((orl + qrl).last ' + rl2, vs, ps, owns)), r ∈ orl ∨ r ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs[node, mk(value, None, null)][(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][(orl + qrl).last].next].val = vs[vs[node, mk(value, None, null)][(orl + qrl).last].next].val)
Used terms: ps, orl + qrl, owns, (orl + qrl).last, vs
| ⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns)) |
| 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), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp(orl + qrl, vs, ps, owns) ∧ (orl + qrl).last ∈ orl + qrl → (∃ rl1, rl2. orl + qrl = rl1 + (orl + qrl).last ' + rl2 ∧ listp((orl + qrl).last ' + rl2, vs, ps, owns)), r ∈ orl ∨ r ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs[node, mk(value, None, null)][(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][(orl + qrl).last].next].val = vs[vs[node, mk(value, None, null)][(orl + qrl).last].next].val) |
orl + qrl = rl1 + (orl + qrl).last ' + rl2, dom vrvHp = dom prvHp, owns(node) = Some(tid), orl + qrl ≠ [], node ≠ null, node ≠ (orl + qrl).last, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl + qrl).last ' + rl2, vs, ps, owns), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ rl1, ¬ node ∈ qrl, ¬ node ∈ orl, ¬ node ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), r ∈ orl ∨ r ∈ qrl ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[(orl + qrl).last].next ≠ null → vs[node, mk(value, None, null)][vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val)
Used simplifier rules: ⊦ a ≠ b → st[b, d][a] = st[a]; (s) ⊦ 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 ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ x.last ∈ x ↔ x ≠ []; (s)
| orl + qrl = rl1 + (orl + qrl).last ' + rl2, dom vrvHp = dom prvHp, owns(node) = Some(tid), orl + qrl ≠ [], node ≠ null, node ≠ (orl + qrl).last, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl + qrl).last ' + rl2, vs, ps, owns), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ rl1, ¬ node ∈ qrl, ¬ node ∈ orl, ¬ node ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), r ∈ orl ∨ r ∈ qrl ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[(orl + qrl).last].next ≠ null → vs[node, mk(value, None, null)][vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val) |
⊦ y ≠ [] → (x + y).last = y.last
orl + qrl = rl1 + (orl + qrl).last ' + rl2, dom vrvHp = dom prvHp, owns(node) = Some(tid), qrl = [], orl + qrl ≠ [], node ≠ null, node ≠ (orl + qrl).last, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), listp((orl + qrl).last ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ rl1, ¬ node ∈ qrl, ¬ node ∈ orl, ¬ node ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ orl ∨ r ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[(orl + qrl).last].next ≠ null → vs[node, mk(value, None, null)][vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val)
orl + qrl = rl1 + qrl.last ' + rl2, dom vrvHp = dom prvHp, owns(node) = Some(tid), orl + qrl ≠ [], node ≠ null, node ≠ qrl.last, orl ≠ [], qrl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), listp(qrl.last ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ rl1, ¬ node ∈ qrl, ¬ node ∈ orl, ¬ node ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ orl ∨ r ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[qrl.last].next ≠ null → vs[node, mk(value, None, null)][vs[qrl.last].next].val = vs[vs[qrl.last].next].val)
Used terms: orl, qrl
| ⊦ y ≠ [] → (x + y).last = y.last |
| orl + qrl = rl1 + (orl + qrl).last ' + rl2, dom vrvHp = dom prvHp, owns(node) = Some(tid), qrl = [], orl + qrl ≠ [], node ≠ null, node ≠ (orl + qrl).last, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), listp((orl + qrl).last ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ rl1, ¬ node ∈ qrl, ¬ node ∈ orl, ¬ node ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ orl ∨ r ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[(orl + qrl).last].next ≠ null → vs[node, mk(value, None, null)][vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val) |
dom vrvHp = dom prvHp, orl = rl1 + orl.last ' + rl2, owns(node) = Some(tid), node ≠ orl.last, node ≠ null, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl, vs, ps, owns), listp(orl.last ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl, vhead, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), r ∈ ps, r ∈ vs, r ∈ orl, node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl), ¬ node ∈ rl2, ¬ node ∈ orl, ¬ node ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[orl.last].next ≠ null → vs[node, mk(value, None, null)][vs[orl.last].next].val = vs[vs[orl.last].next].val)
Used simplifier rules: list-elem-in1: ⊦ listp(rl, vs, ps, owns) ∧ node ∈ rl → node ∈ vs; (forward) from specification DMSQ list-elem-in2: ⊦ listp(rl, vs, ps, owns) ∧ node ∈ rl → node ∈ ps; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s)
| dom vrvHp = dom prvHp, orl = rl1 + orl.last ' + rl2, owns(node) = Some(tid), node ≠ orl.last, node ≠ null, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl, vs, ps, owns), listp(orl.last ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl, vhead, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), r ∈ ps, r ∈ vs, r ∈ orl, node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl), ¬ node ∈ rl2, ¬ node ∈ orl, ¬ node ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[orl.last].next ≠ null → vs[node, mk(value, None, null)][vs[orl.last].next].val = vs[vs[orl.last].next].val) |
dom vrvHp = dom prvHp, orl = rl1 + phead0 ' + rl2, orl = rl + phead0 ', owns(node) = Some(tid), node ≠ phead0, node ≠ null, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(orl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl, vhead, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, r ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl), ¬ node ∈ rl2, ¬ node ∈ orl, ¬ node ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[phead0].next ≠ null → vs[node, mk(value, None, null)][vs[phead0].next].val = vs[vs[phead0].next].val)
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, phead0, y
| dom vrvHp = dom prvHp, orl = rl1 + phead0 ' + rl2, orl = rl + phead0 ', owns(node) = Some(tid), node ≠ phead0, node ≠ null, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(orl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl, vhead, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, r ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl), ¬ node ∈ rl2, ¬ node ∈ orl, ¬ node ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[phead0].next ≠ null → vs[node, mk(value, None, null)][vs[phead0].next].val = vs[vs[phead0].next].val) |
ps[phead0].deqID = vs[phead0].deqID, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, node ≠ null, node ≠ phead0, phead0 ≠ null, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, ps), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), phead ∈ ps, phead ∈ vs, node ∈ ps, node ∈ vs, r ∈ vs, r ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[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[phead0].next ≠ null → vs[phead0].next ∈ vs ∧ vs[phead0].next ∈ ps ∧ ps[vs[phead0].next] = vs[vs[phead0].next] ∧ ps[vs[phead0].next].deqID = None ∧ ps[vs[phead0].next].next = null ∧ weak?(owns(vs[phead0].next)), phead ∈ rl ∨ phead = phead0, r ∈ rl ∨ r = phead0, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[phead0].next ≠ null → vs[node, mk(value, None, null)][vs[phead0].next].val = vs[vs[phead0].next].val)
Used simplifier rules: ⊦ ¬ a ∈ []; (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ a ∈ x → (x + a ' = y + a ' + z ↔ y = x ∧ z = []); (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)
| ps[phead0].deqID = vs[phead0].deqID, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, node ≠ null, node ≠ phead0, phead0 ≠ null, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, ps), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), phead ∈ ps, phead ∈ vs, node ∈ ps, node ∈ vs, r ∈ vs, r ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[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[phead0].next ≠ null → vs[phead0].next ∈ vs ∧ vs[phead0].next ∈ ps ∧ ps[vs[phead0].next] = vs[vs[phead0].next] ∧ ps[vs[phead0].next].deqID = None ∧ ps[vs[phead0].next].next = null ∧ weak?(owns(vs[phead0].next)), phead ∈ rl ∨ phead = phead0, r ∈ rl ∨ r = phead0, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[phead0].next ≠ null → vs[node, mk(value, None, null)][vs[phead0].next].val = vs[vs[phead0].next].val) |
⊦ a ≠ b → st[b, d][a] = st[a]
ps[phead0].deqID = vs[phead0].deqID, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), node ≠ null, node ≠ phead0, phead0 ≠ null, r ≠ node, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, vs), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), phead0 ∈ ps, phead0 ∈ vs, r ∈ ps, r ∈ vs, node ∈ vs, node ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ rl, vs[phead0].next ≠ null → vs[phead0].next ∈ vs ∧ vs[phead0].next ∈ ps ∧ ps[vs[phead0].next] = vs[vs[phead0].next] ∧ ps[vs[phead0].next].deqID = None ∧ ps[vs[phead0].next].next = null ∧ weak?(owns(vs[phead0].next)), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, r ∈ rl ∨ r = phead0, phead ∈ rl ∨ phead = phead0 ⊦ vs[r].val = vs[r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (vs[phead0].next ≠ null → vs[node, mk(value, None, null)][vs[phead0].next].val = vs[vs[phead0].next].val)
Used terms: vs, node, mk(value, None, null), r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| ps[phead0].deqID = vs[phead0].deqID, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), node ≠ null, node ≠ phead0, phead0 ≠ null, r ≠ node, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, vs), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), phead0 ∈ ps, phead0 ∈ vs, r ∈ ps, r ∈ vs, node ∈ vs, node ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ rl, vs[phead0].next ≠ null → vs[phead0].next ∈ vs ∧ vs[phead0].next ∈ ps ∧ ps[vs[phead0].next] = vs[vs[phead0].next] ∧ ps[vs[phead0].next].deqID = None ∧ ps[vs[phead0].next].next = null ∧ weak?(owns(vs[phead0].next)), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, r ∈ rl ∨ r = phead0, phead ∈ rl ∨ phead = phead0 ⊦ vs[r].val = vs[r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (vs[phead0].next ≠ null → vs[node, mk(value, None, null)][vs[phead0].next].val = vs[vs[phead0].next].val) |
ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, vs[node, mk(value, None, null)][vs[phead0].next].val ≠ vs[vs[phead0].next].val, node ≠ null, node ≠ phead0, phead0 ≠ null, r ≠ node, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, ps), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), phead ∈ ps, phead ∈ vs, node ∈ ps, node ∈ vs, r ∈ vs, r ∈ ps, phead0 ∈ vs, phead0 ∈ ps, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl ∨ phead = phead0, r ∈ rl ∨ r = phead0, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦
| ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, vs[node, mk(value, None, null)][vs[phead0].next].val ≠ vs[vs[phead0].next].val, node ≠ null, node ≠ phead0, phead0 ≠ null, r ≠ node, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, ps), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), phead ∈ ps, phead ∈ vs, node ∈ ps, node ∈ vs, r ∈ vs, r ∈ ps, phead0 ∈ vs, phead0 ∈ ps, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl ∨ phead = phead0, r ∈ rl ∨ r = phead0, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ mk(val, opttid, nxt).val = val; (s) ⊦ ¬ weak?(Some(tid)); (s) Used terms: vs, node, mk(value, None, null), vs[phead0].next
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| orl + qrl = rl1 + qrl.last ' + rl2, dom vrvHp = dom prvHp, owns(node) = Some(tid), orl + qrl ≠ [], node ≠ null, node ≠ qrl.last, orl ≠ [], qrl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), listp(qrl.last ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ rl1, ¬ node ∈ qrl, ¬ node ∈ orl, ¬ node ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ orl ∨ r ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[qrl.last].next ≠ null → vs[node, mk(value, None, null)][vs[qrl.last].next].val = vs[vs[qrl.last].next].val) |
orl + qrl = rl1 + qrl.last ' + rl2, dom vrvHp = dom prvHp, owns(node) = Some(tid), orl + qrl ≠ [], node ≠ qrl.last, node ≠ null, orl ≠ [], qrl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), listp(qrl.last ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ 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), orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, r ∈ orl ∨ r ∈ qrl ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[qrl.last].next ≠ null → vs[node, mk(value, None, null)][vs[qrl.last].next].val = vs[vs[qrl.last].next].val)
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
| orl + qrl = rl1 + qrl.last ' + rl2, dom vrvHp = dom prvHp, owns(node) = Some(tid), orl + qrl ≠ [], node ≠ qrl.last, node ≠ null, orl ≠ [], qrl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), listp(qrl.last ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ 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), orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, r ∈ orl ∨ r ∈ qrl ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[qrl.last].next ≠ null → vs[node, mk(value, None, null)][vs[qrl.last].next].val = vs[vs[qrl.last].next].val) |
orl + qrl = rl1 + qrl.last ' + rl2, dom vrvHp = dom prvHp, owns(node) = Some(tid), qrl = r0 + rl, orl + qrl ≠ [], node ≠ qrl.last, node ≠ null, orl ≠ [], qrl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(qrl.last ' + rl2, vs, ps, owns), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ 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), r ∈ orl ∨ r ∈ qrl, vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[qrl.last].next ≠ null → vs[node, mk(value, None, null)][vs[qrl.last].next].val = vs[vs[qrl.last].next].val)
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, tail
| orl + qrl = rl1 + qrl.last ' + rl2, dom vrvHp = dom prvHp, owns(node) = Some(tid), qrl = r0 + rl, orl + qrl ≠ [], node ≠ qrl.last, node ≠ null, orl ≠ [], qrl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(qrl.last ' + rl2, vs, ps, owns), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ 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), r ∈ orl ∨ r ∈ qrl, vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[qrl.last].next ≠ null → vs[node, mk(value, None, null)][vs[qrl.last].next].val = vs[vs[qrl.last].next].val) |
orl + r0 ' + rl = rl1 + (r0 ' + rl).last ' + rl2, ps[r0].deqID = None, dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ (r0 ' + rl).last, node ≠ r0, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + r0 ' + rl, vs, ps, owns), listp((r0 ' + rl).last ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + rl, vhead, vs), nonullRetRefs(orl + r0 ' + rl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ r0 ∈ rl, ¬ r0 ∈ orl, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl, vs), vtail = (r0 ' + rl).last ∨ vtail = (orl + (r0 ' + rl).butlast).last ∧ vs[(r0 ' + rl).last].deqID = None ∧ vs[(r0 ' + rl).last].next = null, r ∈ orl ∨ r = r0 ∨ r ∈ rl ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[(r0 ' + rl).last].next ≠ null → vs[node, mk(value, None, null)][vs[(r0 ' + rl).last].next].val = vs[vs[(r0 ' + rl).last].next].val)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ 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) ⊦ x + a ' + y ≠ []; (s)
| orl + r0 ' + rl = rl1 + (r0 ' + rl).last ' + rl2, ps[r0].deqID = None, dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ (r0 ' + rl).last, node ≠ r0, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + r0 ' + rl, vs, ps, owns), listp((r0 ' + rl).last ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + rl, vhead, vs), nonullRetRefs(orl + r0 ' + rl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ r0 ∈ rl, ¬ r0 ∈ orl, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl, vs), vtail = (r0 ' + rl).last ∨ vtail = (orl + (r0 ' + rl).butlast).last ∧ vs[(r0 ' + rl).last].deqID = None ∧ vs[(r0 ' + rl).last].next = null, r ∈ orl ∨ r = r0 ∨ r ∈ rl ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[(r0 ' + rl).last].next ≠ null → vs[node, mk(value, None, null)][vs[(r0 ' + rl).last].next].val = vs[vs[(r0 ' + rl).last].next].val) |
⊦ y ≠ [] → (x + y).last = y.last
orl + r0 ' + rl = rl1 + (r0 ' + rl).last ' + rl2, ps[r0].deqID = None, dom vrvHp = dom prvHp, owns(node) = Some(tid), rl = [], node ≠ null, node ≠ (r0 ' + rl).last, node ≠ r0, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((r0 ' + rl).last ' + rl2, vs, ps, owns), listp(orl + r0 ' + rl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + rl, vhead, vs), nonullRetRefs(orl + r0 ' + rl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ r0 ∈ rl, ¬ r0 ∈ orl, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ orl ∨ r = r0 ∨ r ∈ rl, vtail = (r0 ' + rl).last ∨ vtail = (orl + (r0 ' + rl).butlast).last ∧ vs[(r0 ' + rl).last].deqID = None ∧ vs[(r0 ' + rl).last].next = null, orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl, vs) ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[(r0 ' + rl).last].next ≠ null → vs[node, mk(value, None, null)][vs[(r0 ' + rl).last].next].val = vs[vs[(r0 ' + rl).last].next].val)
orl + r0 ' + rl = rl1 + rl.last ' + rl2, ps[r0].deqID = None, dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ rl.last, node ≠ r0, orl ≠ [], rl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl.last ' + rl2, vs, ps, owns), listp(orl + r0 ' + rl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + rl, vhead, vs), nonullRetRefs(orl + r0 ' + rl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ r0 ∈ rl, ¬ r0 ∈ orl, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ orl ∨ r = r0 ∨ r ∈ rl, vtail = rl.last ∨ vtail = (orl + (r0 ' + rl).butlast).last ∧ vs[rl.last].deqID = None ∧ vs[rl.last].next = null, orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl, vs) ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[rl.last].next ≠ null → vs[node, mk(value, None, null)][vs[rl.last].next].val = vs[vs[rl.last].next].val)
Used terms: r0 ', rl
| ⊦ y ≠ [] → (x + y).last = y.last |
| orl + r0 ' + rl = rl1 + (r0 ' + rl).last ' + rl2, ps[r0].deqID = None, dom vrvHp = dom prvHp, owns(node) = Some(tid), rl = [], node ≠ null, node ≠ (r0 ' + rl).last, node ≠ r0, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((r0 ' + rl).last ' + rl2, vs, ps, owns), listp(orl + r0 ' + rl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + rl, vhead, vs), nonullRetRefs(orl + r0 ' + rl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ r0 ∈ rl, ¬ r0 ∈ orl, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ orl ∨ r = r0 ∨ r ∈ rl, vtail = (r0 ' + rl).last ∨ vtail = (orl + (r0 ' + rl).butlast).last ∧ vs[(r0 ' + rl).last].deqID = None ∧ vs[(r0 ' + rl).last].next = null, orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl, vs) ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[(r0 ' + rl).last].next ≠ null → vs[node, mk(value, None, null)][vs[(r0 ' + rl).last].next].val = vs[vs[(r0 ' + rl).last].next].val) |
ps[r0].deqID = None, ps[r0].next = null, ps[r0].val = vs[r0].val, dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(r0) = None, node ≠ r0, node ≠ null, orl ≠ [], r0 ≠ null, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + r0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ', vhead, vs), nonullRetRefs(orl + r0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, r0 ∈ vs, r0 ∈ ps, ¬ dups(orl), ¬ weak?(vs[r0].deqID), ¬ node ∈ orl, ¬ r0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next)), r ∈ orl ∨ r = r0, vtail = r0 ∨ vtail = orl.last ∧ vs[r0].deqID = None ∧ vs[r0].next = null, orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[r0].next ≠ null → vs[node, mk(value, None, null)][vs[r0].next].val = vs[vs[r0].next].val)
Used simplifier rules: ⊦ ¬ a ∈ []; (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: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ a '.butlast = []; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ x → (x + a ' = y + a ' + z ↔ y = x ∧ z = []); (ws)
| ps[r0].deqID = None, ps[r0].next = null, ps[r0].val = vs[r0].val, dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(r0) = None, node ≠ r0, node ≠ null, orl ≠ [], r0 ≠ null, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + r0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ', vhead, vs), nonullRetRefs(orl + r0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, r0 ∈ vs, r0 ∈ ps, ¬ dups(orl), ¬ weak?(vs[r0].deqID), ¬ node ∈ orl, ¬ r0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next)), r ∈ orl ∨ r = r0, vtail = r0 ∨ vtail = orl.last ∧ vs[r0].deqID = None ∧ vs[r0].next = null, orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[r0].next ≠ null → vs[node, mk(value, None, null)][vs[r0].next].val = vs[vs[r0].next].val) |
⊦ a ≠ b → st[b, d][a] = st[a]
ps[r0].deqID = None, ps[r0].next = null, ps[r0].val = vs[r0].val, dom vrvHp = dom prvHp, owns(r0) = None, owns(node) = Some(tid), node ≠ r0, node ≠ null, orl ≠ [], r ≠ node, r0 ≠ null, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + r0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ', vhead, vs), nonullRetRefs(orl + r0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), r0 ∈ ps, r0 ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl), ¬ weak?(vs[r0].deqID), ¬ node ∈ orl, ¬ r0 ∈ orl, vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next)), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None, vtail = r0 ∨ vtail = orl.last ∧ vs[r0].deqID = None ∧ vs[r0].next = null, r ∈ orl ∨ r = r0 ⊦ vs[r].val = vs[r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (vs[r0].next ≠ null → vs[node, mk(value, None, null)][vs[r0].next].val = vs[vs[r0].next].val)
Used terms: vs, node, mk(value, None, null), r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| ps[r0].deqID = None, ps[r0].next = null, ps[r0].val = vs[r0].val, dom vrvHp = dom prvHp, owns(r0) = None, owns(node) = Some(tid), node ≠ r0, node ≠ null, orl ≠ [], r ≠ node, r0 ≠ null, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + r0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ', vhead, vs), nonullRetRefs(orl + r0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), r0 ∈ ps, r0 ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl), ¬ weak?(vs[r0].deqID), ¬ node ∈ orl, ¬ r0 ∈ orl, vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next)), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None, vtail = r0 ∨ vtail = orl.last ∧ vs[r0].deqID = None ∧ vs[r0].next = null, r ∈ orl ∨ r = r0 ⊦ vs[r].val = vs[r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (vs[r0].next ≠ null → vs[node, mk(value, None, null)][vs[r0].next].val = vs[vs[r0].next].val) |
vs[vs[r0].next].deqID = None, ps[r0].deqID = None, vs[vs[r0].next].next = null, ps[r0].next = null, ps[r0].val = vs[r0].val, ps[vs[r0].next] = vs[vs[r0].next], dom vrvHp = dom prvHp, owns(r0) = None, owns(node) = Some(tid), vs[r0].next ≠ null, vs[node, mk(value, None, null)][vs[r0].next].val ≠ vs[vs[r0].next].val, node ≠ null, node ≠ r0, orl ≠ [], r ≠ node, r0 ≠ null, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + r0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ', vhead, vs), nonullRetRefs(orl + r0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[r0].next)), vs[r0].next ∈ ps, vs[r0].next ∈ vs, r0 ∈ ps, r0 ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl), ¬ weak?(vs[r0].deqID), ¬ r0 ∈ orl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None, r ∈ orl ∨ r = r0 ⊦
| vs[vs[r0].next].deqID = None, ps[r0].deqID = None, vs[vs[r0].next].next = null, ps[r0].next = null, ps[r0].val = vs[r0].val, ps[vs[r0].next] = vs[vs[r0].next], dom vrvHp = dom prvHp, owns(r0) = None, owns(node) = Some(tid), vs[r0].next ≠ null, vs[node, mk(value, None, null)][vs[r0].next].val ≠ vs[vs[r0].next].val, node ≠ null, node ≠ r0, orl ≠ [], r ≠ node, r0 ≠ null, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + r0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ', vhead, vs), nonullRetRefs(orl + r0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[r0].next)), vs[r0].next ∈ ps, vs[r0].next ∈ vs, r0 ∈ ps, r0 ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl), ¬ weak?(vs[r0].deqID), ¬ r0 ∈ orl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None, r ∈ orl ∨ r = r0 ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ mk(val, opttid, nxt).val = val; (s) ⊦ ¬ weak?(Some(tid)); (s) Used terms: vs, node, mk(value, None, null), vs[r0].next
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| orl + r0 ' + rl = rl1 + rl.last ' + rl2, ps[r0].deqID = None, dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ rl.last, node ≠ r0, orl ≠ [], rl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl.last ' + rl2, vs, ps, owns), listp(orl + r0 ' + rl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + rl, vhead, vs), nonullRetRefs(orl + r0 ' + rl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ r0 ∈ rl, ¬ r0 ∈ orl, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ orl ∨ r = r0 ∨ r ∈ rl, vtail = rl.last ∨ vtail = (orl + (r0 ' + rl).butlast).last ∧ vs[rl.last].deqID = None ∧ vs[rl.last].next = null, orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl, vs) ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[rl.last].next ≠ null → vs[node, mk(value, None, null)][vs[rl.last].next].val = vs[vs[rl.last].next].val) |
orl + r0 ' + rl = rl1 + rl.last ' + rl2, ps[r0].deqID = None, dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ rl.last, node ≠ r0, orl ≠ [], rl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + r0 ' + rl, vs, ps, owns), listp(rl.last ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + rl, vhead, vs), nonullRetRefs(orl + r0 ' + rl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ r0 ∈ rl, ¬ r0 ∈ orl, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl, vs), r ∈ orl ∨ r = r0 ∨ r ∈ rl, vtail = rl.last ∨ vtail = (r0 ' + rl.butlast).last ∧ vs[rl.last].deqID = None ∧ vs[rl.last].next = null ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[rl.last].next ≠ null → vs[node, mk(value, None, null)][vs[rl.last].next].val = vs[vs[rl.last].next].val)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s)
| orl + r0 ' + rl = rl1 + rl.last ' + rl2, ps[r0].deqID = None, dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ rl.last, node ≠ r0, orl ≠ [], rl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + r0 ' + rl, vs, ps, owns), listp(rl.last ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + rl, vhead, vs), nonullRetRefs(orl + r0 ' + rl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ r0 ∈ rl, ¬ r0 ∈ orl, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl, vs), r ∈ orl ∨ r = r0 ∨ r ∈ rl, vtail = rl.last ∨ vtail = (r0 ' + rl.butlast).last ∧ vs[rl.last].deqID = None ∧ vs[rl.last].next = null ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[rl.last].next ≠ null → vs[node, mk(value, None, null)][vs[rl.last].next].val = vs[vs[rl.last].next].val) |
orl + r0 ' + rl = rl1 + vtail0 ' + rl2, ps[r0].deqID = None, dom vrvHp = dom prvHp, owns(node) = Some(tid), rl = rl0 + vtail0 ', node ≠ null, node ≠ vtail0, node ≠ r0, orl ≠ [], rl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vtail0 ' + rl2, vs, ps, owns), listp(orl + r0 ' + rl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + rl, vhead, vs), nonullRetRefs(orl + r0 ' + rl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ r0 ∈ rl, ¬ r0 ∈ orl, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = vtail0 ∨ vtail = (r0 ' + rl0).last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, r ∈ orl ∨ r = r0 ∨ r ∈ rl, orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl, vs) ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[vtail0].next ≠ null → vs[node, mk(value, None, null)][vs[vtail0].next].val = vs[vs[vtail0].next].val)
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl, vtail0, y
| orl + r0 ' + rl = rl1 + vtail0 ' + rl2, ps[r0].deqID = None, dom vrvHp = dom prvHp, owns(node) = Some(tid), rl = rl0 + vtail0 ', node ≠ null, node ≠ vtail0, node ≠ r0, orl ≠ [], rl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vtail0 ' + rl2, vs, ps, owns), listp(orl + r0 ' + rl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + rl, vhead, vs), nonullRetRefs(orl + r0 ' + rl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ r0 ∈ rl, ¬ r0 ∈ orl, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = vtail0 ∨ vtail = (r0 ' + rl0).last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, r ∈ orl ∨ r = r0 ∨ r ∈ rl, orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl, vs) ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[vtail0].next ≠ null → vs[node, mk(value, None, null)][vs[vtail0].next].val = vs[vs[vtail0].next].val) |
orl + r0 ' + rl0 + vtail0 ' = rl1 + vtail0 ' + rl2, ps[vtail0].deqID = None, ps[r0].deqID = None, dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ r0, node ≠ vtail0, node ≠ null, orl ≠ [], r0 ≠ vtail0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vtail0 ' + rl2, vs, ps, owns), listp(rl1 + vtail0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vtail0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vtail0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ r0 ∈ orl, ¬ r0 ∈ rl0, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ orl ∨ r = r0 ∨ r ∈ rl0 ∨ r = vtail0, orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None, vtail = vtail0 ∨ vtail = (r0 ' + rl0).last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[vtail0].next ≠ null → vs[node, mk(value, None, null)][vs[vtail0].next].val = vs[vs[vtail0].next].val)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ 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)
| orl + r0 ' + rl0 + vtail0 ' = rl1 + vtail0 ' + rl2, ps[vtail0].deqID = None, ps[r0].deqID = None, dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ r0, node ≠ vtail0, node ≠ null, orl ≠ [], r0 ≠ vtail0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vtail0 ' + rl2, vs, ps, owns), listp(rl1 + vtail0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vtail0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vtail0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ r0 ∈ orl, ¬ r0 ∈ rl0, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ orl ∨ r = r0 ∨ r ∈ rl0 ∨ r = vtail0, orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None, vtail = vtail0 ∨ vtail = (r0 ' + rl0).last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null ⊦ vs[r].val = vs[node, mk(value, None, null)][r].val ∧ (vs[r].deqID ≠ None → vs[node, mk(value, None, null)][r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[node, mk(value, None, null)][r].next = vs[r].next) ∧ (vs[vtail0].next ≠ null → vs[node, mk(value, None, null)][vs[vtail0].next].val = vs[vs[vtail0].next].val) |
⊦ a ≠ b → st[b, d][a] = st[a]
orl + r0 ' + rl0 + vtail0 ' = rl1 + vtail0 ' + rl2, ps[r0].deqID = None, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ r0, node ≠ vtail0, node ≠ null, orl ≠ [], r ≠ node, r0 ≠ vtail0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl1 + vtail0 ' + rl2, vs, ps, owns), listp(vtail0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vtail0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vtail0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ r0 ∈ orl, ¬ r0 ∈ rl0, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = vtail0 ∨ vtail = (r0 ' + rl0).last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None, r ∈ orl ∨ r = r0 ∨ r ∈ rl0 ∨ r = vtail0 ⊦ vs[r].val = vs[r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (vs[vtail0].next ≠ null → vs[node, mk(value, None, null)][vs[vtail0].next].val = vs[vs[vtail0].next].val)
Used terms: vs, node, mk(value, None, null), r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| orl + r0 ' + rl0 + vtail0 ' = rl1 + vtail0 ' + rl2, ps[r0].deqID = None, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ r0, node ≠ vtail0, node ≠ null, orl ≠ [], r ≠ node, r0 ≠ vtail0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl1 + vtail0 ' + rl2, vs, ps, owns), listp(vtail0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vtail0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vtail0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ r0 ∈ orl, ¬ r0 ∈ rl0, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = vtail0 ∨ vtail = (r0 ' + rl0).last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None, r ∈ orl ∨ r = r0 ∨ r ∈ rl0 ∨ r = vtail0 ⊦ vs[r].val = vs[r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (vs[vtail0].next ≠ null → vs[node, mk(value, None, null)][vs[vtail0].next].val = vs[vs[vtail0].next].val) |
orl + r0 ' + rl0 + vtail0 ' = rl1 + vtail0 ' + rl2, ps[r0].deqID = None, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vtail0].next ≠ null, vs[node, mk(value, None, null)][vs[vtail0].next].val ≠ vs[vs[vtail0].next].val, node ≠ null, node ≠ vtail0, node ≠ r0, orl ≠ [], r ≠ node, r0 ≠ vtail0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl1 + vtail0 ' + rl2, vs, ps, owns), listp(vtail0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vtail0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vtail0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ r0 ∈ rl0, ¬ r0 ∈ orl, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None, r ∈ orl ∨ r = r0 ∨ r ∈ rl0 ∨ r = vtail0 ⊦
| orl + r0 ' + rl0 + vtail0 ' = rl1 + vtail0 ' + rl2, ps[r0].deqID = None, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vtail0].next ≠ null, vs[node, mk(value, None, null)][vs[vtail0].next].val ≠ vs[vs[vtail0].next].val, node ≠ null, node ≠ vtail0, node ≠ r0, orl ≠ [], r ≠ node, r0 ≠ vtail0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl1 + vtail0 ' + rl2, vs, ps, owns), listp(vtail0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vtail0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vtail0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ r0 ∈ rl0, ¬ r0 ∈ orl, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None, r ∈ orl ∨ r = r0 ∨ r ∈ rl0 ∨ r = vtail0 ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
orl + r0 ' + rl0 + vtail0 ' = rl1 + vtail0 ' + rl2, ps[vtail0].deqID = None, ps[r0].deqID = None, vs[vtail0].next = node, dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vtail0].next ≠ null, vs[node, mk(value, None, null)][vs[vtail0].next].val ≠ vs[vs[vtail0].next].val, node ≠ null, node ≠ vtail0, node ≠ r0, orl ≠ [], r ≠ node, r0 ≠ vtail0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vtail0 ' + rl2, vs, ps, owns), listp(rl1 + vtail0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vtail0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vtail0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ r0 ∈ rl0, ¬ r0 ∈ orl, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ orl ∨ r = r0 ∨ r ∈ rl0 ∨ r = vtail0, orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None ⊦
Used terms: vs, node, mk(value, None, null), vs[vtail0].next
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| orl + r0 ' + rl0 + vtail0 ' = rl1 + vtail0 ' + rl2, ps[vtail0].deqID = None, ps[r0].deqID = None, vs[vtail0].next = node, dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vtail0].next ≠ null, vs[node, mk(value, None, null)][vs[vtail0].next].val ≠ vs[vs[vtail0].next].val, node ≠ null, node ≠ vtail0, node ≠ r0, orl ≠ [], r ≠ node, r0 ≠ vtail0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vtail0 ' + rl2, vs, ps, owns), listp(rl1 + vtail0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vtail0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vtail0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ r0 ∈ rl0, ¬ r0 ∈ orl, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ orl ∨ r = r0 ∨ r ∈ rl0 ∨ r = vtail0, orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None ⊦ |
orl + r0 ' + rl0 + vtail0 ' = rl1 + vtail0 ' + rl2, ps[r0].deqID = None, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, owns(vs[vtail0].next) = Some(tid), vs[vtail0].next ≠ null, vs[vtail0].next ≠ vtail0, vs[vtail0].next ≠ r0, orl ≠ [], r ≠ vs[vtail0].next, r0 ≠ vtail0, tid ≠ tid0, value ≠ vs[vs[vtail0].next].val, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl1 + vtail0 ' + rl2, vs, ps, owns), listp(vtail0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vtail0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vtail0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, vs[vtail0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), vs[vtail0].next ∈ vs, vs[vtail0].next ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ r0 ∈ rl0, ¬ r0 ∈ orl, ¬ vs[vtail0].next ∈ rl2, ¬ vs[vtail0].next ∈ rl1, ¬ vs[vtail0].next ∈ orl, ¬ vs[vtail0].next ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None, r ∈ orl ∨ r = r0 ∨ r ∈ rl0 ∨ r = vtail0 ⊦
Used simplifier rules: ⊦ mk(val, opttid, nxt).val = val; (s) ⊦ a = b → st[b, d][a] = d; (s)
| orl + r0 ' + rl0 + vtail0 ' = rl1 + vtail0 ' + rl2, ps[r0].deqID = None, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, owns(vs[vtail0].next) = Some(tid), vs[vtail0].next ≠ null, vs[vtail0].next ≠ vtail0, vs[vtail0].next ≠ r0, orl ≠ [], r ≠ vs[vtail0].next, r0 ≠ vtail0, tid ≠ tid0, value ≠ vs[vs[vtail0].next].val, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl1 + vtail0 ' + rl2, vs, ps, owns), listp(vtail0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vtail0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vtail0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, vs[vtail0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), vs[vtail0].next ∈ vs, vs[vtail0].next ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ r0 ∈ rl0, ¬ r0 ∈ orl, ¬ vs[vtail0].next ∈ rl2, ¬ vs[vtail0].next ∈ rl1, ¬ vs[vtail0].next ∈ orl, ¬ vs[vtail0].next ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None, r ∈ orl ∨ r = r0 ∨ r ∈ rl0 ∨ r = vtail0 ⊦ |
y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last
orl + r0 ' + rl0 = (rl1 + vtail0 ' + rl2).butlast, ps[vtail0].deqID = None, ps[r0].deqID = None, dom vrvHp = dom prvHp, owns(vs[vtail0].next) = Some(tid), vtail0 = (rl1 + vtail0 ' + rl2).last, rl1 + vtail0 ' + rl2 ≠ [], vs[vtail0].next ≠ null, vs[vtail0].next ≠ vtail0, vs[vtail0].next ≠ r0, orl ≠ [], r ≠ vs[vtail0].next, r0 ≠ vtail0, tid ≠ tid0, value ≠ vs[vs[vtail0].next].val, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vtail0 ' + rl2, vs, ps, owns), listp(rl1 + vtail0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vtail0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vtail0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, vs[vtail0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, vs[vtail0].next ∈ ps, vs[vtail0].next ∈ vs, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ r0 ∈ rl0, ¬ r0 ∈ orl, ¬ vs[vtail0].next ∈ rl2, ¬ vs[vtail0].next ∈ rl1, ¬ vs[vtail0].next ∈ orl, ¬ vs[vtail0].next ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ orl ∨ r = r0 ∨ r ∈ rl0 ∨ r = vtail0, orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None ⊦
Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: orl + r0 ' + rl0, vtail0, rl1 + vtail0 ' + rl2
| y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last |
| orl + r0 ' + rl0 = (rl1 + vtail0 ' + rl2).butlast, ps[vtail0].deqID = None, ps[r0].deqID = None, dom vrvHp = dom prvHp, owns(vs[vtail0].next) = Some(tid), vtail0 = (rl1 + vtail0 ' + rl2).last, rl1 + vtail0 ' + rl2 ≠ [], vs[vtail0].next ≠ null, vs[vtail0].next ≠ vtail0, vs[vtail0].next ≠ r0, orl ≠ [], r ≠ vs[vtail0].next, r0 ≠ vtail0, tid ≠ tid0, value ≠ vs[vs[vtail0].next].val, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vtail0 ' + rl2, vs, ps, owns), listp(rl1 + vtail0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vtail0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vtail0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, vs[vtail0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, vs[vtail0].next ∈ ps, vs[vtail0].next ∈ vs, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ r0 ∈ rl0, ¬ r0 ∈ orl, ¬ vs[vtail0].next ∈ rl2, ¬ vs[vtail0].next ∈ rl1, ¬ vs[vtail0].next ∈ orl, ¬ vs[vtail0].next ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ orl ∨ r = r0 ∨ r ∈ rl0 ∨ r = vtail0, orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None ⊦ |
orl + r0 ' + rl0 = rl1 + (vtail0 ' + rl2).butlast, ps[r0].deqID = None, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, owns(vs[vtail0].next) = Some(tid), vtail0 = (vtail0 ' + rl2).last, vs[vtail0].next ≠ null, vs[vtail0].next ≠ vtail0, vs[vtail0].next ≠ r0, orl ≠ [], r ≠ vs[vtail0].next, r0 ≠ vtail0, tid ≠ tid0, value ≠ vs[vs[vtail0].next].val, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl1 + vtail0 ' + rl2, vs, ps, owns), listp(vtail0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vtail0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vtail0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, vs[vtail0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), vs[vtail0].next ∈ vs, vs[vtail0].next ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ r0 ∈ rl0, ¬ r0 ∈ orl, ¬ vs[vtail0].next ∈ rl2, ¬ vs[vtail0].next ∈ rl1, ¬ vs[vtail0].next ∈ orl, ¬ vs[vtail0].next ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None, r ∈ orl ∨ r = r0 ∨ r ∈ rl0 ∨ r = vtail0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + a ' + y ≠ []; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s)
| orl + r0 ' + rl0 = rl1 + (vtail0 ' + rl2).butlast, ps[r0].deqID = None, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, owns(vs[vtail0].next) = Some(tid), vtail0 = (vtail0 ' + rl2).last, vs[vtail0].next ≠ null, vs[vtail0].next ≠ vtail0, vs[vtail0].next ≠ r0, orl ≠ [], r ≠ vs[vtail0].next, r0 ≠ vtail0, tid ≠ tid0, value ≠ vs[vs[vtail0].next].val, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl1 + vtail0 ' + rl2, vs, ps, owns), listp(vtail0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vtail0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vtail0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, vs[vtail0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), vs[vtail0].next ∈ vs, vs[vtail0].next ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ r0 ∈ rl0, ¬ r0 ∈ orl, ¬ vs[vtail0].next ∈ rl2, ¬ vs[vtail0].next ∈ rl1, ¬ vs[vtail0].next ∈ orl, ¬ vs[vtail0].next ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vtail0].deqID = None, r ∈ orl ∨ r = r0 ∨ r ∈ rl0 ∨ r = vtail0 ⊦ |
⊦ y ≠ [] → (x + y).butlast = x + y.butlast
Used simplifier rules: ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ ¬ a ∈ y ∧ ¬ a ∈ z ∧ a ≠ c → y + c ' + z ≠ y1 + a ' + x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) ⊦ a '.butlast = []; (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) ⊦ ¬ weak?(Some(tid)); (s) Used terms: vtail0 ', rl2
| ⊦ y ≠ [] → (x + y).butlast = x + y.butlast |
| 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 ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ equalowns(vs, ps, owns, tid0, vs[node, mk(value, None, null)], ps, owns), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ 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))
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), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r. ¬ ( r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None) → r ∈ vs[node, mk(value, None, null)] ∧ r ∈ ps ∧ vs[node, mk(value, None, null)][r] = vs[r] ∧ (ps[r].next = ps[r].next ∨ ps[r].next = vs[r].next) ∧ (ps[r].val = ps[r].val ∨ ps[r].val = vs[r].val) ∧ (ps[r].deqID = ps[r].deqID ∨ ps[r].deqID = vs[r].deqID) ∧ owns(r) = owns(r)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used terms: ps, ps, tid0, owns, vs[node, mk(value, None, null)], owns, 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)) |
| 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), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r. ¬ ( r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None) → r ∈ vs[node, mk(value, None, null)] ∧ r ∈ ps ∧ vs[node, mk(value, None, null)][r] = vs[r] ∧ (ps[r].next = ps[r].next ∨ ps[r].next = vs[r].next) ∧ (ps[r].val = ps[r].val ∨ ps[r].val = vs[r].val) ∧ (ps[r].deqID = ps[r].deqID ∨ ps[r].deqID = vs[r].deqID) ∧ owns(r) = owns(r)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[node, mk(value, None, null)][r] ≠ vs[r], 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), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ vs[node, mk(value, None, null)], ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None ⊦
Used simplifier rules: ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws)
| dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[node, mk(value, None, null)][r] ≠ vs[r], 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), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ vs[node, mk(value, None, null)], ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ a ∈ st[a, d]; (s) ⊦ Some(tid) = Some(tid0) ↔ tid = tid0; (s) ⊦ Some(tid) ≠ Weak(tid0); (s) Used terms: vs, node, mk(value, None, null), r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| 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 ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noidRely(tid0, orl + qrl, vs, orl + qrl, vs[node, mk(value, None, null)]), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ noidRely(tid, rl, vs, rl0, vs0) ↔ (∀ r. noid(tid, rl, r, vs) → noid(tid, rl0, r, vs0))
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), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r. ¬(noid(tid0, orl + qrl, r, vs) → noid(tid0, orl + qrl, r, vs[node, mk(value, None, null)])), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used terms: orl + qrl, tid0, vs[node, mk(value, None, null)], orl + qrl, vs
| ⊦ noidRely(tid, rl, vs, rl0, vs0) ↔ (∀ r. noid(tid, rl, r, vs) → noid(tid, rl0, r, vs0)) |
| 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), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r. ¬(noid(tid0, orl + qrl, r, vs) → noid(tid0, orl + qrl, r, vs[node, mk(value, None, null)])), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
vs[node, mk(value, None, null)][r0].deqID = Some(tid0), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[r0].deqID ≠ Some(tid0), node ≠ null, orl ≠ [], r0 ≠ r, 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(tid0, orl + qrl, r, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, r0 ∈ orl + qrl from r, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ 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)
| vs[node, mk(value, None, null)][r0].deqID = Some(tid0), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[r0].deqID ≠ Some(tid0), node ≠ null, orl ≠ [], r0 ≠ r, 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(tid0, orl + qrl, r, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, r0 ∈ orl + qrl from r, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ mk(val, opttid, nxt).deqID = opttid; (s) ⊦ None ≠ Some(tid); (s) Used terms: vs, node, mk(value, None, null), r0
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| 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 ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ nextnottidRely(tid0, vhead, vs, vhead, vs[node, mk(value, None, null)]), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ nextnottidRely(tid, vhead, vs, vhead0, vs0) ↔ nextnottid(tid, vhead, vs) → nextnottid(tid, vhead0, vs0)
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(tid0, vhead, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ nextnottid(tid0, vhead, vs[node, mk(value, None, null)]), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used terms: vhead, vhead, tid0, vs[node, mk(value, None, null)], vs
| ⊦ nextnottidRely(tid, vhead, vs, vhead0, vs0) ↔ nextnottid(tid, vhead, vs) → nextnottid(tid, vhead0, vs0) |
| 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(tid0, vhead, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ nextnottid(tid0, vhead, vs[node, mk(value, None, null)]), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid)
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 ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ nextnottid(tid0, vhead, vs[node, mk(value, None, null)]), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid0), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used terms: tid0, vhead, vs
| ⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid) |
| 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 ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ nextnottid(tid0, vhead, vs[node, mk(value, None, null)]), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid0), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid)
vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID = Some(tid0), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[node, mk(value, None, null)][vhead].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), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used terms: tid0, vhead, vs[node, mk(value, None, null)]
| ⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid) |
| vs[node, mk(value, None, null)][vs[node, mk(value, None, null)][vhead].next].deqID = Some(tid0), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[node, mk(value, None, null)][vhead].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), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
vs[node, mk(value, None, null)][vs[vhead].next].deqID = Some(tid0), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead].next ≠ null, node ≠ null, orl ≠ [], tid ≠ tid0, vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[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[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid0), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ a ≠ b → st[b, d][a] = st[a]; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ mk(val, opttid, nxt).next = nxt; (s) Used terms: vs, node, mk(value, None, null), vhead
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| vs[node, mk(value, None, null)][vs[vhead].next].deqID = Some(tid0), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead].next ≠ null, node ≠ null, orl ≠ [], tid ≠ tid0, vhead ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[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[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid0), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[node, mk(value, None, null)][vs[vhead].next].deqID = Some(tid0), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vs[vhead].next].deqID ≠ Some(tid0), vs[vhead].next ≠ null, node ≠ null, orl ≠ [], tid ≠ tid0, vhead ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
| vs[node, mk(value, None, null)][vs[vhead].next].deqID = Some(tid0), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vs[vhead].next].deqID ≠ Some(tid0), vs[vhead].next ≠ null, node ≠ null, orl ≠ [], tid ≠ tid0, vhead ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ mk(val, opttid, nxt).deqID = opttid; (s) ⊦ None ≠ Some(tid); (s) Used terms: vs, node, mk(value, None, null), vs[vhead].next
| ⊦ a ≠ b → st[b, d][a] = st[a] |
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.