| ⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ 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) → ( ls.optval = gs0.vrvHp[gs0.vretRefs(ls.tid)] ∧ ls.optval = gs0.prvHp[gs0.pretRefs(ls.tid)] ∧ gs0.vretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∧ gs0.vretRefs(ls.tid) ∈ gs0.vrvHp ∧ gs0.vretRefs(ls.tid) ≠ null ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ noowns(ls.tid, gs0.owns) |
ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)], ls.optval = gs.prvHp[gs.pretRefs(ls.tid)], gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val)), gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid), gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid), dom gs.vrvHp = dom gs.prvHp, dom gs0.vrvHp = dom gs0.prvHp, gs0.orl ≠ [], gs.orl ≠ [], gs.vretRefs(ls.tid) ≠ null, 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, gs.vretRefs(ls.tid) ∈ gs.vrvHp, 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) ⊦ ( ls.optval = gs0.vrvHp[gs0.vretRefs(ls.tid)] ∧ ls.optval = gs0.prvHp[gs0.pretRefs(ls.tid)] ∧ gs0.vretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∧ gs0.vretRefs(ls.tid) ∈ gs0.vrvHp ∧ gs0.vretRefs(ls.tid) ≠ null ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ noowns(ls.tid, gs0.owns)
| ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)], ls.optval = gs.prvHp[gs.pretRefs(ls.tid)], gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val)), gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid), gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid), dom gs.vrvHp = dom gs.prvHp, dom gs0.vrvHp = dom gs0.prvHp, gs0.orl ≠ [], gs.orl ≠ [], gs.vretRefs(ls.tid) ≠ null, 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, gs.vretRefs(ls.tid) ∈ gs.vrvHp, 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) ⊦ ( ls.optval = gs0.vrvHp[gs0.vretRefs(ls.tid)] ∧ ls.optval = gs0.prvHp[gs0.pretRefs(ls.tid)] ∧ gs0.vretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∧ gs0.vretRefs(ls.tid) ∈ gs0.vrvHp ∧ gs0.vretRefs(ls.tid) ≠ null ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ 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 + gs.qrl + rl = gs0.orl + gs0.qrl, gs.orl + rl0 = gs0.orl, ls.optval = gs.vrvHp[gs0.pretRefs(ls.tid)], ls.optval = gs.prvHp[gs0.pretRefs(ls.tid)], gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid), gs.rvowns(gs0.pretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val)), gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid), gs0.vretRefs(ls.tid) = gs0.pretRefs(ls.tid), dom gs.vrvHp = dom gs.prvHp, dom gs0.vrvHp = dom gs0.prvHp, gs.orl ≠ [], gs0.orl ≠ [], gs0.pretRefs(ls.tid) ≠ null, 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.ps, gs.phead ∈ gs.vs, gs0.phead ∈ gs0.ps, gs0.phead ∈ gs0.vs, gs.phead ∈ gs.orl, gs0.pretRefs(ls.tid) ∈ gs.vrvHp, 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.prvHp ⊆ dom gs0.prvHp, ¬ dups(gs0.qrl), ¬ dups(gs0.orl), ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), ¬ dups(gs0.orl + gs0.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), 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, 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.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.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) ⊦ ls.optval = gs0.vrvHp[gs0.pretRefs(ls.tid)] ∧ ls.optval = gs0.prvHp[gs0.pretRefs(ls.tid)] ∧ gs0.rvowns(gs0.pretRefs(ls.tid)) = gs.rvowns(gs0.pretRefs(ls.tid)) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs)
Used simplifier rules: ⊦ dom prvHp = dom vrvHp ∧ dom vrvHp ⊆ dom vrvHp0 ∧ dom prvHp0 = dom vrvHp0 ∧ rvref ∈ prvHp → rvref ∈ prvHp0; (ss) 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 + gs.qrl + rl = gs0.orl + gs0.qrl, gs.orl + rl0 = gs0.orl, ls.optval = gs.vrvHp[gs0.pretRefs(ls.tid)], ls.optval = gs.prvHp[gs0.pretRefs(ls.tid)], gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid), gs.rvowns(gs0.pretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val)), gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid), gs0.vretRefs(ls.tid) = gs0.pretRefs(ls.tid), dom gs.vrvHp = dom gs.prvHp, dom gs0.vrvHp = dom gs0.prvHp, gs.orl ≠ [], gs0.orl ≠ [], gs0.pretRefs(ls.tid) ≠ null, 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.ps, gs.phead ∈ gs.vs, gs0.phead ∈ gs0.ps, gs0.phead ∈ gs0.vs, gs.phead ∈ gs.orl, gs0.pretRefs(ls.tid) ∈ gs.vrvHp, 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.prvHp ⊆ dom gs0.prvHp, ¬ dups(gs0.qrl), ¬ dups(gs0.orl), ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), ¬ dups(gs0.orl + gs0.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), 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, 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.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.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) ⊦ ls.optval = gs0.vrvHp[gs0.pretRefs(ls.tid)] ∧ ls.optval = gs0.prvHp[gs0.pretRefs(ls.tid)] ∧ gs0.rvowns(gs0.pretRefs(ls.tid)) = gs.rvowns(gs0.pretRefs(ls.tid)) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) |
orl + rl0 = gs0.orl, orl + qrl + rl = gs0.orl + gs0.qrl, ls.optval = prvHp[gs0.pretRefs(ls.tid)], ls.optval = vrvHp[gs0.pretRefs(ls.tid)], gs0.vretRefs(ls.tid) = gs0.pretRefs(ls.tid), dom gs0.vrvHp = dom gs0.prvHp, dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), pretRefs(ls.tid) = gs0.pretRefs(ls.tid), rvowns(gs0.pretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val)), vretRefs(ls.tid) = gs0.pretRefs(ls.tid), gs0.orl ≠ [], gs0.pretRefs(ls.tid) ≠ null, orl ≠ [], allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(orl + qrl, vs, ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), listp(orl + qrl, vs, ps, owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), markedp(orl, vs), markedp(orl, ps), 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(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), ownsRely(ls.tid, owns, gs0.owns), prvHpRely(vrvHp, prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(ls.tid, rvowns, gs0.rvowns, vrvHp), rvrely(ls.tid, rvowns, vretRefs, vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), unmarkedp(qrl, ps), gs0.vhead ∈ gs0.orl + gs0.qrl from vhead, gs0.phead ∈ gs0.orl + gs0.qrl from phead, gs0.vtail ∈ gs0.orl + gs0.qrl from vtail, gs0.phead ∈ gs0.orl, gs0.pretRefs(ls.tid) ∈ vrvHp, phead ∈ orl, gs0.phead ∈ gs0.vs, gs0.phead ∈ gs0.ps, phead ∈ vs, phead ∈ ps, dom prvHp ⊆ dom gs0.prvHp, ¬ dups(gs0.qrl), ¬ dups(gs0.orl), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ dups(gs0.orl + gs0.qrl), 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), vs[vhead].next ≠ null ∧ vs[vs[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.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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, 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, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ls.optval = gs0.vrvHp[gs0.pretRefs(ls.tid)] ∧ ls.optval = gs0.prvHp[gs0.pretRefs(ls.tid)] ∧ gs0.rvowns(gs0.pretRefs(ls.tid)) = rvowns(gs0.pretRefs(ls.tid)) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs)
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 + rl0 = gs0.orl, orl + qrl + rl = gs0.orl + gs0.qrl, ls.optval = prvHp[gs0.pretRefs(ls.tid)], ls.optval = vrvHp[gs0.pretRefs(ls.tid)], gs0.vretRefs(ls.tid) = gs0.pretRefs(ls.tid), dom gs0.vrvHp = dom gs0.prvHp, dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), pretRefs(ls.tid) = gs0.pretRefs(ls.tid), rvowns(gs0.pretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val)), vretRefs(ls.tid) = gs0.pretRefs(ls.tid), gs0.orl ≠ [], gs0.pretRefs(ls.tid) ≠ null, orl ≠ [], allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(orl + qrl, vs, ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), listp(orl + qrl, vs, ps, owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), markedp(orl, vs), markedp(orl, ps), 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(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), ownsRely(ls.tid, owns, gs0.owns), prvHpRely(vrvHp, prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(ls.tid, rvowns, gs0.rvowns, vrvHp), rvrely(ls.tid, rvowns, vretRefs, vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), unmarkedp(qrl, ps), gs0.vhead ∈ gs0.orl + gs0.qrl from vhead, gs0.phead ∈ gs0.orl + gs0.qrl from phead, gs0.vtail ∈ gs0.orl + gs0.qrl from vtail, gs0.phead ∈ gs0.orl, gs0.pretRefs(ls.tid) ∈ vrvHp, phead ∈ orl, gs0.phead ∈ gs0.vs, gs0.phead ∈ gs0.ps, phead ∈ vs, phead ∈ ps, dom prvHp ⊆ dom gs0.prvHp, ¬ dups(gs0.qrl), ¬ dups(gs0.orl), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ dups(gs0.orl + gs0.qrl), 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), vs[vhead].next ≠ null ∧ vs[vs[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.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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, 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, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ls.optval = gs0.vrvHp[gs0.pretRefs(ls.tid)] ∧ ls.optval = gs0.prvHp[gs0.pretRefs(ls.tid)] ∧ gs0.rvowns(gs0.pretRefs(ls.tid)) = rvowns(gs0.pretRefs(ls.tid)) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) |
orl + rl0 = gs0.orl, qrl + rl = rl0 + gs0.qrl, ls.optval = prvHp[gs0.pretRefs(ls.tid)], ls.optval = vrvHp[gs0.pretRefs(ls.tid)], gs0.vretRefs(ls.tid) = gs0.pretRefs(ls.tid), dom gs0.vrvHp = dom gs0.prvHp, dom vrvHp = dom prvHp, pretRefs(ls.tid) = gs0.pretRefs(ls.tid), rvowns(gs0.pretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val)), vretRefs(ls.tid) = gs0.pretRefs(ls.tid), orl + rl0 ≠ [], gs0.pretRefs(ls.tid) ≠ null, orl ≠ [], allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(orl + qrl, vs, ps, gs0.vs, gs0.ps), listp((orl + rl0) + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), markedp(orl, gs0.vs), markedp(rl0, gs0.vs), markedp(orl, gs0.ps), markedp(rl0, gs0.ps), 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 + rl0) + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), ownsRely(ls.tid, owns, gs0.owns), prvHpRely(vrvHp, prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(ls.tid, rvowns, gs0.rvowns, vrvHp), rvrely(ls.tid, rvowns, vretRefs, vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), unmarkedp(qrl, ps), gs0.vhead ∈ (orl + rl0) + gs0.qrl from vhead, gs0.vtail ∈ (orl + rl0) + gs0.qrl from vtail, gs0.pretRefs(ls.tid) ∈ vrvHp, phead ∈ orl, gs0.phead ∈ gs0.vs, gs0.phead ∈ gs0.ps, phead ∈ gs0.ps, phead ∈ gs0.vs, phead ∈ ps, phead ∈ vs, dom prvHp ⊆ dom gs0.prvHp, ¬ dups(rl0), ¬ dups(gs0.qrl), ¬ dups(orl + rl0), ¬ dups(qrl + rl), ¬ dups(orl), ¬ dups((orl + rl0) + gs0.qrl), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), 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), vs[vhead].next ≠ null ∧ vs[vs[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 + 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), 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, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, gs0.phead ∈ orl from phead ∨ gs0.phead ∈ rl0 ∨ gs0.phead ∈ gs0.qrl, gs0.phead ∈ orl ∨ gs0.phead ∈ rl0 ⊦ ls.optval = gs0.vrvHp[gs0.pretRefs(ls.tid)] ∧ ls.optval = gs0.prvHp[gs0.pretRefs(ls.tid)] ∧ gs0.rvowns(gs0.pretRefs(ls.tid)) = rvowns(gs0.pretRefs(ls.tid)) ∧ noid(ls.tid, (orl + rl0) + gs0.qrl, gs0.vhead, gs0.vs)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ 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, ls.optval = prvHp[gs0.pretRefs(ls.tid)], ls.optval = vrvHp[gs0.pretRefs(ls.tid)], gs0.vretRefs(ls.tid) = gs0.pretRefs(ls.tid), dom gs0.vrvHp = dom gs0.prvHp, dom vrvHp = dom prvHp, pretRefs(ls.tid) = gs0.pretRefs(ls.tid), rvowns(gs0.pretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val)), vretRefs(ls.tid) = gs0.pretRefs(ls.tid), orl + rl0 ≠ [], gs0.pretRefs(ls.tid) ≠ null, orl ≠ [], allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(orl + qrl, vs, ps, gs0.vs, gs0.ps), listp((orl + rl0) + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), markedp(orl, gs0.vs), markedp(rl0, gs0.vs), markedp(orl, gs0.ps), markedp(rl0, gs0.ps), 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 + rl0) + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), ownsRely(ls.tid, owns, gs0.owns), prvHpRely(vrvHp, prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(ls.tid, rvowns, gs0.rvowns, vrvHp), rvrely(ls.tid, rvowns, vretRefs, vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), unmarkedp(qrl, ps), gs0.vhead ∈ (orl + rl0) + gs0.qrl from vhead, gs0.vtail ∈ (orl + rl0) + gs0.qrl from vtail, gs0.pretRefs(ls.tid) ∈ vrvHp, phead ∈ orl, gs0.phead ∈ gs0.vs, gs0.phead ∈ gs0.ps, phead ∈ gs0.ps, phead ∈ gs0.vs, phead ∈ ps, phead ∈ vs, dom prvHp ⊆ dom gs0.prvHp, ¬ dups(rl0), ¬ dups(gs0.qrl), ¬ dups(orl + rl0), ¬ dups(qrl + rl), ¬ dups(orl), ¬ dups((orl + rl0) + gs0.qrl), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), 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), vs[vhead].next ≠ null ∧ vs[vs[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 + 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), 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, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, gs0.phead ∈ orl from phead ∨ gs0.phead ∈ rl0 ∨ gs0.phead ∈ gs0.qrl, gs0.phead ∈ orl ∨ gs0.phead ∈ rl0 ⊦ ls.optval = gs0.vrvHp[gs0.pretRefs(ls.tid)] ∧ ls.optval = gs0.prvHp[gs0.pretRefs(ls.tid)] ∧ gs0.rvowns(gs0.pretRefs(ls.tid)) = rvowns(gs0.pretRefs(ls.tid)) ∧ noid(ls.tid, (orl + rl0) + gs0.qrl, gs0.vhead, gs0.vs) |
qrl + rl = rl0 + qrl0, orl + rl0 = orl0, ls.optval = vrvHp[pretRefs0(ls.tid)], ls.optval = prvHp[pretRefs0(ls.tid)], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, gs0 = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), pretRefs(ls.tid) = pretRefs0(ls.tid), rvowns(pretRefs0(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val)), vretRefs(ls.tid) = pretRefs0(ls.tid), vretRefs0(ls.tid) = pretRefs0(ls.tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(ls.tid) ≠ null, 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(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), 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), phead ∈ vs, phead ∈ ps, phead ∈ vs0, phead ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, pretRefs0(ls.tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(qrl + rl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(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), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, 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) ⊦ ls.optval = vrvHp0[pretRefs0(ls.tid)] ∧ ls.optval = prvHp0[pretRefs0(ls.tid)] ∧ rvowns0(pretRefs0(ls.tid)) = rvowns(pretRefs0(ls.tid)) ∧ noid(ls.tid, (orl + rl0) + qrl0, vhead0, vs0)
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, ls.optval = vrvHp[pretRefs0(ls.tid)], ls.optval = prvHp[pretRefs0(ls.tid)], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, gs0 = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), pretRefs(ls.tid) = pretRefs0(ls.tid), rvowns(pretRefs0(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val)), vretRefs(ls.tid) = pretRefs0(ls.tid), vretRefs0(ls.tid) = pretRefs0(ls.tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(ls.tid) ≠ null, 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(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), 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), phead ∈ vs, phead ∈ ps, phead ∈ vs0, phead ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, pretRefs0(ls.tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(qrl + rl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(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), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, 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) ⊦ ls.optval = vrvHp0[pretRefs0(ls.tid)] ∧ ls.optval = prvHp0[pretRefs0(ls.tid)] ∧ rvowns0(pretRefs0(ls.tid)) = rvowns(pretRefs0(ls.tid)) ∧ noid(ls.tid, (orl + rl0) + qrl0, vhead0, vs0) |
qrl + rl = rl0 + qrl0, ls.optval = prvHp[pretRefs0(ls.tid)], ls.optval = vrvHp[pretRefs0(ls.tid)], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(ls.tid) = pretRefs0(ls.tid), rvowns(pretRefs0(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val)), vretRefs(ls.tid) = pretRefs0(ls.tid), vretRefs0(ls.tid) = pretRefs0(ls.tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(ls.tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), 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), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(ls.tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), 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), (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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦ ls.optval = vrvHp0[pretRefs0(ls.tid)] ∧ ls.optval = prvHp0[pretRefs0(ls.tid)] ∧ rvowns0(pretRefs0(ls.tid)) = rvowns(pretRefs0(ls.tid)) ∧ noid(ls.tid, (orl + rl0) + qrl0, vhead0, vs0)
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, ls.optval = prvHp[pretRefs0(ls.tid)], ls.optval = vrvHp[pretRefs0(ls.tid)], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(ls.tid) = pretRefs0(ls.tid), rvowns(pretRefs0(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val)), vretRefs(ls.tid) = pretRefs0(ls.tid), vretRefs0(ls.tid) = pretRefs0(ls.tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(ls.tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), 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), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(ls.tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), 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), (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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦ ls.optval = vrvHp0[pretRefs0(ls.tid)] ∧ ls.optval = prvHp0[pretRefs0(ls.tid)] ∧ rvowns0(pretRefs0(ls.tid)) = rvowns(pretRefs0(ls.tid)) ∧ noid(ls.tid, (orl + rl0) + qrl0, vhead0, vs0) |
qrl + rl = rl0 + qrl0, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), optval = vrvHp[pretRefs0(tid)], optval = prvHp[pretRefs0(tid)], pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (optval = Empty ⊃ Pending(tid);Claimed(tid, optval.val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), 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), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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 ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, 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) ⊦ optval = vrvHp0[pretRefs0(tid)] ∧ optval = prvHp0[pretRefs0(tid)] ∧ rvowns0(pretRefs0(tid)) = rvowns(pretRefs0(tid)) ∧ noid(tid, (orl + rl0) + qrl0, vhead0, vs0)
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 vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), optval = vrvHp[pretRefs0(tid)], optval = prvHp[pretRefs0(tid)], pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (optval = Empty ⊃ Pending(tid);Claimed(tid, optval.val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), 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), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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 ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, 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) ⊦ optval = vrvHp0[pretRefs0(tid)] ∧ optval = prvHp0[pretRefs0(tid)] ∧ rvowns0(pretRefs0(tid)) = rvowns(pretRefs0(tid)) ∧ noid(tid, (orl + rl0) + qrl0, vhead0, vs0) |
qrl + rl = rl0 + qrl0, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), 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), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), 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), (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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦ vrvHp[pretRefs0(tid)] = vrvHp0[pretRefs0(tid)] ∧ vrvHp[pretRefs0(tid)] = prvHp0[pretRefs0(tid)] ∧ rvowns0(pretRefs0(tid)) = rvowns(pretRefs0(tid)) ∧ noid(tid, (orl + rl0) + qrl0, vhead0, vs0)
| qrl + rl = rl0 + qrl0, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), 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), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), 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), (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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦ vrvHp[pretRefs0(tid)] = vrvHp0[pretRefs0(tid)] ∧ vrvHp[pretRefs0(tid)] = prvHp0[pretRefs0(tid)] ∧ rvowns0(pretRefs0(tid)) = rvowns(pretRefs0(tid)) ∧ noid(tid, (orl + rl0) + qrl0, vhead0, vs0) |
qrl + rl = rl0 + qrl0, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), 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), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ 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), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, 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) ⊦
qrl + rl = rl0 + qrl0, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), 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), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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 ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, 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) ⊦ rvowns0(pretRefs0(tid)) = rvowns(pretRefs0(tid)) ∧ vrvHp[pretRefs0(tid)] = prvHp0[pretRefs0(tid)] ∧ vrvHp[pretRefs0(tid)] = vrvHp0[pretRefs0(tid)]
| qrl + rl = rl0 + qrl0, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), 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), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ 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), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, 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) ⊦ |
orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead, (orl + rl0).last = vhead0 ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ⊦ noidRely(tid, orl + qrl, vs, orl + rl0 + qrl0, vs0) ∧ orl ≠ [] ∧ noid(tid, orl + qrl, vhead, vs) ∧ ¬ dups(orl + qrl) ∧ ¬ dups(orl + rl0 + qrl0) ∧ qrl + rl = rl0 + qrl0 ∧ vhead0 ∈ (orl + rl0) + qrl0 from vhead → noid(tid, orl + rl0 + qrl0, vhead0, vs0)
qrl + rl = rl0 + qrl0, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), 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), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ 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), (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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦ (orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead) ∧ ((orl + rl0).last = vhead0 ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0) ∧ noidRely(tid, orl + qrl, vs, orl + rl0 + qrl0, vs0) ∧ orl ≠ [] ∧ noid(tid, orl + qrl, vhead, vs) ∧ ¬ dups(orl + qrl) ∧ ¬ dups(orl + rl0 + qrl0) ∧ qrl + rl = rl0 + qrl0 ∧ vhead0 ∈ (orl + rl0) + qrl0 from vhead
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: qrl, rl, vhead, vhead0, tid, qrl0, orl, vs0, rl0, vs
| orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead, (orl + rl0).last = vhead0 ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ⊦ noidRely(tid, orl + qrl, vs, orl + rl0 + qrl0, vs0) ∧ orl ≠ [] ∧ noid(tid, orl + qrl, vhead, vs) ∧ ¬ dups(orl + qrl) ∧ ¬ dups(orl + rl0 + qrl0) ∧ qrl + rl = rl0 + qrl0 ∧ vhead0 ∈ (orl + rl0) + qrl0 from vhead → noid(tid, orl + rl0 + qrl0, vhead0, vs0) |
| qrl + rl = rl0 + qrl0, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), 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), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ 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), (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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦ (orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead) ∧ ((orl + rl0).last = vhead0 ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0) ∧ noidRely(tid, orl + qrl, vs, orl + rl0 + qrl0, vs0) ∧ orl ≠ [] ∧ noid(tid, orl + qrl, vhead, vs) ∧ ¬ dups(orl + qrl) ∧ ¬ dups(orl + rl0 + qrl0) ∧ qrl + rl = rl0 + qrl0 ∧ vhead0 ∈ (orl + rl0) + qrl0 from vhead |
qrl + rl = rl0 + qrl0, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), 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), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ 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), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, 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) ⊦ (orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead) ∧ ((orl + rl0).last = vhead0 ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]
| qrl + rl = rl0 + qrl0, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), 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), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ 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), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, 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) ⊦ (orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead) ∧ ((orl + rl0).last = vhead0 ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0) |
qrl + rl = rl0 + qrl0, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl.last ≠ vhead, orl ≠ [], pretRefs0(tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), 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), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ 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), (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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦ orl.butlast ≠ [] ∧ orl.butlast.last = vhead
qrl + rl = rl0 + qrl0, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], (orl + rl0).last ≠ vhead0, orl ≠ [], pretRefs0(tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), 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), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ 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), (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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0
| qrl + rl = rl0 + qrl0, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl.last ≠ vhead, orl ≠ [], pretRefs0(tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), 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), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ 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), (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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦ orl.butlast ≠ [] ∧ orl.butlast.last = vhead |
qrl + rl = rl0 + qrl0, orl.butlast = [], prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl.last ≠ [].last, orl ≠ orl.head ', orl ≠ [], phead ≠ orl.last, pretRefs0(tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), nextnottid(tid, [].last, vs), nextnottidRely(tid, [].last, vs, vhead0, vs0), noid(tid, orl + qrl, [].last, 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(qrl, vs), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (orl + rl0) + qrl0 from [].last, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ 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[[].last].next ≠ null ∧ vs[vs[[].last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[[].last].next].deqID.tid)) = Claimed(vs[vs[[].last].next].deqID.tid, vs[vs[[].last].next].val), 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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦
Used simplifier rules: ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss)
| qrl + rl = rl0 + qrl0, orl.butlast = [], prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl.last ≠ [].last, orl ≠ orl.head ', orl ≠ [], phead ≠ orl.last, pretRefs0(tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), nextnottid(tid, [].last, vs), nextnottidRely(tid, [].last, vs, vhead0, vs0), noid(tid, orl + qrl, [].last, 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(qrl, vs), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (orl + rl0) + qrl0 from [].last, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ 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[[].last].next ≠ null ∧ vs[vs[[].last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[[].last].next].deqID.tid)) = Claimed(vs[vs[[].last].next].deqID.tid, vs[vs[[].last].next].val), 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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ |
Used simplifier rules: ⊦ (a ' + x).butlast = [] ↔ x = []; (s) ⊦ a ' + x ≠ []; (s) ⊦ a + x = a ' + x; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: orl, head, tail
| qrl + rl = rl0 + qrl0, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], (orl + rl0).last ≠ vhead0, orl ≠ [], pretRefs0(tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), 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), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ 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), (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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 |
qrl + rl = rl0 + qrl0, (orl + rl0).butlast = [], prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ orl.head ', orl + rl0 ≠ [], (orl + rl0).last ≠ [].last, orl ≠ [], phead0 ≠ (orl + rl0).last, pretRefs0(tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, [].last, 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, vs0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), [].last ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ noid(tid, (orl + rl0) + qrl0, [].last, vs0), vs0[[].last].next ≠ null ∧ vs0[vs0[[].last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[[].last].next].deqID.tid)) = Claimed(vs0[vs0[[].last].next].deqID.tid, vs0[vs0[[].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 ∧ (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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (x + y).head = x.head; (s) ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss)
| qrl + rl = rl0 + qrl0, (orl + rl0).butlast = [], prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ orl.head ', orl + rl0 ≠ [], (orl + rl0).last ≠ [].last, orl ≠ [], phead0 ≠ (orl + rl0).last, pretRefs0(tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, [].last, 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, vs0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), [].last ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ noid(tid, (orl + rl0) + qrl0, [].last, vs0), vs0[[].last].next ≠ null ∧ vs0[vs0[[].last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[[].last].next].deqID.tid)) = Claimed(vs0[vs0[[].last].next].deqID.tid, vs0[vs0[[].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 ∧ (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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦ |
Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ a ' + x ≠ []; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ (a ' + x).butlast = [] ↔ x = []; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ [] + x = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: orl, head, tail
| qrl + rl = rl0 + qrl0, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), 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), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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 ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, 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) ⊦ rvowns0(pretRefs0(tid)) = rvowns(pretRefs0(tid)) ∧ vrvHp[pretRefs0(tid)] = prvHp0[pretRefs0(tid)] ∧ vrvHp[pretRefs0(tid)] = vrvHp0[pretRefs0(tid)] |
⊦ prvHpRely(vrvHp, prvHp, prvHp0) ↔ (∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref])
qrl + rl = rl0 + qrl0, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), 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), 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), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), 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), ∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref], (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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦ rvowns0(pretRefs0(tid)) = rvowns(pretRefs0(tid)) ∧ vrvHp[pretRefs0(tid)] = prvHp0[pretRefs0(tid)] ∧ vrvHp[pretRefs0(tid)] = vrvHp0[pretRefs0(tid)]
Used terms: vrvHp, prvHp, prvHp0
| ⊦ prvHpRely(vrvHp, prvHp, prvHp0) ↔ (∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref]) |
| qrl + rl = rl0 + qrl0, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), 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), 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), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), 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), ∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref], (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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦ rvowns0(pretRefs0(tid)) = rvowns(pretRefs0(tid)) ∧ vrvHp[pretRefs0(tid)] = prvHp0[pretRefs0(tid)] ∧ vrvHp[pretRefs0(tid)] = vrvHp0[pretRefs0(tid)] |
qrl + rl = rl0 + qrl0, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), 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), 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), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), pretRefs0(tid) ∈ prvHp → prvHp0[pretRefs0(tid)] = prvHp[pretRefs0(tid)] ∨ prvHp0[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], ∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref], phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, 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) ⊦ rvowns0(pretRefs0(tid)) = rvowns(pretRefs0(tid)) ∧ vrvHp[pretRefs0(tid)] = prvHp0[pretRefs0(tid)] ∧ vrvHp[pretRefs0(tid)] = vrvHp0[pretRefs0(tid)]
Used terms: pretRefs0(tid)
| qrl + rl = rl0 + qrl0, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), 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), 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), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), pretRefs0(tid) ∈ prvHp → prvHp0[pretRefs0(tid)] = prvHp[pretRefs0(tid)] ∨ prvHp0[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], ∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref], phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, 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) ⊦ rvowns0(pretRefs0(tid)) = rvowns(pretRefs0(tid)) ∧ vrvHp[pretRefs0(tid)] = prvHp0[pretRefs0(tid)] ∧ vrvHp[pretRefs0(tid)] = vrvHp0[pretRefs0(tid)] |
qrl + rl = rl0 + qrl0, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], prvHp0[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), 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), 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), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + 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), ∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref], phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, 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) ⊦ rvowns0(pretRefs0(tid)) = rvowns(pretRefs0(tid)) ∧ vrvHp[pretRefs0(tid)] = vrvHp0[pretRefs0(tid)]
Used simplifier rules: ⊦ dom st0 = dom st1 ∧ a ∈ st0 → a ∈ st1; (ss)
| qrl + rl = rl0 + qrl0, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], prvHp0[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), 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), 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), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + 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), ∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref], phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, 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) ⊦ rvowns0(pretRefs0(tid)) = rvowns(pretRefs0(tid)) ∧ vrvHp[pretRefs0(tid)] = vrvHp0[pretRefs0(tid)] |
⊦ rvownerok(vretRefs, vrvHp, rvowns) ↔ (∀ tid. vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid)
qrl + rl = rl0 + qrl0, prvHp0[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), 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), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + 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), ∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref], ∀ tid. vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = 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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦ rvowns0(pretRefs0(tid)) = rvowns(pretRefs0(tid)) ∧ vrvHp[pretRefs0(tid)] = vrvHp0[pretRefs0(tid)]
Used terms: vretRefs, vrvHp, rvowns
| ⊦ rvownerok(vretRefs, vrvHp, rvowns) ↔ (∀ tid. vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid) |
| qrl + rl = rl0 + qrl0, prvHp0[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), 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), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + 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), ∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref], ∀ tid. vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = 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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦ rvowns0(pretRefs0(tid)) = rvowns(pretRefs0(tid)) ∧ vrvHp[pretRefs0(tid)] = vrvHp0[pretRefs0(tid)] |
⊦ rvownsrely(tid, rvowns, rvowns0, vrvHp) ↔ (∀ rvref. rvref ∈ vrvHp → rvowns(rvref) = rvowns0(rvref) ∨ tid ≠ rvowns(rvref).tid ∧ rvowns(rvref).tid = rvowns0(rvref).tid ∧ rvowns(rvref).pending?)
qrl + rl = rl0 + qrl0, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], prvHp0[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), 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), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + 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), ∀ tid. vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid, ∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref], ∀ rvref. rvref ∈ vrvHp → rvowns(rvref) = rvowns0(rvref) ∨ tid ≠ rvowns(rvref).tid ∧ rvowns(rvref).tid = rvowns0(rvref).tid ∧ rvowns(rvref).pending?, phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, 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) ⊦ rvowns0(pretRefs0(tid)) = rvowns(pretRefs0(tid)) ∧ vrvHp[pretRefs0(tid)] = vrvHp0[pretRefs0(tid)]
Used terms: tid, rvowns, rvowns0, vrvHp
| ⊦ rvownsrely(tid, rvowns, rvowns0, vrvHp) ↔ (∀ rvref. rvref ∈ vrvHp → rvowns(rvref) = rvowns0(rvref) ∨ tid ≠ rvowns(rvref).tid ∧ rvowns(rvref).tid = rvowns0(rvref).tid ∧ rvowns(rvref).pending?) |
| qrl + rl = rl0 + qrl0, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], prvHp0[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), 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), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + 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), ∀ tid. vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid, ∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref], ∀ rvref. rvref ∈ vrvHp → rvowns(rvref) = rvowns0(rvref) ∨ tid ≠ rvowns(rvref).tid ∧ rvowns(rvref).tid = rvowns0(rvref).tid ∧ rvowns(rvref).pending?, phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, 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) ⊦ rvowns0(pretRefs0(tid)) = rvowns(pretRefs0(tid)) ∧ vrvHp[pretRefs0(tid)] = vrvHp0[pretRefs0(tid)] |
qrl + rl = rl0 + qrl0, prvHp0[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), 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), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + 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), pretRefs0(tid) ∈ vrvHp → rvowns(pretRefs0(tid)) = rvowns0(pretRefs0(tid)) ∨ tid ≠ rvowns(pretRefs0(tid)).tid ∧ rvowns(pretRefs0(tid)).tid = rvowns0(pretRefs0(tid)).tid ∧ rvowns(pretRefs0(tid)).pending?, ∀ rvref. rvref ∈ vrvHp → rvowns(rvref) = rvowns0(rvref) ∨ tid ≠ rvowns(rvref).tid ∧ rvowns(rvref).tid = rvowns0(rvref).tid ∧ rvowns(rvref).pending?, ∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref], ∀ tid. vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = 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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦ rvowns0(pretRefs0(tid)) = rvowns(pretRefs0(tid)) ∧ vrvHp[pretRefs0(tid)] = vrvHp0[pretRefs0(tid)]
Used terms: pretRefs0(tid)
| qrl + rl = rl0 + qrl0, prvHp0[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), 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), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + 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), pretRefs0(tid) ∈ vrvHp → rvowns(pretRefs0(tid)) = rvowns0(pretRefs0(tid)) ∨ tid ≠ rvowns(pretRefs0(tid)).tid ∧ rvowns(pretRefs0(tid)).tid = rvowns0(pretRefs0(tid)).tid ∧ rvowns(pretRefs0(tid)).pending?, ∀ rvref. rvref ∈ vrvHp → rvowns(rvref) = rvowns0(rvref) ∨ tid ≠ rvowns(rvref).tid ∧ rvowns(rvref).tid = rvowns0(rvref).tid ∧ rvowns(rvref).pending?, ∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref], ∀ tid. vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = 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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦ rvowns0(pretRefs0(tid)) = rvowns(pretRefs0(tid)) ∧ vrvHp[pretRefs0(tid)] = vrvHp0[pretRefs0(tid)] |
qrl + rl = rl0 + qrl0, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], prvHp0[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), 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), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + 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), ∀ tid. vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid, ∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref], ∀ rvref. rvref ∈ vrvHp → rvowns(rvref) = rvowns0(rvref) ∨ tid ≠ rvowns(rvref).tid ∧ rvowns(rvref).tid = rvowns0(rvref).tid ∧ rvowns(rvref).pending?, phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, 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), rvowns(pretRefs0(tid)) = rvowns0(pretRefs0(tid)) ∨ tid ≠ rvowns(pretRefs0(tid)).tid ∧ rvowns(pretRefs0(tid)).tid = rvowns0(pretRefs0(tid)).tid ∧ rvowns(pretRefs0(tid)).pending? ⊦ rvowns0(pretRefs0(tid)) = rvowns(pretRefs0(tid)) ∧ vrvHp[pretRefs0(tid)] = vrvHp0[pretRefs0(tid)]
| qrl + rl = rl0 + qrl0, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], prvHp0[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), 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), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + 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), ∀ tid. vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid, ∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref], ∀ rvref. rvref ∈ vrvHp → rvowns(rvref) = rvowns0(rvref) ∨ tid ≠ rvowns(rvref).tid ∧ rvowns(rvref).tid = rvowns0(rvref).tid ∧ rvowns(rvref).pending?, phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, 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), rvowns(pretRefs0(tid)) = rvowns0(pretRefs0(tid)) ∨ tid ≠ rvowns(pretRefs0(tid)).tid ∧ rvowns(pretRefs0(tid)).tid = rvowns0(pretRefs0(tid)).tid ∧ rvowns(pretRefs0(tid)).pending? ⊦ rvowns0(pretRefs0(tid)) = rvowns(pretRefs0(tid)) ∧ vrvHp[pretRefs0(tid)] = vrvHp0[pretRefs0(tid)] |
qrl + rl = rl0 + qrl0, prvHp0[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), 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), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + 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), vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid, ∀ rvref. rvref ∈ vrvHp → rvowns(rvref) = rvowns0(rvref) ∨ tid ≠ rvowns(rvref).tid ∧ rvowns(rvref).tid = rvowns0(rvref).tid ∧ rvowns(rvref).pending?, ∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref], ∀ tid. vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid, rvowns(pretRefs0(tid)) = rvowns0(pretRefs0(tid)) ∨ tid ≠ rvowns(pretRefs0(tid)).tid ∧ rvowns(pretRefs0(tid)).tid = rvowns0(pretRefs0(tid)).tid ∧ rvowns(pretRefs0(tid)).pending?, (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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦ rvowns0(pretRefs0(tid)) = rvowns(pretRefs0(tid)) ∧ vrvHp[pretRefs0(tid)] = vrvHp0[pretRefs0(tid)]
Used terms: tid
| qrl + rl = rl0 + qrl0, prvHp0[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), 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), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + 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), vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid, ∀ rvref. rvref ∈ vrvHp → rvowns(rvref) = rvowns0(rvref) ∨ tid ≠ rvowns(rvref).tid ∧ rvowns(rvref).tid = rvowns0(rvref).tid ∧ rvowns(rvref).pending?, ∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref], ∀ tid. vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid, rvowns(pretRefs0(tid)) = rvowns0(pretRefs0(tid)) ∨ tid ≠ rvowns(pretRefs0(tid)).tid ∧ rvowns(pretRefs0(tid)).tid = rvowns0(pretRefs0(tid)).tid ∧ rvowns(pretRefs0(tid)).pending?, (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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦ rvowns0(pretRefs0(tid)) = rvowns(pretRefs0(tid)) ∧ vrvHp[pretRefs0(tid)] = vrvHp0[pretRefs0(tid)] |
qrl + rl = rl0 + qrl0, rvowns0(pretRefs0(tid)).tid = tid, prvHp0[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = rvowns0(pretRefs0(tid)), rvowns0(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], vrvHp[pretRefs0(tid)] ≠ vrvHp0[pretRefs0(tid)], orl ≠ [], pretRefs0(tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), 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), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), 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), ∀ rvref. rvref ∈ vrvHp → rvowns(rvref) = rvowns0(rvref) ∨ tid ≠ rvowns(rvref).tid ∧ rvowns(rvref).tid = rvowns0(rvref).tid ∧ rvowns(rvref).pending?, ∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref], ∀ tid. vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = 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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦
| qrl + rl = rl0 + qrl0, rvowns0(pretRefs0(tid)).tid = tid, prvHp0[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = rvowns0(pretRefs0(tid)), rvowns0(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], vrvHp[pretRefs0(tid)] ≠ vrvHp0[pretRefs0(tid)], orl ≠ [], pretRefs0(tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), 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), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), 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), ∀ rvref. rvref ∈ vrvHp → rvowns(rvref) = rvowns0(rvref) ∨ tid ≠ rvowns(rvref).tid ∧ rvowns(rvref).tid = rvowns0(rvref).tid ∧ rvowns(rvref).pending?, ∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref], ∀ tid. vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = 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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦ |
⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ↔ vrvHp[vretRefs(tid)] = vrvHp0[vretRefs0(tid)] ∨ ¬ rvowns(vretRefs(tid)).pending? ∧ vrvHp0[vretRefs0(tid)] = Val(rvowns(vretRefs(tid)).val)
qrl + rl = rl0 + qrl0, rvowns0(pretRefs0(tid)).tid = tid, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], prvHp0[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = rvowns0(pretRefs0(tid)), rvowns0(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], vrvHp[pretRefs0(tid)] ≠ vrvHp0[pretRefs0(tid)], orl ≠ [], pretRefs0(tid) ≠ null, 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(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), 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), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), ∀ tid. vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid, ∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref], ∀ rvref. rvref ∈ vrvHp → rvowns(rvref) = rvowns0(rvref) ∨ tid ≠ rvowns(rvref).tid ∧ rvowns(rvref).tid = rvowns0(rvref).tid ∧ rvowns(rvref).pending?, phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, 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), vrvHp[vretRefs(tid)] = vrvHp0[vretRefs0(tid)] ∨ ¬ rvowns(vretRefs(tid)).pending? ∧ vrvHp0[vretRefs0(tid)] = Val(rvowns(vretRefs(tid)).val) ⊦
Used terms: vrvHp, vretRefs, tid, rvowns, vrvHp0, vretRefs0
| ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ↔ vrvHp[vretRefs(tid)] = vrvHp0[vretRefs0(tid)] ∨ ¬ rvowns(vretRefs(tid)).pending? ∧ vrvHp0[vretRefs0(tid)] = Val(rvowns(vretRefs(tid)).val) |
| qrl + rl = rl0 + qrl0, rvowns0(pretRefs0(tid)).tid = tid, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], prvHp0[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = rvowns0(pretRefs0(tid)), rvowns0(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], vrvHp[pretRefs0(tid)] ≠ vrvHp0[pretRefs0(tid)], orl ≠ [], pretRefs0(tid) ≠ null, 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(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), 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), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), ∀ tid. vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid, ∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref], ∀ rvref. rvref ∈ vrvHp → rvowns(rvref) = rvowns0(rvref) ∨ tid ≠ rvowns(rvref).tid ∧ rvowns(rvref).tid = rvowns0(rvref).tid ∧ rvowns(rvref).pending?, phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, 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), vrvHp[vretRefs(tid)] = vrvHp0[vretRefs0(tid)] ∨ ¬ rvowns(vretRefs(tid)).pending? ∧ vrvHp0[vretRefs0(tid)] = Val(rvowns(vretRefs(tid)).val) ⊦ |
qrl + rl = rl0 + qrl0, rvowns0(pretRefs0(tid)).tid = tid, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], prvHp0[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], vrvHp0[pretRefs0(tid)] = Val(rvowns0(pretRefs0(tid)).val), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = rvowns0(pretRefs0(tid)), rvowns0(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], vrvHp[pretRefs0(tid)] ≠ Val(rvowns0(pretRefs0(tid)).val), orl ≠ [], pretRefs0(tid) ≠ null, 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(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), 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), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ rvowns0(pretRefs0(tid)).pending?, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + 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), ∀ tid. vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid, ∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref], ∀ rvref. rvref ∈ vrvHp → rvowns(rvref) = rvowns0(rvref) ∨ tid ≠ rvowns(rvref).tid ∧ rvowns(rvref).tid = rvowns0(rvref).tid ∧ rvowns(rvref).pending?, phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, 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) ⊦
| qrl + rl = rl0 + qrl0, rvowns0(pretRefs0(tid)).tid = tid, prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], prvHp0[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], vrvHp0[pretRefs0(tid)] = Val(rvowns0(pretRefs0(tid)).val), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = rvowns0(pretRefs0(tid)), rvowns0(pretRefs0(tid)) = (vrvHp[pretRefs0(tid)] = Empty ⊃ Pending(tid);Claimed(tid, vrvHp[pretRefs0(tid)].val)), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], vrvHp[pretRefs0(tid)] ≠ Val(rvowns0(pretRefs0(tid)).val), orl ≠ [], pretRefs0(tid) ≠ null, 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(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), 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), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ rvowns0(pretRefs0(tid)).pending?, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + 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), ∀ tid. vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid, ∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref], ∀ rvref. rvref ∈ vrvHp → rvowns(rvref) = rvowns0(rvref) ∨ tid ≠ rvowns(rvref).tid ∧ rvowns(rvref).tid = rvowns0(rvref).tid ∧ rvowns(rvref).pending?, phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, 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) ⊦ |
qrl + rl = rl0 + qrl0, rvowns0(pretRefs0(tid)).tid = tid, vrvHp0[pretRefs0(tid)] = Val(rvowns0(pretRefs0(tid)).val), prvHp0[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = rvowns0(pretRefs0(tid)), rvowns0(pretRefs0(tid)) = Claimed(tid, vrvHp[pretRefs0(tid)].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], vrvHp[pretRefs0(tid)] ≠ Empty, vrvHp[pretRefs0(tid)] ≠ Val(rvowns0(pretRefs0(tid)).val), orl ≠ [], pretRefs0(tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), 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), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ rvowns0(pretRefs0(tid)).pending?, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + 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), ∀ rvref. rvref ∈ vrvHp → rvowns(rvref) = rvowns0(rvref) ∨ tid ≠ rvowns(rvref).tid ∧ rvowns(rvref).tid = rvowns0(rvref).tid ∧ rvowns(rvref).pending?, ∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref], ∀ tid. vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = 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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦
Used simplifier rules: ⊦ Pending(tid).tid = tid; (s) ⊦ Empty ≠ Val(val); (s) ⊦ Pending(tid).pending?; (s)
| qrl + rl = rl0 + qrl0, rvowns0(pretRefs0(tid)).tid = tid, vrvHp0[pretRefs0(tid)] = Val(rvowns0(pretRefs0(tid)).val), prvHp0[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = rvowns0(pretRefs0(tid)), rvowns0(pretRefs0(tid)) = Claimed(tid, vrvHp[pretRefs0(tid)].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], vrvHp[pretRefs0(tid)] ≠ Empty, vrvHp[pretRefs0(tid)] ≠ Val(rvowns0(pretRefs0(tid)).val), orl ≠ [], pretRefs0(tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), 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), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ rvowns0(pretRefs0(tid)).pending?, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + 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), ∀ rvref. rvref ∈ vrvHp → rvowns(rvref) = rvowns0(rvref) ∨ tid ≠ rvowns(rvref).tid ∧ rvowns(rvref).tid = rvowns0(rvref).tid ∧ rvowns(rvref).pending?, ∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref], ∀ tid. vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = 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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦ |
qrl + rl = rl0 + qrl0, prvHp0[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], vrvHp0[pretRefs0(tid)] = Val(vrvHp[pretRefs0(tid)].val), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vrvHp[pretRefs0(tid)].val), rvowns0(pretRefs0(tid)) = Claimed(tid, vrvHp[pretRefs0(tid)].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], vrvHp[pretRefs0(tid)] ≠ Empty, vrvHp[pretRefs0(tid)] ≠ Val(vrvHp[pretRefs0(tid)].val), orl ≠ [], pretRefs0(tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), 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), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), 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), ∀ rvref. rvref ∈ vrvHp → rvowns(rvref) = rvowns0(rvref) ∨ tid ≠ rvowns(rvref).tid ∧ rvowns(rvref).tid = rvowns0(rvref).tid ∧ rvowns(rvref).pending?, ∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref], ∀ tid. vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = 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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦
Used simplifier rules: ⊦ ¬ Claimed(tid, val).pending?; (s) ⊦ Claimed(tid, val).val = val; (s) ⊦ Claimed(tid, val).tid = tid; (s)
| qrl + rl = rl0 + qrl0, prvHp0[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], prvHp[pretRefs0(tid)] = vrvHp[pretRefs0(tid)], vrvHp0[pretRefs0(tid)] = Val(vrvHp[pretRefs0(tid)].val), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vrvHp[pretRefs0(tid)].val), rvowns0(pretRefs0(tid)) = Claimed(tid, vrvHp[pretRefs0(tid)].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], vrvHp[pretRefs0(tid)] ≠ Empty, vrvHp[pretRefs0(tid)] ≠ Val(vrvHp[pretRefs0(tid)].val), orl ≠ [], pretRefs0(tid) ≠ null, 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(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), 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), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), 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), ∀ rvref. rvref ∈ vrvHp → rvowns(rvref) = rvowns0(rvref) ∨ tid ≠ rvowns(rvref).tid ∧ rvowns(rvref).tid = rvowns0(rvref).tid ∧ rvowns(rvref).pending?, ∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref], ∀ tid. vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = 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, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦ |
Used simplifier rules: ⊦ optval ≠ Empty → (val = optval.val ↔ optval = Val(val)); (elim) Used terms: vrvHp[pretRefs0(tid)], val
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.