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