| ⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ noowns(ls.tid, gs0.owns) |
gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid), dom gs.vrvHp = dom gs.prvHp, dom gs0.vrvHp = dom gs0.prvHp, gs0.orl ≠ [], gs.orl ≠ [], allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nextnottid(ls.tid, gs.vhead, gs.vs), nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), noowns(ls.tid, gs.owns), ownsRely(ls.tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs.qrl, gs.ps), unmarkedp(gs0.qrl, gs0.ps), gs.phead ∈ gs.orl, gs0.phead ∈ gs0.orl, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ dups(gs0.orl + gs0.qrl), ¬ 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), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, ∃ rl0. gs.orl + rl0 = gs0.orl, 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, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid) ⊦ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ noowns(ls.tid, gs0.owns)
| gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid), dom gs.vrvHp = dom gs.prvHp, dom gs0.vrvHp = dom gs0.prvHp, gs0.orl ≠ [], gs.orl ≠ [], allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nextnottid(ls.tid, gs.vhead, gs.vs), nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), noowns(ls.tid, gs.owns), ownsRely(ls.tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs.qrl, gs.ps), unmarkedp(gs0.qrl, gs0.ps), gs.phead ∈ gs.orl, gs0.phead ∈ gs0.orl, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ dups(gs0.orl + gs0.qrl), ¬ 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), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, ∃ rl0. gs.orl + rl0 = gs0.orl, 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, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid) ⊦ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ noowns(ls.tid, gs0.owns) |
gs.orl + rl0 = gs0.orl, gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid), dom gs0.vrvHp = dom gs0.prvHp, dom gs.vrvHp = dom gs.prvHp, gs0.orl ≠ [], gs.orl ≠ [], allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nextnottid(ls.tid, gs.vhead, gs.vs), nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), ownsRely(ls.tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), unmarkedp(gs.qrl, gs.ps), gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl, gs.phead ∈ gs.orl, gs0.phead ∈ gs0.vs, gs0.phead ∈ gs0.ps, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, dom gs.prvHp ⊆ dom gs0.prvHp, ¬ dups(gs0.orl + gs0.qrl), ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ dups(gs0.orl), ¬ dups(gs0.qrl), ¬ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), 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.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs0.vretRefs(ls.tid) = gs0.pretRefs(ls.tid), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.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), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[gs0.qrl.last].next = null, 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 ⊦
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 ⊦ noowns(tid, owns) ∧ ownsRely(tid, owns, owns0) → noowns(tid, owns0); (ss) ⊦ nextnottidRely(tid, vhead, vs, vhead0, vs0) ∧ nextnottid(tid, vhead, vs) → nextnottid(tid, vhead0, vs0); (ss) ⊦ y ≠ [] → (x + y).last = y.last; (s)
| gs.orl + rl0 = gs0.orl, gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid), dom gs0.vrvHp = dom gs0.prvHp, dom gs.vrvHp = dom gs.prvHp, gs0.orl ≠ [], gs.orl ≠ [], allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nextnottid(ls.tid, gs.vhead, gs.vs), nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), ownsRely(ls.tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), unmarkedp(gs.qrl, gs.ps), gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl, gs.phead ∈ gs.orl, gs0.phead ∈ gs0.vs, gs0.phead ∈ gs0.ps, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, dom gs.prvHp ⊆ dom gs0.prvHp, ¬ dups(gs0.orl + gs0.qrl), ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ dups(gs0.orl), ¬ dups(gs0.qrl), ¬ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), 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.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs0.vretRefs(ls.tid) = gs0.pretRefs(ls.tid), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.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), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[gs0.qrl.last].next = null, 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 ⊦ |
orl + qrl + rl = gs0.orl + gs0.qrl, orl + rl0 = gs0.orl, dom vrvHp = dom prvHp, dom gs0.vrvHp = dom gs0.prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), vretRefs(ls.tid) = gs0.vretRefs(ls.tid), gs0.orl ≠ [], orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(vs, ps, owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(orl + qrl, vs, ps, gs0.vs, gs0.ps), listp(orl + qrl, vs, ps, owns), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(orl, ps), markedp(orl, vs), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nextnottid(ls.tid, vhead, vs), nextnottidRely(ls.tid, vhead, vs, gs0.vhead, gs0.vs), noid(ls.tid, orl + qrl, vhead, vs), noidRely(ls.tid, orl + qrl, vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), noowns(ls.tid, owns), ownsRely(ls.tid, owns, gs0.owns), prvHpRely(vrvHp, prvHp, gs0.prvHp), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(ls.tid, rvowns, gs0.rvowns, vrvHp), rvrely(ls.tid, rvowns, vretRefs, vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(qrl, ps), unmarkedp(gs0.qrl, gs0.ps), phead ∈ ps, phead ∈ vs, gs0.phead ∈ gs0.ps, gs0.phead ∈ gs0.vs, phead ∈ orl, gs0.phead ∈ gs0.orl, gs0.vtail ∈ gs0.orl + gs0.qrl from vtail, gs0.phead ∈ gs0.orl + gs0.qrl from phead, gs0.vhead ∈ gs0.orl + gs0.qrl from vhead, dom prvHp ⊆ dom gs0.prvHp, ¬ dups(gs0.orl + gs0.qrl), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ dups(gs0.orl), ¬ dups(gs0.qrl), ¬ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.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), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[gs0.qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs0.vretRefs(ls.tid) = gs0.pretRefs(ls.tid) ⊦
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
| orl + qrl + rl = gs0.orl + gs0.qrl, orl + rl0 = gs0.orl, dom vrvHp = dom prvHp, dom gs0.vrvHp = dom gs0.prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), vretRefs(ls.tid) = gs0.vretRefs(ls.tid), gs0.orl ≠ [], orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(vs, ps, owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(orl + qrl, vs, ps, gs0.vs, gs0.ps), listp(orl + qrl, vs, ps, owns), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(orl, ps), markedp(orl, vs), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nextnottid(ls.tid, vhead, vs), nextnottidRely(ls.tid, vhead, vs, gs0.vhead, gs0.vs), noid(ls.tid, orl + qrl, vhead, vs), noidRely(ls.tid, orl + qrl, vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), noowns(ls.tid, owns), ownsRely(ls.tid, owns, gs0.owns), prvHpRely(vrvHp, prvHp, gs0.prvHp), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(ls.tid, rvowns, gs0.rvowns, vrvHp), rvrely(ls.tid, rvowns, vretRefs, vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(qrl, ps), unmarkedp(gs0.qrl, gs0.ps), phead ∈ ps, phead ∈ vs, gs0.phead ∈ gs0.ps, gs0.phead ∈ gs0.vs, phead ∈ orl, gs0.phead ∈ gs0.orl, gs0.vtail ∈ gs0.orl + gs0.qrl from vtail, gs0.phead ∈ gs0.orl + gs0.qrl from phead, gs0.vhead ∈ gs0.orl + gs0.qrl from vhead, dom prvHp ⊆ dom gs0.prvHp, ¬ dups(gs0.orl + gs0.qrl), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ dups(gs0.orl), ¬ dups(gs0.qrl), ¬ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.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), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[gs0.qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs0.vretRefs(ls.tid) = gs0.pretRefs(ls.tid) ⊦ |
orl + rl0 = gs0.orl, qrl + rl = rl0 + gs0.qrl, dom vrvHp = dom prvHp, dom gs0.vrvHp = dom gs0.prvHp, vretRefs(ls.tid) = gs0.vretRefs(ls.tid), orl + rl0 ≠ [], orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(vs, ps, owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(orl + qrl, vs, ps, gs0.vs, gs0.ps), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(orl, ps), markedp(orl, vs), markedp(orl, gs0.ps), markedp(rl0, gs0.ps), markedp(orl, gs0.vs), markedp(rl0, gs0.vs), nextnottid(ls.tid, vhead, vs), nextnottidRely(ls.tid, vhead, vs, gs0.vhead, gs0.vs), noid(ls.tid, orl + qrl, vhead, vs), noidRely(ls.tid, orl + qrl, vs, (orl + rl0) + gs0.qrl, gs0.vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), noowns(ls.tid, owns), ownsRely(ls.tid, owns, gs0.owns), prvHpRely(vrvHp, prvHp, gs0.prvHp), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(ls.tid, rvowns, gs0.rvowns, vrvHp), rvrely(ls.tid, rvowns, vretRefs, vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(qrl, ps), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.ps, gs0.phead ∈ gs0.vs, phead ∈ orl, gs0.vtail ∈ (orl + rl0) + gs0.qrl from vtail, gs0.vhead ∈ (orl + rl0) + gs0.qrl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ gs0.ps, phead ∈ gs0.vs, dom prvHp ⊆ dom gs0.prvHp, ¬ dups(gs0.qrl), ¬ dups(orl + rl0), ¬ dups(qrl + rl), ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + gs0.qrl), ¬ dups(qrl), ¬ dups(rl), ¬ noid(ls.tid, (orl + rl0) + gs0.qrl, gs0.vhead, gs0.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), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, gs0.vtail = ((orl + rl0) + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = ((orl + rl0) + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[gs0.qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = gs0.vhead ∧ gs0.phead ≠ (orl + rl0).last ∧ unmarkedp(gs0.qrl, gs0.vs), pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs0.vretRefs(ls.tid) = gs0.pretRefs(ls.tid), gs0.phead ∈ orl ∨ gs0.phead ∈ rl0, gs0.phead ∈ orl from phead ∨ gs0.phead ∈ rl0 ∨ gs0.phead ∈ gs0.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] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) 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
| orl + rl0 = gs0.orl, qrl + rl = rl0 + gs0.qrl, dom vrvHp = dom prvHp, dom gs0.vrvHp = dom gs0.prvHp, vretRefs(ls.tid) = gs0.vretRefs(ls.tid), orl + rl0 ≠ [], orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(vs, ps, owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(orl + qrl, vs, ps, gs0.vs, gs0.ps), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(orl, ps), markedp(orl, vs), markedp(orl, gs0.ps), markedp(rl0, gs0.ps), markedp(orl, gs0.vs), markedp(rl0, gs0.vs), nextnottid(ls.tid, vhead, vs), nextnottidRely(ls.tid, vhead, vs, gs0.vhead, gs0.vs), noid(ls.tid, orl + qrl, vhead, vs), noidRely(ls.tid, orl + qrl, vs, (orl + rl0) + gs0.qrl, gs0.vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), noowns(ls.tid, owns), ownsRely(ls.tid, owns, gs0.owns), prvHpRely(vrvHp, prvHp, gs0.prvHp), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(ls.tid, rvowns, gs0.rvowns, vrvHp), rvrely(ls.tid, rvowns, vretRefs, vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(qrl, ps), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.ps, gs0.phead ∈ gs0.vs, phead ∈ orl, gs0.vtail ∈ (orl + rl0) + gs0.qrl from vtail, gs0.vhead ∈ (orl + rl0) + gs0.qrl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ gs0.ps, phead ∈ gs0.vs, dom prvHp ⊆ dom gs0.prvHp, ¬ dups(gs0.qrl), ¬ dups(orl + rl0), ¬ dups(qrl + rl), ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + gs0.qrl), ¬ dups(qrl), ¬ dups(rl), ¬ noid(ls.tid, (orl + rl0) + gs0.qrl, gs0.vhead, gs0.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), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, gs0.vtail = ((orl + rl0) + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = ((orl + rl0) + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[gs0.qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = gs0.vhead ∧ gs0.phead ≠ (orl + rl0).last ∧ unmarkedp(gs0.qrl, gs0.vs), pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs0.vretRefs(ls.tid) = gs0.pretRefs(ls.tid), gs0.phead ∈ orl ∨ gs0.phead ∈ rl0, gs0.phead ∈ orl from phead ∨ gs0.phead ∈ rl0 ∨ gs0.phead ∈ gs0.qrl ⊦ |
qrl + rl = rl0 + qrl0, orl + rl0 = orl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, gs0 = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), vretRefs(ls.tid) = vretRefs0(ls.tid), orl + rl0 ≠ [], orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, ls.tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), nextnottidRely(ls.tid, vhead, vs, vhead0, vs0), noid(ls.tid, orl + qrl, vhead, vs), noidRely(ls.tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), ownsRely(ls.tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(ls.tid, rvowns, rvowns0, vrvHp), rvrely(ls.tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ vs0, phead ∈ ps0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(qrl + rl), ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ noid(ls.tid, (orl + rl0) + qrl0, vhead0, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(ls.tid) = pretRefs0(ls.tid) ∨ vretRefs0(ls.tid) = pretRefs0(ls.tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ((ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns); (elim) Used terms: qrl0, ps0, phead0, vrvHp0, vretRefs0, vhead0, vtail0, gs0, owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0
| qrl + rl = rl0 + qrl0, orl + rl0 = orl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, gs0 = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), vretRefs(ls.tid) = vretRefs0(ls.tid), orl + rl0 ≠ [], orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, ls.tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), nextnottidRely(ls.tid, vhead, vs, vhead0, vs0), noid(ls.tid, orl + qrl, vhead, vs), noidRely(ls.tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), ownsRely(ls.tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(ls.tid, rvowns, rvowns0, vrvHp), rvrely(ls.tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ vs0, phead ∈ ps0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(qrl + rl), ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ noid(ls.tid, (orl + rl0) + qrl0, vhead0, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(ls.tid) = pretRefs0(ls.tid) ∨ vretRefs0(ls.tid) = pretRefs0(ls.tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
qrl + rl = rl0 + qrl0, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(ls.tid) = vretRefs0(ls.tid), orl + rl0 ≠ [], orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, ls.tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(ls.tid, vhead, vs), nextnottidRely(ls.tid, vhead, vs, vhead0, vs0), noid(ls.tid, orl + qrl, vhead, vs), noidRely(ls.tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(ls.tid, owns), ownsRely(ls.tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(ls.tid, rvowns, rvowns0, vrvHp), rvrely(ls.tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(ls.tid, (orl + rl0) + qrl0, vhead0, vs0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(ls.tid) = pretRefs0(ls.tid) ∨ vretRefs0(ls.tid) = pretRefs0(ls.tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦
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
| qrl + rl = rl0 + qrl0, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(ls.tid) = vretRefs0(ls.tid), orl + rl0 ≠ [], orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, ls.tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(ls.tid, vhead, vs), nextnottidRely(ls.tid, vhead, vs, vhead0, vs0), noid(ls.tid, orl + qrl, vhead, vs), noidRely(ls.tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(ls.tid, owns), ownsRely(ls.tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(ls.tid, rvowns, rvowns0, vrvHp), rvrely(ls.tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(ls.tid, (orl + rl0) + qrl0, vhead0, vs0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(ls.tid) = pretRefs0(ls.tid) ∨ vretRefs0(ls.tid) = pretRefs0(ls.tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ |
qrl + rl = rl0 + qrl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ( (tid = ls.tid ∧ value = ls.value) ∧ optval = ls.optval) ∧ node = ls.node) ∧ nd = ls.nd) ∧ (success ↔ ls.success)) ∧ lst = ls.lst) ∧ nxt = ls.nxt) ∧ rvref = ls.rvref) ∧ optval0 = ls.optval0) ∧ first = ls.first) ∧ othertid = ls.othertid) ∧ addr = ls.addr ↔ ls = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr); (elim) Used terms: value, nxt, optval, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval
| qrl + rl = rl0 + qrl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
qrl + rl = rl0 + qrl0, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦
| qrl + rl = rl0 + qrl0, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ |
⊦ noidRely(tid, orl + qrl, vs, orl + rl0 + qrl0, vs0) ∧ noid(tid, orl + qrl, first, vs) → noid(tid, orl + rl0 + qrl0, first, vs0)
qrl + rl = rl0 + qrl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ noidRely(tid, orl + qrl, vs, orl + rl0 + qrl0, vs0) ∧ noid(tid, orl + qrl, vhead0, vs)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: qrl, tid, vhead0, qrl0, orl, vs0, rl0, vs
| ⊦ noidRely(tid, orl + qrl, vs, orl + rl0 + qrl0, vs0) ∧ noid(tid, orl + qrl, first, vs) → noid(tid, orl + rl0 + qrl0, first, vs0) |
| qrl + rl = rl0 + qrl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ noidRely(tid, orl + qrl, vs, orl + rl0 + qrl0, vs0) ∧ noid(tid, orl + qrl, vhead0, vs) |
qrl + rl = rl0 + qrl0, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), ¬ noid(tid, orl + qrl, vhead0, 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]
| qrl + rl = rl0 + qrl0, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), ¬ noid(tid, orl + qrl, vhead0, 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ |
⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid))
qrl + rl = rl0 + qrl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r0. ¬(r0 ≠ vhead0 ∧ r0 ∈ orl + qrl from vhead0 → vs[r0].deqID ≠ Some(tid)), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used terms: tid, orl + qrl, vhead0, vs
| ⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) |
| qrl + rl = rl0 + qrl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r0. ¬(r0 ≠ vhead0 ∧ r0 ∈ orl + qrl from vhead0 → vs[r0].deqID ≠ Some(tid)), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
qrl + rl = rl0 + qrl0, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), r0 ∈ orl + qrl from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦
| qrl + rl = rl0 + qrl0, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), r0 ∈ orl + qrl from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ |
⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid))
qrl + rl = rl0 + qrl0, vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl + qrl from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead → vs[r0].deqID ≠ Some(tid), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used terms: tid, orl + qrl, vhead, vs
| ⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) |
| qrl + rl = rl0 + qrl0, vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl + qrl from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead → vs[r0].deqID ≠ Some(tid), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
qrl + rl = rl0 + qrl0, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), r0 ∈ orl + qrl from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead → vs[r0].deqID ≠ Some(tid), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦
Used terms: r0
| qrl + rl = rl0 + qrl0, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), r0 ∈ orl + qrl from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead → vs[r0].deqID ≠ Some(tid), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ |
qrl + rl = rl0 + qrl0, vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl + qrl from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead
| qrl + rl = rl0 + qrl0, vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl + qrl from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead |
⊦ y ≠ [] → (x + y).last = y.last
qrl + rl = rl0 + qrl0, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, rl0 = [], vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), r0 ∈ orl + qrl from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead
qrl + rl = rl0 + qrl0, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], r0 ≠ vhead0, rl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), r0 ∈ orl + qrl from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), rl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ rl0.last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead
Used terms: orl, rl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| qrl + rl = rl0 + qrl0, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, rl0 = [], vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), r0 ∈ orl + qrl from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead |
vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp(orl + qrl + rl, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, orl + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), r0 ∈ orl + qrl from vhead0, phead ∈ orl, vtail0 ∈ orl + qrl + rl from vtail, vhead0 ∈ orl + qrl + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ orl, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(orl + qrl + rl), ¬ dups(orl), ¬ dups(qrl + rl), ¬ dups(orl + qrl), ¬ dups(rl), ¬ noid(tid, orl + qrl + rl, vhead0, vs0), ¬ phead0 ∈ 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), orl.last = vhead0 ∧ (qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl, vs0) ∧ unmarkedp(rl, vs0), vtail0 = (orl + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (orl + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, phead0 ∈ rl ∨ phead0 ∈ orl from phead ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ x ∧ a ∈ y → dups(x + y); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) 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 ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)
| vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp(orl + qrl + rl, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, orl + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), r0 ∈ orl + qrl from vhead0, phead ∈ orl, vtail0 ∈ orl + qrl + rl from vtail, vhead0 ∈ orl + qrl + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ orl, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(orl + qrl + rl), ¬ dups(orl), ¬ dups(qrl + rl), ¬ dups(orl + qrl), ¬ dups(rl), ¬ noid(tid, orl + qrl + rl, vhead0, vs0), ¬ phead0 ∈ 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), orl.last = vhead0 ∧ (qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl, vs0) ∧ unmarkedp(rl, vs0), vtail0 = (orl + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (orl + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, phead0 ∈ rl ∨ phead0 ∈ orl from phead ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead |
vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, orl = rl0 + vtail1 ', vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl + rl, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, orl + qrl + rl, vs0), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), phead0 ∈ orl, phead0 ∈ vs, phead0 ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ orl + qrl + rl from vhead, vtail0 ∈ orl + qrl + rl from vtail, phead ∈ orl, r0 ∈ orl + qrl from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(orl + qrl + rl), ¬ dups(orl), ¬ dups(qrl + rl), ¬ dups(orl + qrl), ¬ dups(rl), ¬ noid(tid, orl + qrl + rl, vhead0, vs0), ¬ phead0 ∈ qrl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ rl ∨ phead0 ∈ orl from phead, vtail0 = (orl + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (orl + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail1 = vhead0 ∧ (qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0)) ∨ rl0 ≠ [] ∧ rl0.last = vhead0 ∧ phead0 ≠ vtail1 ∧ unmarkedp(qrl, vs0) ∧ unmarkedp(rl, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vtail1 ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, vtail1, y
| vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, orl = rl0 + vtail1 ', vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl + rl, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, orl + qrl + rl, vs0), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), phead0 ∈ orl, phead0 ∈ vs, phead0 ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ orl + qrl + rl from vhead, vtail0 ∈ orl + qrl + rl from vtail, phead ∈ orl, r0 ∈ orl + qrl from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(orl + qrl + rl), ¬ dups(orl), ¬ dups(qrl + rl), ¬ dups(orl + qrl), ¬ dups(rl), ¬ noid(tid, orl + qrl + rl, vhead0, vs0), ¬ phead0 ∈ qrl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ rl ∨ phead0 ∈ orl from phead, vtail0 = (orl + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (orl + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail1 = vhead0 ∧ (qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0)) ∨ rl0 ≠ [] ∧ rl0.last = vhead0 ∧ phead0 ≠ vtail1 ∧ unmarkedp(qrl, vs0) ∧ unmarkedp(rl, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vtail1 ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead |
vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl0 + vtail1 ') + qrl, vs, ps, vs0, ps0), listp((rl0 + vtail1 ') + qrl, vs, ps, owns), listp((rl0 + vtail1 ') + qrl + rl, vs0, ps0, owns0), markedp(rl0, ps), markedp(rl0, vs), markedp(rl0, ps0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl0 + vtail1 ') + qrl, vs, (rl0 + vtail1 ') + qrl + rl, vs0), nonullRetRefs((rl0 + vtail1 ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl0 + vtail1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), r0 ∈ (rl0 + vtail1 ') + qrl from vhead0, vtail0 ∈ (rl0 + vtail1 ') + qrl + rl from vtail, vhead0 ∈ (rl0 + vtail1 ') + qrl + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps, phead0 ∈ vs, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0 + qrl + rl), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl + rl), ¬ dups(rl0 + qrl), ¬ dups(rl), ¬ noid(tid, (rl0 + vtail1 ') + qrl + rl, vhead0, vs0), ¬ phead0 ∈ qrl, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vtail1 ∧ unmarkedp(qrl, vs), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail1 = vhead0 ∧ (qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0)) ∨ rl0 ≠ [] ∧ rl0.last = vhead0 ∧ phead0 ≠ vtail1 ∧ unmarkedp(qrl, vs0) ∧ unmarkedp(rl, vs0), phead0 ∈ rl ∨ phead0 ∈ rl0 + vtail1 ' from phead, phead ∈ rl0 ∨ phead = vtail1, phead0 ∈ rl0 ∨ phead0 = vtail1, vtail = (vtail1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vtail1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vtail1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ (rl0 + vtail1 ') + qrl from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (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) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ x + a ' ≠ []; (s)
| vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl0 + vtail1 ') + qrl, vs, ps, vs0, ps0), listp((rl0 + vtail1 ') + qrl, vs, ps, owns), listp((rl0 + vtail1 ') + qrl + rl, vs0, ps0, owns0), markedp(rl0, ps), markedp(rl0, vs), markedp(rl0, ps0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl0 + vtail1 ') + qrl, vs, (rl0 + vtail1 ') + qrl + rl, vs0), nonullRetRefs((rl0 + vtail1 ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl0 + vtail1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), r0 ∈ (rl0 + vtail1 ') + qrl from vhead0, vtail0 ∈ (rl0 + vtail1 ') + qrl + rl from vtail, vhead0 ∈ (rl0 + vtail1 ') + qrl + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps, phead0 ∈ vs, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0 + qrl + rl), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl + rl), ¬ dups(rl0 + qrl), ¬ dups(rl), ¬ noid(tid, (rl0 + vtail1 ') + qrl + rl, vhead0, vs0), ¬ phead0 ∈ qrl, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vtail1 ∧ unmarkedp(qrl, vs), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail1 = vhead0 ∧ (qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0)) ∨ rl0 ≠ [] ∧ rl0.last = vhead0 ∧ phead0 ≠ vtail1 ∧ unmarkedp(qrl, vs0) ∧ unmarkedp(rl, vs0), phead0 ∈ rl ∨ phead0 ∈ rl0 + vtail1 ' from phead, phead ∈ rl0 ∨ phead = vtail1, phead0 ∈ rl0 ∨ phead0 = vtail1, vtail = (vtail1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vtail1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vtail1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ (rl0 + vtail1 ') + qrl from vhead |
vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), vtail1 = vhead0, r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl0 + vtail1 ') + qrl, vs, ps, vs0, ps0), listp((rl0 + vtail1 ') + qrl + rl, vs0, ps0, owns0), listp((rl0 + vtail1 ') + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(rl0, ps0), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl0 + vtail1 ') + qrl, vs, (rl0 + vtail1 ') + qrl + rl, vs0), nonullRetRefs((rl0 + vtail1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl0 + vtail1 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps[vtail1].deqID), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), phead0 ∈ vs, phead0 ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (rl0 + vtail1 ') + qrl + rl from vhead, vtail0 ∈ (rl0 + vtail1 ') + qrl + rl from vtail, r0 ∈ (rl0 + vtail1 ') + qrl from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0 + qrl + rl), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl + rl), ¬ dups(rl0 + qrl), ¬ dups(rl), ¬ noid(tid, (rl0 + vtail1 ') + qrl + rl, vhead0, vs0), ¬ phead0 ∈ qrl, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), vtail0 = (vtail1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vtail1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (vtail1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl0 ∨ phead0 = vtail1, phead ∈ rl0 ∨ phead = vtail1, phead0 ∈ rl ∨ phead0 ∈ rl0 + vtail1 ' from phead, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vtail1 ∧ unmarkedp(qrl, vs) ⊦ r0 ≠ vhead ∧ r0 ∈ (rl0 + vtail1 ') + qrl from vhead
vs[r0].deqID = Some(tid), rl0.last = vhead0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), phead0 ≠ vtail1, r0 ≠ vhead0, rl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl0 + vtail1 ') + qrl, vs, ps, vs0, ps0), listp((rl0 + vtail1 ') + qrl + rl, vs0, ps0, owns0), listp((rl0 + vtail1 ') + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(rl0, ps0), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl0 + vtail1 ') + qrl, vs, (rl0 + vtail1 ') + qrl + rl, vs0), nonullRetRefs((rl0 + vtail1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl0 + vtail1 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps[vtail1].deqID), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), unmarkedp(qrl, vs0), unmarkedp(rl, vs0), phead0 ∈ vs, phead0 ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (rl0 + vtail1 ') + qrl + rl from vhead, vtail0 ∈ (rl0 + vtail1 ') + qrl + rl from vtail, r0 ∈ (rl0 + vtail1 ') + qrl from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0 + qrl + rl), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl + rl), ¬ dups(rl0 + qrl), ¬ dups(rl), ¬ noid(tid, (rl0 + vtail1 ') + qrl + rl, vhead0, vs0), ¬ phead0 ∈ qrl, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail0 = (vtail1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vtail1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (vtail1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl0 ∨ phead0 = vtail1, phead ∈ rl0 ∨ phead = vtail1, phead0 ∈ rl ∨ phead0 ∈ rl0 + vtail1 ' from phead, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vtail1 ∧ unmarkedp(qrl, vs) ⊦ r0 ≠ vhead ∧ r0 ∈ (rl0 + vtail1 ') + qrl from vhead
| vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), vtail1 = vhead0, r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl0 + vtail1 ') + qrl, vs, ps, vs0, ps0), listp((rl0 + vtail1 ') + qrl + rl, vs0, ps0, owns0), listp((rl0 + vtail1 ') + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(rl0, ps0), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl0 + vtail1 ') + qrl, vs, (rl0 + vtail1 ') + qrl + rl, vs0), nonullRetRefs((rl0 + vtail1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl0 + vtail1 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps[vtail1].deqID), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), phead0 ∈ vs, phead0 ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (rl0 + vtail1 ') + qrl + rl from vhead, vtail0 ∈ (rl0 + vtail1 ') + qrl + rl from vtail, r0 ∈ (rl0 + vtail1 ') + qrl from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0 + qrl + rl), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl + rl), ¬ dups(rl0 + qrl), ¬ dups(rl), ¬ noid(tid, (rl0 + vtail1 ') + qrl + rl, vhead0, vs0), ¬ phead0 ∈ qrl, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), vtail0 = (vtail1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vtail1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (vtail1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl0 ∨ phead0 = vtail1, phead ∈ rl0 ∨ phead = vtail1, phead0 ∈ rl ∨ phead0 ∈ rl0 + vtail1 ' from phead, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vtail1 ∧ unmarkedp(qrl, vs) ⊦ r0 ≠ vhead ∧ r0 ∈ (rl0 + vtail1 ') + qrl from vhead |
vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl0 + vhead0 ') + qrl, vs, ps, vs0, ps0), listp((rl0 + vhead0 ') + qrl, vs, ps, owns), listp((rl0 + vhead0 ') + qrl + rl, vs0, ps0, owns0), markedp(rl0, ps), markedp(rl0, vs), markedp(rl0, ps0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl0 + vhead0 ') + qrl, vs, (rl0 + vhead0 ') + qrl + rl, vs0), nonullRetRefs((rl0 + vhead0 ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl0 + vhead0 ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), vtail0 ∈ (rl0 + vhead0 ') + qrl + rl from vtail, vhead0 ∈ (rl0 + vhead0 ') + qrl + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps, phead0 ∈ vs, r0 ∈ qrl, r0 ∈ vs, r0 ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0 + qrl + rl), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl + rl), ¬ dups(rl0 + qrl), ¬ dups(rl), ¬ noid(tid, (rl0 + vhead0 ') + qrl + rl, vhead0, vs0), ¬ phead0 ∈ qrl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ rl, qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(qrl, vs), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ rl ∨ phead0 ∈ rl0 + vhead0 ' from phead, phead ∈ rl0 ∨ phead = vhead0, phead0 ∈ rl0 ∨ phead0 = vhead0, vtail0 = (vhead0 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vhead0 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (vhead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ (rl0 + vhead0 ') + qrl from vhead
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)
| vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl0 + vhead0 ') + qrl, vs, ps, vs0, ps0), listp((rl0 + vhead0 ') + qrl, vs, ps, owns), listp((rl0 + vhead0 ') + qrl + rl, vs0, ps0, owns0), markedp(rl0, ps), markedp(rl0, vs), markedp(rl0, ps0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl0 + vhead0 ') + qrl, vs, (rl0 + vhead0 ') + qrl + rl, vs0), nonullRetRefs((rl0 + vhead0 ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl0 + vhead0 ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), vtail0 ∈ (rl0 + vhead0 ') + qrl + rl from vtail, vhead0 ∈ (rl0 + vhead0 ') + qrl + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps, phead0 ∈ vs, r0 ∈ qrl, r0 ∈ vs, r0 ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0 + qrl + rl), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl + rl), ¬ dups(rl0 + qrl), ¬ dups(rl), ¬ noid(tid, (rl0 + vhead0 ') + qrl + rl, vhead0, vs0), ¬ phead0 ∈ qrl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ rl, qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(qrl, vs), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ rl ∨ phead0 ∈ rl0 + vhead0 ' from phead, phead ∈ rl0 ∨ phead = vhead0, phead0 ∈ rl0 ∨ phead0 = vhead0, vtail0 = (vhead0 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vhead0 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (vhead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ (rl0 + vhead0 ') + qrl from vhead |
vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, qrl = phead1 + qrl0, vretRefs(tid) = vretRefs0(tid), qrl ≠ [], r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl0 + vhead0 ') + qrl, vs, ps, vs0, ps0), listp((rl0 + vhead0 ') + qrl + rl, vs0, ps0, owns0), listp((rl0 + vhead0 ') + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(rl0, ps0), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl0 + vhead0 ') + qrl, vs, (rl0 + vhead0 ') + qrl + rl, vs0), nonullRetRefs((rl0 + vhead0 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl0 + vhead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), r0 ∈ ps, r0 ∈ vs, r0 ∈ qrl, phead0 ∈ vs, phead0 ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (rl0 + vhead0 ') + qrl + rl from vhead, vtail0 ∈ (rl0 + vhead0 ') + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0 + qrl + rl), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl + rl), ¬ dups(rl0 + qrl), ¬ dups(rl), ¬ noid(tid, (rl0 + vhead0 ') + qrl + rl, vhead0, vs0), ¬ phead0 ∈ qrl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (vhead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vhead0 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vhead0 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, phead0 ∈ rl0 ∨ phead0 = vhead0, phead ∈ rl0 ∨ phead = vhead0, phead0 ∈ rl ∨ phead0 ∈ rl0 + vhead0 ' from phead, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vhead0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl0, vs)) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(qrl, vs) ⊦ r0 ≠ vhead ∧ r0 ∈ (rl0 + vhead0 ') + qrl from vhead
Used simplifier rules: ⊦ [] + x = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ a ∈ []; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, phead1, y
| vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, qrl = phead1 + qrl0, vretRefs(tid) = vretRefs0(tid), qrl ≠ [], r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl0 + vhead0 ') + qrl, vs, ps, vs0, ps0), listp((rl0 + vhead0 ') + qrl + rl, vs0, ps0, owns0), listp((rl0 + vhead0 ') + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(rl0, ps0), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl0 + vhead0 ') + qrl, vs, (rl0 + vhead0 ') + qrl + rl, vs0), nonullRetRefs((rl0 + vhead0 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl0 + vhead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), r0 ∈ ps, r0 ∈ vs, r0 ∈ qrl, phead0 ∈ vs, phead0 ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (rl0 + vhead0 ') + qrl + rl from vhead, vtail0 ∈ (rl0 + vhead0 ') + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0 + qrl + rl), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl + rl), ¬ dups(rl0 + qrl), ¬ dups(rl), ¬ noid(tid, (rl0 + vhead0 ') + qrl + rl, vhead0, vs0), ¬ phead0 ∈ qrl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), qrl + rl ≠ [] → unmarkedp((qrl + rl).tail, vs0), vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (vhead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vhead0 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vhead0 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, phead0 ∈ rl0 ∨ phead0 = vhead0, phead ∈ rl0 ∨ phead = vhead0, phead0 ∈ rl ∨ phead0 ∈ rl0 + vhead0 ' from phead, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vhead0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl0, vs)) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(qrl, vs) ⊦ r0 ≠ vhead ∧ r0 ∈ (rl0 + vhead0 ') + qrl from vhead |
ps0[ps[vhead0].next].deqID = None, ps[ps[vhead0].next].deqID = None, vs[r0].deqID = Some(tid), ps0[vhead0].next = ps[vhead0].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), phead0 ≠ ps[vhead0].next, r0 ≠ vhead0, vhead0 ≠ ps[vhead0].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, ps, vs0, ps0), listp(rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vs0, ps0, owns0), listp(rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, ps, owns), markedp(rl0, vs0), markedp(rl0, ps0), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vs0), nonullRetRefs(rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, vs0), unmarkedp(qrl0, vs0), unmarkedp(rl, ps0), unmarkedp(qrl0, ps0), unmarkedp(qrl0, ps), r0 ∈ ps, r0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl from vhead, vtail0 ∈ rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0 + qrl0), ¬ dups(qrl0 + rl), ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl0 + qrl0 + rl), ¬ noid(tid, rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vhead0, vs0), ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ qrl0, ¬ ps[vhead0].next ∈ rl, ¬ ps[vhead0].next ∈ qrl0, ¬ ps[vhead0].next ∈ rl0, ¬ vhead0 ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ rl0 ∨ phead0 = vhead0, phead ∈ rl0 ∨ phead = vhead0, phead0 ∈ rl ∨ phead0 ∈ rl0 + vhead0 ' from phead, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail = (ps[vhead0].next ' + qrl0).last ∨ vtail = (vhead0 ' + (ps[vhead0].next ' + qrl0).butlast).last ∧ vs[(ps[vhead0].next ' + qrl0).last].deqID = None ∧ vs[(ps[vhead0].next ' + qrl0).last].next = null, vtail0 = (ps[vhead0].next ' + qrl0 + rl).last ∨ vtail0 = (vhead0 ' + ((ps[vhead0].next ' + qrl0) + rl).butlast).last ∧ vs0[((ps[vhead0].next ' + qrl0) + rl).last].deqID = None ∧ vs0[((ps[vhead0].next ' + qrl0) + rl).last].next = null, vhead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(qrl0, vs), r0 = ps[vhead0].next ∨ r0 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ rl0 + vhead0 ' + ps[vhead0].next ' + qrl0 from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a + x = a ' + x; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ (a ' + x).tail = x; (s) ⊦ a ' + x ≠ []; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s)
| ps0[ps[vhead0].next].deqID = None, ps[ps[vhead0].next].deqID = None, vs[r0].deqID = Some(tid), ps0[vhead0].next = ps[vhead0].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), phead0 ≠ ps[vhead0].next, r0 ≠ vhead0, vhead0 ≠ ps[vhead0].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, ps, vs0, ps0), listp(rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vs0, ps0, owns0), listp(rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, ps, owns), markedp(rl0, vs0), markedp(rl0, ps0), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vs0), nonullRetRefs(rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, vs0), unmarkedp(qrl0, vs0), unmarkedp(rl, ps0), unmarkedp(qrl0, ps0), unmarkedp(qrl0, ps), r0 ∈ ps, r0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl from vhead, vtail0 ∈ rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0 + qrl0), ¬ dups(qrl0 + rl), ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl0 + qrl0 + rl), ¬ noid(tid, rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vhead0, vs0), ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ qrl0, ¬ ps[vhead0].next ∈ rl, ¬ ps[vhead0].next ∈ qrl0, ¬ ps[vhead0].next ∈ rl0, ¬ vhead0 ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ rl0 ∨ phead0 = vhead0, phead ∈ rl0 ∨ phead = vhead0, phead0 ∈ rl ∨ phead0 ∈ rl0 + vhead0 ' from phead, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail = (ps[vhead0].next ' + qrl0).last ∨ vtail = (vhead0 ' + (ps[vhead0].next ' + qrl0).butlast).last ∧ vs[(ps[vhead0].next ' + qrl0).last].deqID = None ∧ vs[(ps[vhead0].next ' + qrl0).last].next = null, vtail0 = (ps[vhead0].next ' + qrl0 + rl).last ∨ vtail0 = (vhead0 ' + ((ps[vhead0].next ' + qrl0) + rl).butlast).last ∧ vs0[((ps[vhead0].next ' + qrl0) + rl).last].deqID = None ∧ vs0[((ps[vhead0].next ' + qrl0) + rl).last].next = null, vhead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(qrl0, vs), r0 = ps[vhead0].next ∨ r0 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ rl0 + vhead0 ' + ps[vhead0].next ' + qrl0 from vhead |
vs[r0].deqID = Some(tid), ps[ps[vhead0].next].deqID = None, ps0[ps[vhead0].next].deqID = None, ps0[vhead0].next = ps[vhead0].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), phead0 ≠ ps[vhead0].next, r0 ≠ vhead0, vhead0 ≠ ps[vhead0].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, ps, vs0, ps0), listp(rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, ps, owns), listp(rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vs0, ps0, owns0), markedp(rl0, ps), markedp(rl0, vs), markedp(rl0, ps0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vs0), nonullRetRefs(rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, vretRefs, pretRefs), nonullRetRefs(rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(qrl0, ps), unmarkedp(qrl0, ps0), unmarkedp(rl, ps0), unmarkedp(qrl0, vs0), unmarkedp(rl, vs0), vtail0 ∈ rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl from vtail, vhead0 ∈ rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps, phead0 ∈ vs, r0 ∈ vs, r0 ∈ ps, phead ∈ rl0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0 + qrl0), ¬ dups(qrl0 + rl), ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl0 + qrl0 + rl), ¬ noid(tid, rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vhead0, vs0), ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ qrl0, ¬ ps[vhead0].next ∈ rl, ¬ ps[vhead0].next ∈ qrl0, ¬ ps[vhead0].next ∈ rl0, ¬ vhead0 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), r0 = ps[vhead0].next ∨ r0 ∈ qrl0, vhead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(qrl0, vs), vtail0 = (ps[vhead0].next ' + qrl0 + rl).last ∨ vtail0 = (vhead0 ' + ((ps[vhead0].next ' + qrl0) + rl).butlast).last ∧ vs0[((ps[vhead0].next ' + qrl0) + rl).last].deqID = None ∧ vs0[((ps[vhead0].next ' + qrl0) + rl).last].next = null, vtail = (ps[vhead0].next ' + qrl0).last ∨ vtail = (vhead0 ' + (ps[vhead0].next ' + qrl0).butlast).last ∧ vs[(ps[vhead0].next ' + qrl0).last].deqID = None ∧ vs[(ps[vhead0].next ' + qrl0).last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ rl ∨ phead0 ∈ rl0 + vhead0 ' from phead, phead0 ∈ rl0 ∨ phead0 = vhead0 ⊦ r0 ≠ vhead ∧ r0 ∈ rl0 + vhead0 ' + ps[vhead0].next ' + qrl0 from vhead
Used simplifier rules: ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]
| vs[r0].deqID = Some(tid), ps[ps[vhead0].next].deqID = None, ps0[ps[vhead0].next].deqID = None, ps0[vhead0].next = ps[vhead0].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), phead0 ≠ ps[vhead0].next, r0 ≠ vhead0, vhead0 ≠ ps[vhead0].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, ps, vs0, ps0), listp(rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, ps, owns), listp(rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vs0, ps0, owns0), markedp(rl0, ps), markedp(rl0, vs), markedp(rl0, ps0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vs0), nonullRetRefs(rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, vretRefs, pretRefs), nonullRetRefs(rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(qrl0, ps), unmarkedp(qrl0, ps0), unmarkedp(rl, ps0), unmarkedp(qrl0, vs0), unmarkedp(rl, vs0), vtail0 ∈ rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl from vtail, vhead0 ∈ rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps, phead0 ∈ vs, r0 ∈ vs, r0 ∈ ps, phead ∈ rl0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0 + qrl0), ¬ dups(qrl0 + rl), ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl0 + qrl0 + rl), ¬ noid(tid, rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vhead0, vs0), ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ qrl0, ¬ ps[vhead0].next ∈ rl, ¬ ps[vhead0].next ∈ qrl0, ¬ ps[vhead0].next ∈ rl0, ¬ vhead0 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), r0 = ps[vhead0].next ∨ r0 ∈ qrl0, vhead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(qrl0, vs), vtail0 = (ps[vhead0].next ' + qrl0 + rl).last ∨ vtail0 = (vhead0 ' + ((ps[vhead0].next ' + qrl0) + rl).butlast).last ∧ vs0[((ps[vhead0].next ' + qrl0) + rl).last].deqID = None ∧ vs0[((ps[vhead0].next ' + qrl0) + rl).last].next = null, vtail = (ps[vhead0].next ' + qrl0).last ∨ vtail = (vhead0 ' + (ps[vhead0].next ' + qrl0).butlast).last ∧ vs[(ps[vhead0].next ' + qrl0).last].deqID = None ∧ vs[(ps[vhead0].next ' + qrl0).last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ rl ∨ phead0 ∈ rl0 + vhead0 ' from phead, phead0 ∈ rl0 ∨ phead0 = vhead0 ⊦ r0 ≠ vhead ∧ r0 ∈ rl0 + vhead0 ' + ps[vhead0].next ' + qrl0 from vhead |
ps0[ps[vhead0].next].deqID = None, ps[ps[vhead0].next].deqID = None, vs[r0].deqID = Some(tid), ps0[vhead0].next = ps[vhead0].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), phead0 ≠ ps[vhead0].next, r0 ≠ vhead0, vhead0 ≠ ps[vhead0].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, ps, vs0, ps0), listp(rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vs0, ps0, owns0), listp(rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, ps, owns), markedp(rl0, vs0), markedp(rl0, ps0), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vs0), nonullRetRefs(rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, vs0), unmarkedp(qrl0, vs0), unmarkedp(rl, ps0), unmarkedp(qrl0, ps0), unmarkedp(qrl0, ps), phead ∈ rl0, r0 ∈ ps, r0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl from vhead, vtail0 ∈ rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0 + qrl0), ¬ dups(qrl0 + rl), ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl0 + qrl0 + rl), ¬ noid(tid, rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vhead0, vs0), ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ qrl0, ¬ ps[vhead0].next ∈ rl, ¬ ps[vhead0].next ∈ qrl0, ¬ ps[vhead0].next ∈ rl0, ¬ vhead0 ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ rl0 ∨ phead0 = vhead0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail = (ps[vhead0].next ' + qrl0).last ∨ vtail = (vhead0 ' + (ps[vhead0].next ' + qrl0).butlast).last ∧ vs[(ps[vhead0].next ' + qrl0).last].deqID = None ∧ vs[(ps[vhead0].next ' + qrl0).last].next = null, vtail0 = (ps[vhead0].next ' + qrl0 + rl).last ∨ vtail0 = (vhead0 ' + ((ps[vhead0].next ' + qrl0) + rl).butlast).last ∧ vs0[((ps[vhead0].next ' + qrl0) + rl).last].deqID = None ∧ vs0[((ps[vhead0].next ' + qrl0) + rl).last].next = null, r0 = ps[vhead0].next ∨ r0 ∈ qrl0, phead0 ∈ rl ∨ phead0 ∈ rl0 from phead ∨ phead0 = vhead0, vhead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ r0 ≠ vhead ∧ r0 ∈ rl0 + vhead0 ' + ps[vhead0].next ' + qrl0 from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s)
| ps0[ps[vhead0].next].deqID = None, ps[ps[vhead0].next].deqID = None, vs[r0].deqID = Some(tid), ps0[vhead0].next = ps[vhead0].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), phead0 ≠ ps[vhead0].next, r0 ≠ vhead0, vhead0 ≠ ps[vhead0].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, ps, vs0, ps0), listp(rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vs0, ps0, owns0), listp(rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, ps, owns), markedp(rl0, vs0), markedp(rl0, ps0), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vs0), nonullRetRefs(rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, vs0), unmarkedp(qrl0, vs0), unmarkedp(rl, ps0), unmarkedp(qrl0, ps0), unmarkedp(qrl0, ps), phead ∈ rl0, r0 ∈ ps, r0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl from vhead, vtail0 ∈ rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0 + qrl0), ¬ dups(qrl0 + rl), ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl0 + qrl0 + rl), ¬ noid(tid, rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vhead0, vs0), ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ qrl0, ¬ ps[vhead0].next ∈ rl, ¬ ps[vhead0].next ∈ qrl0, ¬ ps[vhead0].next ∈ rl0, ¬ vhead0 ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ rl0 ∨ phead0 = vhead0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail = (ps[vhead0].next ' + qrl0).last ∨ vtail = (vhead0 ' + (ps[vhead0].next ' + qrl0).butlast).last ∧ vs[(ps[vhead0].next ' + qrl0).last].deqID = None ∧ vs[(ps[vhead0].next ' + qrl0).last].next = null, vtail0 = (ps[vhead0].next ' + qrl0 + rl).last ∨ vtail0 = (vhead0 ' + ((ps[vhead0].next ' + qrl0) + rl).butlast).last ∧ vs0[((ps[vhead0].next ' + qrl0) + rl).last].deqID = None ∧ vs0[((ps[vhead0].next ' + qrl0) + rl).last].next = null, r0 = ps[vhead0].next ∨ r0 ∈ qrl0, phead0 ∈ rl ∨ phead0 ∈ rl0 from phead ∨ phead0 = vhead0, vhead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ r0 ≠ vhead ∧ r0 ∈ rl0 + vhead0 ' + ps[vhead0].next ' + qrl0 from vhead |
vs[r0].deqID = Some(tid), ps[ps[vhead0].next].deqID = None, ps0[ps[vhead0].next].deqID = None, ps0[vhead0].next = ps[vhead0].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, rl0 = qrl + vtail1 ', vretRefs(tid) = vretRefs0(tid), phead0 ≠ ps[vhead0].next, r0 ≠ vhead0, rl0 ≠ [], vhead0 ≠ ps[vhead0].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, ps, vs0, ps0), listp(rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, ps, owns), listp(rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vs0, ps0, owns0), markedp(rl0, ps), markedp(rl0, vs), markedp(rl0, ps0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vs0), nonullRetRefs(rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, vretRefs, pretRefs), nonullRetRefs(rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(qrl0, ps), unmarkedp(qrl0, ps0), unmarkedp(rl, ps0), unmarkedp(qrl0, vs0), unmarkedp(rl, vs0), vtail0 ∈ rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl from vtail, vhead0 ∈ rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps, phead0 ∈ vs, r0 ∈ vs, r0 ∈ ps, phead ∈ rl0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0 + qrl0), ¬ dups(qrl0 + rl), ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl0 + qrl0 + rl), ¬ noid(tid, rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vhead0, vs0), ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ qrl0, ¬ ps[vhead0].next ∈ rl, ¬ ps[vhead0].next ∈ qrl0, ¬ ps[vhead0].next ∈ rl0, ¬ vhead0 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ rl0 ≠ [] ∧ vtail1 = vhead ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(qrl0, vs), phead0 ∈ rl ∨ phead0 ∈ rl0 from phead ∨ phead0 = vhead0, r0 = ps[vhead0].next ∨ r0 ∈ qrl0, vtail0 = (ps[vhead0].next ' + qrl0 + rl).last ∨ vtail0 = (vhead0 ' + ((ps[vhead0].next ' + qrl0) + rl).butlast).last ∧ vs0[((ps[vhead0].next ' + qrl0) + rl).last].deqID = None ∧ vs0[((ps[vhead0].next ' + qrl0) + rl).last].next = null, vtail = (ps[vhead0].next ' + qrl0).last ∨ vtail = (vhead0 ' + (ps[vhead0].next ' + qrl0).butlast).last ∧ vs[(ps[vhead0].next ' + qrl0).last].deqID = None ∧ vs[(ps[vhead0].next ' + qrl0).last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ rl0 ∨ phead0 = vhead0 ⊦ r0 ≠ vhead ∧ r0 ∈ rl0 + vhead0 ' + ps[vhead0].next ' + qrl0 from vhead
Used simplifier rules: ⊦ ¬ a ∈ []; (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl0, vtail1, y
| vs[r0].deqID = Some(tid), ps[ps[vhead0].next].deqID = None, ps0[ps[vhead0].next].deqID = None, ps0[vhead0].next = ps[vhead0].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, rl0 = qrl + vtail1 ', vretRefs(tid) = vretRefs0(tid), phead0 ≠ ps[vhead0].next, r0 ≠ vhead0, rl0 ≠ [], vhead0 ≠ ps[vhead0].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, ps, vs0, ps0), listp(rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, ps, owns), listp(rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vs0, ps0, owns0), markedp(rl0, ps), markedp(rl0, vs), markedp(rl0, ps0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vs0), nonullRetRefs(rl0 + vhead0 ' + ps[vhead0].next ' + qrl0, vs, vretRefs, pretRefs), nonullRetRefs(rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(qrl0, ps), unmarkedp(qrl0, ps0), unmarkedp(rl, ps0), unmarkedp(qrl0, vs0), unmarkedp(rl, vs0), vtail0 ∈ rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl from vtail, vhead0 ∈ rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps, phead0 ∈ vs, r0 ∈ vs, r0 ∈ ps, phead ∈ rl0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0 + qrl0), ¬ dups(qrl0 + rl), ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(rl0 + qrl0 + rl), ¬ noid(tid, rl0 + vhead0 ' + (ps[vhead0].next ' + qrl0) + rl, vhead0, vs0), ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ qrl0, ¬ ps[vhead0].next ∈ rl, ¬ ps[vhead0].next ∈ qrl0, ¬ ps[vhead0].next ∈ rl0, ¬ vhead0 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ rl0 ≠ [] ∧ vtail1 = vhead ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(qrl0, vs), phead0 ∈ rl ∨ phead0 ∈ rl0 from phead ∨ phead0 = vhead0, r0 = ps[vhead0].next ∨ r0 ∈ qrl0, vtail0 = (ps[vhead0].next ' + qrl0 + rl).last ∨ vtail0 = (vhead0 ' + ((ps[vhead0].next ' + qrl0) + rl).butlast).last ∧ vs0[((ps[vhead0].next ' + qrl0) + rl).last].deqID = None ∧ vs0[((ps[vhead0].next ' + qrl0) + rl).last].next = null, vtail = (ps[vhead0].next ' + qrl0).last ∨ vtail = (vhead0 ' + (ps[vhead0].next ' + qrl0).butlast).last ∧ vs[(ps[vhead0].next ' + qrl0).last].deqID = None ∧ vs[(ps[vhead0].next ' + qrl0).last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ rl0 ∨ phead0 = vhead0 ⊦ r0 ≠ vhead ∧ r0 ∈ rl0 + vhead0 ' + ps[vhead0].next ' + qrl0 from vhead |
vs[r0].deqID = Some(tid), ps[ps[ps0[vtail1].next].next].deqID = None, ps0[ps[ps0[vtail1].next].next].deqID = None, ps[vtail1].next = ps0[vtail1].next, ps0[ps0[vtail1].next].next = ps[ps0[vtail1].next].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), ps[ps0[vtail1].next].next ≠ vtail1, ps0[vtail1].next ≠ vtail1, ps0[vtail1].next ≠ ps[ps0[vtail1].next].next, phead0 ≠ ps[ps0[vtail1].next].next, r0 ≠ ps0[vtail1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + vtail1 ') + ps0[vtail1].next ' + ps[ps0[vtail1].next].next ' + qrl0, vs, ps, vs0, ps0), listp((qrl + vtail1 ') + ps0[vtail1].next ' + ps[ps0[vtail1].next].next ' + qrl0, vs, ps, owns), listp((qrl + vtail1 ') + ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0) + rl, vs0, ps0, owns0), markedp(qrl, ps), markedp(qrl, vs), markedp(qrl, ps0), markedp(qrl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, ps0[vtail1].next, vs0), noidRely (tid, (qrl + vtail1 ') + ps0[vtail1].next ' + ps[ps0[vtail1].next].next ' + qrl0, vs, (qrl + vtail1 ') + ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0) + rl, vs0), nonullRetRefs((qrl + vtail1 ') + ps0[vtail1].next ' + ps[ps0[vtail1].next].next ' + qrl0, vs, vretRefs, pretRefs), nonullRetRefs((qrl + vtail1 ') + ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps[ps0[vtail1].next].deqID), some?(vs[ps0[vtail1].next].deqID), some?(ps0[ps0[vtail1].next].deqID), some?(vs0[ps0[vtail1].next].deqID), unmarkedp(qrl0, ps), unmarkedp(qrl0, ps0), unmarkedp(rl, ps0), unmarkedp(qrl0, vs0), unmarkedp(rl, vs0), vtail0 ∈ (qrl + vtail1 ') + ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0) + rl from vtail, ps0[vtail1].next ∈ (qrl + vtail1 ') + ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0) + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps, phead0 ∈ vs, r0 ∈ vs, r0 ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl), ¬ dups(qrl + qrl0), ¬ dups(qrl0 + rl), ¬ dups(qrl), ¬ dups(qrl + qrl0 + rl), ¬ noid(tid, (qrl + vtail1 ') + ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0) + rl, ps0[vtail1].next, vs0), ¬ ps[ps0[vtail1].next].next ∈ qrl, ¬ ps[ps0[vtail1].next].next ∈ qrl0, ¬ ps[ps0[vtail1].next].next ∈ rl, ¬ phead0 ∈ qrl0, ¬ ps0[vtail1].next ∈ qrl, ¬ ps0[vtail1].next ∈ qrl0, ¬ vtail1 ∈ rl, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl, ¬ ps0[vtail1].next ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[ps0[vtail1].next].next ≠ null ∧ vs0[vs0[ps0[vtail1].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps0[vtail1].next].next].deqID.tid)) = Claimed(vs0[vs0[ps0[vtail1].next].next].deqID.tid, vs0[vs0[ps0[vtail1].next].next].val), phead0 ∈ qrl ∨ phead0 = vtail1 ∨ phead0 = ps0[vtail1].next, phead ∈ qrl ∨ phead = vtail1, phead0 ∈ rl ∨ phead0 ∈ qrl + vtail1 ' from phead ∨ phead0 = ps0[vtail1].next, r0 = ps[ps0[vtail1].next].next ∨ r0 ∈ qrl0, vtail0 = (ps[ps0[vtail1].next].next ' + qrl0 + rl).last ∨ vtail0 = (ps0[vtail1].next ' + ((ps[ps0[vtail1].next].next ' + qrl0) + rl).butlast).last ∧ vs0[((ps[ps0[vtail1].next].next ' + qrl0) + rl).last].deqID = None ∧ vs0[((ps[ps0[vtail1].next].next ' + qrl0) + rl).last].next = null, vtail = (ps[ps0[vtail1].next].next ' + qrl0).last ∨ vtail = (ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0).butlast).last ∧ vs[(ps[ps0[vtail1].next].next ' + qrl0).last].deqID = None ∧ vs[(ps[ps0[vtail1].next].next ' + qrl0).last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), ps0[vtail1].next = vhead ∧ unmarkedp(qrl0, vs) ∨ vtail1 = vhead ∧ vs[ps[ps0[vhead].next].next].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ r0 ≠ vhead ∧ r0 ∈ (qrl + vtail1 ') + ps0[vtail1].next ' + ps[ps0[vtail1].next].next ' + qrl0 from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ x + a ' ≠ []; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s)
| vs[r0].deqID = Some(tid), ps[ps[ps0[vtail1].next].next].deqID = None, ps0[ps[ps0[vtail1].next].next].deqID = None, ps[vtail1].next = ps0[vtail1].next, ps0[ps0[vtail1].next].next = ps[ps0[vtail1].next].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), ps[ps0[vtail1].next].next ≠ vtail1, ps0[vtail1].next ≠ vtail1, ps0[vtail1].next ≠ ps[ps0[vtail1].next].next, phead0 ≠ ps[ps0[vtail1].next].next, r0 ≠ ps0[vtail1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + vtail1 ') + ps0[vtail1].next ' + ps[ps0[vtail1].next].next ' + qrl0, vs, ps, vs0, ps0), listp((qrl + vtail1 ') + ps0[vtail1].next ' + ps[ps0[vtail1].next].next ' + qrl0, vs, ps, owns), listp((qrl + vtail1 ') + ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0) + rl, vs0, ps0, owns0), markedp(qrl, ps), markedp(qrl, vs), markedp(qrl, ps0), markedp(qrl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, ps0[vtail1].next, vs0), noidRely (tid, (qrl + vtail1 ') + ps0[vtail1].next ' + ps[ps0[vtail1].next].next ' + qrl0, vs, (qrl + vtail1 ') + ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0) + rl, vs0), nonullRetRefs((qrl + vtail1 ') + ps0[vtail1].next ' + ps[ps0[vtail1].next].next ' + qrl0, vs, vretRefs, pretRefs), nonullRetRefs((qrl + vtail1 ') + ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps[ps0[vtail1].next].deqID), some?(vs[ps0[vtail1].next].deqID), some?(ps0[ps0[vtail1].next].deqID), some?(vs0[ps0[vtail1].next].deqID), unmarkedp(qrl0, ps), unmarkedp(qrl0, ps0), unmarkedp(rl, ps0), unmarkedp(qrl0, vs0), unmarkedp(rl, vs0), vtail0 ∈ (qrl + vtail1 ') + ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0) + rl from vtail, ps0[vtail1].next ∈ (qrl + vtail1 ') + ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0) + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps, phead0 ∈ vs, r0 ∈ vs, r0 ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl), ¬ dups(qrl + qrl0), ¬ dups(qrl0 + rl), ¬ dups(qrl), ¬ dups(qrl + qrl0 + rl), ¬ noid(tid, (qrl + vtail1 ') + ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0) + rl, ps0[vtail1].next, vs0), ¬ ps[ps0[vtail1].next].next ∈ qrl, ¬ ps[ps0[vtail1].next].next ∈ qrl0, ¬ ps[ps0[vtail1].next].next ∈ rl, ¬ phead0 ∈ qrl0, ¬ ps0[vtail1].next ∈ qrl, ¬ ps0[vtail1].next ∈ qrl0, ¬ vtail1 ∈ rl, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl, ¬ ps0[vtail1].next ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[ps0[vtail1].next].next ≠ null ∧ vs0[vs0[ps0[vtail1].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps0[vtail1].next].next].deqID.tid)) = Claimed(vs0[vs0[ps0[vtail1].next].next].deqID.tid, vs0[vs0[ps0[vtail1].next].next].val), phead0 ∈ qrl ∨ phead0 = vtail1 ∨ phead0 = ps0[vtail1].next, phead ∈ qrl ∨ phead = vtail1, phead0 ∈ rl ∨ phead0 ∈ qrl + vtail1 ' from phead ∨ phead0 = ps0[vtail1].next, r0 = ps[ps0[vtail1].next].next ∨ r0 ∈ qrl0, vtail0 = (ps[ps0[vtail1].next].next ' + qrl0 + rl).last ∨ vtail0 = (ps0[vtail1].next ' + ((ps[ps0[vtail1].next].next ' + qrl0) + rl).butlast).last ∧ vs0[((ps[ps0[vtail1].next].next ' + qrl0) + rl).last].deqID = None ∧ vs0[((ps[ps0[vtail1].next].next ' + qrl0) + rl).last].next = null, vtail = (ps[ps0[vtail1].next].next ' + qrl0).last ∨ vtail = (ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0).butlast).last ∧ vs[(ps[ps0[vtail1].next].next ' + qrl0).last].deqID = None ∧ vs[(ps[ps0[vtail1].next].next ' + qrl0).last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), ps0[vtail1].next = vhead ∧ unmarkedp(qrl0, vs) ∨ vtail1 = vhead ∧ vs[ps[ps0[vhead].next].next].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ r0 ≠ vhead ∧ r0 ∈ (qrl + vtail1 ') + ps0[vtail1].next ' + ps[ps0[vtail1].next].next ' + qrl0 from vhead |
ps0[ps[ps0[vtail1].next].next].deqID = None, ps[ps[ps0[vtail1].next].next].deqID = None, vs[r0].deqID = Some(tid), ps0[ps0[vtail1].next].next = ps[ps0[vtail1].next].next, ps[vtail1].next = ps0[vtail1].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), ps[ps0[vtail1].next].next ≠ vtail1, ps0[vtail1].next ≠ vtail1, ps0[vtail1].next ≠ ps[ps0[vtail1].next].next, phead0 ≠ ps[ps0[vtail1].next].next, r0 ≠ ps0[vtail1].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + vtail1 ') + ps0[vtail1].next ' + ps[ps0[vtail1].next].next ' + qrl0, vs, ps, vs0, ps0), listp((qrl + vtail1 ') + ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0) + rl, vs0, ps0, owns0), listp((qrl + vtail1 ') + ps0[vtail1].next ' + ps[ps0[vtail1].next].next ' + qrl0, vs, ps, owns), markedp(qrl, vs0), markedp(qrl, ps0), markedp(qrl, vs), markedp(qrl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, ps0[vtail1].next, vs0), noidRely (tid, (qrl + vtail1 ') + ps0[vtail1].next ' + ps[ps0[vtail1].next].next ' + qrl0, vs, (qrl + vtail1 ') + ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0) + rl, vs0), nonullRetRefs((qrl + vtail1 ') + ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((qrl + vtail1 ') + ps0[vtail1].next ' + ps[ps0[vtail1].next].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps0[vtail1].next].deqID), some?(ps0[ps0[vtail1].next].deqID), some?(vs[ps0[vtail1].next].deqID), some?(ps[ps0[vtail1].next].deqID), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps[vtail1].deqID), unmarkedp(rl, vs0), unmarkedp(qrl0, vs0), unmarkedp(rl, ps0), unmarkedp(qrl0, ps0), unmarkedp(qrl0, ps), r0 ∈ ps, r0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, ps0[vtail1].next ∈ (qrl + vtail1 ') + ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0) + rl from vhead, vtail0 ∈ (qrl + vtail1 ') + ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0) + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl), ¬ dups(qrl + qrl0), ¬ dups(qrl0 + rl), ¬ dups(qrl), ¬ dups(qrl + qrl0 + rl), ¬ noid(tid, (qrl + vtail1 ') + ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0) + rl, ps0[vtail1].next, vs0), ¬ r0 ∈ (qrl + vtail1 ') + ps0[vtail1].next ' + ps[ps0[vtail1].next].next ' + qrl0 from vhead, ¬ ps[ps0[vtail1].next].next ∈ qrl, ¬ ps[ps0[vtail1].next].next ∈ qrl0, ¬ ps[ps0[vtail1].next].next ∈ rl, ¬ phead0 ∈ qrl0, ¬ ps0[vtail1].next ∈ qrl, ¬ ps0[vtail1].next ∈ qrl0, ¬ vtail1 ∈ rl, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl, ¬ ps0[vtail1].next ∈ rl, vs0[ps0[vtail1].next].next ≠ null ∧ vs0[vs0[ps0[vtail1].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps0[vtail1].next].next].deqID.tid)) = Claimed(vs0[vs0[ps0[vtail1].next].next].deqID.tid, vs0[vs0[ps0[vtail1].next].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), ps0[vtail1].next = vhead ∧ unmarkedp(qrl0, vs) ∨ vtail1 = vhead ∧ vs[ps[ps0[vhead].next].next].deqID = None ∧ unmarkedp(qrl0, vs), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail = (ps[ps0[vtail1].next].next ' + qrl0).last ∨ vtail = (ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0).butlast).last ∧ vs[(ps[ps0[vtail1].next].next ' + qrl0).last].deqID = None ∧ vs[(ps[ps0[vtail1].next].next ' + qrl0).last].next = null, vtail0 = (ps[ps0[vtail1].next].next ' + qrl0 + rl).last ∨ vtail0 = (ps0[vtail1].next ' + ((ps[ps0[vtail1].next].next ' + qrl0) + rl).butlast).last ∧ vs0[((ps[ps0[vtail1].next].next ' + qrl0) + rl).last].deqID = None ∧ vs0[((ps[ps0[vtail1].next].next ' + qrl0) + rl).last].next = null, r0 = ps[ps0[vtail1].next].next ∨ r0 ∈ qrl0, phead0 ∈ rl ∨ phead0 ∈ qrl + vtail1 ' from phead ∨ phead0 = ps0[vtail1].next, phead ∈ qrl ∨ phead = vtail1, phead0 ∈ qrl ∨ phead0 = vtail1 ∨ phead0 = ps0[vtail1].next ⊦
| ps0[ps[ps0[vtail1].next].next].deqID = None, ps[ps[ps0[vtail1].next].next].deqID = None, vs[r0].deqID = Some(tid), ps0[ps0[vtail1].next].next = ps[ps0[vtail1].next].next, ps[vtail1].next = ps0[vtail1].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), ps[ps0[vtail1].next].next ≠ vtail1, ps0[vtail1].next ≠ vtail1, ps0[vtail1].next ≠ ps[ps0[vtail1].next].next, phead0 ≠ ps[ps0[vtail1].next].next, r0 ≠ ps0[vtail1].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + vtail1 ') + ps0[vtail1].next ' + ps[ps0[vtail1].next].next ' + qrl0, vs, ps, vs0, ps0), listp((qrl + vtail1 ') + ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0) + rl, vs0, ps0, owns0), listp((qrl + vtail1 ') + ps0[vtail1].next ' + ps[ps0[vtail1].next].next ' + qrl0, vs, ps, owns), markedp(qrl, vs0), markedp(qrl, ps0), markedp(qrl, vs), markedp(qrl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, ps0[vtail1].next, vs0), noidRely (tid, (qrl + vtail1 ') + ps0[vtail1].next ' + ps[ps0[vtail1].next].next ' + qrl0, vs, (qrl + vtail1 ') + ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0) + rl, vs0), nonullRetRefs((qrl + vtail1 ') + ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((qrl + vtail1 ') + ps0[vtail1].next ' + ps[ps0[vtail1].next].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps0[vtail1].next].deqID), some?(ps0[ps0[vtail1].next].deqID), some?(vs[ps0[vtail1].next].deqID), some?(ps[ps0[vtail1].next].deqID), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps[vtail1].deqID), unmarkedp(rl, vs0), unmarkedp(qrl0, vs0), unmarkedp(rl, ps0), unmarkedp(qrl0, ps0), unmarkedp(qrl0, ps), r0 ∈ ps, r0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, ps0[vtail1].next ∈ (qrl + vtail1 ') + ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0) + rl from vhead, vtail0 ∈ (qrl + vtail1 ') + ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0) + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl), ¬ dups(qrl + qrl0), ¬ dups(qrl0 + rl), ¬ dups(qrl), ¬ dups(qrl + qrl0 + rl), ¬ noid(tid, (qrl + vtail1 ') + ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0) + rl, ps0[vtail1].next, vs0), ¬ r0 ∈ (qrl + vtail1 ') + ps0[vtail1].next ' + ps[ps0[vtail1].next].next ' + qrl0 from vhead, ¬ ps[ps0[vtail1].next].next ∈ qrl, ¬ ps[ps0[vtail1].next].next ∈ qrl0, ¬ ps[ps0[vtail1].next].next ∈ rl, ¬ phead0 ∈ qrl0, ¬ ps0[vtail1].next ∈ qrl, ¬ ps0[vtail1].next ∈ qrl0, ¬ vtail1 ∈ rl, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl, ¬ ps0[vtail1].next ∈ rl, vs0[ps0[vtail1].next].next ≠ null ∧ vs0[vs0[ps0[vtail1].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps0[vtail1].next].next].deqID.tid)) = Claimed(vs0[vs0[ps0[vtail1].next].next].deqID.tid, vs0[vs0[ps0[vtail1].next].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), ps0[vtail1].next = vhead ∧ unmarkedp(qrl0, vs) ∨ vtail1 = vhead ∧ vs[ps[ps0[vhead].next].next].deqID = None ∧ unmarkedp(qrl0, vs), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail = (ps[ps0[vtail1].next].next ' + qrl0).last ∨ vtail = (ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + qrl0).butlast).last ∧ vs[(ps[ps0[vtail1].next].next ' + qrl0).last].deqID = None ∧ vs[(ps[ps0[vtail1].next].next ' + qrl0).last].next = null, vtail0 = (ps[ps0[vtail1].next].next ' + qrl0 + rl).last ∨ vtail0 = (ps0[vtail1].next ' + ((ps[ps0[vtail1].next].next ' + qrl0) + rl).butlast).last ∧ vs0[((ps[ps0[vtail1].next].next ' + qrl0) + rl).last].deqID = None ∧ vs0[((ps[ps0[vtail1].next].next ' + qrl0) + rl).last].next = null, r0 = ps[ps0[vtail1].next].next ∨ r0 ∈ qrl0, phead0 ∈ rl ∨ phead0 ∈ qrl + vtail1 ' from phead ∨ phead0 = ps0[vtail1].next, phead ∈ qrl ∨ phead = vtail1, phead0 ∈ qrl ∨ phead0 = vtail1 ∨ phead0 = ps0[vtail1].next ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) Used terms: qrl + vtail1 ', ps0[vtail1].next ' + ps[ps0[vtail1].next].next ' + qrl0, vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs[r0].deqID = Some(tid), rl0.last = vhead0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), phead0 ≠ vtail1, r0 ≠ vhead0, rl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl0 + vtail1 ') + qrl, vs, ps, vs0, ps0), listp((rl0 + vtail1 ') + qrl + rl, vs0, ps0, owns0), listp((rl0 + vtail1 ') + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(rl0, ps0), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl0 + vtail1 ') + qrl, vs, (rl0 + vtail1 ') + qrl + rl, vs0), nonullRetRefs((rl0 + vtail1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl0 + vtail1 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps[vtail1].deqID), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), unmarkedp(qrl, vs0), unmarkedp(rl, vs0), phead0 ∈ vs, phead0 ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (rl0 + vtail1 ') + qrl + rl from vhead, vtail0 ∈ (rl0 + vtail1 ') + qrl + rl from vtail, r0 ∈ (rl0 + vtail1 ') + qrl from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0 + qrl + rl), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl + rl), ¬ dups(rl0 + qrl), ¬ dups(rl), ¬ noid(tid, (rl0 + vtail1 ') + qrl + rl, vhead0, vs0), ¬ phead0 ∈ qrl, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail0 = (vtail1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vtail1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (vtail1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl0 ∨ phead0 = vtail1, phead ∈ rl0 ∨ phead = vtail1, phead0 ∈ rl ∨ phead0 ∈ rl0 + vtail1 ' from phead, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vtail1 ∧ unmarkedp(qrl, vs) ⊦ r0 ≠ vhead ∧ r0 ∈ (rl0 + vtail1 ') + qrl from vhead |
vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), phead0 ≠ vtail1, r0 ≠ rl0.last, rl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl0 + vtail1 ') + qrl, vs, ps, vs0, ps0), listp((rl0 + vtail1 ') + qrl, vs, ps, owns), listp((rl0 + vtail1 ') + qrl + rl, vs0, ps0, owns0), markedp(rl0, ps), markedp(rl0, vs), markedp(rl0, ps0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, rl0.last, vs0), noidRely(tid, (rl0 + vtail1 ') + qrl, vs, (rl0 + vtail1 ') + qrl + rl, vs0), nonullRetRefs((rl0 + vtail1 ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl0 + vtail1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(rl, vs0), unmarkedp(qrl, vs0), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), r0 ∈ (rl0 + vtail1 ') + qrl from rl0.last, vtail0 ∈ (rl0 + vtail1 ') + qrl + rl from vtail, rl0.last ∈ (rl0 + vtail1 ') + qrl + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ rl0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0 + qrl + rl), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl + rl), ¬ dups(rl0 + qrl), ¬ dups(rl), ¬ noid(tid, (rl0 + vtail1 ') + qrl + rl, rl0.last, vs0), ¬ phead0 ∈ qrl, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[rl0.last].next ≠ null ∧ vs0[vs0[rl0.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[rl0.last].next].deqID.tid)) = Claimed(vs0[vs0[rl0.last].next].deqID.tid, vs0[vs0[rl0.last].next].val), vtail = (vtail1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vtail1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vtail1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl0.last = vhead ∧ phead ≠ vtail1 ∧ unmarkedp(qrl, vs), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ rl ∨ phead0 ∈ rl0 + vtail1 ' from phead, phead ∈ rl0 ∨ phead = vtail1 ⊦ r0 ≠ vhead ∧ r0 ∈ (rl0 + vtail1 ') + qrl from vhead
| vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), phead0 ≠ vtail1, r0 ≠ rl0.last, rl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl0 + vtail1 ') + qrl, vs, ps, vs0, ps0), listp((rl0 + vtail1 ') + qrl, vs, ps, owns), listp((rl0 + vtail1 ') + qrl + rl, vs0, ps0, owns0), markedp(rl0, ps), markedp(rl0, vs), markedp(rl0, ps0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, rl0.last, vs0), noidRely(tid, (rl0 + vtail1 ') + qrl, vs, (rl0 + vtail1 ') + qrl + rl, vs0), nonullRetRefs((rl0 + vtail1 ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs((rl0 + vtail1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(rl, vs0), unmarkedp(qrl, vs0), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), r0 ∈ (rl0 + vtail1 ') + qrl from rl0.last, vtail0 ∈ (rl0 + vtail1 ') + qrl + rl from vtail, rl0.last ∈ (rl0 + vtail1 ') + qrl + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ rl0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0 + qrl + rl), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl + rl), ¬ dups(rl0 + qrl), ¬ dups(rl), ¬ noid(tid, (rl0 + vtail1 ') + qrl + rl, rl0.last, vs0), ¬ phead0 ∈ qrl, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[rl0.last].next ≠ null ∧ vs0[vs0[rl0.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[rl0.last].next].deqID.tid)) = Claimed(vs0[vs0[rl0.last].next].deqID.tid, vs0[vs0[rl0.last].next].val), vtail = (vtail1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vtail1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vtail1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl0.last = vhead ∧ phead ≠ vtail1 ∧ unmarkedp(qrl, vs), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ rl ∨ phead0 ∈ rl0 + vtail1 ' from phead, phead ∈ rl0 ∨ phead = vtail1 ⊦ r0 ≠ vhead ∧ r0 ∈ (rl0 + vtail1 ') + qrl from vhead |
vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, rl0 = qrl0 + vhead0 ', vretRefs(tid) = vretRefs0(tid), phead0 ≠ vtail1, r0 ≠ vhead0, rl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl0 + vtail1 ') + qrl, vs, ps, vs0, ps0), listp((rl0 + vtail1 ') + qrl + rl, vs0, ps0, owns0), listp((rl0 + vtail1 ') + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(rl0, ps0), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl0 + vtail1 ') + qrl, vs, (rl0 + vtail1 ') + qrl + rl, vs0), nonullRetRefs((rl0 + vtail1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl0 + vtail1 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps[vtail1].deqID), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), unmarkedp(qrl, vs0), unmarkedp(rl, vs0), phead0 ∈ rl0, phead0 ∈ vs, phead0 ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (rl0 + vtail1 ') + qrl + rl from vhead, vtail0 ∈ (rl0 + vtail1 ') + qrl + rl from vtail, r0 ∈ (rl0 + vtail1 ') + qrl from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0 + qrl + rl), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl + rl), ¬ dups(rl0 + qrl), ¬ dups(rl), ¬ noid(tid, (rl0 + vtail1 ') + qrl + rl, vhead0, vs0), ¬ phead0 ∈ qrl, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl0 ∨ phead = vtail1, phead0 ∈ rl ∨ phead0 ∈ rl0 + vtail1 ' from phead, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ vhead0 = vhead ∧ phead ≠ vtail1 ∧ unmarkedp(qrl, vs), vtail0 = (vtail1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vtail1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (vtail1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ (rl0 + vtail1 ') + qrl from vhead
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl0, vhead0, y
| vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, rl0 = qrl0 + vhead0 ', vretRefs(tid) = vretRefs0(tid), phead0 ≠ vtail1, r0 ≠ vhead0, rl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl0 + vtail1 ') + qrl, vs, ps, vs0, ps0), listp((rl0 + vtail1 ') + qrl + rl, vs0, ps0, owns0), listp((rl0 + vtail1 ') + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(rl0, ps0), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl0 + vtail1 ') + qrl, vs, (rl0 + vtail1 ') + qrl + rl, vs0), nonullRetRefs((rl0 + vtail1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl0 + vtail1 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps[vtail1].deqID), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), unmarkedp(qrl, vs0), unmarkedp(rl, vs0), phead0 ∈ rl0, phead0 ∈ vs, phead0 ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (rl0 + vtail1 ') + qrl + rl from vhead, vtail0 ∈ (rl0 + vtail1 ') + qrl + rl from vtail, r0 ∈ (rl0 + vtail1 ') + qrl from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0 + qrl + rl), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl + rl), ¬ dups(rl0 + qrl), ¬ dups(rl), ¬ noid(tid, (rl0 + vtail1 ') + qrl + rl, vhead0, vs0), ¬ phead0 ∈ qrl, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl0 ∨ phead = vtail1, phead0 ∈ rl ∨ phead0 ∈ rl0 + vtail1 ' from phead, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ vhead0 = vhead ∧ phead ≠ vtail1 ∧ unmarkedp(qrl, vs), vtail0 = (vtail1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vtail1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (vtail1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ (rl0 + vtail1 ') + qrl from vhead |
vs[r0].deqID = Some(tid), ps0[vhead0].next = ps[vhead0].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), ps[vhead0].next ≠ vhead0, phead0 ≠ ps[vhead0].next, r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl, vs, ps, vs0, ps0), listp(((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl + rl, vs0, ps0, owns0), listp(((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl, vs, ps, owns), markedp(qrl0, vs0), markedp(qrl0, ps0), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, ((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl, vs, ((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl + rl, vs0), nonullRetRefs(((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), some?(vs0[ps[vhead0].next].deqID), some?(ps0[ps[vhead0].next].deqID), some?(vs[ps[vhead0].next].deqID), some?(ps[ps[vhead0].next].deqID), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), unmarkedp(qrl, vs0), unmarkedp(rl, vs0), phead0 ∈ vs, phead0 ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ ((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl + rl from vhead, vtail0 ∈ ((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(qrl0 + qrl), ¬ dups(qrl + rl), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl + rl), ¬ noid(tid, ((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl + rl, vhead0, vs0), ¬ ps[vhead0].next ∈ qrl0, ¬ phead0 ∈ qrl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ qrl0, ¬ ps[vhead0].next ∈ rl, ¬ ps[vhead0].next ∈ qrl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ qrl0 ∨ phead = vhead0 ∨ phead = ps[vhead0].next, r0 = ps[vhead0].next ∨ r0 ∈ qrl, phead0 ∈ qrl0 ∨ phead0 = vhead0, phead0 ∈ rl ∨ phead0 ∈ (qrl0 + vhead0 ') + ps[vhead0].next ' from phead, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (ps[vhead0].next ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (ps[vhead0].next ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (ps[vhead0].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (ps[vhead0].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ps[vhead0].next = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ vhead0 = vhead ∧ phead ≠ ps[vhead].next ∧ unmarkedp(qrl, vs) ⊦ r0 ≠ vhead ∧ r0 ∈ ((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (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) ⊦ 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)
| vs[r0].deqID = Some(tid), ps0[vhead0].next = ps[vhead0].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), ps[vhead0].next ≠ vhead0, phead0 ≠ ps[vhead0].next, r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl, vs, ps, vs0, ps0), listp(((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl + rl, vs0, ps0, owns0), listp(((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl, vs, ps, owns), markedp(qrl0, vs0), markedp(qrl0, ps0), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, ((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl, vs, ((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl + rl, vs0), nonullRetRefs(((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), some?(vs0[ps[vhead0].next].deqID), some?(ps0[ps[vhead0].next].deqID), some?(vs[ps[vhead0].next].deqID), some?(ps[ps[vhead0].next].deqID), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), unmarkedp(qrl, vs0), unmarkedp(rl, vs0), phead0 ∈ vs, phead0 ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ ((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl + rl from vhead, vtail0 ∈ ((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(qrl0 + qrl), ¬ dups(qrl + rl), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl + rl), ¬ noid(tid, ((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl + rl, vhead0, vs0), ¬ ps[vhead0].next ∈ qrl0, ¬ phead0 ∈ qrl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ qrl0, ¬ ps[vhead0].next ∈ rl, ¬ ps[vhead0].next ∈ qrl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ qrl0 ∨ phead = vhead0 ∨ phead = ps[vhead0].next, r0 = ps[vhead0].next ∨ r0 ∈ qrl, phead0 ∈ qrl0 ∨ phead0 = vhead0, phead0 ∈ rl ∨ phead0 ∈ (qrl0 + vhead0 ') + ps[vhead0].next ' from phead, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (ps[vhead0].next ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (ps[vhead0].next ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (ps[vhead0].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (ps[vhead0].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ps[vhead0].next = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ vhead0 = vhead ∧ phead ≠ ps[vhead].next ∧ unmarkedp(qrl, vs) ⊦ r0 ≠ vhead ∧ r0 ∈ ((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl from vhead |
vs[r0].deqID = Some(tid), ps0[vhead0].next = ps[vhead0].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), ps[vhead0].next ≠ vhead0, phead0 ≠ ps[vhead0].next, r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl, vs, ps, vs0, ps0), listp(((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl, vs, ps, owns), listp(((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl + rl, vs0, ps0, owns0), markedp(qrl0, ps), markedp(qrl0, vs), markedp(qrl0, ps0), markedp(qrl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, ((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl, vs, ((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl + rl, vs0), nonullRetRefs(((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[ps[vhead0].next].deqID), some?(vs[ps[vhead0].next].deqID), some?(ps0[ps[vhead0].next].deqID), some?(vs0[ps[vhead0].next].deqID), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(rl, vs0), unmarkedp(qrl, vs0), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), vtail0 ∈ ((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl + rl from vtail, vhead0 ∈ ((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps, phead0 ∈ vs, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(qrl0 + qrl), ¬ dups(qrl + rl), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl + rl), ¬ noid(tid, ((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl + rl, vhead0, vs0), ¬ r0 ∈ ((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl from vhead, ¬ ps[vhead0].next ∈ qrl0, ¬ phead0 ∈ qrl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ qrl0, ¬ ps[vhead0].next ∈ rl, ¬ ps[vhead0].next ∈ 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps[vhead0].next = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ vhead0 = vhead ∧ phead ≠ ps[vhead].next ∧ unmarkedp(qrl, vs), vtail = (ps[vhead0].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (ps[vhead0].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (ps[vhead0].next ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (ps[vhead0].next ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ rl ∨ phead0 ∈ (qrl0 + vhead0 ') + ps[vhead0].next ' from phead, phead0 ∈ qrl0 ∨ phead0 = vhead0, r0 = ps[vhead0].next ∨ r0 ∈ qrl, phead ∈ qrl0 ∨ phead = vhead0 ∨ phead = ps[vhead0].next ⊦
Used simplifier rules: ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]
| vs[r0].deqID = Some(tid), ps0[vhead0].next = ps[vhead0].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), ps[vhead0].next ≠ vhead0, phead0 ≠ ps[vhead0].next, r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl, vs, ps, vs0, ps0), listp(((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl, vs, ps, owns), listp(((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl + rl, vs0, ps0, owns0), markedp(qrl0, ps), markedp(qrl0, vs), markedp(qrl0, ps0), markedp(qrl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, ((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl, vs, ((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl + rl, vs0), nonullRetRefs(((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps[ps[vhead0].next].deqID), some?(vs[ps[vhead0].next].deqID), some?(ps0[ps[vhead0].next].deqID), some?(vs0[ps[vhead0].next].deqID), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(rl, vs0), unmarkedp(qrl, vs0), unmarkedp(qrl, ps), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), vtail0 ∈ ((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl + rl from vtail, vhead0 ∈ ((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps, phead0 ∈ vs, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(qrl0 + qrl), ¬ dups(qrl + rl), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(qrl0 + qrl + rl), ¬ noid(tid, ((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl + rl, vhead0, vs0), ¬ r0 ∈ ((qrl0 + vhead0 ') + ps[vhead0].next ') + qrl from vhead, ¬ ps[vhead0].next ∈ qrl0, ¬ phead0 ∈ qrl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ qrl0, ¬ ps[vhead0].next ∈ rl, ¬ ps[vhead0].next ∈ 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps[vhead0].next = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ vhead0 = vhead ∧ phead ≠ ps[vhead].next ∧ unmarkedp(qrl, vs), vtail = (ps[vhead0].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (ps[vhead0].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (ps[vhead0].next ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (ps[vhead0].next ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ rl ∨ phead0 ∈ (qrl0 + vhead0 ') + ps[vhead0].next ' from phead, phead0 ∈ qrl0 ∨ phead0 = vhead0, r0 = ps[vhead0].next ∨ r0 ∈ qrl, phead ∈ qrl0 ∨ phead = vhead0 ∨ phead = ps[vhead0].next ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
Used simplifier rules: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: (qrl0 + vhead0 ') + ps[vhead0].next ', qrl, vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| qrl + rl = rl0 + qrl0, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], r0 ≠ vhead0, rl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), r0 ∈ orl + qrl from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), rl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ rl0.last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead |
qrl + rl = rl0 + qrl0, vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], r0 ≠ vhead0, rl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl + qrl from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, rl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl + rl0.butlast ≠ [] ∧ (orl + rl0.butlast).last = vhead0 ∧ phead0 ≠ rl0.last ∧ unmarkedp(qrl0, vs0), vtail0 = (rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ y ≠ [] → (x + y).butlast = x + y.butlast; (s)
| qrl + rl = rl0 + qrl0, vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], r0 ≠ vhead0, rl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl + qrl from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, rl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl + rl0.butlast ≠ [] ∧ (orl + rl0.butlast).last = vhead0 ∧ phead0 ≠ rl0.last ∧ unmarkedp(qrl0, vs0), vtail0 = (rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead |
qrl + rl = rl0 + qrl0, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, rl0 = orl0 + vtail1 ', vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], r0 ≠ vhead0, rl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), r0 ∈ orl + qrl from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail1 = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ vtail1 ∧ unmarkedp(qrl0, vs0), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl0, vtail1, y
| qrl + rl = rl0 + qrl0, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, rl0 = orl0 + vtail1 ', vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], r0 ≠ vhead0, rl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), r0 ∈ orl + qrl from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail1 = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ vtail1 ∧ unmarkedp(qrl0, vs0), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead |
qrl + rl = (orl0 + vtail1 ') + qrl0, vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + orl0 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl0, vs0), markedp(orl, vs0), markedp(orl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + orl0 + vtail1 ') + qrl0, vs0), nonullRetRefs((orl + orl0 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + orl0 + vtail1 ') + qrl0 from vhead, vtail0 ∈ (orl + orl0 + vtail1 ') + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl + qrl from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + orl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl0), ¬ dups(qrl0), ¬ dups(orl0 + qrl0), ¬ dups(orl + orl0), ¬ noid(tid, (orl + orl0 + vtail1 ') + qrl0, vhead0, vs0), ¬ vtail1 ∈ orl, ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail1 = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ vtail1 ∧ unmarkedp(qrl0, vs0), phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = vtail1, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (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 ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (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)
| qrl + rl = (orl0 + vtail1 ') + qrl0, vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + orl0 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl0, vs0), markedp(orl, vs0), markedp(orl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + orl0 + vtail1 ') + qrl0, vs0), nonullRetRefs((orl + orl0 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + orl0 + vtail1 ') + qrl0 from vhead, vtail0 ∈ (orl + orl0 + vtail1 ') + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl + qrl from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + orl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl0), ¬ dups(qrl0), ¬ dups(orl0 + qrl0), ¬ dups(orl + orl0), ¬ noid(tid, (orl + orl0 + vtail1 ') + qrl0, vhead0, vs0), ¬ vtail1 ∈ orl, ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail1 = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ vtail1 ∧ unmarkedp(qrl0, vs0), phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = vtail1, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead |
qrl + rl = (orl0 + vtail1 ') + qrl0, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), vtail1 = vhead0, orl ≠ [], r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + orl0 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl, vs0), markedp(orl0, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + orl0 + vtail1 ') + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + orl0 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), r0 ∈ orl + qrl from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + orl0 + vtail1 ') + qrl0 from vtail, vhead0 ∈ (orl + orl0 + vtail1 ') + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + orl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl0), ¬ dups(qrl0), ¬ dups(orl0 + qrl0), ¬ dups(orl + orl0), ¬ noid(tid, (orl + orl0 + vtail1 ') + qrl0, vhead0, vs0), ¬ vtail1 ∈ orl, ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = vtail1, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid) ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead
qrl + rl = (orl0 + vtail1 ') + qrl0, vs[r0].deqID = Some(tid), (orl + orl0).last = vhead0, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl + orl0 ≠ [], orl ≠ [], phead0 ≠ vtail1, r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + orl0 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl, vs0), markedp(orl0, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + orl0 + vtail1 ') + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + orl0 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), r0 ∈ orl + qrl from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + orl0 + vtail1 ') + qrl0 from vtail, vhead0 ∈ (orl + orl0 + vtail1 ') + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + orl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl0), ¬ dups(qrl0), ¬ dups(orl0 + qrl0), ¬ dups(orl + orl0), ¬ noid(tid, (orl + orl0 + vtail1 ') + qrl0, vhead0, vs0), ¬ vtail1 ∈ orl, ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = vtail1, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid) ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead
| qrl + rl = (orl0 + vtail1 ') + qrl0, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), vtail1 = vhead0, orl ≠ [], r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + orl0 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl, vs0), markedp(orl0, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + orl0 + vtail1 ') + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + orl0 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), r0 ∈ orl + qrl from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + orl0 + vtail1 ') + qrl0 from vtail, vhead0 ∈ (orl + orl0 + vtail1 ') + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + orl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl0), ¬ dups(qrl0), ¬ dups(orl0 + qrl0), ¬ dups(orl + orl0), ¬ noid(tid, (orl + orl0 + vtail1 ') + qrl0, vhead0, vs0), ¬ vtail1 ∈ orl, ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = vtail1, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid) ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead |
qrl + rl = (orl0 + vhead0 ') + qrl0, vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + orl0 + vhead0 ') + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl0, vs0), markedp(orl, vs0), markedp(orl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + orl0 + vhead0 ') + qrl0, vs0), nonullRetRefs((orl + orl0 + vhead0 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + orl0 + vhead0 ') + qrl0 from vhead, vtail0 ∈ (orl + orl0 + vhead0 ') + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ qrl from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + orl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl0), ¬ dups(qrl0), ¬ dups(orl0 + qrl0), ¬ dups(orl + orl0), ¬ noid(tid, (orl + orl0 + vhead0 ') + qrl0, vhead0, vs0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ qrl0, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = vhead0, vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| qrl + rl = (orl0 + vhead0 ') + qrl0, vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + orl0 + vhead0 ') + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl0, vs0), markedp(orl, vs0), markedp(orl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + orl0 + vhead0 ') + qrl0, vs0), nonullRetRefs((orl + orl0 + vhead0 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + orl0 + vhead0 ') + qrl0 from vhead, vtail0 ∈ (orl + orl0 + vhead0 ') + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ qrl from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + orl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl0), ¬ dups(qrl0), ¬ dups(orl0 + qrl0), ¬ dups(orl + orl0), ¬ noid(tid, (orl + orl0 + vhead0 ') + qrl0, vhead0, vs0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ qrl0, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = vhead0, vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead |
qrl + rl = (orl0 + vhead0 ') + qrl0, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, qrl = vtail1 + orl1, vretRefs(tid) = vretRefs0(tid), orl ≠ [], qrl ≠ [], r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + orl0 + vhead0 ') + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl, vs0), markedp(orl0, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + orl0 + vhead0 ') + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + orl0 + vhead0 ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), r0 ∈ qrl from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + orl0 + vhead0 ') + qrl0 from vtail, vhead0 ∈ (orl + orl0 + vhead0 ') + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + orl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl0), ¬ dups(qrl0), ¬ dups(orl0 + qrl0), ¬ dups(orl + orl0), ¬ noid(tid, (orl + orl0 + vhead0 ') + qrl0, vhead0, vs0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = vhead0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(orl1, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid) ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead
Used simplifier rules: ⊦ [] + x = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ [] from r = []; (s) ⊦ ¬ a ∈ []; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, vtail1, y
| qrl + rl = (orl0 + vhead0 ') + qrl0, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, qrl = vtail1 + orl1, vretRefs(tid) = vretRefs0(tid), orl ≠ [], qrl ≠ [], r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + orl0 + vhead0 ') + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl, vs0), markedp(orl0, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + orl0 + vhead0 ') + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + orl0 + vhead0 ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), r0 ∈ qrl from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + orl0 + vhead0 ') + qrl0 from vtail, vhead0 ∈ (orl + orl0 + vhead0 ') + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + orl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl0), ¬ dups(qrl0), ¬ dups(orl0 + qrl0), ¬ dups(orl + orl0), ¬ noid(tid, (orl + orl0 + vhead0 ') + qrl0, vhead0, vs0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = vhead0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(orl1, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid) ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead |
(vtail1 ' + orl1) + rl = (orl0 + vhead0 ') + qrl0, ps[vtail1].deqID = None, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vtail1 ' + orl1, vs, ps, vs0, ps0), listp(orl + vtail1 ' + orl1, vs, ps, owns), listp((orl + orl0 + vhead0 ') + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl, vs0), markedp(orl0, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vtail1 ' + orl1, vs, (orl + orl0 + vhead0 ') + qrl0, vs0), nonullRetRefs(orl + vtail1 ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs((orl + orl0 + vhead0 ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(orl1, ps), unmarkedp(qrl0, ps0), r0 ∈ vtail1 ' + orl1 from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + orl0 + vhead0 ') + qrl0 from vtail, vhead0 ∈ (orl + orl0 + vhead0 ') + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl1), ¬ dups(orl), ¬ dups((orl + orl0) + qrl0), ¬ dups(orl + orl1), ¬ dups(orl + orl0), ¬ dups(orl0 + qrl0), ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(rl), ¬ noid(tid, (orl + orl0 + vhead0 ') + qrl0, vhead0, vs0), ¬ vtail1 ∈ orl1, ¬ vtail1 ∈ orl, ¬ vhead0 ∈ qrl0, ¬ 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vtail = (vtail1 ' + orl1).last ∨ vtail = (orl + (vtail1 ' + orl1).butlast).last ∧ vs[(vtail1 ' + orl1).last].deqID = None ∧ vs[(vtail1 ' + orl1).last].next = null, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail1].deqID = None ∧ unmarkedp(orl1, vs), phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = vhead0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail1 ∈ orl0 ∨ vtail1 = vhead0 ∨ vtail1 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vtail1 ' + orl1 from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ a + x = a ' + x; (s) ⊦ a ' + x ≠ []; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (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)
| (vtail1 ' + orl1) + rl = (orl0 + vhead0 ') + qrl0, ps[vtail1].deqID = None, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vtail1 ' + orl1, vs, ps, vs0, ps0), listp(orl + vtail1 ' + orl1, vs, ps, owns), listp((orl + orl0 + vhead0 ') + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl, vs0), markedp(orl0, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vtail1 ' + orl1, vs, (orl + orl0 + vhead0 ') + qrl0, vs0), nonullRetRefs(orl + vtail1 ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs((orl + orl0 + vhead0 ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(orl1, ps), unmarkedp(qrl0, ps0), r0 ∈ vtail1 ' + orl1 from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + orl0 + vhead0 ') + qrl0 from vtail, vhead0 ∈ (orl + orl0 + vhead0 ') + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl1), ¬ dups(orl), ¬ dups((orl + orl0) + qrl0), ¬ dups(orl + orl1), ¬ dups(orl + orl0), ¬ dups(orl0 + qrl0), ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(rl), ¬ noid(tid, (orl + orl0 + vhead0 ') + qrl0, vhead0, vs0), ¬ vtail1 ∈ orl1, ¬ vtail1 ∈ orl, ¬ vhead0 ∈ qrl0, ¬ 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vtail = (vtail1 ' + orl1).last ∨ vtail = (orl + (vtail1 ' + orl1).butlast).last ∧ vs[(vtail1 ' + orl1).last].deqID = None ∧ vs[(vtail1 ' + orl1).last].next = null, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail1].deqID = None ∧ unmarkedp(orl1, vs), phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = vhead0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail1 ∈ orl0 ∨ vtail1 = vhead0 ∨ vtail1 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vtail1 ' + orl1 from vhead |
(vtail1 ' + orl1) + rl = (orl0 + vhead0 ') + qrl0, vs[r0].deqID = Some(tid), ps[vtail1].deqID = None, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, orl0 = [], vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vtail1 ' + orl1, vs, ps, vs0, ps0), listp((orl + orl0 + vhead0 ') + qrl0, vs0, ps0, owns0), listp(orl + vtail1 ' + orl1, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl0, vs0), markedp(orl, vs0), markedp(orl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vtail1 ' + orl1, vs, (orl + orl0 + vhead0 ') + qrl0, vs0), nonullRetRefs((orl + orl0 + vhead0 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vtail1 ' + orl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), unmarkedp(qrl0, ps0), unmarkedp(orl1, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + orl0 + vhead0 ') + qrl0 from vhead, vtail0 ∈ (orl + orl0 + vhead0 ') + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ vtail1 ' + orl1 from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl1), ¬ dups(orl), ¬ dups((orl + orl0) + qrl0), ¬ dups(orl + orl1), ¬ dups(orl + orl0), ¬ dups(orl0 + qrl0), ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(rl), ¬ noid(tid, (orl + orl0 + vhead0 ') + qrl0, vhead0, vs0), ¬ vtail1 ∈ orl1, ¬ vtail1 ∈ orl, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail1 ∈ orl0 ∨ vtail1 = vhead0 ∨ vtail1 ∈ qrl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = vhead0, vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail1].deqID = None ∧ unmarkedp(orl1, vs), vtail = (vtail1 ' + orl1).last ∨ vtail = (orl + (vtail1 ' + orl1).butlast).last ∧ vs[(vtail1 ' + orl1).last].deqID = None ∧ vs[(vtail1 ' + orl1).last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vtail1 ' + orl1 from vhead
(vtail1 ' + orl1) + rl = (orl0 + vhead0 ') + qrl0, vs[r0].deqID = Some(tid), ps[vtail1].deqID = None, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, orl0 = vtail2 + orl2, vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vtail1 ' + orl1, vs, ps, vs0, ps0), listp((orl + orl0 + vhead0 ') + qrl0, vs0, ps0, owns0), listp(orl + vtail1 ' + orl1, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl0, vs0), markedp(orl, vs0), markedp(orl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vtail1 ' + orl1, vs, (orl + orl0 + vhead0 ') + qrl0, vs0), nonullRetRefs((orl + orl0 + vhead0 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vtail1 ' + orl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), unmarkedp(qrl0, ps0), unmarkedp(orl1, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + orl0 + vhead0 ') + qrl0 from vhead, vtail0 ∈ (orl + orl0 + vhead0 ') + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ vtail1 ' + orl1 from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl1), ¬ dups(orl), ¬ dups((orl + orl0) + qrl0), ¬ dups(orl + orl1), ¬ dups(orl + orl0), ¬ dups(orl0 + qrl0), ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(rl), ¬ noid(tid, (orl + orl0 + vhead0 ') + qrl0, vhead0, vs0), ¬ vtail1 ∈ orl1, ¬ vtail1 ∈ orl, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail1 ∈ orl0 ∨ vtail1 = vhead0 ∨ vtail1 ∈ qrl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = vhead0, vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail1].deqID = None ∧ unmarkedp(orl1, vs), vtail = (vtail1 ' + orl1).last ∨ vtail = (orl + (vtail1 ' + orl1).butlast).last ∧ vs[(vtail1 ' + orl1).last].deqID = None ∧ vs[(vtail1 ' + orl1).last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vtail1 ' + orl1 from vhead
Used simplifier rules: reflist freely generated by [], +;;
| (vtail1 ' + orl1) + rl = (orl0 + vhead0 ') + qrl0, vs[r0].deqID = Some(tid), ps[vtail1].deqID = None, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, orl0 = [], vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vtail1 ' + orl1, vs, ps, vs0, ps0), listp((orl + orl0 + vhead0 ') + qrl0, vs0, ps0, owns0), listp(orl + vtail1 ' + orl1, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl0, vs0), markedp(orl, vs0), markedp(orl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vtail1 ' + orl1, vs, (orl + orl0 + vhead0 ') + qrl0, vs0), nonullRetRefs((orl + orl0 + vhead0 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vtail1 ' + orl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), unmarkedp(qrl0, ps0), unmarkedp(orl1, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + orl0 + vhead0 ') + qrl0 from vhead, vtail0 ∈ (orl + orl0 + vhead0 ') + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ vtail1 ' + orl1 from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl1), ¬ dups(orl), ¬ dups((orl + orl0) + qrl0), ¬ dups(orl + orl1), ¬ dups(orl + orl0), ¬ dups(orl0 + qrl0), ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(rl), ¬ noid(tid, (orl + orl0 + vhead0 ') + qrl0, vhead0, vs0), ¬ vtail1 ∈ orl1, ¬ vtail1 ∈ orl, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail1 ∈ orl0 ∨ vtail1 = vhead0 ∨ vtail1 ∈ qrl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = vhead0, vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail1].deqID = None ∧ unmarkedp(orl1, vs), vtail = (vtail1 ' + orl1).last ∨ vtail = (orl + (vtail1 ' + orl1).butlast).last ∧ vs[(vtail1 ' + orl1).last].deqID = None ∧ vs[(vtail1 ' + orl1).last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vtail1 ' + orl1 from vhead |
vs[r0].deqID = Some(tid), ps[vhead0].deqID = None, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead0 ' + orl1, vs, ps, vs0, ps0), listp(orl + vhead0 ' + orl1 + rl, vs0, ps0, owns0), listp(orl + vhead0 ' + orl1, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vhead0 ' + orl1, vs, orl + vhead0 ' + orl1 + rl, vs0), nonullRetRefs(orl + vhead0 ' + orl1 + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vhead0 ' + orl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), unmarkedp(orl1, ps0), unmarkedp(rl, ps0), unmarkedp(orl1, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ orl + vhead0 ' + orl1 + rl from vhead, vtail0 ∈ orl + vhead0 ' + orl1 + rl from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl1, r0 ∈ vs, r0 ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + orl1 + rl), ¬ dups(orl), ¬ dups(orl1 + rl), ¬ dups(orl + orl1), ¬ dups(rl), ¬ dups(orl1), ¬ noid(tid, orl + vhead0 ' + orl1 + rl, vhead0, vs0), ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl, orl1 + rl ≠ [] → unmarkedp((orl1 + rl).tail, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl ∨ phead0 = vhead0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (vhead0 ' + orl1 + rl).last ∨ orl1 + rl ≠ [] ∧ vtail0 = (vhead0 ' + (orl1 + rl).butlast).last ∧ vs0[(orl1 + rl).last].deqID = None ∧ vs0[(orl1 + rl).last].next = null, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl1, vs), phead0 ∈ orl from phead ∨ phead0 = vhead0 ∨ phead0 ∈ orl1 ∨ phead0 ∈ rl, vtail = orl1.last ∨ vtail = (orl + (vhead0 ' + orl1).butlast).last ∧ vs[orl1.last].deqID = None ∧ vs[orl1.last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vhead0 ' + orl1 from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] 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 ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) ⊦ markedp([], vs); (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)
| vs[r0].deqID = Some(tid), ps[vhead0].deqID = None, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead0 ' + orl1, vs, ps, vs0, ps0), listp(orl + vhead0 ' + orl1 + rl, vs0, ps0, owns0), listp(orl + vhead0 ' + orl1, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vhead0 ' + orl1, vs, orl + vhead0 ' + orl1 + rl, vs0), nonullRetRefs(orl + vhead0 ' + orl1 + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vhead0 ' + orl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), unmarkedp(orl1, ps0), unmarkedp(rl, ps0), unmarkedp(orl1, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ orl + vhead0 ' + orl1 + rl from vhead, vtail0 ∈ orl + vhead0 ' + orl1 + rl from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl1, r0 ∈ vs, r0 ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + orl1 + rl), ¬ dups(orl), ¬ dups(orl1 + rl), ¬ dups(orl + orl1), ¬ dups(rl), ¬ dups(orl1), ¬ noid(tid, orl + vhead0 ' + orl1 + rl, vhead0, vs0), ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl, orl1 + rl ≠ [] → unmarkedp((orl1 + rl).tail, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl ∨ phead0 = vhead0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (vhead0 ' + orl1 + rl).last ∨ orl1 + rl ≠ [] ∧ vtail0 = (vhead0 ' + (orl1 + rl).butlast).last ∧ vs0[(orl1 + rl).last].deqID = None ∧ vs0[(orl1 + rl).last].next = null, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl1, vs), phead0 ∈ orl from phead ∨ phead0 = vhead0 ∨ phead0 ∈ orl1 ∨ phead0 ∈ rl, vtail = orl1.last ∨ vtail = (orl + (vhead0 ' + orl1).butlast).last ∧ vs[orl1.last].deqID = None ∧ vs[orl1.last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vhead0 ' + orl1 from vhead |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
ps[vhead0].deqID = None, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead0 ' + orl1, vs, ps, vs0, ps0), listp(orl + vhead0 ' + orl1, vs, ps, owns), listp(orl + vhead0 ' + orl1 + rl, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vhead0 ' + orl1, vs, orl + vhead0 ' + orl1 + rl, vs0), nonullRetRefs(orl + vhead0 ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs(orl + vhead0 ' + orl1 + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(orl1, ps), unmarkedp(rl, ps0), unmarkedp(orl1, ps0), r0 ∈ ps, r0 ∈ vs, r0 ∈ orl1, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ orl + vhead0 ' + orl1 + rl from vtail, vhead0 ∈ orl + vhead0 ' + orl1 + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + orl1 + rl), ¬ dups(orl), ¬ dups(orl1 + rl), ¬ dups(orl + orl1), ¬ dups(rl), ¬ dups(orl1), ¬ noid(tid, orl + vhead0 ' + orl1 + rl, vhead0, vs0), ¬ vhead ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl1 + rl ≠ [] → unmarkedp((orl1 + rl).tail, vs0), vtail = orl1.last ∨ vtail = (orl + (vhead0 ' + orl1).butlast).last ∧ vs[orl1.last].deqID = None ∧ vs[orl1.last].next = null, phead0 ∈ orl from phead ∨ phead0 = vhead0 ∨ phead0 ∈ orl1 ∨ phead0 ∈ rl, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl1, vs), vtail0 = (vhead0 ' + orl1 + rl).last ∨ orl1 + rl ≠ [] ∧ vtail0 = (vhead0 ' + (orl1 + rl).butlast).last ∧ vs0[(orl1 + rl).last].deqID = None ∧ vs0[(orl1 + rl).last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 = vhead0 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vhead0 ' + orl1 from vhead
Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ y → a ∈ x + y; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ ⊦ a ∈ x ∧ a ∈ y → dups(x + y); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: orl, vhead0 ' + orl1 + rl, vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| ps[vhead0].deqID = None, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead0 ' + orl1, vs, ps, vs0, ps0), listp(orl + vhead0 ' + orl1, vs, ps, owns), listp(orl + vhead0 ' + orl1 + rl, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vhead0 ' + orl1, vs, orl + vhead0 ' + orl1 + rl, vs0), nonullRetRefs(orl + vhead0 ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs(orl + vhead0 ' + orl1 + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(orl1, ps), unmarkedp(rl, ps0), unmarkedp(orl1, ps0), r0 ∈ ps, r0 ∈ vs, r0 ∈ orl1, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ orl + vhead0 ' + orl1 + rl from vtail, vhead0 ∈ orl + vhead0 ' + orl1 + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + orl1 + rl), ¬ dups(orl), ¬ dups(orl1 + rl), ¬ dups(orl + orl1), ¬ dups(rl), ¬ dups(orl1), ¬ noid(tid, orl + vhead0 ' + orl1 + rl, vhead0, vs0), ¬ vhead ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl1 + rl ≠ [] → unmarkedp((orl1 + rl).tail, vs0), vtail = orl1.last ∨ vtail = (orl + (vhead0 ' + orl1).butlast).last ∧ vs[orl1.last].deqID = None ∧ vs[orl1.last].next = null, phead0 ∈ orl from phead ∨ phead0 = vhead0 ∨ phead0 ∈ orl1 ∨ phead0 ∈ rl, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl1, vs), vtail0 = (vhead0 ' + orl1 + rl).last ∨ orl1 + rl ≠ [] ∧ vtail0 = (vhead0 ' + (orl1 + rl).butlast).last ∧ vs0[(orl1 + rl).last].deqID = None ∧ vs0[(orl1 + rl).last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 = vhead0 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vhead0 ' + orl1 from vhead |
ps[vhead0].deqID = None, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, r0 ≠ vhead, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead0 ' + orl1, vs, ps, vs0, ps0), listp(orl + vhead0 ' + orl1, vs, ps, owns), listp(orl + vhead0 ' + orl1 + rl, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vhead0 ' + orl1, vs, orl + vhead0 ' + orl1 + rl, vs0), nonullRetRefs(orl + vhead0 ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs(orl + vhead0 ' + orl1 + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(orl1, ps), unmarkedp(rl, ps0), unmarkedp(orl1, ps0), vhead0 ∈ vhead0 ' + orl1 + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, r0 ∈ ps, r0 ∈ vs, r0 ∈ orl1, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ orl + vhead0 ' + orl1 + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(orl1), ¬ dups(rl), ¬ dups(orl + orl1), ¬ dups(orl1 + rl), ¬ dups(orl), ¬ dups(orl + orl1 + rl), ¬ noid(tid, orl + vhead0 ' + orl1 + rl, vhead0, vs0), ¬ vhead0 ∈ rl, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead ∈ orl, ¬ r0 ∈ vhead0 ' + orl1 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl1 + rl ≠ [] → unmarkedp((orl1 + rl).tail, vs0), vtail = orl1.last ∨ vtail = (orl + (vhead0 ' + orl1).butlast).last ∧ vs[orl1.last].deqID = None ∧ vs[orl1.last].next = null, phead0 ∈ orl from phead ∨ phead0 = vhead0 ∨ phead0 ∈ orl1 ∨ phead0 ∈ rl, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl1, vs), vtail0 = (vhead0 ' + orl1 + rl).last ∨ orl1 + rl ≠ [] ∧ vtail0 = (vhead0 ' + (orl1 + rl).butlast).last ∧ vs0[(orl1 + rl).last].deqID = None ∧ vs0[(orl1 + rl).last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 = vhead0 ⊦
Used simplifier rules: ⊦ r ∈ rl from r0 → r ∈ rl; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| ps[vhead0].deqID = None, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, r0 ≠ vhead, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead0 ' + orl1, vs, ps, vs0, ps0), listp(orl + vhead0 ' + orl1, vs, ps, owns), listp(orl + vhead0 ' + orl1 + rl, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vhead0 ' + orl1, vs, orl + vhead0 ' + orl1 + rl, vs0), nonullRetRefs(orl + vhead0 ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs(orl + vhead0 ' + orl1 + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(orl1, ps), unmarkedp(rl, ps0), unmarkedp(orl1, ps0), vhead0 ∈ vhead0 ' + orl1 + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, r0 ∈ ps, r0 ∈ vs, r0 ∈ orl1, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ orl + vhead0 ' + orl1 + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(orl1), ¬ dups(rl), ¬ dups(orl + orl1), ¬ dups(orl1 + rl), ¬ dups(orl), ¬ dups(orl + orl1 + rl), ¬ noid(tid, orl + vhead0 ' + orl1 + rl, vhead0, vs0), ¬ vhead0 ∈ rl, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead ∈ orl, ¬ r0 ∈ vhead0 ' + orl1 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl1 + rl ≠ [] → unmarkedp((orl1 + rl).tail, vs0), vtail = orl1.last ∨ vtail = (orl + (vhead0 ' + orl1).butlast).last ∧ vs[orl1.last].deqID = None ∧ vs[orl1.last].next = null, phead0 ∈ orl from phead ∨ phead0 = vhead0 ∨ phead0 ∈ orl1 ∨ phead0 ∈ rl, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl1, vs), vtail0 = (vhead0 ' + orl1 + rl).last ∨ orl1 + rl ≠ [] ∧ vtail0 = (vhead0 ' + (orl1 + rl).butlast).last ∧ vs0[(orl1 + rl).last].deqID = None ∧ vs0[(orl1 + rl).last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 = vhead0 ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
vs[r0].deqID = Some(tid), ps[vhead0].deqID = None, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, r0 ≠ vhead, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead0 ' + orl1, vs, ps, vs0, ps0), listp(orl + vhead0 ' + orl1 + rl, vs0, ps0, owns0), listp(orl + vhead0 ' + orl1, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vhead0 ' + orl1, vs, orl + vhead0 ' + orl1 + rl, vs0), nonullRetRefs(orl + vhead0 ' + orl1 + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vhead0 ' + orl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), unmarkedp(orl1, ps0), unmarkedp(rl, ps0), unmarkedp(orl1, ps), vtail0 ∈ orl + vhead0 ' + orl1 + rl from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl1, r0 ∈ vs, r0 ∈ ps, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ vhead0 ' + orl1 + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(orl1), ¬ dups(rl), ¬ dups(orl + orl1), ¬ dups(orl1 + rl), ¬ dups(orl), ¬ dups(orl + orl1 + rl), ¬ noid(tid, orl + vhead0 ' + orl1 + rl, vhead0, vs0), ¬ vhead ∈ vhead0 ', ¬ vhead0 ∈ rl, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead ∈ orl, ¬ r0 ∈ vhead0 ' + orl1 from vhead, orl1 + rl ≠ [] → unmarkedp((orl1 + rl).tail, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl ∨ phead0 = vhead0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (vhead0 ' + orl1 + rl).last ∨ orl1 + rl ≠ [] ∧ vtail0 = (vhead0 ' + (orl1 + rl).butlast).last ∧ vs0[(orl1 + rl).last].deqID = None ∧ vs0[(orl1 + rl).last].next = null, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl1, vs), phead0 ∈ orl from phead ∨ phead0 = vhead0 ∨ phead0 ∈ orl1 ∨ phead0 ∈ rl, vtail = orl1.last ∨ vtail = (orl + (vhead0 ' + orl1).butlast).last ∧ vs[orl1.last].deqID = None ∧ vs[orl1.last].next = null ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: vhead0 ', orl1 + rl, vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs[r0].deqID = Some(tid), ps[vhead0].deqID = None, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, r0 ≠ vhead, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead0 ' + orl1, vs, ps, vs0, ps0), listp(orl + vhead0 ' + orl1 + rl, vs0, ps0, owns0), listp(orl + vhead0 ' + orl1, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vhead0 ' + orl1, vs, orl + vhead0 ' + orl1 + rl, vs0), nonullRetRefs(orl + vhead0 ' + orl1 + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vhead0 ' + orl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), unmarkedp(orl1, ps0), unmarkedp(rl, ps0), unmarkedp(orl1, ps), vtail0 ∈ orl + vhead0 ' + orl1 + rl from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl1, r0 ∈ vs, r0 ∈ ps, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ vhead0 ' + orl1 + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(orl1), ¬ dups(rl), ¬ dups(orl + orl1), ¬ dups(orl1 + rl), ¬ dups(orl), ¬ dups(orl + orl1 + rl), ¬ noid(tid, orl + vhead0 ' + orl1 + rl, vhead0, vs0), ¬ vhead ∈ vhead0 ', ¬ vhead0 ∈ rl, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead ∈ orl, ¬ r0 ∈ vhead0 ' + orl1 from vhead, orl1 + rl ≠ [] → unmarkedp((orl1 + rl).tail, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl ∨ phead0 = vhead0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (vhead0 ' + orl1 + rl).last ∨ orl1 + rl ≠ [] ∧ vtail0 = (vhead0 ' + (orl1 + rl).butlast).last ∧ vs0[(orl1 + rl).last].deqID = None ∧ vs0[(orl1 + rl).last].next = null, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl1, vs), phead0 ∈ orl from phead ∨ phead0 = vhead0 ∨ phead0 ∈ orl1 ∨ phead0 ∈ rl, vtail = orl1.last ∨ vtail = (orl + (vhead0 ' + orl1).butlast).last ∧ vs[orl1.last].deqID = None ∧ vs[orl1.last].next = null ⊦ |
ps[vhead0].deqID = None, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, r0 ≠ vhead, vhead ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead0 ' + orl1, vs, ps, vs0, ps0), listp(orl + vhead0 ' + orl1, vs, ps, owns), listp(orl + vhead0 ' + orl1 + rl, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vhead0 ' + orl1, vs, orl + vhead0 ' + orl1 + rl, vs0), nonullRetRefs(orl + vhead0 ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs(orl + vhead0 ' + orl1 + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(orl1, ps), unmarkedp(rl, ps0), unmarkedp(orl1, ps0), phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, r0 ∈ ps, r0 ∈ vs, r0 ∈ orl1, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ orl + vhead0 ' + orl1 + rl from vtail, vhead0 ∈ orl1 + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(orl1), ¬ dups(rl), ¬ dups(orl + orl1), ¬ dups(orl1 + rl), ¬ dups(orl), ¬ dups(orl + orl1 + rl), ¬ noid(tid, orl + vhead0 ' + orl1 + rl, vhead0, vs0), ¬ vhead0 ∈ rl, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead ∈ orl, ¬ r0 ∈ orl1 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl1 + rl ≠ [] → unmarkedp((orl1 + rl).tail, vs0), vtail = orl1.last ∨ vtail = (orl + (vhead0 ' + orl1).butlast).last ∧ vs[orl1.last].deqID = None ∧ vs[orl1.last].next = null, phead0 ∈ orl from phead ∨ phead0 = vhead0 ∨ phead0 ∈ orl1 ∨ phead0 ∈ rl, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl1, vs), vtail0 = (vhead0 ' + orl1 + rl).last ∨ orl1 + rl ≠ [] ∧ vtail0 = (vhead0 ' + (orl1 + rl).butlast).last ∧ vs0[(orl1 + rl).last].deqID = None ∧ vs0[(orl1 + rl).last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 = vhead0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| ps[vhead0].deqID = None, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, r0 ≠ vhead, vhead ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead0 ' + orl1, vs, ps, vs0, ps0), listp(orl + vhead0 ' + orl1, vs, ps, owns), listp(orl + vhead0 ' + orl1 + rl, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vhead0 ' + orl1, vs, orl + vhead0 ' + orl1 + rl, vs0), nonullRetRefs(orl + vhead0 ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs(orl + vhead0 ' + orl1 + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(orl1, ps), unmarkedp(rl, ps0), unmarkedp(orl1, ps0), phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, r0 ∈ ps, r0 ∈ vs, r0 ∈ orl1, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ orl + vhead0 ' + orl1 + rl from vtail, vhead0 ∈ orl1 + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(orl1), ¬ dups(rl), ¬ dups(orl + orl1), ¬ dups(orl1 + rl), ¬ dups(orl), ¬ dups(orl + orl1 + rl), ¬ noid(tid, orl + vhead0 ' + orl1 + rl, vhead0, vs0), ¬ vhead0 ∈ rl, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead ∈ orl, ¬ r0 ∈ orl1 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl1 + rl ≠ [] → unmarkedp((orl1 + rl).tail, vs0), vtail = orl1.last ∨ vtail = (orl + (vhead0 ' + orl1).butlast).last ∧ vs[orl1.last].deqID = None ∧ vs[orl1.last].next = null, phead0 ∈ orl from phead ∨ phead0 = vhead0 ∨ phead0 ∈ orl1 ∨ phead0 ∈ rl, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl1, vs), vtail0 = (vhead0 ' + orl1 + rl).last ∨ orl1 + rl ≠ [] ∧ vtail0 = (vhead0 ' + (orl1 + rl).butlast).last ∧ vs0[(orl1 + rl).last].deqID = None ∧ vs0[(orl1 + rl).last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 = vhead0 ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ∈ rl from r0 → r ∈ rl; (ss) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) Used terms: orl1, rl, vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| (vtail1 ' + orl1) + rl = (orl0 + vhead0 ') + qrl0, vs[r0].deqID = Some(tid), ps[vtail1].deqID = None, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, orl0 = vtail2 + orl2, vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vtail1 ' + orl1, vs, ps, vs0, ps0), listp((orl + orl0 + vhead0 ') + qrl0, vs0, ps0, owns0), listp(orl + vtail1 ' + orl1, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl0, vs0), markedp(orl, vs0), markedp(orl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vtail1 ' + orl1, vs, (orl + orl0 + vhead0 ') + qrl0, vs0), nonullRetRefs((orl + orl0 + vhead0 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vtail1 ' + orl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), unmarkedp(qrl0, ps0), unmarkedp(orl1, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + orl0 + vhead0 ') + qrl0 from vhead, vtail0 ∈ (orl + orl0 + vhead0 ') + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ vtail1 ' + orl1 from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl1), ¬ dups(orl), ¬ dups((orl + orl0) + qrl0), ¬ dups(orl + orl1), ¬ dups(orl + orl0), ¬ dups(orl0 + qrl0), ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(rl), ¬ noid(tid, (orl + orl0 + vhead0 ') + qrl0, vhead0, vs0), ¬ vtail1 ∈ orl1, ¬ vtail1 ∈ orl, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail1 ∈ orl0 ∨ vtail1 = vhead0 ∨ vtail1 ∈ qrl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = vhead0, vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail1].deqID = None ∧ unmarkedp(orl1, vs), vtail = (vtail1 ' + orl1).last ∨ vtail = (orl + (vtail1 ' + orl1).butlast).last ∧ vs[(vtail1 ' + orl1).last].deqID = None ∧ vs[(vtail1 ' + orl1).last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vtail1 ' + orl1 from vhead |
orl1 + rl = orl2 + vhead0 ' + qrl0, vs[r0].deqID = Some(tid), ps[vtail2].deqID = None, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, vhead0 ≠ vtail2, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vtail2 ' + orl1, vs, ps, vs0, ps0), listp(orl + (vtail2 ' + orl2) + vhead0 ' + qrl0, vs0, ps0, owns0), listp(orl + vtail2 ' + orl1, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl2, vs0), markedp(orl, vs0), markedp(orl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vtail2 ' + orl1, vs, orl + (vtail2 ' + orl2) + vhead0 ' + qrl0, vs0), nonullRetRefs(orl + (vtail2 ' + orl2) + vhead0 ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vtail2 ' + orl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail2].deqID), some?(ps0[vtail2].deqID), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), unmarkedp(qrl0, ps0), unmarkedp(orl1, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ orl + (vtail2 ' + orl2) + vhead0 ' + qrl0 from vhead, vtail0 ∈ orl + (vtail2 ' + orl2) + vhead0 ' + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl1 from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ dups(orl2), ¬ dups(rl), ¬ dups(orl + orl1), ¬ dups(orl + orl2 + qrl0), ¬ dups(orl1), ¬ noid(tid, orl + (vtail2 ' + orl2) + vhead0 ' + qrl0, vhead0, vs0), ¬ vhead0 ∈ orl2, ¬ vhead0 ∈ qrl0, ¬ vtail2 ∈ orl1, ¬ vtail2 ∈ qrl0, ¬ vtail2 ∈ orl2, ¬ vtail2 ∈ orl, ¬ vhead0 ∈ orl, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl ∨ phead0 = vtail2 ∨ phead0 ∈ orl2 ∨ phead0 = vhead0, phead0 ∈ orl from phead ∨ phead0 = vtail2 ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail2].deqID = None ∧ unmarkedp(orl1, vs), vtail = (vtail2 ' + orl1).last ∨ vtail = (orl + (vtail2 ' + orl1).butlast).last ∧ vs[(vtail2 ' + orl1).last].deqID = None ∧ vs[(vtail2 ' + orl1).last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vtail2 ' + orl1 from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ 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 ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (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) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)
| orl1 + rl = orl2 + vhead0 ' + qrl0, vs[r0].deqID = Some(tid), ps[vtail2].deqID = None, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, vhead0 ≠ vtail2, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vtail2 ' + orl1, vs, ps, vs0, ps0), listp(orl + (vtail2 ' + orl2) + vhead0 ' + qrl0, vs0, ps0, owns0), listp(orl + vtail2 ' + orl1, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl2, vs0), markedp(orl, vs0), markedp(orl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vtail2 ' + orl1, vs, orl + (vtail2 ' + orl2) + vhead0 ' + qrl0, vs0), nonullRetRefs(orl + (vtail2 ' + orl2) + vhead0 ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vtail2 ' + orl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail2].deqID), some?(ps0[vtail2].deqID), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), unmarkedp(qrl0, ps0), unmarkedp(orl1, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ orl + (vtail2 ' + orl2) + vhead0 ' + qrl0 from vhead, vtail0 ∈ orl + (vtail2 ' + orl2) + vhead0 ' + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl1 from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ dups(orl2), ¬ dups(rl), ¬ dups(orl + orl1), ¬ dups(orl + orl2 + qrl0), ¬ dups(orl1), ¬ noid(tid, orl + (vtail2 ' + orl2) + vhead0 ' + qrl0, vhead0, vs0), ¬ vhead0 ∈ orl2, ¬ vhead0 ∈ qrl0, ¬ vtail2 ∈ orl1, ¬ vtail2 ∈ qrl0, ¬ vtail2 ∈ orl2, ¬ vtail2 ∈ orl, ¬ vhead0 ∈ orl, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl ∨ phead0 = vtail2 ∨ phead0 ∈ orl2 ∨ phead0 = vhead0, phead0 ∈ orl from phead ∨ phead0 = vtail2 ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail2].deqID = None ∧ unmarkedp(orl1, vs), vtail = (vtail2 ' + orl1).last ∨ vtail = (orl + (vtail2 ' + orl1).butlast).last ∧ vs[(vtail2 ' + orl1).last].deqID = None ∧ vs[(vtail2 ' + orl1).last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vtail2 ' + orl1 from vhead |
orl1 + rl = orl2 + vhead0 ' + qrl0, ps[vtail2].deqID = None, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, orl = qrl + phead1 ', vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, vhead0 ≠ vtail2, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vtail2 ' + orl1, vs, ps, vs0, ps0), listp(orl + vtail2 ' + orl1, vs, ps, owns), listp(orl + (vtail2 ' + orl2) + vhead0 ' + qrl0, vs0, ps0, owns0), markedp(orl2, ps0), markedp(orl, vs0), markedp(orl2, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vtail2 ' + orl1, vs, orl + (vtail2 ' + orl2) + vhead0 ' + qrl0, vs0), nonullRetRefs(orl + vtail2 ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs(orl + (vtail2 ' + orl2) + vhead0 ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), some?(ps0[vtail2].deqID), some?(vs0[vtail2].deqID), unmarkedp(orl1, ps), unmarkedp(qrl0, ps0), r0 ∈ orl1 from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ orl + (vtail2 ' + orl2) + vhead0 ' + qrl0 from vtail, vhead0 ∈ orl + (vtail2 ' + orl2) + vhead0 ' + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ dups(orl2), ¬ dups(rl), ¬ dups(orl + orl1), ¬ dups(orl + orl2 + qrl0), ¬ dups(orl1), ¬ noid(tid, orl + (vtail2 ' + orl2) + vhead0 ' + qrl0, vhead0, vs0), ¬ vhead0 ∈ orl2, ¬ vhead0 ∈ qrl0, ¬ vtail2 ∈ orl1, ¬ vtail2 ∈ qrl0, ¬ vtail2 ∈ orl2, ¬ vtail2 ∈ orl, ¬ vhead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vtail = (vtail2 ' + orl1).last ∨ vtail = (orl + (vtail2 ' + orl1).butlast).last ∧ vs[(vtail2 ' + orl1).last].deqID = None ∧ vs[(vtail2 ' + orl1).last].next = null, phead1 = vhead ∧ unmarkedp(orl1, vs) ∨ qrl ≠ [] ∧ qrl.last = vhead ∧ phead ≠ phead1 ∧ vs[vtail2].deqID = None ∧ unmarkedp(orl1, vs), vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl from phead ∨ phead0 = vtail2 ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 = vtail2 ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vtail2 ' + orl1 from vhead
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, phead1, y
| orl1 + rl = orl2 + vhead0 ' + qrl0, ps[vtail2].deqID = None, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, orl = qrl + phead1 ', vretRefs(tid) = vretRefs0(tid), orl ≠ [], r0 ≠ vhead0, vhead0 ≠ vtail2, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vtail2 ' + orl1, vs, ps, vs0, ps0), listp(orl + vtail2 ' + orl1, vs, ps, owns), listp(orl + (vtail2 ' + orl2) + vhead0 ' + qrl0, vs0, ps0, owns0), markedp(orl2, ps0), markedp(orl, vs0), markedp(orl2, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vtail2 ' + orl1, vs, orl + (vtail2 ' + orl2) + vhead0 ' + qrl0, vs0), nonullRetRefs(orl + vtail2 ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs(orl + (vtail2 ' + orl2) + vhead0 ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), some?(ps0[vtail2].deqID), some?(vs0[vtail2].deqID), unmarkedp(orl1, ps), unmarkedp(qrl0, ps0), r0 ∈ orl1 from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ orl + (vtail2 ' + orl2) + vhead0 ' + qrl0 from vtail, vhead0 ∈ orl + (vtail2 ' + orl2) + vhead0 ' + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ dups(orl2), ¬ dups(rl), ¬ dups(orl + orl1), ¬ dups(orl + orl2 + qrl0), ¬ dups(orl1), ¬ noid(tid, orl + (vtail2 ' + orl2) + vhead0 ' + qrl0, vhead0, vs0), ¬ vhead0 ∈ orl2, ¬ vhead0 ∈ qrl0, ¬ vtail2 ∈ orl1, ¬ vtail2 ∈ qrl0, ¬ vtail2 ∈ orl2, ¬ vtail2 ∈ orl, ¬ vhead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vtail = (vtail2 ' + orl1).last ∨ vtail = (orl + (vtail2 ' + orl1).butlast).last ∧ vs[(vtail2 ' + orl1).last].deqID = None ∧ vs[(vtail2 ' + orl1).last].next = null, phead1 = vhead ∧ unmarkedp(orl1, vs) ∨ qrl ≠ [] ∧ qrl.last = vhead ∧ phead ≠ phead1 ∧ vs[vtail2].deqID = None ∧ unmarkedp(orl1, vs), vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl from phead ∨ phead0 = vtail2 ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 = vtail2 ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vtail2 ' + orl1 from vhead |
orl1 + rl = orl2 + vhead0 ' + qrl0, ps[ps0[phead1].next].deqID = None, vs[r0].deqID = Some(tid), ps[phead1].next = ps0[phead1].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), ps0[phead1].next ≠ phead1, r0 ≠ vhead0, vhead0 ≠ phead1, vhead0 ≠ ps0[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, ps, vs0, ps0), listp((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, ps, owns), listp((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(orl2, vs0), markedp(qrl, ps), markedp(qrl, vs), markedp(qrl, ps0), markedp(orl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0), nonullRetRefs((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), some?(ps0[ps0[phead1].next].deqID), some?(vs0[ps0[phead1].next].deqID), unmarkedp(orl1, ps), unmarkedp(qrl0, ps0), r0 ∈ orl1 from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, vtail0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0 from vtail, vhead0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl2), ¬ dups(orl1), ¬ dups(qrl0), ¬ dups(qrl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(qrl), ¬ dups(qrl + orl2 + qrl0), ¬ dups(qrl + orl1), ¬ dups(rl), ¬ noid(tid, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vhead0, vs0), ¬ vhead0 ∈ qrl, ¬ ps0[phead1].next ∈ qrl, ¬ ps0[phead1].next ∈ orl2, ¬ ps0[phead1].next ∈ qrl0, ¬ ps0[phead1].next ∈ orl1, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl2, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl1, ¬ phead1 ∈ orl2, ¬ phead1 ∈ 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vtail = (ps0[phead1].next ' + orl1).last ∨ vtail = (phead1 ' + (ps0[phead1].next ' + orl1).butlast).last ∧ vs[(ps0[phead1].next ' + orl1).last].deqID = None ∧ vs[(ps0[phead1].next ' + orl1).last].next = null, phead0 ∈ qrl ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0, phead ∈ qrl ∨ phead = phead1, phead1 = vhead ∧ unmarkedp(orl1, vs) ∨ qrl ≠ [] ∧ qrl.last = vhead ∧ phead ≠ phead1 ∧ vs[ps0[phead1].next].deqID = None ∧ unmarkedp(orl1, vs), vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ qrl + phead1 ' from phead ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ (qrl + phead1 ') + ps0[phead1].next ' + orl1 from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| orl1 + rl = orl2 + vhead0 ' + qrl0, ps[ps0[phead1].next].deqID = None, vs[r0].deqID = Some(tid), ps[phead1].next = ps0[phead1].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), ps0[phead1].next ≠ phead1, r0 ≠ vhead0, vhead0 ≠ phead1, vhead0 ≠ ps0[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, ps, vs0, ps0), listp((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, ps, owns), listp((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(orl2, vs0), markedp(qrl, ps), markedp(qrl, vs), markedp(qrl, ps0), markedp(orl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0), nonullRetRefs((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), some?(ps0[ps0[phead1].next].deqID), some?(vs0[ps0[phead1].next].deqID), unmarkedp(orl1, ps), unmarkedp(qrl0, ps0), r0 ∈ orl1 from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, vtail0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0 from vtail, vhead0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl2), ¬ dups(orl1), ¬ dups(qrl0), ¬ dups(qrl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(qrl), ¬ dups(qrl + orl2 + qrl0), ¬ dups(qrl + orl1), ¬ dups(rl), ¬ noid(tid, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vhead0, vs0), ¬ vhead0 ∈ qrl, ¬ ps0[phead1].next ∈ qrl, ¬ ps0[phead1].next ∈ orl2, ¬ ps0[phead1].next ∈ qrl0, ¬ ps0[phead1].next ∈ orl1, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl2, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl1, ¬ phead1 ∈ orl2, ¬ phead1 ∈ 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vtail = (ps0[phead1].next ' + orl1).last ∨ vtail = (phead1 ' + (ps0[phead1].next ' + orl1).butlast).last ∧ vs[(ps0[phead1].next ' + orl1).last].deqID = None ∧ vs[(ps0[phead1].next ' + orl1).last].next = null, phead0 ∈ qrl ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0, phead ∈ qrl ∨ phead = phead1, phead1 = vhead ∧ unmarkedp(orl1, vs) ∨ qrl ≠ [] ∧ qrl.last = vhead ∧ phead ≠ phead1 ∧ vs[ps0[phead1].next].deqID = None ∧ unmarkedp(orl1, vs), vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ qrl + phead1 ' from phead ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ (qrl + phead1 ') + ps0[phead1].next ' + orl1 from vhead |
orl1 + rl = orl2 + vhead0 ' + qrl0, vs[r0].deqID = Some(tid), ps[ps0[phead1].next].deqID = None, ps[phead1].next = ps0[phead1].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, r0 = vhead, vretRefs(tid) = vretRefs0(tid), ps0[phead1].next ≠ phead1, r0 ≠ vhead0, vhead0 ≠ phead1, vhead0 ≠ ps0[phead1].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, ps, vs0, ps0), listp((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0, ps0, owns0), listp((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, ps, owns), markedp(orl2, ps0), markedp(qrl, ps0), markedp(qrl, vs), markedp(qrl, ps), markedp(orl2, vs0), markedp(qrl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0), nonullRetRefs((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps0[phead1].next].deqID), some?(ps0[ps0[phead1].next].deqID), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl0, ps0), unmarkedp(orl1, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0 from vhead, vtail0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0 from vtail, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl1 from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl2), ¬ dups(orl1), ¬ dups(qrl0), ¬ dups(qrl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(qrl), ¬ dups(qrl + orl2 + qrl0), ¬ dups(qrl + orl1), ¬ dups(rl), ¬ noid(tid, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vhead0, vs0), ¬ vhead0 ∈ qrl, ¬ ps0[phead1].next ∈ qrl, ¬ ps0[phead1].next ∈ orl2, ¬ ps0[phead1].next ∈ qrl0, ¬ ps0[phead1].next ∈ orl1, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl2, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl1, ¬ phead1 ∈ orl2, ¬ phead1 ∈ qrl, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ qrl + phead1 ' from phead ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead1 = vhead ∧ unmarkedp(orl1, vs) ∨ qrl ≠ [] ∧ qrl.last = vhead ∧ phead ≠ phead1 ∧ vs[ps0[phead1].next].deqID = None ∧ unmarkedp(orl1, vs), phead ∈ qrl ∨ phead = phead1, phead0 ∈ qrl ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0, vtail = (ps0[phead1].next ' + orl1).last ∨ vtail = (phead1 ' + (ps0[phead1].next ' + orl1).butlast).last ∧ vs[(ps0[phead1].next ' + orl1).last].deqID = None ∧ vs[(ps0[phead1].next ' + orl1).last].next = null ⊦
orl1 + rl = orl2 + vhead0 ' + qrl0, vs[r0].deqID = Some(tid), ps[ps0[phead1].next].deqID = None, ps[phead1].next = ps0[phead1].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), ps0[phead1].next ≠ phead1, r0 ≠ vhead0, vhead0 ≠ phead1, vhead0 ≠ ps0[phead1].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, ps, vs0, ps0), listp((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0, ps0, owns0), listp((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, ps, owns), markedp(orl2, ps0), markedp(qrl, ps0), markedp(qrl, vs), markedp(qrl, ps), markedp(orl2, vs0), markedp(qrl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0), nonullRetRefs((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps0[phead1].next].deqID), some?(ps0[ps0[phead1].next].deqID), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl0, ps0), unmarkedp(orl1, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0 from vhead, vtail0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0 from vtail, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl1 from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl2), ¬ dups(orl1), ¬ dups(qrl0), ¬ dups(qrl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(qrl), ¬ dups(qrl + orl2 + qrl0), ¬ dups(qrl + orl1), ¬ dups(rl), ¬ noid(tid, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vhead0, vs0), ¬ r0 ∈ (qrl + phead1 ') + ps0[phead1].next ' + orl1 from vhead, ¬ vhead0 ∈ qrl, ¬ ps0[phead1].next ∈ qrl, ¬ ps0[phead1].next ∈ orl2, ¬ ps0[phead1].next ∈ qrl0, ¬ ps0[phead1].next ∈ orl1, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl2, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl1, ¬ phead1 ∈ orl2, ¬ phead1 ∈ qrl, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ qrl + phead1 ' from phead ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead1 = vhead ∧ unmarkedp(orl1, vs) ∨ qrl ≠ [] ∧ qrl.last = vhead ∧ phead ≠ phead1 ∧ vs[ps0[phead1].next].deqID = None ∧ unmarkedp(orl1, vs), phead ∈ qrl ∨ phead = phead1, phead0 ∈ qrl ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0, vtail = (ps0[phead1].next ' + orl1).last ∨ vtail = (phead1 ' + (ps0[phead1].next ' + orl1).butlast).last ∧ vs[(ps0[phead1].next ' + orl1).last].deqID = None ∧ vs[(ps0[phead1].next ' + orl1).last].next = null ⊦
| orl1 + rl = orl2 + vhead0 ' + qrl0, vs[r0].deqID = Some(tid), ps[ps0[phead1].next].deqID = None, ps[phead1].next = ps0[phead1].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, r0 = vhead, vretRefs(tid) = vretRefs0(tid), ps0[phead1].next ≠ phead1, r0 ≠ vhead0, vhead0 ≠ phead1, vhead0 ≠ ps0[phead1].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, ps, vs0, ps0), listp((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0, ps0, owns0), listp((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, ps, owns), markedp(orl2, ps0), markedp(qrl, ps0), markedp(qrl, vs), markedp(qrl, ps), markedp(orl2, vs0), markedp(qrl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0), nonullRetRefs((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps0[phead1].next].deqID), some?(ps0[ps0[phead1].next].deqID), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl0, ps0), unmarkedp(orl1, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0 from vhead, vtail0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0 from vtail, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl1 from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl2), ¬ dups(orl1), ¬ dups(qrl0), ¬ dups(qrl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(qrl), ¬ dups(qrl + orl2 + qrl0), ¬ dups(qrl + orl1), ¬ dups(rl), ¬ noid(tid, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vhead0, vs0), ¬ vhead0 ∈ qrl, ¬ ps0[phead1].next ∈ qrl, ¬ ps0[phead1].next ∈ orl2, ¬ ps0[phead1].next ∈ qrl0, ¬ ps0[phead1].next ∈ orl1, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl2, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl1, ¬ phead1 ∈ orl2, ¬ phead1 ∈ qrl, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ qrl + phead1 ' from phead ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead1 = vhead ∧ unmarkedp(orl1, vs) ∨ qrl ≠ [] ∧ qrl.last = vhead ∧ phead ≠ phead1 ∧ vs[ps0[phead1].next].deqID = None ∧ unmarkedp(orl1, vs), phead ∈ qrl ∨ phead = phead1, phead0 ∈ qrl ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0, vtail = (ps0[phead1].next ' + orl1).last ∨ vtail = (phead1 ' + (ps0[phead1].next ' + orl1).butlast).last ∧ vs[(ps0[phead1].next ' + orl1).last].deqID = None ∧ vs[(ps0[phead1].next ' + orl1).last].next = null ⊦ |
orl1 + rl = orl2 + vhead0 ' + qrl0, ps[ps0[phead1].next].deqID = None, vs[vhead].deqID = Some(tid), ps[phead1].next = ps0[phead1].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), ps0[phead1].next ≠ phead1, vhead ≠ vhead0, vhead0 ≠ phead1, vhead0 ≠ ps0[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, ps, vs0, ps0), listp((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, ps, owns), listp((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(orl2, vs0), markedp(qrl, ps), markedp(qrl, vs), markedp(qrl, ps0), markedp(orl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0), nonullRetRefs((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), some?(ps0[ps0[phead1].next].deqID), some?(vs0[ps0[phead1].next].deqID), unmarkedp(orl1, ps), unmarkedp(qrl0, ps0), vhead ∈ orl1 from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, vtail0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0 from vtail, vhead0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl2), ¬ dups(orl1), ¬ dups(qrl0), ¬ dups(qrl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(qrl), ¬ dups(qrl + orl2 + qrl0), ¬ dups(qrl + orl1), ¬ dups(rl), ¬ noid(tid, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vhead0, vs0), ¬ vhead0 ∈ qrl, ¬ ps0[phead1].next ∈ qrl, ¬ ps0[phead1].next ∈ orl2, ¬ ps0[phead1].next ∈ qrl0, ¬ ps0[phead1].next ∈ orl1, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl2, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl1, ¬ phead1 ∈ orl2, ¬ phead1 ∈ 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vtail = (ps0[phead1].next ' + orl1).last ∨ vtail = (phead1 ' + (ps0[phead1].next ' + orl1).butlast).last ∧ vs[(ps0[phead1].next ' + orl1).last].deqID = None ∧ vs[(ps0[phead1].next ' + orl1).last].next = null, phead0 ∈ qrl ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0, phead ∈ qrl ∨ phead = phead1, phead1 = vhead ∧ unmarkedp(orl1, vs) ∨ qrl ≠ [] ∧ qrl.last = vhead ∧ phead ≠ phead1 ∧ vs[ps0[phead1].next].deqID = None ∧ unmarkedp(orl1, vs), vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ qrl + phead1 ' from phead ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0 ⊦
| orl1 + rl = orl2 + vhead0 ' + qrl0, ps[ps0[phead1].next].deqID = None, vs[vhead].deqID = Some(tid), ps[phead1].next = ps0[phead1].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), ps0[phead1].next ≠ phead1, vhead ≠ vhead0, vhead0 ≠ phead1, vhead0 ≠ ps0[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, ps, vs0, ps0), listp((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, ps, owns), listp((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(orl2, vs0), markedp(qrl, ps), markedp(qrl, vs), markedp(qrl, ps0), markedp(orl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0), nonullRetRefs((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), some?(ps0[ps0[phead1].next].deqID), some?(vs0[ps0[phead1].next].deqID), unmarkedp(orl1, ps), unmarkedp(qrl0, ps0), vhead ∈ orl1 from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, vtail0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0 from vtail, vhead0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl2), ¬ dups(orl1), ¬ dups(qrl0), ¬ dups(qrl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(qrl), ¬ dups(qrl + orl2 + qrl0), ¬ dups(qrl + orl1), ¬ dups(rl), ¬ noid(tid, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vhead0, vs0), ¬ vhead0 ∈ qrl, ¬ ps0[phead1].next ∈ qrl, ¬ ps0[phead1].next ∈ orl2, ¬ ps0[phead1].next ∈ qrl0, ¬ ps0[phead1].next ∈ orl1, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl2, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl1, ¬ phead1 ∈ orl2, ¬ phead1 ∈ 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vtail = (ps0[phead1].next ' + orl1).last ∨ vtail = (phead1 ' + (ps0[phead1].next ' + orl1).butlast).last ∧ vs[(ps0[phead1].next ' + orl1).last].deqID = None ∧ vs[(ps0[phead1].next ' + orl1).last].next = null, phead0 ∈ qrl ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0, phead ∈ qrl ∨ phead = phead1, phead1 = vhead ∧ unmarkedp(orl1, vs) ∨ qrl ≠ [] ∧ qrl.last = vhead ∧ phead ≠ phead1 ∧ vs[ps0[phead1].next].deqID = None ∧ unmarkedp(orl1, vs), vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ qrl + phead1 ' from phead ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0 ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
orl1 + rl = orl2 + vhead0 ' + qrl0, vs[vhead].deqID = Some(tid), ps[ps0[phead1].next].deqID = None, ps[phead1].next = ps0[phead1].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), ps0[phead1].next ≠ phead1, vhead ≠ vhead0, vhead0 ≠ phead1, vhead0 ≠ ps0[phead1].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, ps, vs0, ps0), listp((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0, ps0, owns0), listp((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, ps, owns), markedp(orl2, ps0), markedp(qrl, ps0), markedp(qrl, vs), markedp(qrl, ps), markedp(orl2, vs0), markedp(qrl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0), nonullRetRefs((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps0[phead1].next].deqID), some?(ps0[ps0[phead1].next].deqID), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl0, ps0), unmarkedp(orl1, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (qrl + phead1 ' from vhead) + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vtail0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0 from vtail, phead0 ∈ vs0, phead0 ∈ ps0, vhead ∈ orl1 from vhead0, vhead ∈ qrl + phead1 ', dom prvHp ⊆ dom prvHp0, ¬ dups(orl2), ¬ dups(orl1), ¬ dups(qrl0), ¬ dups(qrl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(qrl), ¬ dups(qrl + orl2 + qrl0), ¬ dups(qrl + orl1), ¬ dups(rl), ¬ noid(tid, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vhead0, vs0), ¬ vhead0 ∈ qrl, ¬ ps0[phead1].next ∈ qrl, ¬ ps0[phead1].next ∈ orl2, ¬ ps0[phead1].next ∈ qrl0, ¬ ps0[phead1].next ∈ orl1, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl2, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl1, ¬ phead1 ∈ orl2, ¬ phead1 ∈ qrl, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ qrl + phead1 ' from phead ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead1 = vhead ∧ unmarkedp(orl1, vs) ∨ qrl ≠ [] ∧ qrl.last = vhead ∧ phead ≠ phead1 ∧ vs[ps0[phead1].next].deqID = None ∧ unmarkedp(orl1, vs), phead ∈ qrl ∨ phead = phead1, phead0 ∈ qrl ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0, vtail = (ps0[phead1].next ' + orl1).last ∨ vtail = (phead1 ' + (ps0[phead1].next ' + orl1).butlast).last ∧ vs[(ps0[phead1].next ' + orl1).last].deqID = None ∧ vs[(ps0[phead1].next ' + orl1).last].next = null ⊦
Used simplifier rules: ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) Used terms: qrl + phead1 ', (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| orl1 + rl = orl2 + vhead0 ' + qrl0, vs[vhead].deqID = Some(tid), ps[ps0[phead1].next].deqID = None, ps[phead1].next = ps0[phead1].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), ps0[phead1].next ≠ phead1, vhead ≠ vhead0, vhead0 ≠ phead1, vhead0 ≠ ps0[phead1].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, ps, vs0, ps0), listp((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0, ps0, owns0), listp((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, ps, owns), markedp(orl2, ps0), markedp(qrl, ps0), markedp(qrl, vs), markedp(qrl, ps), markedp(orl2, vs0), markedp(qrl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0), nonullRetRefs((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps0[phead1].next].deqID), some?(ps0[ps0[phead1].next].deqID), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl0, ps0), unmarkedp(orl1, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (qrl + phead1 ' from vhead) + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vtail0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0 from vtail, phead0 ∈ vs0, phead0 ∈ ps0, vhead ∈ orl1 from vhead0, vhead ∈ qrl + phead1 ', dom prvHp ⊆ dom prvHp0, ¬ dups(orl2), ¬ dups(orl1), ¬ dups(qrl0), ¬ dups(qrl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(qrl), ¬ dups(qrl + orl2 + qrl0), ¬ dups(qrl + orl1), ¬ dups(rl), ¬ noid(tid, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vhead0, vs0), ¬ vhead0 ∈ qrl, ¬ ps0[phead1].next ∈ qrl, ¬ ps0[phead1].next ∈ orl2, ¬ ps0[phead1].next ∈ qrl0, ¬ ps0[phead1].next ∈ orl1, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl2, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl1, ¬ phead1 ∈ orl2, ¬ phead1 ∈ qrl, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ qrl + phead1 ' from phead ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead1 = vhead ∧ unmarkedp(orl1, vs) ∨ qrl ≠ [] ∧ qrl.last = vhead ∧ phead ≠ phead1 ∧ vs[ps0[phead1].next].deqID = None ∧ unmarkedp(orl1, vs), phead ∈ qrl ∨ phead = phead1, phead0 ∈ qrl ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0, vtail = (ps0[phead1].next ' + orl1).last ∨ vtail = (phead1 ' + (ps0[phead1].next ' + orl1).butlast).last ∧ vs[(ps0[phead1].next ' + orl1).last].deqID = None ∧ vs[(ps0[phead1].next ' + orl1).last].next = null ⊦ |
orl1 + rl = orl2 + vhead0 ' + qrl0, vs[ps0[phead1].next].deqID = None, ps[ps0[phead1].next].deqID = None, vs[qrl.last].deqID = Some(tid), ps[phead1].next = ps0[phead1].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), qrl.last ≠ phead1, qrl.last ≠ vhead0, ps0[phead1].next ≠ phead1, phead ≠ phead1, qrl ≠ [], vhead0 ≠ phead1, vhead0 ≠ ps0[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, ps, vs0, ps0), listp((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, ps, owns), listp((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(orl2, vs0), markedp(qrl, ps), markedp(qrl, vs), markedp(qrl, ps0), markedp(orl2, ps0), nextnottid(tid, qrl.last, vs), nextnottidRely(tid, qrl.last, vs, vhead0, vs0), noidRely(tid, (qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0), nonullRetRefs((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), some?(ps0[ps0[phead1].next].deqID), some?(vs0[ps0[phead1].next].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), unmarkedp(qrl0, ps0), phead ∈ qrl, qrl.last ∈ orl1 from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, vtail0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0 from vtail, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl2), ¬ dups(orl1), ¬ dups(qrl0), ¬ dups(qrl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(qrl), ¬ dups(qrl + orl2 + qrl0), ¬ dups(qrl + orl1), ¬ dups(rl), ¬ noid(tid, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vhead0, vs0), ¬ vhead0 ∈ qrl, ¬ ps0[phead1].next ∈ qrl, ¬ ps0[phead1].next ∈ orl2, ¬ ps0[phead1].next ∈ qrl0, ¬ ps0[phead1].next ∈ orl1, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl2, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl1, ¬ phead1 ∈ orl2, ¬ phead1 ∈ qrl, vs[qrl.last].next ≠ null ∧ vs[vs[qrl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[qrl.last].next].deqID.tid)) = Claimed(vs[vs[qrl.last].next].deqID.tid, vs[vs[qrl.last].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), phead0 ∈ qrl from phead ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail = (ps0[phead1].next ' + orl1).last ∨ vtail = (phead1 ' + (ps0[phead1].next ' + orl1).butlast).last ∧ vs[(ps0[phead1].next ' + orl1).last].deqID = None ∧ vs[(ps0[phead1].next ' + orl1).last].next = null, phead0 ∈ qrl ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) ⊦ r ∈ rl from r0 → r ∈ rl; (ss) ⊦ ¬ a ∈ x → (a ∈ b ' + x ↔ a = b); (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s)
| orl1 + rl = orl2 + vhead0 ' + qrl0, vs[ps0[phead1].next].deqID = None, ps[ps0[phead1].next].deqID = None, vs[qrl.last].deqID = Some(tid), ps[phead1].next = ps0[phead1].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), qrl.last ≠ phead1, qrl.last ≠ vhead0, ps0[phead1].next ≠ phead1, phead ≠ phead1, qrl ≠ [], vhead0 ≠ phead1, vhead0 ≠ ps0[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, ps, vs0, ps0), listp((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, ps, owns), listp((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(orl2, vs0), markedp(qrl, ps), markedp(qrl, vs), markedp(qrl, ps0), markedp(orl2, ps0), nextnottid(tid, qrl.last, vs), nextnottidRely(tid, qrl.last, vs, vhead0, vs0), noidRely(tid, (qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0), nonullRetRefs((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), some?(ps0[ps0[phead1].next].deqID), some?(vs0[ps0[phead1].next].deqID), unmarkedp(orl1, vs), unmarkedp(orl1, ps), unmarkedp(qrl0, ps0), phead ∈ qrl, qrl.last ∈ orl1 from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, vtail0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0 from vtail, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl2), ¬ dups(orl1), ¬ dups(qrl0), ¬ dups(qrl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(qrl), ¬ dups(qrl + orl2 + qrl0), ¬ dups(qrl + orl1), ¬ dups(rl), ¬ noid(tid, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vhead0, vs0), ¬ vhead0 ∈ qrl, ¬ ps0[phead1].next ∈ qrl, ¬ ps0[phead1].next ∈ orl2, ¬ ps0[phead1].next ∈ qrl0, ¬ ps0[phead1].next ∈ orl1, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl2, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl1, ¬ phead1 ∈ orl2, ¬ phead1 ∈ qrl, vs[qrl.last].next ≠ null ∧ vs[vs[qrl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[qrl.last].next].deqID.tid)) = Claimed(vs[vs[qrl.last].next].deqID.tid, vs[vs[qrl.last].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), phead0 ∈ qrl from phead ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail = (ps0[phead1].next ' + orl1).last ∨ vtail = (phead1 ' + (ps0[phead1].next ' + orl1).butlast).last ∧ vs[(ps0[phead1].next ' + orl1).last].deqID = None ∧ vs[(ps0[phead1].next ' + orl1).last].next = null, phead0 ∈ qrl ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ r ∈ rl from r0 → r ∈ rl; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl, vtail1, y
| orl1 + rl = orl2 + vhead0 ' + qrl0, vs[r0].deqID = Some(tid), ps[ps0[phead1].next].deqID = None, ps[phead1].next = ps0[phead1].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), ps0[phead1].next ≠ phead1, r0 ≠ vhead0, vhead0 ≠ phead1, vhead0 ≠ ps0[phead1].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, ps, vs0, ps0), listp((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0, ps0, owns0), listp((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, ps, owns), markedp(orl2, ps0), markedp(qrl, ps0), markedp(qrl, vs), markedp(qrl, ps), markedp(orl2, vs0), markedp(qrl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0), nonullRetRefs((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((qrl + phead1 ') + ps0[phead1].next ' + orl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps0[phead1].next].deqID), some?(ps0[ps0[phead1].next].deqID), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl0, ps0), unmarkedp(orl1, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0 from vhead, vtail0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0 from vtail, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl1 from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl2), ¬ dups(orl1), ¬ dups(qrl0), ¬ dups(qrl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(qrl), ¬ dups(qrl + orl2 + qrl0), ¬ dups(qrl + orl1), ¬ dups(rl), ¬ noid(tid, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + qrl0, vhead0, vs0), ¬ r0 ∈ (qrl + phead1 ') + ps0[phead1].next ' + orl1 from vhead, ¬ vhead0 ∈ qrl, ¬ ps0[phead1].next ∈ qrl, ¬ ps0[phead1].next ∈ orl2, ¬ ps0[phead1].next ∈ qrl0, ¬ ps0[phead1].next ∈ orl1, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl2, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl1, ¬ phead1 ∈ orl2, ¬ phead1 ∈ qrl, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ qrl + phead1 ' from phead ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead1 = vhead ∧ unmarkedp(orl1, vs) ∨ qrl ≠ [] ∧ qrl.last = vhead ∧ phead ≠ phead1 ∧ vs[ps0[phead1].next].deqID = None ∧ unmarkedp(orl1, vs), phead ∈ qrl ∨ phead = phead1, phead0 ∈ qrl ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0, vtail = (ps0[phead1].next ' + orl1).last ∨ vtail = (phead1 ' + (ps0[phead1].next ' + orl1).butlast).last ∧ vs[(ps0[phead1].next ' + orl1).last].deqID = None ∧ vs[(ps0[phead1].next ' + orl1).last].next = null ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ∈ rl from r0 → r ∈ rl; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) Used terms: qrl + phead1 ', ps0[phead1].next ' + orl1, vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| qrl + rl = (orl0 + vtail1 ') + qrl0, vs[r0].deqID = Some(tid), (orl + orl0).last = vhead0, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl + orl0 ≠ [], orl ≠ [], phead0 ≠ vtail1, r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + orl0 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl, vs0), markedp(orl0, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + orl0 + vtail1 ') + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + orl0 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), r0 ∈ orl + qrl from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + orl0 + vtail1 ') + qrl0 from vtail, vhead0 ∈ (orl + orl0 + vtail1 ') + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + orl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl0), ¬ dups(qrl0), ¬ dups(orl0 + qrl0), ¬ dups(orl + orl0), ¬ noid(tid, (orl + orl0 + vtail1 ') + qrl0, vhead0, vs0), ¬ vtail1 ∈ orl, ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = vtail1 ∨ phead0 ∈ qrl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = vtail1, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid) ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead |
qrl + rl = (orl0 + vtail1 ') + qrl0, vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl + orl0 ≠ [], orl ≠ [], phead0 ≠ vtail1, r0 ≠ (orl + orl0).last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + orl0 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl0, vs0), markedp(orl, vs0), markedp(orl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, (orl + orl0).last, vs0), noidRely(tid, orl + qrl, vs, (orl + orl0 + vtail1 ') + qrl0, vs0), nonullRetRefs((orl + orl0 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, (orl + orl0).last ∈ (orl + orl0 + vtail1 ') + qrl0 from vhead, vtail0 ∈ (orl + orl0 + vtail1 ') + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl + qrl from (orl + orl0).last, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + orl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl0), ¬ dups(qrl0), ¬ dups(orl0 + qrl0), ¬ dups(orl + orl0), ¬ noid(tid, (orl + orl0 + vtail1 ') + qrl0, (orl + orl0).last, vs0), ¬ vtail1 ∈ orl, ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ qrl0, vs0[(orl + orl0).last].next ≠ null ∧ vs0[vs0[(orl + orl0).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(orl + orl0).last].next].deqID.tid)) = Claimed(vs0[vs0[(orl + orl0).last].next].deqID.tid, vs0[vs0[(orl + orl0).last].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), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ orl ∨ phead0 ∈ orl0, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead
| qrl + rl = (orl0 + vtail1 ') + qrl0, vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl + orl0 ≠ [], orl ≠ [], phead0 ≠ vtail1, r0 ≠ (orl + orl0).last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + orl0 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl0, vs0), markedp(orl, vs0), markedp(orl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, (orl + orl0).last, vs0), noidRely(tid, orl + qrl, vs, (orl + orl0 + vtail1 ') + qrl0, vs0), nonullRetRefs((orl + orl0 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, (orl + orl0).last ∈ (orl + orl0 + vtail1 ') + qrl0 from vhead, vtail0 ∈ (orl + orl0 + vtail1 ') + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl + qrl from (orl + orl0).last, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + orl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl0), ¬ dups(qrl0), ¬ dups(orl0 + qrl0), ¬ dups(orl + orl0), ¬ noid(tid, (orl + orl0 + vtail1 ') + qrl0, (orl + orl0).last, vs0), ¬ vtail1 ∈ orl, ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ qrl0, vs0[(orl + orl0).last].next ≠ null ∧ vs0[vs0[(orl + orl0).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(orl + orl0).last].next].deqID.tid)) = Claimed(vs0[vs0[(orl + orl0).last].next].deqID.tid, vs0[vs0[(orl + orl0).last].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), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ orl ∨ phead0 ∈ orl0, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead |
⊦ y ≠ [] → (x + y).last = y.last
qrl + rl = (orl0 + vtail1 ') + qrl0, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, orl0 = [], vretRefs(tid) = vretRefs0(tid), orl + orl0 ≠ [], orl ≠ [], phead0 ≠ vtail1, r0 ≠ (orl + orl0).last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + orl0 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl, vs0), markedp(orl0, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, (orl + orl0).last, vs0), noidRely(tid, orl + qrl, vs, (orl + orl0 + vtail1 ') + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + orl0 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), r0 ∈ orl + qrl from (orl + orl0).last, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + orl0 + vtail1 ') + qrl0 from vtail, (orl + orl0).last ∈ (orl + orl0 + vtail1 ') + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + orl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl0), ¬ dups(qrl0), ¬ dups(orl0 + qrl0), ¬ dups(orl + orl0), ¬ noid(tid, (orl + orl0 + vtail1 ') + qrl0, (orl + orl0).last, vs0), ¬ vtail1 ∈ orl, ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[(orl + orl0).last].next ≠ null ∧ vs0[vs0[(orl + orl0).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(orl + orl0).last].next].deqID.tid)) = Claimed(vs0[vs0[(orl + orl0).last].next].deqID.tid, vs0[vs0[(orl + orl0).last].next].val), phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ orl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid) ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead
qrl + rl = (orl0 + vtail1 ') + qrl0, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl + orl0 ≠ [], orl ≠ [], orl0 ≠ [], phead0 ≠ vtail1, r0 ≠ orl0.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + orl0 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl, vs0), markedp(orl0, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, orl0.last, vs0), noidRely(tid, orl + qrl, vs, (orl + orl0 + vtail1 ') + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + orl0 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), r0 ∈ orl + qrl from orl0.last, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + orl0 + vtail1 ') + qrl0 from vtail, orl0.last ∈ (orl + orl0 + vtail1 ') + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + orl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl0), ¬ dups(qrl0), ¬ dups(orl0 + qrl0), ¬ dups(orl + orl0), ¬ noid(tid, (orl + orl0 + vtail1 ') + qrl0, orl0.last, vs0), ¬ vtail1 ∈ orl, ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[orl0.last].next ≠ null ∧ vs0[vs0[orl0.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[orl0.last].next].deqID.tid)) = Claimed(vs0[vs0[orl0.last].next].deqID.tid, vs0[vs0[orl0.last].next].val), phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ orl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid) ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead
Used terms: orl, orl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| qrl + rl = (orl0 + vtail1 ') + qrl0, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, orl0 = [], vretRefs(tid) = vretRefs0(tid), orl + orl0 ≠ [], orl ≠ [], phead0 ≠ vtail1, r0 ≠ (orl + orl0).last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + orl0 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl, vs0), markedp(orl0, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, (orl + orl0).last, vs0), noidRely(tid, orl + qrl, vs, (orl + orl0 + vtail1 ') + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + orl0 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), r0 ∈ orl + qrl from (orl + orl0).last, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + orl0 + vtail1 ') + qrl0 from vtail, (orl + orl0).last ∈ (orl + orl0 + vtail1 ') + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + orl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl0), ¬ dups(qrl0), ¬ dups(orl0 + qrl0), ¬ dups(orl + orl0), ¬ noid(tid, (orl + orl0 + vtail1 ') + qrl0, (orl + orl0).last, vs0), ¬ vtail1 ∈ orl, ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[(orl + orl0).last].next ≠ null ∧ vs0[vs0[(orl + orl0).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(orl + orl0).last].next].deqID.tid)) = Claimed(vs0[vs0[(orl + orl0).last].next].deqID.tid, vs0[vs0[(orl + orl0).last].next].val), phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ orl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid) ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead |
qrl + rl = vtail1 ' + qrl0, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl ≠ [], phead0 ≠ vtail1, r0 ≠ orl.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl + rl, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, orl.last, vs0), noidRely(tid, orl + qrl, vs, orl + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ orl, r0 ∈ orl + qrl from orl.last, phead ∈ orl, vtail0 ∈ orl + qrl + rl from vtail, orl.last ∈ orl + qrl + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ orl from phead, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl0), ¬ dups(orl + qrl), ¬ noid(tid, orl + qrl + rl, orl.last, vs0), ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ orl, ¬ phead0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[orl.last].next ≠ null ∧ vs0[vs0[orl.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[orl.last].next].deqID.tid)) = Claimed(vs0[vs0[orl.last].next].deqID.tid, vs0[vs0[orl.last].next].val), vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail1 ∈ qrl ∨ vtail1 ∈ rl ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x ∧ a ∈ y → dups(x + y); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (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 in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)
| qrl + rl = vtail1 ' + qrl0, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl ≠ [], phead0 ≠ vtail1, r0 ≠ orl.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl + rl, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, orl.last, vs0), noidRely(tid, orl + qrl, vs, orl + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ orl, r0 ∈ orl + qrl from orl.last, phead ∈ orl, vtail0 ∈ orl + qrl + rl from vtail, orl.last ∈ orl + qrl + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ orl from phead, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl0), ¬ dups(orl + qrl), ¬ noid(tid, orl + qrl + rl, orl.last, vs0), ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ orl, ¬ phead0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[orl.last].next ≠ null ∧ vs0[vs0[orl.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[orl.last].next].deqID.tid)) = Claimed(vs0[vs0[orl.last].next].deqID.tid, vs0[vs0[orl.last].next].val), vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail1 ∈ qrl ∨ vtail1 ∈ rl ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead |
qrl + rl = vtail1 ' + qrl0, vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, qrl = vhead0 + orl0, vretRefs(tid) = vretRefs0(tid), orl ≠ [], phead0 ≠ vtail1, qrl ≠ [], r0 ≠ orl.last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp(orl + qrl + rl, vs0, ps0, owns0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, orl.last, vs0), noidRely(tid, orl + qrl, vs, orl + qrl + rl, vs0), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead0 ∈ orl from phead, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, orl.last ∈ orl + qrl + rl from vhead, vtail0 ∈ orl + qrl + rl from vtail, phead ∈ orl, r0 ∈ orl + qrl from orl.last, phead0 ∈ orl, phead0 ∈ vs, phead0 ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl0), ¬ dups(orl + qrl), ¬ noid(tid, orl + qrl + rl, orl.last, vs0), ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ orl, ¬ phead0 ∈ qrl0, vs0[orl.last].next ≠ null ∧ vs0[vs0[orl.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[orl.last].next].deqID.tid)) = Claimed(vs0[vs0[orl.last].next].deqID.tid, vs0[vs0[orl.last].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), vtail1 ∈ qrl ∨ vtail1 ∈ rl, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(orl0, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead
Used simplifier rules: ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] rl ≠ [] ⊦ ¬ dups(rl) → rl from rl.last = rl.last '; (s) ⊦ a ∈ b ' ↔ a = b; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, vhead0, y
| qrl + rl = vtail1 ' + qrl0, vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, qrl = vhead0 + orl0, vretRefs(tid) = vretRefs0(tid), orl ≠ [], phead0 ≠ vtail1, qrl ≠ [], r0 ≠ orl.last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp(orl + qrl + rl, vs0, ps0, owns0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, orl.last, vs0), noidRely(tid, orl + qrl, vs, orl + qrl + rl, vs0), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead0 ∈ orl from phead, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, orl.last ∈ orl + qrl + rl from vhead, vtail0 ∈ orl + qrl + rl from vtail, phead ∈ orl, r0 ∈ orl + qrl from orl.last, phead0 ∈ orl, phead0 ∈ vs, phead0 ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl0), ¬ dups(orl + qrl), ¬ noid(tid, orl + qrl + rl, orl.last, vs0), ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ orl, ¬ phead0 ∈ qrl0, vs0[orl.last].next ≠ null ∧ vs0[vs0[orl.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[orl.last].next].deqID.tid)) = Claimed(vs0[vs0[orl.last].next].deqID.tid, vs0[vs0[orl.last].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), vtail1 ∈ qrl ∨ vtail1 ∈ rl, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(orl0, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (qrl + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead |
ps[vtail1].deqID = None, vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl ≠ [], phead0 ≠ vtail1, r0 ≠ orl.last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vtail1 ' + orl0, vs, ps, vs0, ps0), listp(orl + vtail1 ' + orl0, vs, ps, owns), listp(orl + (vtail1 ' + orl0) + rl, vs0, ps0, owns0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, orl.last, vs0), noidRely(tid, orl + vtail1 ' + orl0, vs, orl + (vtail1 ' + orl0) + rl, vs0), nonullRetRefs(orl + (vtail1 ' + orl0) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vtail1 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs0), unmarkedp(rl, vs0), unmarkedp(orl0, ps0), unmarkedp(rl, ps0), phead0 ∈ orl from phead, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, orl.last ∈ orl + (vtail1 ' + orl0) + rl from vhead, vtail0 ∈ orl + (vtail1 ' + orl0) + rl from vtail, phead ∈ orl, r0 ∈ orl + vtail1 ' + orl0 from orl.last, phead0 ∈ orl, phead0 ∈ vs, phead0 ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl0 + rl), ¬ dups(orl + orl0), ¬ noid(tid, orl + (vtail1 ' + orl0) + rl, orl.last, vs0), ¬ vtail1 ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ rl, ¬ vtail1 ∈ orl, ¬ vtail1 ∈ rl, vs0[orl.last].next ≠ null ∧ vs0[vs0[orl.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[orl.last].next].deqID.tid)) = Claimed(vs0[vs0[orl.last].next].deqID.tid, vs0[vs0[orl.last].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), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail1].deqID = None ∧ unmarkedp(orl0, vs), vtail = (vtail1 ' + orl0).last ∨ vtail = (orl + (vtail1 ' + orl0).butlast).last ∧ vs[(vtail1 ' + orl0).last].deqID = None ∧ vs[(vtail1 ' + orl0).last].next = null, vtail0 = ((vtail1 ' + orl0) + rl).last ∨ orl0 + rl ≠ [] ∧ vtail0 = (vtail1 ' + (orl0 + rl).butlast).last ∧ vs0[(orl0 + rl).last].deqID = None ∧ vs0[(orl0 + rl).last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid) ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vtail1 ' + orl0 from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ a ' + x ≠ []; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)
| ps[vtail1].deqID = None, vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl ≠ [], phead0 ≠ vtail1, r0 ≠ orl.last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vtail1 ' + orl0, vs, ps, vs0, ps0), listp(orl + vtail1 ' + orl0, vs, ps, owns), listp(orl + (vtail1 ' + orl0) + rl, vs0, ps0, owns0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, orl.last, vs0), noidRely(tid, orl + vtail1 ' + orl0, vs, orl + (vtail1 ' + orl0) + rl, vs0), nonullRetRefs(orl + (vtail1 ' + orl0) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vtail1 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs0), unmarkedp(rl, vs0), unmarkedp(orl0, ps0), unmarkedp(rl, ps0), phead0 ∈ orl from phead, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, orl.last ∈ orl + (vtail1 ' + orl0) + rl from vhead, vtail0 ∈ orl + (vtail1 ' + orl0) + rl from vtail, phead ∈ orl, r0 ∈ orl + vtail1 ' + orl0 from orl.last, phead0 ∈ orl, phead0 ∈ vs, phead0 ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl0 + rl), ¬ dups(orl + orl0), ¬ noid(tid, orl + (vtail1 ' + orl0) + rl, orl.last, vs0), ¬ vtail1 ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ rl, ¬ vtail1 ∈ orl, ¬ vtail1 ∈ rl, vs0[orl.last].next ≠ null ∧ vs0[vs0[orl.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[orl.last].next].deqID.tid)) = Claimed(vs0[vs0[orl.last].next].deqID.tid, vs0[vs0[orl.last].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), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail1].deqID = None ∧ unmarkedp(orl0, vs), vtail = (vtail1 ' + orl0).last ∨ vtail = (orl + (vtail1 ' + orl0).butlast).last ∧ vs[(vtail1 ' + orl0).last].deqID = None ∧ vs[(vtail1 ' + orl0).last].next = null, vtail0 = ((vtail1 ' + orl0) + rl).last ∨ orl0 + rl ≠ [] ∧ vtail0 = (vtail1 ' + (orl0 + rl).butlast).last ∧ vs0[(orl0 + rl).last].deqID = None ∧ vs0[(orl0 + rl).last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid) ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vtail1 ' + orl0 from vhead |
vs[r0].deqID = Some(tid), ps[vtail1].deqID = None, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, orl = rl0 + vhead0 ', vretRefs(tid) = vretRefs0(tid), orl ≠ [], phead0 ≠ vtail1, r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vtail1 ' + orl0, vs, ps, vs0, ps0), listp(orl + (vtail1 ' + orl0) + rl, vs0, ps0, owns0), listp(orl + vtail1 ' + orl0, vs, ps, owns), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vtail1 ' + orl0, vs, orl + (vtail1 ' + orl0) + rl, vs0), nonullRetRefs(orl + vtail1 ' + orl0, vs, vretRefs, pretRefs), nonullRetRefs(orl + (vtail1 ' + orl0) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(rl, ps0), unmarkedp(orl0, ps0), unmarkedp(rl, vs0), unmarkedp(orl0, vs0), unmarkedp(orl0, ps), phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ orl, r0 ∈ orl + vtail1 ' + orl0 from vhead0, phead ∈ orl, vtail0 ∈ orl + (vtail1 ' + orl0) + rl from vtail, vhead0 ∈ orl + (vtail1 ' + orl0) + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ orl from phead, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl0 + rl), ¬ dups(orl + orl0), ¬ noid(tid, orl + (vtail1 ' + orl0) + rl, vhead0, vs0), ¬ vtail1 ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ rl, ¬ vtail1 ∈ orl, ¬ vtail1 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = ((vtail1 ' + orl0) + rl).last ∨ orl0 + rl ≠ [] ∧ vtail0 = (vtail1 ' + (orl0 + rl).butlast).last ∧ vs0[(orl0 + rl).last].deqID = None ∧ vs0[(orl0 + rl).last].next = null, vtail = (vtail1 ' + orl0).last ∨ vtail = (orl + (vtail1 ' + orl0).butlast).last ∧ vs[(vtail1 ' + orl0).last].deqID = None ∧ vs[(vtail1 ' + orl0).last].next = null, vhead0 = vhead ∧ unmarkedp(orl0, vs) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail1].deqID = None ∧ unmarkedp(orl0, vs) ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vtail1 ' + orl0 from vhead
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, vhead0, y
| vs[r0].deqID = Some(tid), ps[vtail1].deqID = None, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, orl = rl0 + vhead0 ', vretRefs(tid) = vretRefs0(tid), orl ≠ [], phead0 ≠ vtail1, r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vtail1 ' + orl0, vs, ps, vs0, ps0), listp(orl + (vtail1 ' + orl0) + rl, vs0, ps0, owns0), listp(orl + vtail1 ' + orl0, vs, ps, owns), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vtail1 ' + orl0, vs, orl + (vtail1 ' + orl0) + rl, vs0), nonullRetRefs(orl + vtail1 ' + orl0, vs, vretRefs, pretRefs), nonullRetRefs(orl + (vtail1 ' + orl0) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(rl, ps0), unmarkedp(orl0, ps0), unmarkedp(rl, vs0), unmarkedp(orl0, vs0), unmarkedp(orl0, ps), phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ orl, r0 ∈ orl + vtail1 ' + orl0 from vhead0, phead ∈ orl, vtail0 ∈ orl + (vtail1 ' + orl0) + rl from vtail, vhead0 ∈ orl + (vtail1 ' + orl0) + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ orl from phead, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl0 + rl), ¬ dups(orl + orl0), ¬ noid(tid, orl + (vtail1 ' + orl0) + rl, vhead0, vs0), ¬ vtail1 ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ rl, ¬ vtail1 ∈ orl, ¬ vtail1 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = ((vtail1 ' + orl0) + rl).last ∨ orl0 + rl ≠ [] ∧ vtail0 = (vtail1 ' + (orl0 + rl).butlast).last ∧ vs0[(orl0 + rl).last].deqID = None ∧ vs0[(orl0 + rl).last].next = null, vtail = (vtail1 ' + orl0).last ∨ vtail = (orl + (vtail1 ' + orl0).butlast).last ∧ vs[(vtail1 ' + orl0).last].deqID = None ∧ vs[(vtail1 ' + orl0).last].next = null, vhead0 = vhead ∧ unmarkedp(orl0, vs) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail1].deqID = None ∧ unmarkedp(orl0, vs) ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vtail1 ' + orl0 from vhead |
vs[r0].deqID = Some(tid), ps[ps[vhead0].next].deqID = None, ps0[vhead0].next = ps[vhead0].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), ps[vhead0].next ≠ vhead0, phead0 ≠ ps[vhead0].next, r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl0 + vhead0 ') + ps[vhead0].next ' + orl0, vs, ps, vs0, ps0), listp((rl0 + vhead0 ') + (ps[vhead0].next ' + orl0) + rl, vs0, ps0, owns0), listp((rl0 + vhead0 ') + ps[vhead0].next ' + orl0, vs, ps, owns), markedp(rl0, vs0), markedp(rl0, ps), markedp(rl0, vs), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl0 + vhead0 ') + ps[vhead0].next ' + orl0, vs, (rl0 + vhead0 ') + (ps[vhead0].next ' + orl0) + rl, vs0), nonullRetRefs((rl0 + vhead0 ') + ps[vhead0].next ' + orl0, vs, vretRefs, pretRefs), nonullRetRefs((rl0 + vhead0 ') + (ps[vhead0].next ' + orl0) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps0[vhead0].deqID), some?(ps0[ps[vhead0].next].deqID), some?(vs0[ps[vhead0].next].deqID), unmarkedp(rl, ps0), unmarkedp(orl0, ps0), unmarkedp(rl, vs0), unmarkedp(orl0, vs0), unmarkedp(orl0, ps), phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps, phead0 ∈ vs, vtail0 ∈ (rl0 + vhead0 ') + (ps[vhead0].next ' + orl0) + rl from vtail, vhead0 ∈ (rl0 + vhead0 ') + (ps[vhead0].next ' + orl0) + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ rl0 + vhead0 ' from phead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl0 + orl0), ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl0), ¬ dups(rl0 + orl0 + rl), ¬ noid(tid, (rl0 + vhead0 ') + (ps[vhead0].next ' + orl0) + rl, vhead0, vs0), ¬ ps[vhead0].next ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl0, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ rl0, ¬ ps[vhead0].next ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = (ps[vhead0].next ' + orl0).last ∨ vtail = (vhead0 ' + (ps[vhead0].next ' + orl0).butlast).last ∧ vs[(ps[vhead0].next ' + orl0).last].deqID = None ∧ vs[(ps[vhead0].next ' + orl0).last].next = null, r0 = ps[vhead0].next ∨ r0 ∈ orl0, phead0 ∈ rl0 ∨ phead0 = vhead0, phead ∈ rl0 ∨ phead = vhead0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = ((ps[vhead0].next ' + orl0) + rl).last ∨ orl0 + rl ≠ [] ∧ vtail0 = (ps[vhead0].next ' + (orl0 + rl).butlast).last ∧ vs0[(orl0 + rl).last].deqID = None ∧ vs0[(orl0 + rl).last].next = null, vhead0 = vhead ∧ unmarkedp(orl0, vs) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl0, vs) ⊦ r0 ≠ vhead ∧ r0 ∈ (rl0 + vhead0 ') + ps[vhead0].next ' + orl0 from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ 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) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (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) ⊦ 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)
| vs[r0].deqID = Some(tid), ps[ps[vhead0].next].deqID = None, ps0[vhead0].next = ps[vhead0].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), ps[vhead0].next ≠ vhead0, phead0 ≠ ps[vhead0].next, r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl0 + vhead0 ') + ps[vhead0].next ' + orl0, vs, ps, vs0, ps0), listp((rl0 + vhead0 ') + (ps[vhead0].next ' + orl0) + rl, vs0, ps0, owns0), listp((rl0 + vhead0 ') + ps[vhead0].next ' + orl0, vs, ps, owns), markedp(rl0, vs0), markedp(rl0, ps), markedp(rl0, vs), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl0 + vhead0 ') + ps[vhead0].next ' + orl0, vs, (rl0 + vhead0 ') + (ps[vhead0].next ' + orl0) + rl, vs0), nonullRetRefs((rl0 + vhead0 ') + ps[vhead0].next ' + orl0, vs, vretRefs, pretRefs), nonullRetRefs((rl0 + vhead0 ') + (ps[vhead0].next ' + orl0) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps0[vhead0].deqID), some?(ps0[ps[vhead0].next].deqID), some?(vs0[ps[vhead0].next].deqID), unmarkedp(rl, ps0), unmarkedp(orl0, ps0), unmarkedp(rl, vs0), unmarkedp(orl0, vs0), unmarkedp(orl0, ps), phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps, phead0 ∈ vs, vtail0 ∈ (rl0 + vhead0 ') + (ps[vhead0].next ' + orl0) + rl from vtail, vhead0 ∈ (rl0 + vhead0 ') + (ps[vhead0].next ' + orl0) + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ rl0 + vhead0 ' from phead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl0 + orl0), ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl0), ¬ dups(rl0 + orl0 + rl), ¬ noid(tid, (rl0 + vhead0 ') + (ps[vhead0].next ' + orl0) + rl, vhead0, vs0), ¬ ps[vhead0].next ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl0, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ rl0, ¬ ps[vhead0].next ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = (ps[vhead0].next ' + orl0).last ∨ vtail = (vhead0 ' + (ps[vhead0].next ' + orl0).butlast).last ∧ vs[(ps[vhead0].next ' + orl0).last].deqID = None ∧ vs[(ps[vhead0].next ' + orl0).last].next = null, r0 = ps[vhead0].next ∨ r0 ∈ orl0, phead0 ∈ rl0 ∨ phead0 = vhead0, phead ∈ rl0 ∨ phead = vhead0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = ((ps[vhead0].next ' + orl0) + rl).last ∨ orl0 + rl ≠ [] ∧ vtail0 = (ps[vhead0].next ' + (orl0 + rl).butlast).last ∧ vs0[(orl0 + rl).last].deqID = None ∧ vs0[(orl0 + rl).last].next = null, vhead0 = vhead ∧ unmarkedp(orl0, vs) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl0, vs) ⊦ r0 ≠ vhead ∧ r0 ∈ (rl0 + vhead0 ') + ps[vhead0].next ' + orl0 from vhead |
ps[ps[vhead0].next].deqID = None, vs[r0].deqID = Some(tid), ps0[vhead0].next = ps[vhead0].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, rl0 = orl + vtail1 ', vretRefs(tid) = vretRefs0(tid), ps[vhead0].next ≠ vhead0, phead0 ≠ ps[vhead0].next, r0 ≠ vhead0, rl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl0 + vhead0 ') + ps[vhead0].next ' + orl0, vs, ps, vs0, ps0), listp((rl0 + vhead0 ') + ps[vhead0].next ' + orl0, vs, ps, owns), listp((rl0 + vhead0 ') + (ps[vhead0].next ' + orl0) + rl, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl0, vs), markedp(rl0, ps), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl0 + vhead0 ') + ps[vhead0].next ' + orl0, vs, (rl0 + vhead0 ') + (ps[vhead0].next ' + orl0) + rl, vs0), nonullRetRefs((rl0 + vhead0 ') + (ps[vhead0].next ' + orl0) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl0 + vhead0 ') + ps[vhead0].next ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps[vhead0].next].deqID), some?(ps0[ps[vhead0].next].deqID), some?(ps0[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs0), unmarkedp(rl, vs0), unmarkedp(orl0, ps0), unmarkedp(rl, ps0), phead0 ∈ rl0 + vhead0 ' from phead, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (rl0 + vhead0 ') + (ps[vhead0].next ' + orl0) + rl from vhead, vtail0 ∈ (rl0 + vhead0 ') + (ps[vhead0].next ' + orl0) + rl from vtail, phead0 ∈ vs, phead0 ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl0 + orl0), ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl0), ¬ dups(rl0 + orl0 + rl), ¬ noid(tid, (rl0 + vhead0 ') + (ps[vhead0].next ' + orl0) + rl, vhead0, vs0), ¬ ps[vhead0].next ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl0, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ rl0, ¬ ps[vhead0].next ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(orl0, vs) ∨ rl0 ≠ [] ∧ vtail1 = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl0, vs), vtail0 = ((ps[vhead0].next ' + orl0) + rl).last ∨ orl0 + rl ≠ [] ∧ vtail0 = (ps[vhead0].next ' + (orl0 + rl).butlast).last ∧ vs0[(orl0 + rl).last].deqID = None ∧ vs0[(orl0 + rl).last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead ∈ rl0 ∨ phead = vhead0, phead0 ∈ rl0 ∨ phead0 = vhead0, r0 = ps[vhead0].next ∨ r0 ∈ orl0, vtail = (ps[vhead0].next ' + orl0).last ∨ vtail = (vhead0 ' + (ps[vhead0].next ' + orl0).butlast).last ∧ vs[(ps[vhead0].next ' + orl0).last].deqID = None ∧ vs[(ps[vhead0].next ' + orl0).last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ (rl0 + vhead0 ') + ps[vhead0].next ' + orl0 from vhead
Used simplifier rules: ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ markedp([], vs); (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ [] + x = x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl0, vtail1, y
| ps[ps[vhead0].next].deqID = None, vs[r0].deqID = Some(tid), ps0[vhead0].next = ps[vhead0].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, rl0 = orl + vtail1 ', vretRefs(tid) = vretRefs0(tid), ps[vhead0].next ≠ vhead0, phead0 ≠ ps[vhead0].next, r0 ≠ vhead0, rl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl0 + vhead0 ') + ps[vhead0].next ' + orl0, vs, ps, vs0, ps0), listp((rl0 + vhead0 ') + ps[vhead0].next ' + orl0, vs, ps, owns), listp((rl0 + vhead0 ') + (ps[vhead0].next ' + orl0) + rl, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl0, vs), markedp(rl0, ps), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, (rl0 + vhead0 ') + ps[vhead0].next ' + orl0, vs, (rl0 + vhead0 ') + (ps[vhead0].next ' + orl0) + rl, vs0), nonullRetRefs((rl0 + vhead0 ') + (ps[vhead0].next ' + orl0) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl0 + vhead0 ') + ps[vhead0].next ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps[vhead0].next].deqID), some?(ps0[ps[vhead0].next].deqID), some?(ps0[vhead0].deqID), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs0), unmarkedp(rl, vs0), unmarkedp(orl0, ps0), unmarkedp(rl, ps0), phead0 ∈ rl0 + vhead0 ' from phead, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (rl0 + vhead0 ') + (ps[vhead0].next ' + orl0) + rl from vhead, vtail0 ∈ (rl0 + vhead0 ') + (ps[vhead0].next ' + orl0) + rl from vtail, phead0 ∈ vs, phead0 ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl0 + orl0), ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl0), ¬ dups(rl0 + orl0 + rl), ¬ noid(tid, (rl0 + vhead0 ') + (ps[vhead0].next ' + orl0) + rl, vhead0, vs0), ¬ ps[vhead0].next ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl0, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ rl0, ¬ ps[vhead0].next ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(orl0, vs) ∨ rl0 ≠ [] ∧ vtail1 = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl0, vs), vtail0 = ((ps[vhead0].next ' + orl0) + rl).last ∨ orl0 + rl ≠ [] ∧ vtail0 = (ps[vhead0].next ' + (orl0 + rl).butlast).last ∧ vs0[(orl0 + rl).last].deqID = None ∧ vs0[(orl0 + rl).last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead ∈ rl0 ∨ phead = vhead0, phead0 ∈ rl0 ∨ phead0 = vhead0, r0 = ps[vhead0].next ∨ r0 ∈ orl0, vtail = (ps[vhead0].next ' + orl0).last ∨ vtail = (vhead0 ' + (ps[vhead0].next ' + orl0).butlast).last ∧ vs[(ps[vhead0].next ' + orl0).last].deqID = None ∧ vs[(ps[vhead0].next ' + orl0).last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ (rl0 + vhead0 ') + ps[vhead0].next ' + orl0 from vhead |
ps[ps[ps0[vtail1].next].next].deqID = None, vs[r0].deqID = Some(tid), ps[vtail1].next = ps0[vtail1].next, ps0[ps0[vtail1].next].next = ps[ps0[vtail1].next].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), ps0[vtail1].next ≠ vtail1, ps[ps0[vtail1].next].next ≠ vtail1, ps[ps0[vtail1].next].next ≠ ps0[vtail1].next, phead0 ≠ ps[ps0[vtail1].next].next, r0 ≠ ps0[vtail1].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(((orl + vtail1 ') + ps0[vtail1].next ') + ps[ps0[vtail1].next].next ' + orl0, vs, ps, vs0, ps0), listp(((orl + vtail1 ') + ps0[vtail1].next ') + ps[ps0[vtail1].next].next ' + orl0, vs, ps, owns), listp(((orl + vtail1 ') + ps0[vtail1].next ') + (ps[ps0[vtail1].next].next ' + orl0) + rl, vs0, ps0, owns0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, ps0[vtail1].next, vs0), noidRely (tid, ((orl + vtail1 ') + ps0[vtail1].next ') + ps[ps0[vtail1].next].next ' + orl0, vs, ((orl + vtail1 ') + ps0[vtail1].next ') + (ps[ps0[vtail1].next].next ' + orl0) + rl, vs0), nonullRetRefs(((orl + vtail1 ') + ps0[vtail1].next ') + (ps[ps0[vtail1].next].next ' + orl0) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(((orl + vtail1 ') + ps0[vtail1].next ') + ps[ps0[vtail1].next].next ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs0[vtail1].deqID), some?(vs0[ps[ps0[vtail1].next].next].deqID), some?(ps0[ps[ps0[vtail1].next].next].deqID), some?(ps0[ps0[vtail1].next].deqID), some?(vs[ps0[vtail1].next].deqID), some?(ps[ps0[vtail1].next].deqID), some?(vs0[ps0[vtail1].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs0), unmarkedp(rl, vs0), unmarkedp(orl0, ps0), unmarkedp(rl, ps0), phead0 ∈ (orl + vtail1 ') + ps0[vtail1].next ' from phead, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, ps0[vtail1].next ∈ ((orl + vtail1 ') + ps0[vtail1].next ') + (ps[ps0[vtail1].next].next ' + orl0) + rl from vhead, vtail0 ∈ ((orl + vtail1 ') + ps0[vtail1].next ') + (ps[ps0[vtail1].next].next ' + orl0) + rl from vtail, phead0 ∈ vs, phead0 ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0), ¬ dups(rl), ¬ dups(orl + orl0), ¬ dups(orl0 + rl), ¬ dups(orl), ¬ dups(orl + orl0 + rl), ¬ noid(tid, ((orl + vtail1 ') + ps0[vtail1].next ') + (ps[ps0[vtail1].next].next ' + orl0) + rl, ps0[vtail1].next, vs0), ¬ ps0[vtail1].next ∈ orl, ¬ ps0[vtail1].next ∈ orl0, ¬ ps0[vtail1].next ∈ rl, ¬ ps[ps0[vtail1].next].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ rl, ¬ ps[ps0[vtail1].next].next ∈ orl, ¬ vtail1 ∈ rl, ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ orl, ¬ ps[ps0[vtail1].next].next ∈ rl, vs0[ps0[vtail1].next].next ≠ null ∧ vs0[vs0[ps0[vtail1].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps0[vtail1].next].next].deqID.tid)) = Claimed(vs0[vs0[ps0[vtail1].next].next].deqID.tid, vs0[vs0[ps0[vtail1].next].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), phead ∈ orl ∨ phead = vtail1 ∨ phead = ps0[vtail1].next, phead0 ∈ orl ∨ phead0 = vtail1 ∨ phead0 = ps0[vtail1].next, vtail0 = ((ps[ps0[vtail1].next].next ' + orl0) + rl).last ∨ orl0 + rl ≠ [] ∧ vtail0 = (ps[ps0[vtail1].next].next ' + (orl0 + rl).butlast).last ∧ vs0[(orl0 + rl).last].deqID = None ∧ vs0[(orl0 + rl).last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), r0 = ps[ps0[vtail1].next].next ∨ r0 ∈ orl0, vtail = (ps[ps0[vtail1].next].next ' + orl0).last ∨ vtail = (ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + orl0).butlast).last ∧ vs[(ps[ps0[vtail1].next].next ' + orl0).last].deqID = None ∧ vs[(ps[ps0[vtail1].next].next ' + orl0).last].next = null, ps0[vtail1].next = vhead ∧ unmarkedp(orl0, vs) ∨ vtail1 = vhead ∧ phead ≠ ps0[vhead].next ∧ vs[ps[ps0[vhead].next].next].deqID = None ∧ unmarkedp(orl0, vs) ⊦ r0 ≠ vhead ∧ r0 ∈ ((orl + vtail1 ') + ps0[vtail1].next ') + ps[ps0[vtail1].next].next ' + orl0 from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ x + a ' ≠ []; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s)
| ps[ps[ps0[vtail1].next].next].deqID = None, vs[r0].deqID = Some(tid), ps[vtail1].next = ps0[vtail1].next, ps0[ps0[vtail1].next].next = ps[ps0[vtail1].next].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), ps0[vtail1].next ≠ vtail1, ps[ps0[vtail1].next].next ≠ vtail1, ps[ps0[vtail1].next].next ≠ ps0[vtail1].next, phead0 ≠ ps[ps0[vtail1].next].next, r0 ≠ ps0[vtail1].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(((orl + vtail1 ') + ps0[vtail1].next ') + ps[ps0[vtail1].next].next ' + orl0, vs, ps, vs0, ps0), listp(((orl + vtail1 ') + ps0[vtail1].next ') + ps[ps0[vtail1].next].next ' + orl0, vs, ps, owns), listp(((orl + vtail1 ') + ps0[vtail1].next ') + (ps[ps0[vtail1].next].next ' + orl0) + rl, vs0, ps0, owns0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, ps0[vtail1].next, vs0), noidRely (tid, ((orl + vtail1 ') + ps0[vtail1].next ') + ps[ps0[vtail1].next].next ' + orl0, vs, ((orl + vtail1 ') + ps0[vtail1].next ') + (ps[ps0[vtail1].next].next ' + orl0) + rl, vs0), nonullRetRefs(((orl + vtail1 ') + ps0[vtail1].next ') + (ps[ps0[vtail1].next].next ' + orl0) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(((orl + vtail1 ') + ps0[vtail1].next ') + ps[ps0[vtail1].next].next ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs0[vtail1].deqID), some?(vs0[ps[ps0[vtail1].next].next].deqID), some?(ps0[ps[ps0[vtail1].next].next].deqID), some?(ps0[ps0[vtail1].next].deqID), some?(vs[ps0[vtail1].next].deqID), some?(ps[ps0[vtail1].next].deqID), some?(vs0[ps0[vtail1].next].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs0), unmarkedp(rl, vs0), unmarkedp(orl0, ps0), unmarkedp(rl, ps0), phead0 ∈ (orl + vtail1 ') + ps0[vtail1].next ' from phead, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, ps0[vtail1].next ∈ ((orl + vtail1 ') + ps0[vtail1].next ') + (ps[ps0[vtail1].next].next ' + orl0) + rl from vhead, vtail0 ∈ ((orl + vtail1 ') + ps0[vtail1].next ') + (ps[ps0[vtail1].next].next ' + orl0) + rl from vtail, phead0 ∈ vs, phead0 ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0), ¬ dups(rl), ¬ dups(orl + orl0), ¬ dups(orl0 + rl), ¬ dups(orl), ¬ dups(orl + orl0 + rl), ¬ noid(tid, ((orl + vtail1 ') + ps0[vtail1].next ') + (ps[ps0[vtail1].next].next ' + orl0) + rl, ps0[vtail1].next, vs0), ¬ ps0[vtail1].next ∈ orl, ¬ ps0[vtail1].next ∈ orl0, ¬ ps0[vtail1].next ∈ rl, ¬ ps[ps0[vtail1].next].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ rl, ¬ ps[ps0[vtail1].next].next ∈ orl, ¬ vtail1 ∈ rl, ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ orl, ¬ ps[ps0[vtail1].next].next ∈ rl, vs0[ps0[vtail1].next].next ≠ null ∧ vs0[vs0[ps0[vtail1].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps0[vtail1].next].next].deqID.tid)) = Claimed(vs0[vs0[ps0[vtail1].next].next].deqID.tid, vs0[vs0[ps0[vtail1].next].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), phead ∈ orl ∨ phead = vtail1 ∨ phead = ps0[vtail1].next, phead0 ∈ orl ∨ phead0 = vtail1 ∨ phead0 = ps0[vtail1].next, vtail0 = ((ps[ps0[vtail1].next].next ' + orl0) + rl).last ∨ orl0 + rl ≠ [] ∧ vtail0 = (ps[ps0[vtail1].next].next ' + (orl0 + rl).butlast).last ∧ vs0[(orl0 + rl).last].deqID = None ∧ vs0[(orl0 + rl).last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), r0 = ps[ps0[vtail1].next].next ∨ r0 ∈ orl0, vtail = (ps[ps0[vtail1].next].next ' + orl0).last ∨ vtail = (ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + orl0).butlast).last ∧ vs[(ps[ps0[vtail1].next].next ' + orl0).last].deqID = None ∧ vs[(ps[ps0[vtail1].next].next ' + orl0).last].next = null, ps0[vtail1].next = vhead ∧ unmarkedp(orl0, vs) ∨ vtail1 = vhead ∧ phead ≠ ps0[vhead].next ∧ vs[ps[ps0[vhead].next].next].deqID = None ∧ unmarkedp(orl0, vs) ⊦ r0 ≠ vhead ∧ r0 ∈ ((orl + vtail1 ') + ps0[vtail1].next ') + ps[ps0[vtail1].next].next ' + orl0 from vhead |
vs[r0].deqID = Some(tid), ps[ps[ps0[vtail1].next].next].deqID = None, ps0[ps0[vtail1].next].next = ps[ps0[vtail1].next].next, ps[vtail1].next = ps0[vtail1].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), ps0[vtail1].next ≠ vtail1, ps[ps0[vtail1].next].next ≠ vtail1, ps[ps0[vtail1].next].next ≠ ps0[vtail1].next, phead0 ≠ ps[ps0[vtail1].next].next, r0 ≠ ps0[vtail1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(((orl + vtail1 ') + ps0[vtail1].next ') + ps[ps0[vtail1].next].next ' + orl0, vs, ps, vs0, ps0), listp(((orl + vtail1 ') + ps0[vtail1].next ') + (ps[ps0[vtail1].next].next ' + orl0) + rl, vs0, ps0, owns0), listp(((orl + vtail1 ') + ps0[vtail1].next ') + ps[ps0[vtail1].next].next ' + orl0, vs, ps, owns), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, ps0[vtail1].next, vs0), noidRely (tid, ((orl + vtail1 ') + ps0[vtail1].next ') + ps[ps0[vtail1].next].next ' + orl0, vs, ((orl + vtail1 ') + ps0[vtail1].next ') + (ps[ps0[vtail1].next].next ' + orl0) + rl, vs0), nonullRetRefs(((orl + vtail1 ') + ps0[vtail1].next ') + ps[ps0[vtail1].next].next ' + orl0, vs, vretRefs, pretRefs), nonullRetRefs(((orl + vtail1 ') + ps0[vtail1].next ') + (ps[ps0[vtail1].next].next ' + orl0) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps0[vtail1].next].deqID), some?(ps[ps0[vtail1].next].deqID), some?(vs[ps0[vtail1].next].deqID), some?(ps0[ps0[vtail1].next].deqID), some?(ps0[ps[ps0[vtail1].next].next].deqID), some?(vs0[ps[ps0[vtail1].next].next].deqID), some?(vs0[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps0[vtail1].deqID), unmarkedp(rl, ps0), unmarkedp(orl0, ps0), unmarkedp(rl, vs0), unmarkedp(orl0, vs0), unmarkedp(orl0, ps), phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps, phead0 ∈ vs, vtail0 ∈ ((orl + vtail1 ') + ps0[vtail1].next ') + (ps[ps0[vtail1].next].next ' + orl0) + rl from vtail, ps0[vtail1].next ∈ ((orl + vtail1 ') + ps0[vtail1].next ') + (ps[ps0[vtail1].next].next ' + orl0) + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ (orl + vtail1 ') + ps0[vtail1].next ' from phead, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0), ¬ dups(rl), ¬ dups(orl + orl0), ¬ dups(orl0 + rl), ¬ dups(orl), ¬ dups(orl + orl0 + rl), ¬ noid(tid, ((orl + vtail1 ') + ps0[vtail1].next ') + (ps[ps0[vtail1].next].next ' + orl0) + rl, ps0[vtail1].next, vs0), ¬ r0 ∈ ((orl + vtail1 ') + ps0[vtail1].next ') + ps[ps0[vtail1].next].next ' + orl0 from vhead, ¬ ps0[vtail1].next ∈ orl, ¬ ps0[vtail1].next ∈ orl0, ¬ ps0[vtail1].next ∈ rl, ¬ ps[ps0[vtail1].next].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ rl, ¬ ps[ps0[vtail1].next].next ∈ orl, ¬ vtail1 ∈ rl, ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ orl, ¬ ps[ps0[vtail1].next].next ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[ps0[vtail1].next].next ≠ null ∧ vs0[vs0[ps0[vtail1].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps0[vtail1].next].next].deqID.tid)) = Claimed(vs0[vs0[ps0[vtail1].next].next].deqID.tid, vs0[vs0[ps0[vtail1].next].next].val), ps0[vtail1].next = vhead ∧ unmarkedp(orl0, vs) ∨ vtail1 = vhead ∧ phead ≠ ps0[vhead].next ∧ vs[ps[ps0[vhead].next].next].deqID = None ∧ unmarkedp(orl0, vs), vtail = (ps[ps0[vtail1].next].next ' + orl0).last ∨ vtail = (ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + orl0).butlast).last ∧ vs[(ps[ps0[vtail1].next].next ' + orl0).last].deqID = None ∧ vs[(ps[ps0[vtail1].next].next ' + orl0).last].next = null, r0 = ps[ps0[vtail1].next].next ∨ r0 ∈ orl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = ((ps[ps0[vtail1].next].next ' + orl0) + rl).last ∨ orl0 + rl ≠ [] ∧ vtail0 = (ps[ps0[vtail1].next].next ' + (orl0 + rl).butlast).last ∧ vs0[(orl0 + rl).last].deqID = None ∧ vs0[(orl0 + rl).last].next = null, phead0 ∈ orl ∨ phead0 = vtail1 ∨ phead0 = ps0[vtail1].next, phead ∈ orl ∨ phead = vtail1 ∨ phead = ps0[vtail1].next ⊦
| vs[r0].deqID = Some(tid), ps[ps[ps0[vtail1].next].next].deqID = None, ps0[ps0[vtail1].next].next = ps[ps0[vtail1].next].next, ps[vtail1].next = ps0[vtail1].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), ps0[vtail1].next ≠ vtail1, ps[ps0[vtail1].next].next ≠ vtail1, ps[ps0[vtail1].next].next ≠ ps0[vtail1].next, phead0 ≠ ps[ps0[vtail1].next].next, r0 ≠ ps0[vtail1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(((orl + vtail1 ') + ps0[vtail1].next ') + ps[ps0[vtail1].next].next ' + orl0, vs, ps, vs0, ps0), listp(((orl + vtail1 ') + ps0[vtail1].next ') + (ps[ps0[vtail1].next].next ' + orl0) + rl, vs0, ps0, owns0), listp(((orl + vtail1 ') + ps0[vtail1].next ') + ps[ps0[vtail1].next].next ' + orl0, vs, ps, owns), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, ps0[vtail1].next, vs0), noidRely (tid, ((orl + vtail1 ') + ps0[vtail1].next ') + ps[ps0[vtail1].next].next ' + orl0, vs, ((orl + vtail1 ') + ps0[vtail1].next ') + (ps[ps0[vtail1].next].next ' + orl0) + rl, vs0), nonullRetRefs(((orl + vtail1 ') + ps0[vtail1].next ') + ps[ps0[vtail1].next].next ' + orl0, vs, vretRefs, pretRefs), nonullRetRefs(((orl + vtail1 ') + ps0[vtail1].next ') + (ps[ps0[vtail1].next].next ' + orl0) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps0[vtail1].next].deqID), some?(ps[ps0[vtail1].next].deqID), some?(vs[ps0[vtail1].next].deqID), some?(ps0[ps0[vtail1].next].deqID), some?(ps0[ps[ps0[vtail1].next].next].deqID), some?(vs0[ps[ps0[vtail1].next].next].deqID), some?(vs0[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps0[vtail1].deqID), unmarkedp(rl, ps0), unmarkedp(orl0, ps0), unmarkedp(rl, vs0), unmarkedp(orl0, vs0), unmarkedp(orl0, ps), phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps, phead0 ∈ vs, vtail0 ∈ ((orl + vtail1 ') + ps0[vtail1].next ') + (ps[ps0[vtail1].next].next ' + orl0) + rl from vtail, ps0[vtail1].next ∈ ((orl + vtail1 ') + ps0[vtail1].next ') + (ps[ps0[vtail1].next].next ' + orl0) + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ (orl + vtail1 ') + ps0[vtail1].next ' from phead, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0), ¬ dups(rl), ¬ dups(orl + orl0), ¬ dups(orl0 + rl), ¬ dups(orl), ¬ dups(orl + orl0 + rl), ¬ noid(tid, ((orl + vtail1 ') + ps0[vtail1].next ') + (ps[ps0[vtail1].next].next ' + orl0) + rl, ps0[vtail1].next, vs0), ¬ r0 ∈ ((orl + vtail1 ') + ps0[vtail1].next ') + ps[ps0[vtail1].next].next ' + orl0 from vhead, ¬ ps0[vtail1].next ∈ orl, ¬ ps0[vtail1].next ∈ orl0, ¬ ps0[vtail1].next ∈ rl, ¬ ps[ps0[vtail1].next].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ rl, ¬ ps[ps0[vtail1].next].next ∈ orl, ¬ vtail1 ∈ rl, ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ orl, ¬ ps[ps0[vtail1].next].next ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[ps0[vtail1].next].next ≠ null ∧ vs0[vs0[ps0[vtail1].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps0[vtail1].next].next].deqID.tid)) = Claimed(vs0[vs0[ps0[vtail1].next].next].deqID.tid, vs0[vs0[ps0[vtail1].next].next].val), ps0[vtail1].next = vhead ∧ unmarkedp(orl0, vs) ∨ vtail1 = vhead ∧ phead ≠ ps0[vhead].next ∧ vs[ps[ps0[vhead].next].next].deqID = None ∧ unmarkedp(orl0, vs), vtail = (ps[ps0[vtail1].next].next ' + orl0).last ∨ vtail = (ps0[vtail1].next ' + (ps[ps0[vtail1].next].next ' + orl0).butlast).last ∧ vs[(ps[ps0[vtail1].next].next ' + orl0).last].deqID = None ∧ vs[(ps[ps0[vtail1].next].next ' + orl0).last].next = null, r0 = ps[ps0[vtail1].next].next ∨ r0 ∈ orl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = ((ps[ps0[vtail1].next].next ' + orl0) + rl).last ∨ orl0 + rl ≠ [] ∧ vtail0 = (ps[ps0[vtail1].next].next ' + (orl0 + rl).butlast).last ∧ vs0[(orl0 + rl).last].deqID = None ∧ vs0[(orl0 + rl).last].next = null, phead0 ∈ orl ∨ phead0 = vtail1 ∨ phead0 = ps0[vtail1].next, phead ∈ orl ∨ phead = vtail1 ∨ phead = ps0[vtail1].next ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) Used terms: (orl + vtail1 ') + ps0[vtail1].next ', ps[ps0[vtail1].next].next ' + orl0, vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| qrl + rl = (orl0 + vtail1 ') + qrl0, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl + orl0 ≠ [], orl ≠ [], orl0 ≠ [], phead0 ≠ vtail1, r0 ≠ orl0.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + orl0 + vtail1 ') + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl, vs0), markedp(orl0, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, orl0.last, vs0), noidRely(tid, orl + qrl, vs, (orl + orl0 + vtail1 ') + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + orl0 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), r0 ∈ orl + qrl from orl0.last, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + orl0 + vtail1 ') + qrl0 from vtail, orl0.last ∈ (orl + orl0 + vtail1 ') + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + orl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl0), ¬ dups(qrl0), ¬ dups(orl0 + qrl0), ¬ dups(orl + orl0), ¬ noid(tid, (orl + orl0 + vtail1 ') + qrl0, orl0.last, vs0), ¬ vtail1 ∈ orl, ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[orl0.last].next ≠ null ∧ vs0[vs0[orl0.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[orl0.last].next].deqID.tid)) = Claimed(vs0[vs0[orl0.last].next].deqID.tid, vs0[vs0[orl0.last].next].val), phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ orl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid) ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead |
qrl + rl = (orl0 + vtail1 ') + qrl0, vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, orl0 = orl1 + vhead0 ', vretRefs(tid) = vretRefs0(tid), orl + orl0 ≠ [], orl ≠ [], orl0 ≠ [], phead0 ≠ vtail1, r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + orl0 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl0, vs0), markedp(orl, vs0), markedp(orl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + orl0 + vtail1 ') + qrl0, vs0), nonullRetRefs((orl + orl0 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + orl0 + vtail1 ') + qrl0 from vhead, vtail0 ∈ (orl + orl0 + vtail1 ') + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl + qrl from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + orl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl0), ¬ dups(qrl0), ¬ dups(orl0 + qrl0), ¬ dups(orl + orl0), ¬ noid(tid, (orl + orl0 + vtail1 ') + qrl0, vhead0, vs0), ¬ vtail1 ∈ orl, ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ orl ∨ phead0 ∈ orl0, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, vhead0, y
| qrl + rl = (orl0 + vtail1 ') + qrl0, vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, orl0 = orl1 + vhead0 ', vretRefs(tid) = vretRefs0(tid), orl + orl0 ≠ [], orl ≠ [], orl0 ≠ [], phead0 ≠ vtail1, r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + orl0 + vtail1 ') + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl0, vs0), markedp(orl, vs0), markedp(orl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + orl0 + vtail1 ') + qrl0, vs0), nonullRetRefs((orl + orl0 + vtail1 ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + orl0 + vtail1 ') + qrl0 from vhead, vtail0 ∈ (orl + orl0 + vtail1 ') + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl + qrl from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + orl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl0), ¬ dups(qrl0), ¬ dups(orl0 + qrl0), ¬ dups(orl + orl0), ¬ noid(tid, (orl + orl0 + vtail1 ') + qrl0, vhead0, vs0), ¬ vtail1 ∈ orl, ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ orl ∨ phead0 ∈ orl0, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead |
qrl + rl = ((orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), ps0[vhead0].next ≠ vhead0, orl ≠ [], phead0 ≠ ps0[vhead0].next, r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl1, vs0), markedp(orl, vs0), markedp(orl1, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0), nonullRetRefs((orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[ps0[vhead0].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), r0 ∈ qrl from vhead0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0 from vhead, vtail0 ∈ (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + orl1), ¬ dups(orl1 + qrl0), ¬ dups(qrl0), ¬ dups(orl1), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups((orl + orl1) + qrl0), ¬ dups(orl + qrl), ¬ noid(tid, (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vhead0, vs0), ¬ ps0[vhead0].next ∈ orl1, ¬ ps0[vhead0].next ∈ orl, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ ps0[vhead0].next ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl from phead ∨ phead0 ∈ orl1 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ orl1 ∨ phead0 = vhead0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (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)
| qrl + rl = ((orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs[r0].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), ps0[vhead0].next ≠ vhead0, orl ≠ [], phead0 ≠ ps0[vhead0].next, r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl1, vs0), markedp(orl, vs0), markedp(orl1, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0), nonullRetRefs((orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[ps0[vhead0].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), r0 ∈ qrl from vhead0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0 from vhead, vtail0 ∈ (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + orl1), ¬ dups(orl1 + qrl0), ¬ dups(qrl0), ¬ dups(orl1), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups((orl + orl1) + qrl0), ¬ dups(orl + qrl), ¬ noid(tid, (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vhead0, vs0), ¬ ps0[vhead0].next ∈ orl1, ¬ ps0[vhead0].next ∈ orl, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ ps0[vhead0].next ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl from phead ∨ phead0 ∈ orl1 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ orl1 ∨ phead0 = vhead0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead |
qrl + rl = ((orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, qrl = vtail1 + orl0, vretRefs(tid) = vretRefs0(tid), ps0[vhead0].next ≠ vhead0, orl ≠ [], phead0 ≠ ps0[vhead0].next, qrl ≠ [], r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0, ps0, owns0), markedp(orl1, ps0), markedp(orl, vs0), markedp(orl1, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[ps0[vhead0].next].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0 from vtail, vhead0 ∈ (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, r0 ∈ qrl from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + orl1), ¬ dups(orl1 + qrl0), ¬ dups(qrl0), ¬ dups(orl1), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups((orl + orl1) + qrl0), ¬ dups(orl + qrl), ¬ noid(tid, (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vhead0, vs0), ¬ ps0[vhead0].next ∈ orl1, ¬ ps0[vhead0].next ∈ orl, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ ps0[vhead0].next ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(orl0, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ orl1 ∨ phead0 = vhead0, phead0 ∈ orl from phead ∨ phead0 ∈ orl1 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead
Used simplifier rules: ⊦ [] + x = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ [] from r = []; (s) ⊦ ¬ a ∈ []; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, vtail1, y
| qrl + rl = ((orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, qrl = vtail1 + orl0, vretRefs(tid) = vretRefs0(tid), ps0[vhead0].next ≠ vhead0, orl ≠ [], phead0 ≠ ps0[vhead0].next, qrl ≠ [], r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0, ps0, owns0), markedp(orl1, ps0), markedp(orl, vs0), markedp(orl1, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + qrl, vs, (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[ps0[vhead0].next].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0 from vtail, vhead0 ∈ (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, r0 ∈ qrl from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + orl1), ¬ dups(orl1 + qrl0), ¬ dups(qrl0), ¬ dups(orl1), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups((orl + orl1) + qrl0), ¬ dups(orl + qrl), ¬ noid(tid, (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vhead0, vs0), ¬ ps0[vhead0].next ∈ orl1, ¬ ps0[vhead0].next ∈ orl, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ ps0[vhead0].next ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(orl0, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ orl1 ∨ phead0 = vhead0, phead0 ∈ orl from phead ∨ phead0 ∈ orl1 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead |
(vtail1 ' + orl0) + rl = ((orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, ps[vtail1].deqID = None, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), ps0[vhead0].next ≠ vhead0, orl ≠ [], phead0 ≠ ps0[vhead0].next, r0 ≠ vhead0, vtail1 ≠ ps0[vhead0].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vtail1 ' + orl0, vs, ps, vs0, ps0), listp(orl + vtail1 ' + orl0, vs, ps, owns), listp((orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0, ps0, owns0), markedp(orl1, ps0), markedp(orl, vs0), markedp(orl1, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vtail1 ' + orl0, vs, (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0), nonullRetRefs(orl + vtail1 ' + orl0, vs, vretRefs, pretRefs), nonullRetRefs((orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[ps0[vhead0].next].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(orl0, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0 from vtail, vhead0 ∈ (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, r0 ∈ vtail1 ' + orl0 from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ dups((orl + orl1) + qrl0), ¬ dups(rl), ¬ dups(orl1), ¬ dups(qrl0), ¬ dups(orl1 + qrl0), ¬ dups(orl + orl1), ¬ noid(tid, (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vhead0, vs0), ¬ vtail1 ∈ orl, ¬ vtail1 ∈ orl0, ¬ ps0[vhead0].next ∈ qrl0, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ qrl0, ¬ ps0[vhead0].next ∈ orl, ¬ ps0[vhead0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = (vtail1 ' + orl0).last ∨ vtail = (orl + (vtail1 ' + orl0).butlast).last ∧ vs[(vtail1 ' + orl0).last].deqID = None ∧ vs[(vtail1 ' + orl0).last].next = null, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail1].deqID = None ∧ unmarkedp(orl0, vs), vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ orl1 ∨ phead0 = vhead0, phead0 ∈ orl from phead ∨ phead0 ∈ orl1 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, vtail1 ∈ qrl0 ∨ vtail1 = vhead0 ∨ vtail1 ∈ orl1 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vtail1 ' + orl0 from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ a ∈ y → (y + c ' + z = a ' + z0 ↔ y = [] ∧ c = a ∧ z = z0); (ws) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ a + x = a ' + x; (s) ⊦ a ' + x ≠ []; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s)
| (vtail1 ' + orl0) + rl = ((orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, ps[vtail1].deqID = None, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), ps0[vhead0].next ≠ vhead0, orl ≠ [], phead0 ≠ ps0[vhead0].next, r0 ≠ vhead0, vtail1 ≠ ps0[vhead0].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vtail1 ' + orl0, vs, ps, vs0, ps0), listp(orl + vtail1 ' + orl0, vs, ps, owns), listp((orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0, ps0, owns0), markedp(orl1, ps0), markedp(orl, vs0), markedp(orl1, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vtail1 ' + orl0, vs, (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0), nonullRetRefs(orl + vtail1 ' + orl0, vs, vretRefs, pretRefs), nonullRetRefs((orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[ps0[vhead0].next].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(orl0, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0 from vtail, vhead0 ∈ (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, r0 ∈ vtail1 ' + orl0 from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ dups((orl + orl1) + qrl0), ¬ dups(rl), ¬ dups(orl1), ¬ dups(qrl0), ¬ dups(orl1 + qrl0), ¬ dups(orl + orl1), ¬ noid(tid, (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vhead0, vs0), ¬ vtail1 ∈ orl, ¬ vtail1 ∈ orl0, ¬ ps0[vhead0].next ∈ qrl0, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ qrl0, ¬ ps0[vhead0].next ∈ orl, ¬ ps0[vhead0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = (vtail1 ' + orl0).last ∨ vtail = (orl + (vtail1 ' + orl0).butlast).last ∧ vs[(vtail1 ' + orl0).last].deqID = None ∧ vs[(vtail1 ' + orl0).last].next = null, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail1].deqID = None ∧ unmarkedp(orl0, vs), vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ orl1 ∨ phead0 = vhead0, phead0 ∈ orl from phead ∨ phead0 ∈ orl1 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, vtail1 ∈ qrl0 ∨ vtail1 = vhead0 ∨ vtail1 ∈ orl1 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vtail1 ' + orl0 from vhead |
(vtail1 ' + orl0) + rl = ((orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs[r0].deqID = Some(tid), ps[vtail1].deqID = None, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, orl1 = [], vretRefs(tid) = vretRefs0(tid), ps0[vhead0].next ≠ vhead0, orl ≠ [], phead0 ≠ ps0[vhead0].next, r0 ≠ vhead0, vtail1 ≠ ps0[vhead0].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vtail1 ' + orl0, vs, ps, vs0, ps0), listp((orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0, ps0, owns0), listp(orl + vtail1 ' + orl0, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl1, vs0), markedp(orl, vs0), markedp(orl1, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vtail1 ' + orl0, vs, (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0), nonullRetRefs((orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vtail1 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[ps0[vhead0].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(orl0, ps), r0 ∈ vtail1 ' + orl0 from vhead0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0 from vhead, vtail0 ∈ (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ dups((orl + orl1) + qrl0), ¬ dups(rl), ¬ dups(orl1), ¬ dups(qrl0), ¬ dups(orl1 + qrl0), ¬ dups(orl + orl1), ¬ noid(tid, (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vhead0, vs0), ¬ vtail1 ∈ orl, ¬ vtail1 ∈ orl0, ¬ ps0[vhead0].next ∈ qrl0, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ qrl0, ¬ ps0[vhead0].next ∈ orl, ¬ ps0[vhead0].next ∈ orl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail1 ∈ qrl0 ∨ vtail1 = vhead0 ∨ vtail1 ∈ orl1, phead0 ∈ orl from phead ∨ phead0 ∈ orl1 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ orl1 ∨ phead0 = vhead0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail1].deqID = None ∧ unmarkedp(orl0, vs), vtail = (vtail1 ' + orl0).last ∨ vtail = (orl + (vtail1 ' + orl0).butlast).last ∧ vs[(vtail1 ' + orl0).last].deqID = None ∧ vs[(vtail1 ' + orl0).last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vtail1 ' + orl0 from vhead
(vtail1 ' + orl0) + rl = ((orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs[r0].deqID = Some(tid), ps[vtail1].deqID = None, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, orl1 = vtail2 + orl2, vretRefs(tid) = vretRefs0(tid), ps0[vhead0].next ≠ vhead0, orl ≠ [], phead0 ≠ ps0[vhead0].next, r0 ≠ vhead0, vtail1 ≠ ps0[vhead0].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vtail1 ' + orl0, vs, ps, vs0, ps0), listp((orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0, ps0, owns0), listp(orl + vtail1 ' + orl0, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl1, vs0), markedp(orl, vs0), markedp(orl1, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vtail1 ' + orl0, vs, (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0), nonullRetRefs((orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vtail1 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[ps0[vhead0].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(orl0, ps), r0 ∈ vtail1 ' + orl0 from vhead0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0 from vhead, vtail0 ∈ (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ dups((orl + orl1) + qrl0), ¬ dups(rl), ¬ dups(orl1), ¬ dups(qrl0), ¬ dups(orl1 + qrl0), ¬ dups(orl + orl1), ¬ noid(tid, (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vhead0, vs0), ¬ vtail1 ∈ orl, ¬ vtail1 ∈ orl0, ¬ ps0[vhead0].next ∈ qrl0, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ qrl0, ¬ ps0[vhead0].next ∈ orl, ¬ ps0[vhead0].next ∈ orl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail1 ∈ qrl0 ∨ vtail1 = vhead0 ∨ vtail1 ∈ orl1, phead0 ∈ orl from phead ∨ phead0 ∈ orl1 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ orl1 ∨ phead0 = vhead0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail1].deqID = None ∧ unmarkedp(orl0, vs), vtail = (vtail1 ' + orl0).last ∨ vtail = (orl + (vtail1 ' + orl0).butlast).last ∧ vs[(vtail1 ' + orl0).last].deqID = None ∧ vs[(vtail1 ' + orl0).last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vtail1 ' + orl0 from vhead
Used simplifier rules: reflist freely generated by [], +;;
| (vtail1 ' + orl0) + rl = ((orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs[r0].deqID = Some(tid), ps[vtail1].deqID = None, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, orl1 = [], vretRefs(tid) = vretRefs0(tid), ps0[vhead0].next ≠ vhead0, orl ≠ [], phead0 ≠ ps0[vhead0].next, r0 ≠ vhead0, vtail1 ≠ ps0[vhead0].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vtail1 ' + orl0, vs, ps, vs0, ps0), listp((orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0, ps0, owns0), listp(orl + vtail1 ' + orl0, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl1, vs0), markedp(orl, vs0), markedp(orl1, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vtail1 ' + orl0, vs, (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0), nonullRetRefs((orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vtail1 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[ps0[vhead0].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(orl0, ps), r0 ∈ vtail1 ' + orl0 from vhead0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0 from vhead, vtail0 ∈ (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ dups((orl + orl1) + qrl0), ¬ dups(rl), ¬ dups(orl1), ¬ dups(qrl0), ¬ dups(orl1 + qrl0), ¬ dups(orl + orl1), ¬ noid(tid, (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vhead0, vs0), ¬ vtail1 ∈ orl, ¬ vtail1 ∈ orl0, ¬ ps0[vhead0].next ∈ qrl0, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ qrl0, ¬ ps0[vhead0].next ∈ orl, ¬ ps0[vhead0].next ∈ orl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail1 ∈ qrl0 ∨ vtail1 = vhead0 ∨ vtail1 ∈ orl1, phead0 ∈ orl from phead ∨ phead0 ∈ orl1 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ orl1 ∨ phead0 = vhead0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail1].deqID = None ∧ unmarkedp(orl0, vs), vtail = (vtail1 ' + orl0).last ∨ vtail = (orl + (vtail1 ' + orl0).butlast).last ∧ vs[(vtail1 ' + orl0).last].deqID = None ∧ vs[(vtail1 ' + orl0).last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vtail1 ' + orl0 from vhead |
orl0 + rl = ps0[vhead0].next ' + qrl0, vs[r0].deqID = Some(tid), ps[vhead0].deqID = None, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), ps0[vhead0].next ≠ vhead0, orl ≠ [], phead0 ≠ ps0[vhead0].next, r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead0 ' + orl0, vs, ps, vs0, ps0), listp(orl + vhead0 ' + orl0 + rl, vs0, ps0, owns0), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vhead0 ' + orl0, vs, orl + vhead0 ' + orl0 + rl, vs0), nonullRetRefs(orl + vhead0 ' + orl0 + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[ps0[vhead0].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(orl0, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ orl + vhead0 ' + orl0 + rl from vhead, vtail0 ∈ orl + vhead0 ' + orl0 + rl from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl0, r0 ∈ vs, r0 ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(orl + qrl0), ¬ dups(orl + orl0), ¬ dups(orl0), ¬ noid(tid, orl + vhead0 ' + orl0 + rl, vhead0, vs0), ¬ ps0[vhead0].next ∈ orl, ¬ vhead0 ∈ qrl0, ¬ ps0[vhead0].next ∈ qrl0, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl from phead ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 = vhead0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (orl0 + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs), ps0[vhead0].next ∈ orl0 ∨ ps0[vhead0].next ∈ rl, vtail = orl0.last ∨ vtail = (orl + (vhead0 ' + orl0).butlast).last ∧ vs[orl0.last].deqID = None ∧ vs[orl0.last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vhead0 ' + orl0 from vhead
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) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)
| orl0 + rl = ps0[vhead0].next ' + qrl0, vs[r0].deqID = Some(tid), ps[vhead0].deqID = None, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), ps0[vhead0].next ≠ vhead0, orl ≠ [], phead0 ≠ ps0[vhead0].next, r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead0 ' + orl0, vs, ps, vs0, ps0), listp(orl + vhead0 ' + orl0 + rl, vs0, ps0, owns0), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vhead0 ' + orl0, vs, orl + vhead0 ' + orl0 + rl, vs0), nonullRetRefs(orl + vhead0 ' + orl0 + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[ps0[vhead0].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(orl0, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ orl + vhead0 ' + orl0 + rl from vhead, vtail0 ∈ orl + vhead0 ' + orl0 + rl from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl0, r0 ∈ vs, r0 ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(orl + qrl0), ¬ dups(orl + orl0), ¬ dups(orl0), ¬ noid(tid, orl + vhead0 ' + orl0 + rl, vhead0, vs0), ¬ ps0[vhead0].next ∈ orl, ¬ vhead0 ∈ qrl0, ¬ ps0[vhead0].next ∈ qrl0, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl from phead ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 = vhead0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (orl0 + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs), ps0[vhead0].next ∈ orl0 ∨ ps0[vhead0].next ∈ rl, vtail = orl0.last ∨ vtail = (orl + (vhead0 ' + orl0).butlast).last ∧ vs[orl0.last].deqID = None ∧ vs[orl0.last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vhead0 ' + orl0 from vhead |
orl0 + rl = ps0[vhead0].next ' + qrl0, ps[vhead0].deqID = None, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, orl0 = vhead1 + orl1, vretRefs(tid) = vretRefs0(tid), ps0[vhead0].next ≠ vhead0, orl ≠ [], phead0 ≠ ps0[vhead0].next, r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead0 ' + orl0, vs, ps, vs0, ps0), listp(orl + vhead0 ' + orl0, vs, ps, owns), listp(orl + vhead0 ' + orl0 + rl, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vhead0 ' + orl0, vs, orl + vhead0 ' + orl0 + rl, vs0), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), nonullRetRefs(orl + vhead0 ' + orl0 + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[ps0[vhead0].next].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(orl0, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), r0 ∈ ps, r0 ∈ vs, r0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ orl + vhead0 ' + orl0 + rl from vtail, vhead0 ∈ orl + vhead0 ' + orl0 + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(orl + qrl0), ¬ dups(orl + orl0), ¬ dups(orl0), ¬ noid(tid, orl + vhead0 ' + orl0 + rl, vhead0, vs0), ¬ ps0[vhead0].next ∈ orl, ¬ vhead0 ∈ qrl0, ¬ ps0[vhead0].next ∈ qrl0, ¬ 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = orl0.last ∨ vtail = (orl + (vhead0 ' + orl0).butlast).last ∧ vs[orl0.last].deqID = None ∧ vs[orl0.last].next = null, ps0[vhead0].next ∈ orl0 ∨ ps0[vhead0].next ∈ rl, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs), vtail0 = (orl0 + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 = vhead0, phead0 ∈ orl from phead ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vhead0 ' + orl0 from vhead
Used simplifier rules: reflist freely generated by [], +;; ⊦ [] + x = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ a ∈ []; (s)
| orl0 + rl = ps0[vhead0].next ' + qrl0, ps[vhead0].deqID = None, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, orl0 = vhead1 + orl1, vretRefs(tid) = vretRefs0(tid), ps0[vhead0].next ≠ vhead0, orl ≠ [], phead0 ≠ ps0[vhead0].next, r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead0 ' + orl0, vs, ps, vs0, ps0), listp(orl + vhead0 ' + orl0, vs, ps, owns), listp(orl + vhead0 ' + orl0 + rl, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vhead0 ' + orl0, vs, orl + vhead0 ' + orl0 + rl, vs0), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), nonullRetRefs(orl + vhead0 ' + orl0 + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[ps0[vhead0].next].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(orl0, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), r0 ∈ ps, r0 ∈ vs, r0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ orl + vhead0 ' + orl0 + rl from vtail, vhead0 ∈ orl + vhead0 ' + orl0 + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(orl + qrl0), ¬ dups(orl + orl0), ¬ dups(orl0), ¬ noid(tid, orl + vhead0 ' + orl0 + rl, vhead0, vs0), ¬ ps0[vhead0].next ∈ orl, ¬ vhead0 ∈ qrl0, ¬ ps0[vhead0].next ∈ qrl0, ¬ 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = orl0.last ∨ vtail = (orl + (vhead0 ' + orl0).butlast).last ∧ vs[orl0.last].deqID = None ∧ vs[orl0.last].next = null, ps0[vhead0].next ∈ orl0 ∨ ps0[vhead0].next ∈ rl, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs), vtail0 = (orl0 + rl).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 = vhead0, phead0 ∈ orl from phead ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vhead0 ' + orl0 from vhead |
ps[ps0[vhead0].next].deqID = None, ps[vhead0].deqID = None, vs[r0].deqID = Some(tid), ps[vhead0].next = ps0[vhead0].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), ps0[vhead0].next ≠ vhead0, orl ≠ [], phead0 ≠ ps0[vhead0].next, r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead0 ' + ps0[vhead0].next ' + orl1, vs, ps, vs0, ps0), listp(orl + vhead0 ' + ps0[vhead0].next ' + orl1, vs, ps, owns), listp(orl + vhead0 ' + (ps0[vhead0].next ' + orl1) + rl, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vhead0 ' + ps0[vhead0].next ' + orl1, vs, orl + vhead0 ' + (ps0[vhead0].next ' + orl1) + rl, vs0), nonullRetRefs(orl + vhead0 ' + ps0[vhead0].next ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs(orl + vhead0 ' + (ps0[vhead0].next ' + orl1) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[ps0[vhead0].next].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, ps0), unmarkedp(rl, ps0), unmarkedp(orl1, vs0), unmarkedp(rl, vs0), r0 ∈ ps, r0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ orl + vhead0 ' + (ps0[vhead0].next ' + orl1) + rl from vtail, vhead0 ∈ orl + vhead0 ' + (ps0[vhead0].next ' + orl1) + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + orl1 + rl), ¬ dups(orl1), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl1 + rl), ¬ dups(orl + orl1), ¬ noid(tid, orl + vhead0 ' + (ps0[vhead0].next ' + orl1) + rl, vhead0, vs0), ¬ ps0[vhead0].next ∈ orl, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ ps0[vhead0].next ∈ orl1, ¬ ps0[vhead0].next ∈ rl, ¬ vhead0 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = (ps0[vhead0].next ' + orl1).last ∨ vtail = (vhead0 ' + (ps0[vhead0].next ' + orl1).butlast).last ∧ vs[(ps0[vhead0].next ' + orl1).last].deqID = None ∧ vs[(ps0[vhead0].next ' + orl1).last].next = null, orl.last = vhead ∧ vs[ps0[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ vs[ps0[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs), vtail0 = ((ps0[vhead0].next ' + orl1) + rl).last ∨ orl1 + rl ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + (orl1 + rl).butlast).last ∧ vs0[(orl1 + rl).last].deqID = None ∧ vs0[(orl1 + rl).last].next = null, r0 = ps0[vhead0].next ∨ r0 ∈ orl1, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 = vhead0, phead0 ∈ orl from phead ∨ phead0 = vhead0 ∨ phead0 ∈ orl1 ∨ phead0 ∈ rl ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vhead0 ' + ps0[vhead0].next ' + orl1 from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a + x = a ' + x; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)
| ps[ps0[vhead0].next].deqID = None, ps[vhead0].deqID = None, vs[r0].deqID = Some(tid), ps[vhead0].next = ps0[vhead0].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), ps0[vhead0].next ≠ vhead0, orl ≠ [], phead0 ≠ ps0[vhead0].next, r0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead0 ' + ps0[vhead0].next ' + orl1, vs, ps, vs0, ps0), listp(orl + vhead0 ' + ps0[vhead0].next ' + orl1, vs, ps, owns), listp(orl + vhead0 ' + (ps0[vhead0].next ' + orl1) + rl, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vhead0 ' + ps0[vhead0].next ' + orl1, vs, orl + vhead0 ' + (ps0[vhead0].next ' + orl1) + rl, vs0), nonullRetRefs(orl + vhead0 ' + ps0[vhead0].next ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs(orl + vhead0 ' + (ps0[vhead0].next ' + orl1) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[ps0[vhead0].next].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, ps0), unmarkedp(rl, ps0), unmarkedp(orl1, vs0), unmarkedp(rl, vs0), r0 ∈ ps, r0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ orl + vhead0 ' + (ps0[vhead0].next ' + orl1) + rl from vtail, vhead0 ∈ orl + vhead0 ' + (ps0[vhead0].next ' + orl1) + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + orl1 + rl), ¬ dups(orl1), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl1 + rl), ¬ dups(orl + orl1), ¬ noid(tid, orl + vhead0 ' + (ps0[vhead0].next ' + orl1) + rl, vhead0, vs0), ¬ ps0[vhead0].next ∈ orl, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ ps0[vhead0].next ∈ orl1, ¬ ps0[vhead0].next ∈ rl, ¬ vhead0 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = (ps0[vhead0].next ' + orl1).last ∨ vtail = (vhead0 ' + (ps0[vhead0].next ' + orl1).butlast).last ∧ vs[(ps0[vhead0].next ' + orl1).last].deqID = None ∧ vs[(ps0[vhead0].next ' + orl1).last].next = null, orl.last = vhead ∧ vs[ps0[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ vs[ps0[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs), vtail0 = ((ps0[vhead0].next ' + orl1) + rl).last ∨ orl1 + rl ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + (orl1 + rl).butlast).last ∧ vs0[(orl1 + rl).last].deqID = None ∧ vs0[(orl1 + rl).last].next = null, r0 = ps0[vhead0].next ∨ r0 ∈ orl1, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 = vhead0, phead0 ∈ orl from phead ∨ phead0 = vhead0 ∨ phead0 ∈ orl1 ∨ phead0 ∈ rl ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vhead0 ' + ps0[vhead0].next ' + orl1 from vhead |
vs[r0].deqID = Some(tid), ps[vhead0].deqID = None, ps[ps0[vhead0].next].deqID = None, ps[vhead0].next = ps0[vhead0].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, orl = rl0 + vtail1 ', vretRefs(tid) = vretRefs0(tid), ps0[vhead0].next ≠ vhead0, orl ≠ [], phead0 ≠ ps0[vhead0].next, r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead0 ' + ps0[vhead0].next ' + orl1, vs, ps, vs0, ps0), listp(orl + vhead0 ' + (ps0[vhead0].next ' + orl1) + rl, vs0, ps0, owns0), listp(orl + vhead0 ' + ps0[vhead0].next ' + orl1, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vhead0 ' + ps0[vhead0].next ' + orl1, vs, orl + vhead0 ' + (ps0[vhead0].next ' + orl1) + rl, vs0), nonullRetRefs(orl + vhead0 ' + (ps0[vhead0].next ' + orl1) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vhead0 ' + ps0[vhead0].next ' + orl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[ps0[vhead0].next].deqID), unmarkedp(rl, vs0), unmarkedp(orl1, vs0), unmarkedp(rl, ps0), unmarkedp(orl1, ps0), unmarkedp(orl1, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ orl + vhead0 ' + (ps0[vhead0].next ' + orl1) + rl from vhead, vtail0 ∈ orl + vhead0 ' + (ps0[vhead0].next ' + orl1) + rl from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ vs, r0 ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + orl1 + rl), ¬ dups(orl1), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl1 + rl), ¬ dups(orl + orl1), ¬ noid(tid, orl + vhead0 ' + (ps0[vhead0].next ' + orl1) + rl, vhead0, vs0), ¬ ps0[vhead0].next ∈ orl, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ ps0[vhead0].next ∈ orl1, ¬ ps0[vhead0].next ∈ rl, ¬ vhead0 ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl from phead ∨ phead0 = vhead0 ∨ phead0 ∈ orl1 ∨ phead0 ∈ rl, phead0 ∈ orl ∨ phead0 = vhead0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), r0 = ps0[vhead0].next ∨ r0 ∈ orl1, vtail0 = ((ps0[vhead0].next ' + orl1) + rl).last ∨ orl1 + rl ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + (orl1 + rl).butlast).last ∧ vs0[(orl1 + rl).last].deqID = None ∧ vs0[(orl1 + rl).last].next = null, vtail1 = vhead ∧ vs[ps0[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vtail1 ∧ vs[vhead0].deqID = None ∧ vs[ps0[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs), vtail = (ps0[vhead0].next ' + orl1).last ∨ vtail = (vhead0 ' + (ps0[vhead0].next ' + orl1).butlast).last ∧ vs[(ps0[vhead0].next ' + orl1).last].deqID = None ∧ vs[(ps0[vhead0].next ' + orl1).last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vhead0 ' + ps0[vhead0].next ' + orl1 from vhead
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, vtail1, y
| vs[r0].deqID = Some(tid), ps[vhead0].deqID = None, ps[ps0[vhead0].next].deqID = None, ps[vhead0].next = ps0[vhead0].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, orl = rl0 + vtail1 ', vretRefs(tid) = vretRefs0(tid), ps0[vhead0].next ≠ vhead0, orl ≠ [], phead0 ≠ ps0[vhead0].next, r0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead0 ' + ps0[vhead0].next ' + orl1, vs, ps, vs0, ps0), listp(orl + vhead0 ' + (ps0[vhead0].next ' + orl1) + rl, vs0, ps0, owns0), listp(orl + vhead0 ' + ps0[vhead0].next ' + orl1, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vhead0 ' + ps0[vhead0].next ' + orl1, vs, orl + vhead0 ' + (ps0[vhead0].next ' + orl1) + rl, vs0), nonullRetRefs(orl + vhead0 ' + (ps0[vhead0].next ' + orl1) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vhead0 ' + ps0[vhead0].next ' + orl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[ps0[vhead0].next].deqID), unmarkedp(rl, vs0), unmarkedp(orl1, vs0), unmarkedp(rl, ps0), unmarkedp(orl1, ps0), unmarkedp(orl1, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ orl + vhead0 ' + (ps0[vhead0].next ' + orl1) + rl from vhead, vtail0 ∈ orl + vhead0 ' + (ps0[vhead0].next ' + orl1) + rl from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ vs, r0 ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + orl1 + rl), ¬ dups(orl1), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl1 + rl), ¬ dups(orl + orl1), ¬ noid(tid, orl + vhead0 ' + (ps0[vhead0].next ' + orl1) + rl, vhead0, vs0), ¬ ps0[vhead0].next ∈ orl, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ ps0[vhead0].next ∈ orl1, ¬ ps0[vhead0].next ∈ rl, ¬ vhead0 ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl from phead ∨ phead0 = vhead0 ∨ phead0 ∈ orl1 ∨ phead0 ∈ rl, phead0 ∈ orl ∨ phead0 = vhead0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), r0 = ps0[vhead0].next ∨ r0 ∈ orl1, vtail0 = ((ps0[vhead0].next ' + orl1) + rl).last ∨ orl1 + rl ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + (orl1 + rl).butlast).last ∧ vs0[(orl1 + rl).last].deqID = None ∧ vs0[(orl1 + rl).last].next = null, vtail1 = vhead ∧ vs[ps0[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vtail1 ∧ vs[vhead0].deqID = None ∧ vs[ps0[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs), vtail = (ps0[vhead0].next ' + orl1).last ∨ vtail = (vhead0 ' + (ps0[vhead0].next ' + orl1).butlast).last ∧ vs[(ps0[vhead0].next ' + orl1).last].deqID = None ∧ vs[(ps0[vhead0].next ' + orl1).last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vhead0 ' + ps0[vhead0].next ' + orl1 from vhead |
vs[r0].deqID = Some(tid), ps[ps[vtail1].next].deqID = None, ps[ps0[ps[vtail1].next].next].deqID = None, ps0[vtail1].next = ps[vtail1].next, ps[ps[vtail1].next].next = ps0[ps[vtail1].next].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), ps[vtail1].next ≠ vtail1, ps0[ps[vtail1].next].next ≠ vtail1, ps0[ps[vtail1].next].next ≠ ps[vtail1].next, phead0 ≠ ps0[ps[vtail1].next].next, r0 ≠ ps[vtail1].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, ps, vs0, ps0), listp((rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, vs0, ps0, owns0), listp((rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, ps, owns), markedp(rl0, ps0), markedp(rl0, vs), markedp(rl0, ps), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, ps[vtail1].next, vs0), noidRely (tid, (rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, vs0), nonullRetRefs((rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs0[vtail1].deqID), some?(vs0[ps[vtail1].next].deqID), some?(ps0[ps[vtail1].next].deqID), some?(vs0[ps0[ps[vtail1].next].next].deqID), some?(ps0[ps0[ps[vtail1].next].next].deqID), unmarkedp(rl, vs0), unmarkedp(orl1, vs0), unmarkedp(rl, ps0), unmarkedp(orl1, ps0), unmarkedp(orl1, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, ps[vtail1].next ∈ (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl from vhead, vtail0 ∈ (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl from vtail, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ vs, r0 ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl0 + orl1), ¬ dups(orl1 + rl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(rl0 + orl1 + rl), ¬ noid(tid, (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, ps[vtail1].next, vs0), ¬ ps[vtail1].next ∈ rl0, ¬ ps0[ps[vtail1].next].next ∈ rl0, ¬ vtail1 ∈ rl, ¬ vtail1 ∈ orl1, ¬ vtail1 ∈ rl0, ¬ ps[vtail1].next ∈ rl, ¬ ps0[ps[vtail1].next].next ∈ rl, ¬ ps0[ps[vtail1].next].next ∈ orl1, ¬ ps[vtail1].next ∈ orl1, vs0[ps[vtail1].next].next ≠ null ∧ vs0[vs0[ps[vtail1].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps[vtail1].next].next].deqID.tid)) = Claimed(vs0[vs0[ps[vtail1].next].next].deqID.tid, vs0[vs0[ps[vtail1].next].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), phead0 ∈ rl0 ∨ phead0 = vtail1 ∨ phead0 = ps[vtail1].next, phead ∈ rl0 ∨ phead = vtail1, phead0 ∈ rl0 + vtail1 ' from phead ∨ phead0 = ps[vtail1].next ∨ phead0 ∈ orl1 ∨ phead0 ∈ rl, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), r0 = ps0[ps[vtail1].next].next ∨ r0 ∈ orl1, vtail0 = ((ps0[ps[vtail1].next].next ' + orl1) + rl).last ∨ orl1 + rl ≠ [] ∧ vtail0 = (ps0[ps[vtail1].next].next ' + (orl1 + rl).butlast).last ∧ vs0[(orl1 + rl).last].deqID = None ∧ vs0[(orl1 + rl).last].next = null, vtail = (ps0[ps[vtail1].next].next ' + orl1).last ∨ vtail = (ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1).butlast).last ∧ vs[(ps0[ps[vtail1].next].next ' + orl1).last].deqID = None ∧ vs[(ps0[ps[vtail1].next].next ' + orl1).last].next = null, vtail1 = vhead ∧ vs[ps0[ps[vhead].next].next].deqID = None ∧ unmarkedp(orl1, vs) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vtail1 ∧ vs[ps[vtail1].next].deqID = None ∧ vs[ps0[ps[vtail1].next].next].deqID = None ∧ unmarkedp(orl1, vs) ⊦ r0 ≠ vhead ∧ r0 ∈ (rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1 from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + 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)
| vs[r0].deqID = Some(tid), ps[ps[vtail1].next].deqID = None, ps[ps0[ps[vtail1].next].next].deqID = None, ps0[vtail1].next = ps[vtail1].next, ps[ps[vtail1].next].next = ps0[ps[vtail1].next].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), ps[vtail1].next ≠ vtail1, ps0[ps[vtail1].next].next ≠ vtail1, ps0[ps[vtail1].next].next ≠ ps[vtail1].next, phead0 ≠ ps0[ps[vtail1].next].next, r0 ≠ ps[vtail1].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, ps, vs0, ps0), listp((rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, vs0, ps0, owns0), listp((rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, ps, owns), markedp(rl0, ps0), markedp(rl0, vs), markedp(rl0, ps), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, ps[vtail1].next, vs0), noidRely (tid, (rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, vs0), nonullRetRefs((rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs0[vtail1].deqID), some?(vs0[ps[vtail1].next].deqID), some?(ps0[ps[vtail1].next].deqID), some?(vs0[ps0[ps[vtail1].next].next].deqID), some?(ps0[ps0[ps[vtail1].next].next].deqID), unmarkedp(rl, vs0), unmarkedp(orl1, vs0), unmarkedp(rl, ps0), unmarkedp(orl1, ps0), unmarkedp(orl1, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, ps[vtail1].next ∈ (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl from vhead, vtail0 ∈ (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl from vtail, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ vs, r0 ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl0 + orl1), ¬ dups(orl1 + rl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(rl0 + orl1 + rl), ¬ noid(tid, (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, ps[vtail1].next, vs0), ¬ ps[vtail1].next ∈ rl0, ¬ ps0[ps[vtail1].next].next ∈ rl0, ¬ vtail1 ∈ rl, ¬ vtail1 ∈ orl1, ¬ vtail1 ∈ rl0, ¬ ps[vtail1].next ∈ rl, ¬ ps0[ps[vtail1].next].next ∈ rl, ¬ ps0[ps[vtail1].next].next ∈ orl1, ¬ ps[vtail1].next ∈ orl1, vs0[ps[vtail1].next].next ≠ null ∧ vs0[vs0[ps[vtail1].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps[vtail1].next].next].deqID.tid)) = Claimed(vs0[vs0[ps[vtail1].next].next].deqID.tid, vs0[vs0[ps[vtail1].next].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), phead0 ∈ rl0 ∨ phead0 = vtail1 ∨ phead0 = ps[vtail1].next, phead ∈ rl0 ∨ phead = vtail1, phead0 ∈ rl0 + vtail1 ' from phead ∨ phead0 = ps[vtail1].next ∨ phead0 ∈ orl1 ∨ phead0 ∈ rl, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), r0 = ps0[ps[vtail1].next].next ∨ r0 ∈ orl1, vtail0 = ((ps0[ps[vtail1].next].next ' + orl1) + rl).last ∨ orl1 + rl ≠ [] ∧ vtail0 = (ps0[ps[vtail1].next].next ' + (orl1 + rl).butlast).last ∧ vs0[(orl1 + rl).last].deqID = None ∧ vs0[(orl1 + rl).last].next = null, vtail = (ps0[ps[vtail1].next].next ' + orl1).last ∨ vtail = (ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1).butlast).last ∧ vs[(ps0[ps[vtail1].next].next ' + orl1).last].deqID = None ∧ vs[(ps0[ps[vtail1].next].next ' + orl1).last].next = null, vtail1 = vhead ∧ vs[ps0[ps[vhead].next].next].deqID = None ∧ unmarkedp(orl1, vs) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vtail1 ∧ vs[ps[vtail1].next].deqID = None ∧ vs[ps0[ps[vtail1].next].next].deqID = None ∧ unmarkedp(orl1, vs) ⊦ r0 ≠ vhead ∧ r0 ∈ (rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1 from vhead |
ps[ps0[ps[vtail1].next].next].deqID = None, ps[ps[vtail1].next].deqID = None, vs[r0].deqID = Some(tid), ps[ps[vtail1].next].next = ps0[ps[vtail1].next].next, ps0[vtail1].next = ps[vtail1].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, r0 = vhead, vretRefs(tid) = vretRefs0(tid), ps[vtail1].next ≠ vtail1, ps0[ps[vtail1].next].next ≠ vtail1, ps0[ps[vtail1].next].next ≠ ps[vtail1].next, phead0 ≠ ps0[ps[vtail1].next].next, r0 ≠ ps[vtail1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, ps, vs0, ps0), listp((rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, ps, owns), listp((rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, vs0, ps0, owns0), markedp(rl0, vs0), markedp(rl0, ps), markedp(rl0, vs), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, ps[vtail1].next, vs0), noidRely (tid, (rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, vs0), nonullRetRefs((rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs((rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[ps0[ps[vtail1].next].next].deqID), some?(vs0[ps0[ps[vtail1].next].next].deqID), some?(ps0[ps[vtail1].next].deqID), some?(vs0[ps[vtail1].next].deqID), some?(vs0[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps0[vtail1].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, ps0), unmarkedp(rl, ps0), unmarkedp(orl1, vs0), unmarkedp(rl, vs0), r0 ∈ ps, r0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vtail0 ∈ (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl from vtail, ps[vtail1].next ∈ (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl0 + orl1), ¬ dups(orl1 + rl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(rl0 + orl1 + rl), ¬ noid(tid, (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, ps[vtail1].next, vs0), ¬ ps[vtail1].next ∈ rl0, ¬ ps0[ps[vtail1].next].next ∈ rl0, ¬ vtail1 ∈ rl, ¬ vtail1 ∈ orl1, ¬ vtail1 ∈ rl0, ¬ ps[vtail1].next ∈ rl, ¬ ps0[ps[vtail1].next].next ∈ rl, ¬ ps0[ps[vtail1].next].next ∈ orl1, ¬ ps[vtail1].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[ps[vtail1].next].next ≠ null ∧ vs0[vs0[ps[vtail1].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps[vtail1].next].next].deqID.tid)) = Claimed(vs0[vs0[ps[vtail1].next].next].deqID.tid, vs0[vs0[ps[vtail1].next].next].val), vtail1 = vhead ∧ vs[ps0[ps[vhead].next].next].deqID = None ∧ unmarkedp(orl1, vs) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vtail1 ∧ vs[ps[vtail1].next].deqID = None ∧ vs[ps0[ps[vtail1].next].next].deqID = None ∧ unmarkedp(orl1, vs), vtail = (ps0[ps[vtail1].next].next ' + orl1).last ∨ vtail = (ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1).butlast).last ∧ vs[(ps0[ps[vtail1].next].next ' + orl1).last].deqID = None ∧ vs[(ps0[ps[vtail1].next].next ' + orl1).last].next = null, vtail0 = ((ps0[ps[vtail1].next].next ' + orl1) + rl).last ∨ orl1 + rl ≠ [] ∧ vtail0 = (ps0[ps[vtail1].next].next ' + (orl1 + rl).butlast).last ∧ vs0[(orl1 + rl).last].deqID = None ∧ vs0[(orl1 + rl).last].next = null, r0 = ps0[ps[vtail1].next].next ∨ r0 ∈ orl1, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ rl0 + vtail1 ' from phead ∨ phead0 = ps[vtail1].next ∨ phead0 ∈ orl1 ∨ phead0 ∈ rl, phead ∈ rl0 ∨ phead = vtail1, phead0 ∈ rl0 ∨ phead0 = vtail1 ∨ phead0 = ps[vtail1].next ⊦
ps[ps0[ps[vtail1].next].next].deqID = None, ps[ps[vtail1].next].deqID = None, vs[r0].deqID = Some(tid), ps[ps[vtail1].next].next = ps0[ps[vtail1].next].next, ps0[vtail1].next = ps[vtail1].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), ps[vtail1].next ≠ vtail1, ps0[ps[vtail1].next].next ≠ vtail1, ps0[ps[vtail1].next].next ≠ ps[vtail1].next, phead0 ≠ ps0[ps[vtail1].next].next, r0 ≠ ps[vtail1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, ps, vs0, ps0), listp((rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, ps, owns), listp((rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, vs0, ps0, owns0), markedp(rl0, vs0), markedp(rl0, ps), markedp(rl0, vs), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, ps[vtail1].next, vs0), noidRely (tid, (rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, vs0), nonullRetRefs((rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs((rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[ps0[ps[vtail1].next].next].deqID), some?(vs0[ps0[ps[vtail1].next].next].deqID), some?(ps0[ps[vtail1].next].deqID), some?(vs0[ps[vtail1].next].deqID), some?(vs0[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps0[vtail1].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, ps0), unmarkedp(rl, ps0), unmarkedp(orl1, vs0), unmarkedp(rl, vs0), r0 ∈ ps, r0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vtail0 ∈ (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl from vtail, ps[vtail1].next ∈ (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl0 + orl1), ¬ dups(orl1 + rl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(rl0 + orl1 + rl), ¬ noid(tid, (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, ps[vtail1].next, vs0), ¬ r0 ∈ (rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1 from vhead, ¬ ps[vtail1].next ∈ rl0, ¬ ps0[ps[vtail1].next].next ∈ rl0, ¬ vtail1 ∈ rl, ¬ vtail1 ∈ orl1, ¬ vtail1 ∈ rl0, ¬ ps[vtail1].next ∈ rl, ¬ ps0[ps[vtail1].next].next ∈ rl, ¬ ps0[ps[vtail1].next].next ∈ orl1, ¬ ps[vtail1].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[ps[vtail1].next].next ≠ null ∧ vs0[vs0[ps[vtail1].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps[vtail1].next].next].deqID.tid)) = Claimed(vs0[vs0[ps[vtail1].next].next].deqID.tid, vs0[vs0[ps[vtail1].next].next].val), vtail1 = vhead ∧ vs[ps0[ps[vhead].next].next].deqID = None ∧ unmarkedp(orl1, vs) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vtail1 ∧ vs[ps[vtail1].next].deqID = None ∧ vs[ps0[ps[vtail1].next].next].deqID = None ∧ unmarkedp(orl1, vs), vtail = (ps0[ps[vtail1].next].next ' + orl1).last ∨ vtail = (ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1).butlast).last ∧ vs[(ps0[ps[vtail1].next].next ' + orl1).last].deqID = None ∧ vs[(ps0[ps[vtail1].next].next ' + orl1).last].next = null, vtail0 = ((ps0[ps[vtail1].next].next ' + orl1) + rl).last ∨ orl1 + rl ≠ [] ∧ vtail0 = (ps0[ps[vtail1].next].next ' + (orl1 + rl).butlast).last ∧ vs0[(orl1 + rl).last].deqID = None ∧ vs0[(orl1 + rl).last].next = null, r0 = ps0[ps[vtail1].next].next ∨ r0 ∈ orl1, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ rl0 + vtail1 ' from phead ∨ phead0 = ps[vtail1].next ∨ phead0 ∈ orl1 ∨ phead0 ∈ rl, phead ∈ rl0 ∨ phead = vtail1, phead0 ∈ rl0 ∨ phead0 = vtail1 ∨ phead0 = ps[vtail1].next ⊦
| ps[ps0[ps[vtail1].next].next].deqID = None, ps[ps[vtail1].next].deqID = None, vs[r0].deqID = Some(tid), ps[ps[vtail1].next].next = ps0[ps[vtail1].next].next, ps0[vtail1].next = ps[vtail1].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, r0 = vhead, vretRefs(tid) = vretRefs0(tid), ps[vtail1].next ≠ vtail1, ps0[ps[vtail1].next].next ≠ vtail1, ps0[ps[vtail1].next].next ≠ ps[vtail1].next, phead0 ≠ ps0[ps[vtail1].next].next, r0 ≠ ps[vtail1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, ps, vs0, ps0), listp((rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, ps, owns), listp((rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, vs0, ps0, owns0), markedp(rl0, vs0), markedp(rl0, ps), markedp(rl0, vs), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, ps[vtail1].next, vs0), noidRely (tid, (rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, vs0), nonullRetRefs((rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs((rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[ps0[ps[vtail1].next].next].deqID), some?(vs0[ps0[ps[vtail1].next].next].deqID), some?(ps0[ps[vtail1].next].deqID), some?(vs0[ps[vtail1].next].deqID), some?(vs0[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps0[vtail1].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, ps0), unmarkedp(rl, ps0), unmarkedp(orl1, vs0), unmarkedp(rl, vs0), r0 ∈ ps, r0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vtail0 ∈ (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl from vtail, ps[vtail1].next ∈ (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl0 + orl1), ¬ dups(orl1 + rl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(rl0 + orl1 + rl), ¬ noid(tid, (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, ps[vtail1].next, vs0), ¬ ps[vtail1].next ∈ rl0, ¬ ps0[ps[vtail1].next].next ∈ rl0, ¬ vtail1 ∈ rl, ¬ vtail1 ∈ orl1, ¬ vtail1 ∈ rl0, ¬ ps[vtail1].next ∈ rl, ¬ ps0[ps[vtail1].next].next ∈ rl, ¬ ps0[ps[vtail1].next].next ∈ orl1, ¬ ps[vtail1].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[ps[vtail1].next].next ≠ null ∧ vs0[vs0[ps[vtail1].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps[vtail1].next].next].deqID.tid)) = Claimed(vs0[vs0[ps[vtail1].next].next].deqID.tid, vs0[vs0[ps[vtail1].next].next].val), vtail1 = vhead ∧ vs[ps0[ps[vhead].next].next].deqID = None ∧ unmarkedp(orl1, vs) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vtail1 ∧ vs[ps[vtail1].next].deqID = None ∧ vs[ps0[ps[vtail1].next].next].deqID = None ∧ unmarkedp(orl1, vs), vtail = (ps0[ps[vtail1].next].next ' + orl1).last ∨ vtail = (ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1).butlast).last ∧ vs[(ps0[ps[vtail1].next].next ' + orl1).last].deqID = None ∧ vs[(ps0[ps[vtail1].next].next ' + orl1).last].next = null, vtail0 = ((ps0[ps[vtail1].next].next ' + orl1) + rl).last ∨ orl1 + rl ≠ [] ∧ vtail0 = (ps0[ps[vtail1].next].next ' + (orl1 + rl).butlast).last ∧ vs0[(orl1 + rl).last].deqID = None ∧ vs0[(orl1 + rl).last].next = null, r0 = ps0[ps[vtail1].next].next ∨ r0 ∈ orl1, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ rl0 + vtail1 ' from phead ∨ phead0 = ps[vtail1].next ∨ phead0 ∈ orl1 ∨ phead0 ∈ rl, phead ∈ rl0 ∨ phead = vtail1, phead0 ∈ rl0 ∨ phead0 = vtail1 ∨ phead0 = ps[vtail1].next ⊦ |
vs[ps0[ps[vtail1].next].next].deqID = None, vs[ps[vtail1].next].deqID = None, vs[rl0.last].deqID = Some(tid), ps[ps[vtail1].next].deqID = None, ps[ps0[ps[vtail1].next].next].deqID = None, ps0[vtail1].next = ps[vtail1].next, ps[ps[vtail1].next].next = ps0[ps[vtail1].next].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), rl0.last ≠ ps0[ps[vtail1].next].next, rl0.last ≠ ps[vtail1].next, ps[vtail1].next ≠ vtail1, ps0[ps[vtail1].next].next ≠ vtail1, ps0[ps[vtail1].next].next ≠ ps[vtail1].next, phead ≠ vtail1, phead0 ≠ ps0[ps[vtail1].next].next, rl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, ps, vs0, ps0), listp((rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, vs0, ps0, owns0), listp((rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, ps, owns), markedp(rl0, ps0), markedp(rl0, vs), markedp(rl0, ps), markedp(rl0, vs0), nextnottid(tid, rl0.last, vs), nextnottidRely(tid, rl0.last, vs, ps[vtail1].next, vs0), noidRely (tid, (rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, vs0), nonullRetRefs((rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs0[vtail1].deqID), some?(vs0[ps[vtail1].next].deqID), some?(ps0[ps[vtail1].next].deqID), some?(vs0[ps0[ps[vtail1].next].next].deqID), some?(ps0[ps0[ps[vtail1].next].next].deqID), unmarkedp(orl1, vs), unmarkedp(rl, vs0), unmarkedp(orl1, vs0), unmarkedp(rl, ps0), unmarkedp(orl1, ps0), unmarkedp(orl1, ps), phead ∈ rl0, rl0.last ∈ orl1, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, ps[vtail1].next ∈ (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl from rl0.last, vtail0 ∈ (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl from vtail, phead0 ∈ vs0, phead0 ∈ ps0, rl0.last ∈ vs, rl0.last ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl0 + orl1), ¬ dups(orl1 + rl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(rl0 + orl1 + rl), ¬ noid(tid, (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, ps[vtail1].next, vs0), ¬ ps[vtail1].next ∈ rl0, ¬ ps0[ps[vtail1].next].next ∈ rl0, ¬ vtail1 ∈ rl, ¬ vtail1 ∈ orl1, ¬ vtail1 ∈ rl0, ¬ ps[vtail1].next ∈ rl, ¬ ps0[ps[vtail1].next].next ∈ rl, ¬ ps0[ps[vtail1].next].next ∈ orl1, ¬ ps[vtail1].next ∈ orl1, vs0[ps[vtail1].next].next ≠ null ∧ vs0[vs0[ps[vtail1].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps[vtail1].next].next].deqID.tid)) = Claimed(vs0[vs0[ps[vtail1].next].next].deqID.tid, vs0[vs0[ps[vtail1].next].next].val), vs[rl0.last].next ≠ null ∧ vs[vs[rl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[rl0.last].next].deqID.tid)) = Claimed(vs[vs[rl0.last].next].deqID.tid, vs[vs[rl0.last].next].val), phead0 ∈ rl0 from phead ∨ phead0 = vtail1 ∨ phead0 = ps[vtail1].next ∨ phead0 ∈ orl1 ∨ phead0 ∈ rl, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = ((ps0[ps[vtail1].next].next ' + orl1) + rl).last ∨ orl1 + rl ≠ [] ∧ vtail0 = (ps0[ps[vtail1].next].next ' + (orl1 + rl).butlast).last ∧ vs0[(orl1 + rl).last].deqID = None ∧ vs0[(orl1 + rl).last].next = null, vtail = orl1.last ∨ vtail = (ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1).butlast).last ∧ vs[orl1.last].deqID = None ∧ vs[orl1.last].next = null, phead0 ∈ rl0 ∨ phead0 = vtail1 ∨ phead0 = ps[vtail1].next ⊦
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 ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| vs[ps0[ps[vtail1].next].next].deqID = None, vs[ps[vtail1].next].deqID = None, vs[rl0.last].deqID = Some(tid), ps[ps[vtail1].next].deqID = None, ps[ps0[ps[vtail1].next].next].deqID = None, ps0[vtail1].next = ps[vtail1].next, ps[ps[vtail1].next].next = ps0[ps[vtail1].next].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), rl0.last ≠ ps0[ps[vtail1].next].next, rl0.last ≠ ps[vtail1].next, ps[vtail1].next ≠ vtail1, ps0[ps[vtail1].next].next ≠ vtail1, ps0[ps[vtail1].next].next ≠ ps[vtail1].next, phead ≠ vtail1, phead0 ≠ ps0[ps[vtail1].next].next, rl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, ps, vs0, ps0), listp((rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, vs0, ps0, owns0), listp((rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, ps, owns), markedp(rl0, ps0), markedp(rl0, vs), markedp(rl0, ps), markedp(rl0, vs0), nextnottid(tid, rl0.last, vs), nextnottidRely(tid, rl0.last, vs, ps[vtail1].next, vs0), noidRely (tid, (rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, vs0), nonullRetRefs((rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs0[vtail1].deqID), some?(vs0[ps[vtail1].next].deqID), some?(ps0[ps[vtail1].next].deqID), some?(vs0[ps0[ps[vtail1].next].next].deqID), some?(ps0[ps0[ps[vtail1].next].next].deqID), unmarkedp(orl1, vs), unmarkedp(rl, vs0), unmarkedp(orl1, vs0), unmarkedp(rl, ps0), unmarkedp(orl1, ps0), unmarkedp(orl1, ps), phead ∈ rl0, rl0.last ∈ orl1, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, ps[vtail1].next ∈ (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl from rl0.last, vtail0 ∈ (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl from vtail, phead0 ∈ vs0, phead0 ∈ ps0, rl0.last ∈ vs, rl0.last ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl0 + orl1), ¬ dups(orl1 + rl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(rl0 + orl1 + rl), ¬ noid(tid, (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, ps[vtail1].next, vs0), ¬ ps[vtail1].next ∈ rl0, ¬ ps0[ps[vtail1].next].next ∈ rl0, ¬ vtail1 ∈ rl, ¬ vtail1 ∈ orl1, ¬ vtail1 ∈ rl0, ¬ ps[vtail1].next ∈ rl, ¬ ps0[ps[vtail1].next].next ∈ rl, ¬ ps0[ps[vtail1].next].next ∈ orl1, ¬ ps[vtail1].next ∈ orl1, vs0[ps[vtail1].next].next ≠ null ∧ vs0[vs0[ps[vtail1].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps[vtail1].next].next].deqID.tid)) = Claimed(vs0[vs0[ps[vtail1].next].next].deqID.tid, vs0[vs0[ps[vtail1].next].next].val), vs[rl0.last].next ≠ null ∧ vs[vs[rl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[rl0.last].next].deqID.tid)) = Claimed(vs[vs[rl0.last].next].deqID.tid, vs[vs[rl0.last].next].val), phead0 ∈ rl0 from phead ∨ phead0 = vtail1 ∨ phead0 = ps[vtail1].next ∨ phead0 ∈ orl1 ∨ phead0 ∈ rl, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = ((ps0[ps[vtail1].next].next ' + orl1) + rl).last ∨ orl1 + rl ≠ [] ∧ vtail0 = (ps0[ps[vtail1].next].next ' + (orl1 + rl).butlast).last ∧ vs0[(orl1 + rl).last].deqID = None ∧ vs0[(orl1 + rl).last].next = null, vtail = orl1.last ∨ vtail = (ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1).butlast).last ∧ vs[orl1.last].deqID = None ∧ vs[orl1.last].next = null, phead0 ∈ rl0 ∨ phead0 = vtail1 ∨ phead0 = ps[vtail1].next ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ a ∈ y → dups(x + a ' + y); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl0, phead1, y
| ps[ps0[ps[vtail1].next].next].deqID = None, ps[ps[vtail1].next].deqID = None, vs[r0].deqID = Some(tid), ps[ps[vtail1].next].next = ps0[ps[vtail1].next].next, ps0[vtail1].next = ps[vtail1].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), ps[vtail1].next ≠ vtail1, ps0[ps[vtail1].next].next ≠ vtail1, ps0[ps[vtail1].next].next ≠ ps[vtail1].next, phead0 ≠ ps0[ps[vtail1].next].next, r0 ≠ ps[vtail1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, ps, vs0, ps0), listp((rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, ps, owns), listp((rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, vs0, ps0, owns0), markedp(rl0, vs0), markedp(rl0, ps), markedp(rl0, vs), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, ps[vtail1].next, vs0), noidRely (tid, (rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, vs0), nonullRetRefs((rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs((rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[ps0[ps[vtail1].next].next].deqID), some?(vs0[ps0[ps[vtail1].next].next].deqID), some?(ps0[ps[vtail1].next].deqID), some?(vs0[ps[vtail1].next].deqID), some?(vs0[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps0[vtail1].deqID), unmarkedp(orl1, ps), unmarkedp(orl1, ps0), unmarkedp(rl, ps0), unmarkedp(orl1, vs0), unmarkedp(rl, vs0), r0 ∈ ps, r0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vtail0 ∈ (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl from vtail, ps[vtail1].next ∈ (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl0 + orl1), ¬ dups(orl1 + rl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(rl0 + orl1 + rl), ¬ noid(tid, (rl0 + vtail1 ') + ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1) + rl, ps[vtail1].next, vs0), ¬ r0 ∈ (rl0 + vtail1 ') + ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1 from vhead, ¬ ps[vtail1].next ∈ rl0, ¬ ps0[ps[vtail1].next].next ∈ rl0, ¬ vtail1 ∈ rl, ¬ vtail1 ∈ orl1, ¬ vtail1 ∈ rl0, ¬ ps[vtail1].next ∈ rl, ¬ ps0[ps[vtail1].next].next ∈ rl, ¬ ps0[ps[vtail1].next].next ∈ orl1, ¬ ps[vtail1].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[ps[vtail1].next].next ≠ null ∧ vs0[vs0[ps[vtail1].next].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[ps[vtail1].next].next].deqID.tid)) = Claimed(vs0[vs0[ps[vtail1].next].next].deqID.tid, vs0[vs0[ps[vtail1].next].next].val), vtail1 = vhead ∧ vs[ps0[ps[vhead].next].next].deqID = None ∧ unmarkedp(orl1, vs) ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vtail1 ∧ vs[ps[vtail1].next].deqID = None ∧ vs[ps0[ps[vtail1].next].next].deqID = None ∧ unmarkedp(orl1, vs), vtail = (ps0[ps[vtail1].next].next ' + orl1).last ∨ vtail = (ps[vtail1].next ' + (ps0[ps[vtail1].next].next ' + orl1).butlast).last ∧ vs[(ps0[ps[vtail1].next].next ' + orl1).last].deqID = None ∧ vs[(ps0[ps[vtail1].next].next ' + orl1).last].next = null, vtail0 = ((ps0[ps[vtail1].next].next ' + orl1) + rl).last ∨ orl1 + rl ≠ [] ∧ vtail0 = (ps0[ps[vtail1].next].next ' + (orl1 + rl).butlast).last ∧ vs0[(orl1 + rl).last].deqID = None ∧ vs0[(orl1 + rl).last].next = null, r0 = ps0[ps[vtail1].next].next ∨ r0 ∈ orl1, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ rl0 + vtail1 ' from phead ∨ phead0 = ps[vtail1].next ∨ phead0 ∈ orl1 ∨ phead0 ∈ rl, phead ∈ rl0 ∨ phead = vtail1, phead0 ∈ rl0 ∨ phead0 = vtail1 ∨ phead0 = ps[vtail1].next ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) Used terms: rl0 + vtail1 ', ps[vtail1].next ' + ps0[ps[vtail1].next].next ' + orl1, vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| (vtail1 ' + orl0) + rl = ((orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs[r0].deqID = Some(tid), ps[vtail1].deqID = None, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, orl1 = vtail2 + orl2, vretRefs(tid) = vretRefs0(tid), ps0[vhead0].next ≠ vhead0, orl ≠ [], phead0 ≠ ps0[vhead0].next, r0 ≠ vhead0, vtail1 ≠ ps0[vhead0].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vtail1 ' + orl0, vs, ps, vs0, ps0), listp((orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0, ps0, owns0), listp(orl + vtail1 ' + orl0, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl1, vs0), markedp(orl, vs0), markedp(orl1, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vtail1 ' + orl0, vs, (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0), nonullRetRefs((orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vtail1 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[ps0[vhead0].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(orl0, ps), r0 ∈ vtail1 ' + orl0 from vhead0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0 from vhead, vtail0 ∈ (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ dups((orl + orl1) + qrl0), ¬ dups(rl), ¬ dups(orl1), ¬ dups(qrl0), ¬ dups(orl1 + qrl0), ¬ dups(orl + orl1), ¬ noid(tid, (orl + (orl1 + vhead0 ') + ps0[vhead0].next ') + qrl0, vhead0, vs0), ¬ vtail1 ∈ orl, ¬ vtail1 ∈ orl0, ¬ ps0[vhead0].next ∈ qrl0, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ qrl0, ¬ ps0[vhead0].next ∈ orl, ¬ ps0[vhead0].next ∈ orl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail1 ∈ qrl0 ∨ vtail1 = vhead0 ∨ vtail1 ∈ orl1, phead0 ∈ orl from phead ∨ phead0 ∈ orl1 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ orl1 ∨ phead0 = vhead0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail1].deqID = None ∧ unmarkedp(orl0, vs), vtail = (vtail1 ' + orl0).last ∨ vtail = (orl + (vtail1 ' + orl0).butlast).last ∧ vs[(vtail1 ' + orl0).last].deqID = None ∧ vs[(vtail1 ' + orl0).last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vtail1 ' + orl0 from vhead |
orl0 + rl = orl2 + vhead0 ' + ps0[vhead0].next ' + qrl0, vs[r0].deqID = Some(tid), ps[vtail2].deqID = None, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), ps0[vhead0].next ≠ vhead0, orl ≠ [], phead0 ≠ ps0[vhead0].next, r0 ≠ vhead0, vhead0 ≠ vtail2, vtail2 ≠ ps0[vhead0].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vtail2 ' + orl0, vs, ps, vs0, ps0), listp(orl + (vtail2 ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, ps0, owns0), listp(orl + vtail2 ' + orl0, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl2, vs0), markedp(orl, vs0), markedp(orl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vtail2 ' + orl0, vs, orl + (vtail2 ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0), nonullRetRefs(orl + (vtail2 ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vtail2 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail2].deqID), some?(ps0[vtail2].deqID), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[ps0[vhead0].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(orl0, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ orl + (vtail2 ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vhead, vtail0 ∈ orl + (vtail2 ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl0 from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(qrl0), ¬ dups(orl2), ¬ dups(orl), ¬ dups(rl), ¬ dups(orl + orl2 + qrl0), ¬ dups(orl + orl0), ¬ dups(orl0), ¬ noid(tid, orl + (vtail2 ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vhead0, vs0), ¬ ps0[vhead0].next ∈ orl2, ¬ ps0[vhead0].next ∈ orl, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl2, ¬ vhead0 ∈ orl, ¬ ps0[vhead0].next ∈ qrl0, ¬ vtail2 ∈ orl0, ¬ vtail2 ∈ qrl0, ¬ vtail2 ∈ orl2, ¬ vtail2 ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl from phead ∨ phead0 = vtail2 ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 = vtail2 ∨ phead0 ∈ orl2 ∨ phead0 = vhead0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail2].deqID = None ∧ unmarkedp(orl0, vs), vtail = (vtail2 ' + orl0).last ∨ vtail = (orl + (vtail2 ' + orl0).butlast).last ∧ vs[(vtail2 ' + orl0).last].deqID = None ∧ vs[(vtail2 ' + orl0).last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vtail2 ' + orl0 from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ 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 ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ 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) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)
| orl0 + rl = orl2 + vhead0 ' + ps0[vhead0].next ' + qrl0, vs[r0].deqID = Some(tid), ps[vtail2].deqID = None, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), ps0[vhead0].next ≠ vhead0, orl ≠ [], phead0 ≠ ps0[vhead0].next, r0 ≠ vhead0, vhead0 ≠ vtail2, vtail2 ≠ ps0[vhead0].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vtail2 ' + orl0, vs, ps, vs0, ps0), listp(orl + (vtail2 ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, ps0, owns0), listp(orl + vtail2 ' + orl0, vs, ps, owns), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), markedp(orl2, vs0), markedp(orl, vs0), markedp(orl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vtail2 ' + orl0, vs, orl + (vtail2 ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0), nonullRetRefs(orl + (vtail2 ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vtail2 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail2].deqID), some?(ps0[vtail2].deqID), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[ps0[vhead0].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(orl0, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ orl + (vtail2 ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vhead, vtail0 ∈ orl + (vtail2 ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl0 from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(qrl0), ¬ dups(orl2), ¬ dups(orl), ¬ dups(rl), ¬ dups(orl + orl2 + qrl0), ¬ dups(orl + orl0), ¬ dups(orl0), ¬ noid(tid, orl + (vtail2 ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vhead0, vs0), ¬ ps0[vhead0].next ∈ orl2, ¬ ps0[vhead0].next ∈ orl, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl2, ¬ vhead0 ∈ orl, ¬ ps0[vhead0].next ∈ qrl0, ¬ vtail2 ∈ orl0, ¬ vtail2 ∈ qrl0, ¬ vtail2 ∈ orl2, ¬ vtail2 ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl from phead ∨ phead0 = vtail2 ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 = vtail2 ∨ phead0 ∈ orl2 ∨ phead0 = vhead0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail2].deqID = None ∧ unmarkedp(orl0, vs), vtail = (vtail2 ' + orl0).last ∨ vtail = (orl + (vtail2 ' + orl0).butlast).last ∧ vs[(vtail2 ' + orl0).last].deqID = None ∧ vs[(vtail2 ' + orl0).last].next = null ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vtail2 ' + orl0 from vhead |
orl0 + rl = orl2 + vhead0 ' + ps0[vhead0].next ' + qrl0, ps[vtail2].deqID = None, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, orl = qrl + phead1 ', vretRefs(tid) = vretRefs0(tid), ps0[vhead0].next ≠ vhead0, orl ≠ [], phead0 ≠ ps0[vhead0].next, r0 ≠ vhead0, vhead0 ≠ vtail2, vtail2 ≠ ps0[vhead0].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vtail2 ' + orl0, vs, ps, vs0, ps0), listp(orl + vtail2 ' + orl0, vs, ps, owns), listp(orl + (vtail2 ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, ps0, owns0), markedp(orl2, ps0), markedp(orl, vs0), markedp(orl2, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vtail2 ' + orl0, vs, orl + (vtail2 ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0), nonullRetRefs(orl + vtail2 ' + orl0, vs, vretRefs, pretRefs), nonullRetRefs(orl + (vtail2 ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[ps0[vhead0].next].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), some?(ps0[vtail2].deqID), some?(vs0[vtail2].deqID), unmarkedp(orl0, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), r0 ∈ orl0 from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ orl + (vtail2 ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vtail, vhead0 ∈ orl + (vtail2 ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(qrl0), ¬ dups(orl2), ¬ dups(orl), ¬ dups(rl), ¬ dups(orl + orl2 + qrl0), ¬ dups(orl + orl0), ¬ dups(orl0), ¬ noid(tid, orl + (vtail2 ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vhead0, vs0), ¬ ps0[vhead0].next ∈ orl2, ¬ ps0[vhead0].next ∈ orl, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl2, ¬ vhead0 ∈ orl, ¬ ps0[vhead0].next ∈ qrl0, ¬ vtail2 ∈ orl0, ¬ vtail2 ∈ qrl0, ¬ vtail2 ∈ orl2, ¬ vtail2 ∈ 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = (vtail2 ' + orl0).last ∨ vtail = (orl + (vtail2 ' + orl0).butlast).last ∧ vs[(vtail2 ' + orl0).last].deqID = None ∧ vs[(vtail2 ' + orl0).last].next = null, phead1 = vhead ∧ unmarkedp(orl0, vs) ∨ qrl ≠ [] ∧ qrl.last = vhead ∧ phead ≠ phead1 ∧ vs[vtail2].deqID = None ∧ unmarkedp(orl0, vs), vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 = vtail2 ∨ phead0 ∈ orl2 ∨ phead0 = vhead0, phead0 ∈ orl from phead ∨ phead0 = vtail2 ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vtail2 ' + orl0 from vhead
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, phead1, y
| orl0 + rl = orl2 + vhead0 ' + ps0[vhead0].next ' + qrl0, ps[vtail2].deqID = None, vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, orl = qrl + phead1 ', vretRefs(tid) = vretRefs0(tid), ps0[vhead0].next ≠ vhead0, orl ≠ [], phead0 ≠ ps0[vhead0].next, r0 ≠ vhead0, vhead0 ≠ vtail2, vtail2 ≠ ps0[vhead0].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vtail2 ' + orl0, vs, ps, vs0, ps0), listp(orl + vtail2 ' + orl0, vs, ps, owns), listp(orl + (vtail2 ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, ps0, owns0), markedp(orl2, ps0), markedp(orl, vs0), markedp(orl2, vs0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely(tid, orl + vtail2 ' + orl0, vs, orl + (vtail2 ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0), nonullRetRefs(orl + vtail2 ' + orl0, vs, vretRefs, pretRefs), nonullRetRefs(orl + (vtail2 ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[ps0[vhead0].next].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), some?(ps0[vtail2].deqID), some?(vs0[vtail2].deqID), unmarkedp(orl0, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), r0 ∈ orl0 from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ orl + (vtail2 ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vtail, vhead0 ∈ orl + (vtail2 ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(qrl0), ¬ dups(orl2), ¬ dups(orl), ¬ dups(rl), ¬ dups(orl + orl2 + qrl0), ¬ dups(orl + orl0), ¬ dups(orl0), ¬ noid(tid, orl + (vtail2 ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vhead0, vs0), ¬ ps0[vhead0].next ∈ orl2, ¬ ps0[vhead0].next ∈ orl, ¬ vhead0 ∈ qrl0, ¬ vhead0 ∈ orl2, ¬ vhead0 ∈ orl, ¬ ps0[vhead0].next ∈ qrl0, ¬ vtail2 ∈ orl0, ¬ vtail2 ∈ qrl0, ¬ vtail2 ∈ orl2, ¬ vtail2 ∈ 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = (vtail2 ' + orl0).last ∨ vtail = (orl + (vtail2 ' + orl0).butlast).last ∧ vs[(vtail2 ' + orl0).last].deqID = None ∧ vs[(vtail2 ' + orl0).last].next = null, phead1 = vhead ∧ unmarkedp(orl0, vs) ∨ qrl ≠ [] ∧ qrl.last = vhead ∧ phead ≠ phead1 ∧ vs[vtail2].deqID = None ∧ unmarkedp(orl0, vs), vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 = vtail2 ∨ phead0 ∈ orl2 ∨ phead0 = vhead0, phead0 ∈ orl from phead ∨ phead0 = vtail2 ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ orl + vtail2 ' + orl0 from vhead |
orl0 + rl = orl2 + vhead0 ' + ps0[vhead0].next ' + qrl0, ps[ps0[phead1].next].deqID = None, vs[r0].deqID = Some(tid), ps[phead1].next = ps0[phead1].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), ps0[phead1].next ≠ phead1, ps0[vhead0].next ≠ phead1, ps0[phead1].next ≠ ps0[vhead0].next, ps0[vhead0].next ≠ vhead0, phead0 ≠ ps0[vhead0].next, r0 ≠ vhead0, vhead0 ≠ phead1, vhead0 ≠ ps0[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, ps, vs0, ps0), listp((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, ps, owns), listp((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(orl2, vs0), markedp(qrl, ps), markedp(qrl, vs), markedp(qrl, ps0), markedp(orl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely (tid, (qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0), nonullRetRefs((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, vretRefs, pretRefs), nonullRetRefs((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps0[ps0[vhead0].next].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), some?(ps0[ps0[phead1].next].deqID), some?(vs0[ps0[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), r0 ∈ orl0 from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, vtail0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vtail, vhead0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl2), ¬ dups(qrl0), ¬ dups(qrl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(orl0), ¬ dups(qrl), ¬ dups(qrl + orl0), ¬ dups(qrl + orl2 + qrl0), ¬ dups(rl), ¬ noid(tid, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vhead0, vs0), ¬ ps0[phead1].next ∈ qrl, ¬ ps0[phead1].next ∈ orl2, ¬ ps0[phead1].next ∈ qrl0, ¬ ps0[phead1].next ∈ orl0, ¬ ps0[vhead0].next ∈ qrl0, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ orl2, ¬ vhead0 ∈ qrl0, ¬ ps0[vhead0].next ∈ qrl, ¬ ps0[vhead0].next ∈ orl2, ¬ phead1 ∈ orl0, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl2, ¬ phead1 ∈ 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = (ps0[phead1].next ' + orl0).last ∨ vtail = (phead1 ' + (ps0[phead1].next ' + orl0).butlast).last ∧ vs[(ps0[phead1].next ' + orl0).last].deqID = None ∧ vs[(ps0[phead1].next ' + orl0).last].next = null, phead0 ∈ qrl ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0, phead ∈ qrl ∨ phead = phead1, phead1 = vhead ∧ unmarkedp(orl0, vs) ∨ qrl ≠ [] ∧ qrl.last = vhead ∧ phead ≠ phead1 ∧ vs[ps0[phead1].next].deqID = None ∧ unmarkedp(orl0, vs), vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ qrl + phead1 ' from phead ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ (qrl + phead1 ') + ps0[phead1].next ' + orl0 from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| orl0 + rl = orl2 + vhead0 ' + ps0[vhead0].next ' + qrl0, ps[ps0[phead1].next].deqID = None, vs[r0].deqID = Some(tid), ps[phead1].next = ps0[phead1].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), ps0[phead1].next ≠ phead1, ps0[vhead0].next ≠ phead1, ps0[phead1].next ≠ ps0[vhead0].next, ps0[vhead0].next ≠ vhead0, phead0 ≠ ps0[vhead0].next, r0 ≠ vhead0, vhead0 ≠ phead1, vhead0 ≠ ps0[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, ps, vs0, ps0), listp((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, ps, owns), listp((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(orl2, vs0), markedp(qrl, ps), markedp(qrl, vs), markedp(qrl, ps0), markedp(orl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely (tid, (qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0), nonullRetRefs((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, vretRefs, pretRefs), nonullRetRefs((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps0[ps0[vhead0].next].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), some?(ps0[ps0[phead1].next].deqID), some?(vs0[ps0[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), r0 ∈ orl0 from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, vtail0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vtail, vhead0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl2), ¬ dups(qrl0), ¬ dups(qrl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(orl0), ¬ dups(qrl), ¬ dups(qrl + orl0), ¬ dups(qrl + orl2 + qrl0), ¬ dups(rl), ¬ noid(tid, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vhead0, vs0), ¬ ps0[phead1].next ∈ qrl, ¬ ps0[phead1].next ∈ orl2, ¬ ps0[phead1].next ∈ qrl0, ¬ ps0[phead1].next ∈ orl0, ¬ ps0[vhead0].next ∈ qrl0, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ orl2, ¬ vhead0 ∈ qrl0, ¬ ps0[vhead0].next ∈ qrl, ¬ ps0[vhead0].next ∈ orl2, ¬ phead1 ∈ orl0, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl2, ¬ phead1 ∈ 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = (ps0[phead1].next ' + orl0).last ∨ vtail = (phead1 ' + (ps0[phead1].next ' + orl0).butlast).last ∧ vs[(ps0[phead1].next ' + orl0).last].deqID = None ∧ vs[(ps0[phead1].next ' + orl0).last].next = null, phead0 ∈ qrl ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0, phead ∈ qrl ∨ phead = phead1, phead1 = vhead ∧ unmarkedp(orl0, vs) ∨ qrl ≠ [] ∧ qrl.last = vhead ∧ phead ≠ phead1 ∧ vs[ps0[phead1].next].deqID = None ∧ unmarkedp(orl0, vs), vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ qrl + phead1 ' from phead ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0 ⊦ r0 ≠ vhead ∧ r0 ∈ (qrl + phead1 ') + ps0[phead1].next ' + orl0 from vhead |
orl0 + rl = orl2 + vhead0 ' + ps0[vhead0].next ' + qrl0, vs[r0].deqID = Some(tid), ps[ps0[phead1].next].deqID = None, ps[phead1].next = ps0[phead1].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, r0 = vhead, vretRefs(tid) = vretRefs0(tid), ps0[phead1].next ≠ phead1, ps0[vhead0].next ≠ phead1, ps0[phead1].next ≠ ps0[vhead0].next, ps0[vhead0].next ≠ vhead0, phead0 ≠ ps0[vhead0].next, r0 ≠ vhead0, vhead0 ≠ phead1, vhead0 ≠ ps0[phead1].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, ps, vs0, ps0), listp((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, ps0, owns0), listp((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, ps, owns), markedp(orl2, ps0), markedp(qrl, ps0), markedp(qrl, vs), markedp(qrl, ps), markedp(orl2, vs0), markedp(qrl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely (tid, (qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0), nonullRetRefs((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps0[phead1].next].deqID), some?(ps0[ps0[phead1].next].deqID), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[ps0[vhead0].next].deqID), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(orl0, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vhead, vtail0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vtail, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl0 from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl2), ¬ dups(qrl0), ¬ dups(qrl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(orl0), ¬ dups(qrl), ¬ dups(qrl + orl0), ¬ dups(qrl + orl2 + qrl0), ¬ dups(rl), ¬ noid(tid, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vhead0, vs0), ¬ ps0[phead1].next ∈ qrl, ¬ ps0[phead1].next ∈ orl2, ¬ ps0[phead1].next ∈ qrl0, ¬ ps0[phead1].next ∈ orl0, ¬ ps0[vhead0].next ∈ qrl0, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ orl2, ¬ vhead0 ∈ qrl0, ¬ ps0[vhead0].next ∈ qrl, ¬ ps0[vhead0].next ∈ orl2, ¬ phead1 ∈ orl0, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl2, ¬ phead1 ∈ qrl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ qrl + phead1 ' from phead ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead1 = vhead ∧ unmarkedp(orl0, vs) ∨ qrl ≠ [] ∧ qrl.last = vhead ∧ phead ≠ phead1 ∧ vs[ps0[phead1].next].deqID = None ∧ unmarkedp(orl0, vs), phead ∈ qrl ∨ phead = phead1, phead0 ∈ qrl ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0, vtail = (ps0[phead1].next ' + orl0).last ∨ vtail = (phead1 ' + (ps0[phead1].next ' + orl0).butlast).last ∧ vs[(ps0[phead1].next ' + orl0).last].deqID = None ∧ vs[(ps0[phead1].next ' + orl0).last].next = null ⊦
orl0 + rl = orl2 + vhead0 ' + ps0[vhead0].next ' + qrl0, vs[r0].deqID = Some(tid), ps[ps0[phead1].next].deqID = None, ps[phead1].next = ps0[phead1].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), ps0[phead1].next ≠ phead1, ps0[vhead0].next ≠ phead1, ps0[phead1].next ≠ ps0[vhead0].next, ps0[vhead0].next ≠ vhead0, phead0 ≠ ps0[vhead0].next, r0 ≠ vhead0, vhead0 ≠ phead1, vhead0 ≠ ps0[phead1].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, ps, vs0, ps0), listp((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, ps0, owns0), listp((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, ps, owns), markedp(orl2, ps0), markedp(qrl, ps0), markedp(qrl, vs), markedp(qrl, ps), markedp(orl2, vs0), markedp(qrl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely (tid, (qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0), nonullRetRefs((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps0[phead1].next].deqID), some?(ps0[ps0[phead1].next].deqID), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[ps0[vhead0].next].deqID), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(orl0, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vhead, vtail0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vtail, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl0 from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl2), ¬ dups(qrl0), ¬ dups(qrl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(orl0), ¬ dups(qrl), ¬ dups(qrl + orl0), ¬ dups(qrl + orl2 + qrl0), ¬ dups(rl), ¬ noid(tid, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vhead0, vs0), ¬ r0 ∈ (qrl + phead1 ') + ps0[phead1].next ' + orl0 from vhead, ¬ ps0[phead1].next ∈ qrl, ¬ ps0[phead1].next ∈ orl2, ¬ ps0[phead1].next ∈ qrl0, ¬ ps0[phead1].next ∈ orl0, ¬ ps0[vhead0].next ∈ qrl0, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ orl2, ¬ vhead0 ∈ qrl0, ¬ ps0[vhead0].next ∈ qrl, ¬ ps0[vhead0].next ∈ orl2, ¬ phead1 ∈ orl0, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl2, ¬ phead1 ∈ qrl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ qrl + phead1 ' from phead ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead1 = vhead ∧ unmarkedp(orl0, vs) ∨ qrl ≠ [] ∧ qrl.last = vhead ∧ phead ≠ phead1 ∧ vs[ps0[phead1].next].deqID = None ∧ unmarkedp(orl0, vs), phead ∈ qrl ∨ phead = phead1, phead0 ∈ qrl ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0, vtail = (ps0[phead1].next ' + orl0).last ∨ vtail = (phead1 ' + (ps0[phead1].next ' + orl0).butlast).last ∧ vs[(ps0[phead1].next ' + orl0).last].deqID = None ∧ vs[(ps0[phead1].next ' + orl0).last].next = null ⊦
| orl0 + rl = orl2 + vhead0 ' + ps0[vhead0].next ' + qrl0, vs[r0].deqID = Some(tid), ps[ps0[phead1].next].deqID = None, ps[phead1].next = ps0[phead1].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, r0 = vhead, vretRefs(tid) = vretRefs0(tid), ps0[phead1].next ≠ phead1, ps0[vhead0].next ≠ phead1, ps0[phead1].next ≠ ps0[vhead0].next, ps0[vhead0].next ≠ vhead0, phead0 ≠ ps0[vhead0].next, r0 ≠ vhead0, vhead0 ≠ phead1, vhead0 ≠ ps0[phead1].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, ps, vs0, ps0), listp((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, ps0, owns0), listp((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, ps, owns), markedp(orl2, ps0), markedp(qrl, ps0), markedp(qrl, vs), markedp(qrl, ps), markedp(orl2, vs0), markedp(qrl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely (tid, (qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0), nonullRetRefs((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps0[phead1].next].deqID), some?(ps0[ps0[phead1].next].deqID), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[ps0[vhead0].next].deqID), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(orl0, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vhead, vtail0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vtail, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl0 from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl2), ¬ dups(qrl0), ¬ dups(qrl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(orl0), ¬ dups(qrl), ¬ dups(qrl + orl0), ¬ dups(qrl + orl2 + qrl0), ¬ dups(rl), ¬ noid(tid, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vhead0, vs0), ¬ ps0[phead1].next ∈ qrl, ¬ ps0[phead1].next ∈ orl2, ¬ ps0[phead1].next ∈ qrl0, ¬ ps0[phead1].next ∈ orl0, ¬ ps0[vhead0].next ∈ qrl0, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ orl2, ¬ vhead0 ∈ qrl0, ¬ ps0[vhead0].next ∈ qrl, ¬ ps0[vhead0].next ∈ orl2, ¬ phead1 ∈ orl0, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl2, ¬ phead1 ∈ qrl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ qrl + phead1 ' from phead ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead1 = vhead ∧ unmarkedp(orl0, vs) ∨ qrl ≠ [] ∧ qrl.last = vhead ∧ phead ≠ phead1 ∧ vs[ps0[phead1].next].deqID = None ∧ unmarkedp(orl0, vs), phead ∈ qrl ∨ phead = phead1, phead0 ∈ qrl ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0, vtail = (ps0[phead1].next ' + orl0).last ∨ vtail = (phead1 ' + (ps0[phead1].next ' + orl0).butlast).last ∧ vs[(ps0[phead1].next ' + orl0).last].deqID = None ∧ vs[(ps0[phead1].next ' + orl0).last].next = null ⊦ |
orl0 + rl = orl2 + vhead0 ' + ps0[vhead0].next ' + qrl0, ps[ps0[phead1].next].deqID = None, vs[vhead].deqID = Some(tid), ps[phead1].next = ps0[phead1].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), ps0[phead1].next ≠ phead1, ps0[vhead0].next ≠ phead1, ps0[phead1].next ≠ ps0[vhead0].next, ps0[vhead0].next ≠ vhead0, phead0 ≠ ps0[vhead0].next, vhead ≠ vhead0, vhead0 ≠ phead1, vhead0 ≠ ps0[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, ps, vs0, ps0), listp((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, ps, owns), listp((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(orl2, vs0), markedp(qrl, ps), markedp(qrl, vs), markedp(qrl, ps0), markedp(orl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely (tid, (qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0), nonullRetRefs((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, vretRefs, pretRefs), nonullRetRefs((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps0[ps0[vhead0].next].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), some?(ps0[ps0[phead1].next].deqID), some?(vs0[ps0[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), vhead ∈ orl0 from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, vtail0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vtail, vhead0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl2), ¬ dups(qrl0), ¬ dups(qrl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(orl0), ¬ dups(qrl), ¬ dups(qrl + orl0), ¬ dups(qrl + orl2 + qrl0), ¬ dups(rl), ¬ noid(tid, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vhead0, vs0), ¬ ps0[phead1].next ∈ qrl, ¬ ps0[phead1].next ∈ orl2, ¬ ps0[phead1].next ∈ qrl0, ¬ ps0[phead1].next ∈ orl0, ¬ ps0[vhead0].next ∈ qrl0, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ orl2, ¬ vhead0 ∈ qrl0, ¬ ps0[vhead0].next ∈ qrl, ¬ ps0[vhead0].next ∈ orl2, ¬ phead1 ∈ orl0, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl2, ¬ phead1 ∈ 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = (ps0[phead1].next ' + orl0).last ∨ vtail = (phead1 ' + (ps0[phead1].next ' + orl0).butlast).last ∧ vs[(ps0[phead1].next ' + orl0).last].deqID = None ∧ vs[(ps0[phead1].next ' + orl0).last].next = null, phead0 ∈ qrl ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0, phead ∈ qrl ∨ phead = phead1, phead1 = vhead ∧ unmarkedp(orl0, vs) ∨ qrl ≠ [] ∧ qrl.last = vhead ∧ phead ≠ phead1 ∧ vs[ps0[phead1].next].deqID = None ∧ unmarkedp(orl0, vs), vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ qrl + phead1 ' from phead ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0 ⊦
| orl0 + rl = orl2 + vhead0 ' + ps0[vhead0].next ' + qrl0, ps[ps0[phead1].next].deqID = None, vs[vhead].deqID = Some(tid), ps[phead1].next = ps0[phead1].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), ps0[phead1].next ≠ phead1, ps0[vhead0].next ≠ phead1, ps0[phead1].next ≠ ps0[vhead0].next, ps0[vhead0].next ≠ vhead0, phead0 ≠ ps0[vhead0].next, vhead ≠ vhead0, vhead0 ≠ phead1, vhead0 ≠ ps0[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, ps, vs0, ps0), listp((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, ps, owns), listp((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(orl2, vs0), markedp(qrl, ps), markedp(qrl, vs), markedp(qrl, ps0), markedp(orl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely (tid, (qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0), nonullRetRefs((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, vretRefs, pretRefs), nonullRetRefs((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps0[ps0[vhead0].next].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), some?(ps0[ps0[phead1].next].deqID), some?(vs0[ps0[phead1].next].deqID), unmarkedp(orl0, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), vhead ∈ orl0 from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, vtail0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vtail, vhead0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl2), ¬ dups(qrl0), ¬ dups(qrl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(orl0), ¬ dups(qrl), ¬ dups(qrl + orl0), ¬ dups(qrl + orl2 + qrl0), ¬ dups(rl), ¬ noid(tid, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vhead0, vs0), ¬ ps0[phead1].next ∈ qrl, ¬ ps0[phead1].next ∈ orl2, ¬ ps0[phead1].next ∈ qrl0, ¬ ps0[phead1].next ∈ orl0, ¬ ps0[vhead0].next ∈ qrl0, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ orl2, ¬ vhead0 ∈ qrl0, ¬ ps0[vhead0].next ∈ qrl, ¬ ps0[vhead0].next ∈ orl2, ¬ phead1 ∈ orl0, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl2, ¬ phead1 ∈ 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = (ps0[phead1].next ' + orl0).last ∨ vtail = (phead1 ' + (ps0[phead1].next ' + orl0).butlast).last ∧ vs[(ps0[phead1].next ' + orl0).last].deqID = None ∧ vs[(ps0[phead1].next ' + orl0).last].next = null, phead0 ∈ qrl ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0, phead ∈ qrl ∨ phead = phead1, phead1 = vhead ∧ unmarkedp(orl0, vs) ∨ qrl ≠ [] ∧ qrl.last = vhead ∧ phead ≠ phead1 ∧ vs[ps0[phead1].next].deqID = None ∧ unmarkedp(orl0, vs), vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ qrl + phead1 ' from phead ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0 ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
orl0 + rl = orl2 + vhead0 ' + ps0[vhead0].next ' + qrl0, vs[vhead].deqID = Some(tid), ps[ps0[phead1].next].deqID = None, ps[phead1].next = ps0[phead1].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), ps0[phead1].next ≠ phead1, ps0[vhead0].next ≠ phead1, ps0[phead1].next ≠ ps0[vhead0].next, ps0[vhead0].next ≠ vhead0, phead0 ≠ ps0[vhead0].next, vhead ≠ vhead0, vhead0 ≠ phead1, vhead0 ≠ ps0[phead1].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, ps, vs0, ps0), listp((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, ps0, owns0), listp((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, ps, owns), markedp(orl2, ps0), markedp(qrl, ps0), markedp(qrl, vs), markedp(qrl, ps), markedp(orl2, vs0), markedp(qrl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely (tid, (qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0), nonullRetRefs((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps0[phead1].next].deqID), some?(ps0[ps0[phead1].next].deqID), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[ps0[vhead0].next].deqID), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(orl0, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (qrl + phead1 ' from vhead) + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vtail0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vtail, phead0 ∈ vs0, phead0 ∈ ps0, vhead ∈ orl0 from vhead0, vhead ∈ qrl + phead1 ', dom prvHp ⊆ dom prvHp0, ¬ dups(orl2), ¬ dups(qrl0), ¬ dups(qrl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(orl0), ¬ dups(qrl), ¬ dups(qrl + orl0), ¬ dups(qrl + orl2 + qrl0), ¬ dups(rl), ¬ noid(tid, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vhead0, vs0), ¬ ps0[phead1].next ∈ qrl, ¬ ps0[phead1].next ∈ orl2, ¬ ps0[phead1].next ∈ qrl0, ¬ ps0[phead1].next ∈ orl0, ¬ ps0[vhead0].next ∈ qrl0, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ orl2, ¬ vhead0 ∈ qrl0, ¬ ps0[vhead0].next ∈ qrl, ¬ ps0[vhead0].next ∈ orl2, ¬ phead1 ∈ orl0, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl2, ¬ phead1 ∈ qrl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ qrl + phead1 ' from phead ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead1 = vhead ∧ unmarkedp(orl0, vs) ∨ qrl ≠ [] ∧ qrl.last = vhead ∧ phead ≠ phead1 ∧ vs[ps0[phead1].next].deqID = None ∧ unmarkedp(orl0, vs), phead ∈ qrl ∨ phead = phead1, phead0 ∈ qrl ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0, vtail = (ps0[phead1].next ' + orl0).last ∨ vtail = (phead1 ' + (ps0[phead1].next ' + orl0).butlast).last ∧ vs[(ps0[phead1].next ' + orl0).last].deqID = None ∧ vs[(ps0[phead1].next ' + orl0).last].next = null ⊦
Used simplifier rules: ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) Used terms: qrl + phead1 ', (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| orl0 + rl = orl2 + vhead0 ' + ps0[vhead0].next ' + qrl0, vs[vhead].deqID = Some(tid), ps[ps0[phead1].next].deqID = None, ps[phead1].next = ps0[phead1].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), ps0[phead1].next ≠ phead1, ps0[vhead0].next ≠ phead1, ps0[phead1].next ≠ ps0[vhead0].next, ps0[vhead0].next ≠ vhead0, phead0 ≠ ps0[vhead0].next, vhead ≠ vhead0, vhead0 ≠ phead1, vhead0 ≠ ps0[phead1].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, ps, vs0, ps0), listp((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, ps0, owns0), listp((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, ps, owns), markedp(orl2, ps0), markedp(qrl, ps0), markedp(qrl, vs), markedp(qrl, ps), markedp(orl2, vs0), markedp(qrl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely (tid, (qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0), nonullRetRefs((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps0[phead1].next].deqID), some?(ps0[ps0[phead1].next].deqID), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[ps0[vhead0].next].deqID), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(orl0, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (qrl + phead1 ' from vhead) + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vtail0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vtail, phead0 ∈ vs0, phead0 ∈ ps0, vhead ∈ orl0 from vhead0, vhead ∈ qrl + phead1 ', dom prvHp ⊆ dom prvHp0, ¬ dups(orl2), ¬ dups(qrl0), ¬ dups(qrl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(orl0), ¬ dups(qrl), ¬ dups(qrl + orl0), ¬ dups(qrl + orl2 + qrl0), ¬ dups(rl), ¬ noid(tid, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vhead0, vs0), ¬ ps0[phead1].next ∈ qrl, ¬ ps0[phead1].next ∈ orl2, ¬ ps0[phead1].next ∈ qrl0, ¬ ps0[phead1].next ∈ orl0, ¬ ps0[vhead0].next ∈ qrl0, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ orl2, ¬ vhead0 ∈ qrl0, ¬ ps0[vhead0].next ∈ qrl, ¬ ps0[vhead0].next ∈ orl2, ¬ phead1 ∈ orl0, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl2, ¬ phead1 ∈ qrl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ qrl + phead1 ' from phead ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead1 = vhead ∧ unmarkedp(orl0, vs) ∨ qrl ≠ [] ∧ qrl.last = vhead ∧ phead ≠ phead1 ∧ vs[ps0[phead1].next].deqID = None ∧ unmarkedp(orl0, vs), phead ∈ qrl ∨ phead = phead1, phead0 ∈ qrl ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0, vtail = (ps0[phead1].next ' + orl0).last ∨ vtail = (phead1 ' + (ps0[phead1].next ' + orl0).butlast).last ∧ vs[(ps0[phead1].next ' + orl0).last].deqID = None ∧ vs[(ps0[phead1].next ' + orl0).last].next = null ⊦ |
orl0 + rl = orl2 + vhead0 ' + ps0[vhead0].next ' + qrl0, vs[ps0[phead1].next].deqID = None, ps[ps0[phead1].next].deqID = None, vs[qrl.last].deqID = Some(tid), ps[phead1].next = ps0[phead1].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), qrl.last ≠ phead1, qrl.last ≠ vhead0, ps0[phead1].next ≠ phead1, ps0[vhead0].next ≠ phead1, ps0[phead1].next ≠ ps0[vhead0].next, ps0[vhead0].next ≠ vhead0, phead ≠ phead1, phead0 ≠ ps0[vhead0].next, qrl ≠ [], vhead0 ≠ phead1, vhead0 ≠ ps0[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, ps, vs0, ps0), listp((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, ps, owns), listp((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(orl2, vs0), markedp(qrl, ps), markedp(qrl, vs), markedp(qrl, ps0), markedp(orl2, ps0), nextnottid(tid, qrl.last, vs), nextnottidRely(tid, qrl.last, vs, vhead0, vs0), noidRely (tid, (qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0), nonullRetRefs((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, vretRefs, pretRefs), nonullRetRefs((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps0[ps0[vhead0].next].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), some?(ps0[ps0[phead1].next].deqID), some?(vs0[ps0[phead1].next].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), phead ∈ qrl, qrl.last ∈ orl0 from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, vtail0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vtail, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl2), ¬ dups(qrl0), ¬ dups(qrl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(orl0), ¬ dups(qrl), ¬ dups(qrl + orl0), ¬ dups(qrl + orl2 + qrl0), ¬ dups(rl), ¬ noid(tid, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vhead0, vs0), ¬ ps0[phead1].next ∈ qrl, ¬ ps0[phead1].next ∈ orl2, ¬ ps0[phead1].next ∈ qrl0, ¬ ps0[phead1].next ∈ orl0, ¬ ps0[vhead0].next ∈ qrl0, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ orl2, ¬ vhead0 ∈ qrl0, ¬ ps0[vhead0].next ∈ qrl, ¬ ps0[vhead0].next ∈ orl2, ¬ phead1 ∈ orl0, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl2, ¬ phead1 ∈ qrl, vs[qrl.last].next ≠ null ∧ vs[vs[qrl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[qrl.last].next].deqID.tid)) = Claimed(vs[vs[qrl.last].next].deqID.tid, vs[vs[qrl.last].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), phead0 ∈ qrl from phead ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail = (ps0[phead1].next ' + orl0).last ∨ vtail = (phead1 ' + (ps0[phead1].next ' + orl0).butlast).last ∧ vs[(ps0[phead1].next ' + orl0).last].deqID = None ∧ vs[(ps0[phead1].next ' + orl0).last].next = null, phead0 ∈ qrl ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) ⊦ r ∈ rl from r0 → r ∈ rl; (ss) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s)
| orl0 + rl = orl2 + vhead0 ' + ps0[vhead0].next ' + qrl0, vs[ps0[phead1].next].deqID = None, ps[ps0[phead1].next].deqID = None, vs[qrl.last].deqID = Some(tid), ps[phead1].next = ps0[phead1].next, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), qrl.last ≠ phead1, qrl.last ≠ vhead0, ps0[phead1].next ≠ phead1, ps0[vhead0].next ≠ phead1, ps0[phead1].next ≠ ps0[vhead0].next, ps0[vhead0].next ≠ vhead0, phead ≠ phead1, phead0 ≠ ps0[vhead0].next, qrl ≠ [], vhead0 ≠ phead1, vhead0 ≠ ps0[phead1].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, ps, vs0, ps0), listp((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, ps, owns), listp((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, ps0, owns0), markedp(qrl, vs0), markedp(orl2, vs0), markedp(qrl, ps), markedp(qrl, vs), markedp(qrl, ps0), markedp(orl2, ps0), nextnottid(tid, qrl.last, vs), nextnottidRely(tid, qrl.last, vs, vhead0, vs0), noidRely (tid, (qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0), nonullRetRefs((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, vretRefs, pretRefs), nonullRetRefs((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), some?(ps0[phead1].deqID), some?(ps0[ps0[vhead0].next].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), some?(ps0[ps0[phead1].next].deqID), some?(vs0[ps0[phead1].next].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), phead ∈ qrl, qrl.last ∈ orl0 from vhead0, phead0 ∈ ps0, phead0 ∈ vs0, vtail0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vtail, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl2), ¬ dups(qrl0), ¬ dups(qrl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(orl0), ¬ dups(qrl), ¬ dups(qrl + orl0), ¬ dups(qrl + orl2 + qrl0), ¬ dups(rl), ¬ noid(tid, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vhead0, vs0), ¬ ps0[phead1].next ∈ qrl, ¬ ps0[phead1].next ∈ orl2, ¬ ps0[phead1].next ∈ qrl0, ¬ ps0[phead1].next ∈ orl0, ¬ ps0[vhead0].next ∈ qrl0, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ orl2, ¬ vhead0 ∈ qrl0, ¬ ps0[vhead0].next ∈ qrl, ¬ ps0[vhead0].next ∈ orl2, ¬ phead1 ∈ orl0, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl2, ¬ phead1 ∈ qrl, vs[qrl.last].next ≠ null ∧ vs[vs[qrl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[qrl.last].next].deqID.tid)) = Claimed(vs[vs[qrl.last].next].deqID.tid, vs[vs[qrl.last].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), phead0 ∈ qrl from phead ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail = (ps0[phead1].next ' + orl0).last ∨ vtail = (phead1 ' + (ps0[phead1].next ' + orl0).butlast).last ∧ vs[(ps0[phead1].next ' + orl0).last].deqID = None ∧ vs[(ps0[phead1].next ' + orl0).last].next = null, phead0 ∈ qrl ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ r ∈ rl from r0 → r ∈ rl; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl, vtail1, y
| orl0 + rl = orl2 + vhead0 ' + ps0[vhead0].next ' + qrl0, vs[r0].deqID = Some(tid), ps[ps0[phead1].next].deqID = None, ps[phead1].next = ps0[phead1].next, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), ps0[phead1].next ≠ phead1, ps0[vhead0].next ≠ phead1, ps0[phead1].next ≠ ps0[vhead0].next, ps0[vhead0].next ≠ vhead0, phead0 ≠ ps0[vhead0].next, r0 ≠ vhead0, vhead0 ≠ phead1, vhead0 ≠ ps0[phead1].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, ps, vs0, ps0), listp((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, ps0, owns0), listp((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, ps, owns), markedp(orl2, ps0), markedp(qrl, ps0), markedp(qrl, vs), markedp(qrl, ps), markedp(orl2, vs0), markedp(qrl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noidRely (tid, (qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0), nonullRetRefs((qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((qrl + phead1 ') + ps0[phead1].next ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[ps0[phead1].next].deqID), some?(ps0[ps0[phead1].next].deqID), some?(vs0[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs0[ps0[vhead0].next].deqID), some?(ps0[ps0[vhead0].next].deqID), some?(ps0[phead1].deqID), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(orl0, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vhead, vtail0 ∈ (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0 from vtail, phead0 ∈ vs0, phead0 ∈ ps0, r0 ∈ orl0 from vhead0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl2), ¬ dups(qrl0), ¬ dups(qrl + orl2), ¬ dups(orl2 + qrl0), ¬ dups(orl0), ¬ dups(qrl), ¬ dups(qrl + orl0), ¬ dups(qrl + orl2 + qrl0), ¬ dups(rl), ¬ noid(tid, (qrl + phead1 ') + (ps0[phead1].next ' + orl2) + vhead0 ' + ps0[vhead0].next ' + qrl0, vhead0, vs0), ¬ r0 ∈ (qrl + phead1 ') + ps0[phead1].next ' + orl0 from vhead, ¬ ps0[phead1].next ∈ qrl, ¬ ps0[phead1].next ∈ orl2, ¬ ps0[phead1].next ∈ qrl0, ¬ ps0[phead1].next ∈ orl0, ¬ ps0[vhead0].next ∈ qrl0, ¬ vhead0 ∈ qrl, ¬ vhead0 ∈ orl2, ¬ vhead0 ∈ qrl0, ¬ ps0[vhead0].next ∈ qrl, ¬ ps0[vhead0].next ∈ orl2, ¬ phead1 ∈ orl0, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl2, ¬ phead1 ∈ qrl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ qrl + phead1 ' from phead ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0 ∨ phead0 ∈ qrl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), vtail0 = (ps0[vhead0].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (ps0[vhead0].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead1 = vhead ∧ unmarkedp(orl0, vs) ∨ qrl ≠ [] ∧ qrl.last = vhead ∧ phead ≠ phead1 ∧ vs[ps0[phead1].next].deqID = None ∧ unmarkedp(orl0, vs), phead ∈ qrl ∨ phead = phead1, phead0 ∈ qrl ∨ phead0 = phead1 ∨ phead0 = ps0[phead1].next ∨ phead0 ∈ orl2 ∨ phead0 = vhead0, vtail = (ps0[phead1].next ' + orl0).last ∨ vtail = (phead1 ' + (ps0[phead1].next ' + orl0).butlast).last ∧ vs[(ps0[phead1].next ' + orl0).last].deqID = None ∧ vs[(ps0[phead1].next ' + orl0).last].next = null ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ∈ rl from r0 → r ∈ rl; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) Used terms: qrl + phead1 ', ps0[phead1].next ' + orl0, vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
The following image shows the proof tree of sequent calculus. The proved goal is at the bottom. You can click on the nodes to view additional rules. See here for details on colors in a proof tree.