[Imprint][Data Privacy Statement][E-Mail]



View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 1 from proof stable-D27 (conclusion) (back to tree)

⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].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.first ∈ gs0.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs0.ps[ls.first].next ∧ gs0.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs0.vhead = ls.first → gs0.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ (¬ ls.success ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from ls.lst) ∧ ls.lst ∈ gs0.orl + gs0.qrl from ls.first ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs0.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs0.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ noowns(ls.tid, gs0.owns)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof stable-D27 (previous step) (back to tree)

gs.vs[ls.nxt].deqID = Some(ls.othertid), ls.nxt = gs.ps[ls.first].next, ls.optval = Val(gs.vs[ls.nxt].val), gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid), dom gs.vrvHp = dom gs.prvHp, dom gs0.vrvHp = dom gs0.prvHp, ls.addr ≠ null, ls.first ≠ ls.lst, ls.nxt ≠ null, gs0.orl ≠ [], gs.orl ≠ [], ls.rvref ≠ 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, ls.first ∈ gs.orl, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, ls.lst ∈ gs.orl + gs.qrl from ls.first, ls.rvref ∈ gs.vrvHp, ls.addr ∈ 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, ¬ ls.success, ¬ 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), gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.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.first ∈ gs0.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs0.ps[ls.first].next ∧ gs0.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs0.vhead = ls.first → gs0.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ (¬ ls.success ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from ls.lst) ∧ ls.lst ∈ gs0.orl + gs0.qrl from ls.first ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs0.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs0.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ noowns(ls.tid, gs0.owns)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ Val(val) = Val(val0) ↔ val = val0; (s) ⊦ rvownsrely(tid, rvowns, rvowns0, vrvHp) ∧ rvowns(addr) = Pending(tid) ∧ addr ∈ vrvHp ∧ addr ≠ null → (rvowns0(addr) = Pending(tid) ↔ true); (ss) ⊦ Val(val).val = val; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ 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) ⊦ dom vrvHp ⊆ dom vrvHp0 ∧ rvref ∈ vrvHp → rvref ∈ vrvHp0; (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s)

Proof step 3 from proof stable-D27 (previous step) (back to tree)

gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, gs.orl + rl0 = gs0.orl, gs.vs[ls.nxt].deqID = Some(ls.othertid), ls.nxt = gs.ps[ls.first].next, ls.optval = Val(gs.vs[ls.nxt].val), gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(ls.rvref) = Pending(ls.tid), ls.rvref = gs0.vretRefs(ls.tid), ls.rvref = gs0.pretRefs(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, dom gs0.vrvHp = dom gs0.prvHp, ls.addr ≠ null, ls.first ≠ ls.lst, ls.nxt ≠ null, gs.orl ≠ [], gs0.orl ≠ [], ls.rvref ≠ 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, ls.first ∈ gs.ps, gs.phead ∈ gs.vs, ls.first ∈ gs.vs, gs0.phead ∈ gs0.ps, gs0.phead ∈ gs0.vs, gs.phead ∈ gs.orl, ls.first ∈ gs.orl, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, ls.rvref ∈ gs.vrvHp, ls.addr ∈ 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, ¬ ls.success, ¬ dups(gs0.qrl), ¬ dups(gs0.orl), ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), ¬ dups(gs0.orl + gs0.qrl), gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, gs.vs[ls.nxt].val), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), 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, ls.lst ∈ gs.orl from ls.first ∨ ls.lst ∈ gs.qrl, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), 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.first ∈ gs0.orl ∧ ls.nxt = gs0.ps[ls.first].next ∧ gs0.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs0.vhead = ls.first → gs0.rvowns(ls.addr) = Claimed(ls.othertid, gs.vs[ls.nxt].val)) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from ls.lst ∧ (ls.lst ∈ gs0.orl from ls.first ∨ ls.lst ∈ gs0.qrl) ∧ gs.vs[ls.nxt].val = gs0.vs[ls.nxt].val ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkgs, seq:⊦ ( ( ( ( ( ( ( ( ( ( (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), subst:[qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs] → [qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs]

Additional information

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

Proof step 4 from proof stable-D27 (previous step) (back to tree)

orl + rl0 = gs0.orl, orl + qrl + rl = gs0.orl + gs0.qrl, vs[ls.nxt].deqID = Some(ls.othertid), ls.nxt = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), ls.rvref = gs0.pretRefs(ls.tid), ls.rvref = gs0.vretRefs(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) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.addr ≠ null, ls.first ≠ ls.lst, ls.nxt ≠ null, gs0.orl ≠ [], ls.rvref ≠ 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, ls.addr ∈ vrvHp, ls.rvref ∈ vrvHp, vtail ∈ orl + qrl from ls.lst, ls.first ∈ orl, phead ∈ orl, gs0.phead ∈ gs0.vs, gs0.phead ∈ gs0.ps, ls.first ∈ vs, phead ∈ vs, ls.first ∈ ps, phead ∈ ps, dom prvHp ⊆ dom gs0.prvHp, ¬ ls.success, ¬ 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), vhead = ls.first → rvowns(ls.addr) = Claimed(ls.othertid, vs[ls.nxt].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), ls.lst ∈ orl from ls.first ∨ ls.lst ∈ qrl, 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.first ∈ gs0.orl ∧ ls.nxt = gs0.ps[ls.first].next ∧ gs0.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs0.vhead = ls.first → gs0.rvowns(ls.addr) = Claimed(ls.othertid, vs[ls.nxt].val)) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from ls.lst ∧ (ls.lst ∈ gs0.orl from ls.first ∨ ls.lst ∈ gs0.qrl) ∧ vs[ls.nxt].val = gs0.vs[ls.nxt].val ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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) ⊦ a ∈ x → a ∈ x + y; (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

Proof step 5 from proof stable-D27 (previous step) (back to tree)

orl + rl0 = gs0.orl, qrl + rl = rl0 + gs0.qrl, vs[ls.nxt].deqID = Some(ls.othertid), ls.nxt = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), ls.rvref = gs0.pretRefs(ls.tid), ls.rvref = gs0.vretRefs(ls.tid), dom gs0.vrvHp = dom gs0.prvHp, dom vrvHp = dom prvHp, pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, orl + rl0 ≠ [], ls.addr ≠ null, ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ 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, ls.addr ∈ vrvHp, ls.rvref ∈ vrvHp, vtail ∈ orl + qrl from ls.lst, ls.first ∈ orl, phead ∈ orl, gs0.phead ∈ gs0.vs, gs0.phead ∈ gs0.ps, ls.first ∈ gs0.ps, phead ∈ gs0.ps, ls.first ∈ gs0.vs, phead ∈ gs0.vs, ls.first ∈ ps, phead ∈ ps, ls.first ∈ vs, phead ∈ vs, dom prvHp ⊆ dom gs0.prvHp, ¬ ls.success, ¬ 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), vhead = ls.first → rvowns(ls.addr) = Claimed(ls.othertid, vs[ls.nxt].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), ls.lst ∈ orl from ls.first ∨ ls.lst ∈ qrl, 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.nxt = gs0.ps[ls.first].next ∧ gs0.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs0.vhead = ls.first → gs0.rvowns(ls.addr) = Claimed(ls.othertid, vs[ls.nxt].val)) ∧ gs0.vtail ∈ (orl + rl0) + gs0.qrl from ls.lst ∧ (ls.lst ∈ orl from ls.first ∨ ls.lst ∈ rl0 ∨ ls.lst ∈ gs0.qrl) ∧ vs[ls.nxt].val = gs0.vs[ls.nxt].val ∧ noid(ls.tid, (orl + rl0) + gs0.qrl, gs0.vhead, gs0.vs)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkgs, seq:⊦ ( ( ( ( ( ( ( ( ( ( (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), subst:[qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs] → [qrl0, ps0, phead0, vrvHp0, vretRefs0, vhead0, vtail0, gs0, owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0]

Additional information

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

Proof step 6 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl + rl0 = orl0, vs[ls.nxt].deqID = Some(ls.othertid), ls.nxt = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), ls.rvref = vretRefs0(ls.tid), ls.rvref = 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) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, orl + rl0 ≠ [], ls.addr ≠ null, ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, ls.tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(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, ls.first ∈ vs, phead ∈ ps, ls.first ∈ ps, phead ∈ vs0, ls.first ∈ vs0, phead ∈ ps0, ls.first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, ls.first ∈ orl, vtail ∈ orl + qrl from ls.lst, ls.rvref ∈ vrvHp, ls.addr ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ ls.success, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(qrl + rl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), vhead = ls.first → rvowns(ls.addr) = Claimed(ls.othertid, vs[ls.nxt].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), 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, ls.lst ∈ orl from ls.first ∨ ls.lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (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.nxt = ps0[ls.first].next ∧ vs0[ls.nxt].deqID = Some(ls.othertid) ∧ (vhead0 = ls.first → rvowns0(ls.addr) = Claimed(ls.othertid, vs[ls.nxt].val)) ∧ vtail0 ∈ (orl + rl0) + qrl0 from ls.lst ∧ (ls.lst ∈ orl from ls.first ∨ ls.lst ∈ rl0 ∨ ls.lst ∈ qrl0) ∧ vs[ls.nxt].val = vs0[ls.nxt].val ∧ noid(ls.tid, (orl + rl0) + qrl0, vhead0, vs0)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 7 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ls.nxt].deqID = Some(ls.othertid), ls.nxt = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), ls.rvref = pretRefs0(ls.tid), ls.rvref = vretRefs0(ls.tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, orl + rl0 ≠ [], ls.addr ≠ null, ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ null, orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, ls.tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(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, ls.addr ∈ vrvHp, ls.rvref ∈ vrvHp, vtail ∈ orl + qrl from ls.lst, ls.first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, ls.first ∈ ps, phead ∈ ps, ls.first ∈ vs, phead ∈ vs, ls.first ∈ vs0, phead ∈ vs0, ls.first ∈ ps0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ ls.success, ¬ 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), vhead = ls.first → rvowns(ls.addr) = Claimed(ls.othertid, vs[ls.nxt].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), ls.lst ∈ orl from ls.first ∨ ls.lst ∈ qrl, 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.nxt = ps0[ls.first].next ∧ vs0[ls.nxt].deqID = Some(ls.othertid) ∧ (vhead0 = ls.first → rvowns0(ls.addr) = Claimed(ls.othertid, vs[ls.nxt].val)) ∧ vtail0 ∈ (orl + rl0) + qrl0 from ls.lst ∧ (ls.lst ∈ orl from ls.first ∨ ls.lst ∈ rl0 ∨ ls.lst ∈ qrl0) ∧ vs[ls.nxt].val = vs0[ls.nxt].val ∧ noid(ls.tid, (orl + rl0) + qrl0, vhead0, vs0)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkls, seq:⊦ ( ( ( ( ( ( ( ( ( ( (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), subst:[value, nxt, optval0, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval] → [value, nxt, optval0, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval]

Additional information

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

Proof step 8 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[nxt].deqID = Some(othertid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), nxt = ps[first].next, optval = Val(vs[nxt].val), pretRefs(tid) = rvref, rvowns(rvref) = Pending(tid), rvref = vretRefs0(tid), rvref = pretRefs0(tid), ¬ success, vretRefs(tid) = rvref, orl + rl0 ≠ [], addr ≠ null, first ≠ lst, nxt ≠ null, orl ≠ [], rvref ≠ 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, first ∈ ps0, phead ∈ vs0, first ∈ vs0, phead ∈ vs, first ∈ vs, phead ∈ ps, first ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, rvref ∈ vrvHp, addr ∈ 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[nxt].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), 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, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ nxt = ps0[first].next ∧ vs0[nxt].deqID = Some(othertid) ∧ (vhead0 = first → rvowns0(addr) = Claimed(othertid, vs[nxt].val)) ∧ vtail0 ∈ (orl + rl0) + qrl0 from lst ∧ (lst ∈ orl from first ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ vs[nxt].val = vs0[nxt].val ∧ noid(tid, (orl + rl0) + qrl0, vhead0, vs0)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ

Proof step 9 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, 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, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].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), lst ∈ orl from first ∨ lst ∈ qrl, 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 ⊦ ps[first].next = ps0[first].next ∧ vs0[ps[first].next].deqID = Some(othertid) ∧ (vhead0 = first → rvowns0(addr) = Claimed(othertid, vs[ps[first].next].val)) ∧ vtail0 ∈ (orl + rl0) + qrl0 from lst ∧ (lst ∈ orl from first ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ vs[ps[first].next].val = vs0[ps[first].next].val ∧ noid(tid, (orl + rl0) + qrl0, vhead0, vs0)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 10 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ ps0[first].next, ps[first].next ≠ null, addr ≠ null, first ≠ lst, 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), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:equalrl-def, seq:⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val)), subst:[ps, rl, ps0, vs0, vs] → [ps, orl + qrl, ps0, vs0, vs], <all paths>

Additional information

Used terms: ps, orl + qrl, ps0, vs0, vs

Proof step 11 from proof stable-D27 (previous step) (back to tree)

⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ (vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val))

A spec-lemma

Proof step 12 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ ps0[first].next, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), 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, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ∀ r. r ∈ orl + qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].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), lst ∈ orl from first ∨ lst ∈ qrl, 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 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)

Proof step 13 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ ps0[first].next, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), 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), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].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, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 76 terms: first

Additional information

Used terms: first

Proof step 14 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], vs0[ps[first].next].deqID ≠ Some(othertid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, 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), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:equalrl-def, seq:⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val)), subst:[ps, rl, ps0, vs0, vs] → [ps, orl + qrl, ps0, vs0, vs], <all paths>

Additional information

Used terms: ps, orl + qrl, ps0, vs0, vs

Proof step 15 from proof stable-D27 (previous step) (back to tree)

⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ (vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val))

A spec-lemma

Proof step 16 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], vs0[ps[first].next].deqID ≠ Some(othertid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), 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, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ∀ r. r ∈ orl + qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].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), lst ∈ orl from first ∨ lst ∈ qrl, 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 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)

Proof step 17 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], vs0[ps[first].next].deqID ≠ Some(othertid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), 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), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].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, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 76 terms: ps[first].next abort: F discard: F computed: T

Additional information

Used terms: ps[first].next

Proof step 18 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], vs0[ps[first].next].deqID ≠ Some(othertid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), 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, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ∈ orl ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].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), lst ∈ orl from first ∨ lst ∈ qrl, 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 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ None ≠ Some(tid); (s)

Proof step 19 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], vs0[ps[first].next].deqID ≠ Some(othertid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), 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, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, 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), ¬ ps[first].next ∈ orl, ¬ ps[first].next ∈ qrl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].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), lst ∈ orl from first ∨ lst ∈ qrl, 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 ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-in-postfix1, seq:⊦ listp(rl + rl0, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + rl0, vs, ps, owns)), subst:[ps, rl, owns, r, rl0, vs] → [ps, orl, owns, first, qrl, vs]

Additional information

Used terms: ps, orl, owns, first, qrl, vs

Proof step 20 from proof stable-D27 (previous step) (back to tree)

⊦ listp(rl + rl0, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + rl0, vs, ps, owns))

A spec-lemma

Proof step 21 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], vs0[ps[first].next].deqID ≠ Some(othertid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), 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), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ 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), ¬ ps[first].next ∈ orl, ¬ ps[first].next ∈ qrl, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), listp(orl + qrl, vs, ps, owns) ∧ first ∈ orl → (∃ rl1, rl2. orl = rl1 + first ' + rl2 ∧ listp(first ' + rl2 + qrl, vs, ps, owns)), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].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, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' + y ≠ []; (s) ⊦ x = y + a ' + z → a ∈ x; (s)

Proof step 22 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs0[ps[first].next].deqID ≠ Some(othertid), ps[first].next ≠ first, ps[first].next ≠ null, addr ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ ps[first].next ∈ rl2, ¬ ps[first].next ∈ rl1, ¬ ps[first].next ∈ qrl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ∀ r. r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl2

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 23 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl2 = [], rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs0[ps[first].next].deqID ≠ Some(othertid), ps[first].next ≠ first, ps[first].next ≠ null, addr ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + 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), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ ps[first].next ∈ rl2, ¬ ps[first].next ∈ rl1, ¬ ps[first].next ∈ qrl, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), ∀ r. r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

Proof step 24 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs0[ps[first].next].deqID ≠ Some(othertid), ps[first].next ≠ first, ps[first].next ≠ null, addr ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + rl0 + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + qrl, vs, ps, owns), listp(first ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), markedp(rl1, vs0), markedp(rl0, vs0), markedp(rl1, ps0), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, rl1 + first ' + qrl, vhead, vs), noidRely(tid, rl1 + first ' + qrl, vs, rl1 + first ' + rl0 + qrl0, vs0), nonullRetRefs(rl1 + first ' + rl0 + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ rl1 + first ' + rl0 + qrl0 from vhead, vtail0 ∈ rl1 + first ' + rl0 + qrl0 from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, lst ∈ qrl, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl1 + qrl), ¬ dups(rl1 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ first ∈ rl1, ¬ ps[first].next ∈ rl1, ¬ ps[first].next ∈ qrl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ∀ r. r ∈ rl1 ∨ r = first ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ (vs[qrl.last].next ≠ null → vs0[qrl.last].next = vs[qrl.last].next ∧ vs0[vs0[qrl.last].next].val = vs[vs0[qrl.last].next].val), (first ' + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl0).last ∧ unmarkedp(qrl0, vs0), first = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 ≠ [] ∧ rl1.last = vhead ∧ phead ≠ first ∧ unmarkedp(qrl, vs), vtail0 = (first ' + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0, phead ∈ rl1 ∨ phead = first, phead0 ∈ rl1 + first ' from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-data[reflist], name:elim-list-c, seq:x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y, subst:[x, a, y] → [qrl, phead1, rl2]

Additional information

Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, phead1, y

Proof step 25 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vhead0 = first, vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, rvowns0(addr) ≠ Claimed(othertid, vs[ps[first].next].val), 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), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ rvownsrely(tid, rvowns, rvowns0, vrvHp) ∧ rvowns(addr) = Claimed(othertid, v) ∧ addr ∈ vrvHp ∧ addr ≠ null → (rvowns0(addr) = Claimed(othertid, v) ↔ true); (ss)

Proof step 26 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[ps[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[ps[first].next].val), vhead ≠ first, 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, first, 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), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, first ∈ (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[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].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, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = first ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:equalrl-def, seq:⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val)), subst:[ps, rl, ps0, vs0, vs] → [ps, orl + qrl, ps0, vs0, vs], <all paths>

Additional information

Used terms: ps, orl + qrl, ps0, vs0, vs

Proof step 27 from proof stable-D27 (previous step) (back to tree)

⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ (vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val))

A spec-lemma

Proof step 28 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[ps[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[ps[first].next].val), vhead ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), 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, first, 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), first ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, 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[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ orl + qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val), (orl + rl0).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = first ∧ 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), lst ∈ orl from first ∨ lst ∈ qrl, 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 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)

Proof step 29 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[ps[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[ps[first].next].val), vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), 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, first, 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), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, first ∈ (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[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].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, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = first ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-in-postfix1, seq:⊦ listp(rl + rl0, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + rl0, vs, ps, owns)), subst:[ps, rl, owns, r, rl0, vs] → [ps, orl, owns, first, qrl, vs]

Additional information

Used terms: ps, orl, owns, first, qrl, vs

Proof step 30 from proof stable-D27 (previous step) (back to tree)

⊦ listp(rl + rl0, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + rl0, vs, ps, owns))

A spec-lemma

Proof step 31 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[ps[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[ps[first].next].val), vhead ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), 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, first, 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), first ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, 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[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp(orl + qrl, vs, ps, owns) ∧ first ∈ orl → (∃ rl1, rl2. orl = rl1 + first ' + rl2 ∧ listp(first ' + rl2 + qrl, vs, ps, owns)), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val), (orl + rl0).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = first ∧ 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), lst ∈ orl from first ∨ lst ∈ qrl, 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 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' + y ≠ []; (s) ⊦ x = y + a ' + z → a ∈ x; (s)

Proof step 32 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[ps[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[ps[first].next].val), vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, first, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + 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), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, first ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), ∀ r. r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), (first ' + rl2 + rl0).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = first ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 92 terms: first abort: F discard: F computed: T

Additional information

Used terms: first

Proof step 33 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[ps[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[ps[first].next].val), vhead ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl0, ps0), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl0, vs0), markedp(rl1, ps0), markedp(rl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, first, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), first ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), first ∈ rl1 ∨ first = first ∨ first ∈ rl2 ∨ first ∈ qrl → vs[first].val = vs0[first].val ∧ ps[first].val = ps0[first].val ∧ (vs[first].deqID ≠ None → vs0[first].deqID = vs[first].deqID) ∧ (ps[first].deqID ≠ None → ps0[first].deqID = ps[first].deqID) ∧ (vs[first].next ≠ null → vs0[first].next = vs[first].next) ∧ (ps[first].next ≠ null → ps0[first].next = ps[first].next) ∧ ( vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2 + rl0).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = first ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(opttid) → opttid ≠ None; (as)

Proof step 34 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[ps[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[ps[first].next].val), vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, first, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + 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), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, first ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), (first ' + rl2 + rl0).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = first ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:noidRely-def, seq:⊦ noidRely(tid, rl, vs, rl0, vs0) ↔ (∀ r. noid(tid, rl, r, vs) → noid(tid, rl0, r, vs0)), subst:[rl, tid, vs0, rl0, vs] → [(rl1 + first ' + rl2) + qrl, tid, vs0, ((rl1 + first ' + rl2) + rl0) + qrl0, vs], <all paths>

Additional information

Used terms: (rl1 + first ' + rl2) + qrl, tid, vs0, ((rl1 + first ' + rl2) + rl0) + qrl0, vs

Proof step 35 from proof stable-D27 (previous step) (back to tree)

⊦ noidRely(tid, rl, vs, rl0, vs0) ↔ (∀ r. noid(tid, rl, r, vs) → noid(tid, rl0, r, vs0))

A spec-lemma

Proof step 36 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(othertid), ps0[first].next = ps[first].next, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[ps[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[ps[first].next].val), vhead ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl0, ps0), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl0, vs0), markedp(rl1, ps0), markedp(rl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, first, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), first ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. noid(tid, (rl1 + first ' + rl2) + qrl, r, vs) → noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, r, vs0), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2 + rl0).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = first ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0 ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 97 terms: vhead abort: F discard: T computed: T

Additional information

Used terms: vhead

Proof step 37 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[ps[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[ps[first].next].val), vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, first, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + 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), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, first ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs) → noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, vhead, vs0), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), (first ' + rl2 + rl0).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = first ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 38 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps0[first].deqID = ps[first].deqID, vs0[first].deqID = vs[first].deqID, vs[ps[first].next].deqID = Some(othertid), ps0[first].next = ps[first].next, ps[first].val = ps0[first].val, vs[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[ps[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[ps[first].next].val), vhead ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl0, ps0), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl0, vs0), markedp(rl1, ps0), markedp(rl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, first, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, vhead, vs0), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), first ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, vs[first].next ≠ null → vs0[first].next = vs[first].next, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2 + rl0).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = first ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0 ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl2

Additional information

Used simplifier rules: reflist freely generated by [], +;;

Proof step 39 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl2 = [], rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[ps[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[ps[first].next].val), vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, first, vs0), noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, vhead, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + 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), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, first ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), (first ' + rl2 + rl0).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = first ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

Proof step 40 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl1.last ≠ first, ps[first].next ≠ null, addr ≠ null, first ≠ lst, phead ≠ first, pretRefs0(tid) ≠ null, rl1 ≠ [], rvowns(addr) ≠ Claimed(othertid, vs[ps[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[ps[first].next].val), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + qrl, vs, ps, owns), listp(rl1 + first ' + rl0 + qrl0, vs0, ps0, owns0), listp(first ' + qrl, vs, ps, owns), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl1, ps), markedp(rl1, vs), markedp(rl0, ps0), nextnottid(tid, rl1.last, vs), nextnottidRely(tid, rl1.last, vs, first, vs0), noid(tid, rl1 + first ' + rl0 + qrl0, rl1.last, vs0), noid(tid, rl1 + first ' + qrl, rl1.last, vs), nonullRetRefs(rl1 + first ' + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + 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), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), lst ∈ ps, lst ∈ vs, phead ∈ rl1, lst ∈ qrl, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, vtail0 ∈ rl1 + first ' + rl0 + qrl0 from vtail, first ∈ rl1 + first ' + rl0 + qrl0 from rl1.last, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl0 + qrl0), ¬ dups(rl1 + qrl), ¬ dups(rl), ¬ first ∈ rl1, ¬ first ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, vs[rl1.last].next ≠ null ∧ vs[vs[rl1.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[rl1.last].next].deqID.tid)) = Claimed(vs[vs[rl1.last].next].deqID.tid, vs[vs[rl1.last].next].val), vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[qrl.last].next ≠ null → vs0[qrl.last].next = vs[qrl.last].next ∧ vs0[vs0[qrl.last].next].val = vs[vs0[qrl.last].next].val, ∀ r. r ∈ rl1 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 from phead ∨ phead0 = first ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0, vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (first ' + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (first ' + rl0).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl0).butlast).last = first ∧ phead0 ≠ (first ' + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: qrl

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a ' + x ≠ []; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ None ≠ Some(tid); (s) ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s)

Proof step 41 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = ps[first].deqID, ps0[first].next = ps[first].next, vs[first].val = vs0[first].val, ps[first].val = ps0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl2 = first0 + rl3, rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[ps[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[ps[first].next].val), vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, first, vs0), noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, vhead, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + 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), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, first ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vs[first].next ≠ null → vs0[first].next = vs[first].next, vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val, ∀ r. r ∈ rl1 ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), (first ' + rl2 + rl0).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = first ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ some?(Some(tid)); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s)

Proof step 42 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(othertid), ps[first].deqID = vs[first].deqID, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, vs0[first].val = ps0[first].val, vs[first].val = ps0[first].val, ps[first].val = ps0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(vs0[vs[first].next].deqID.tid)) = Claimed(vs0[vs[first].next].deqID.tid, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ null, addr ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[vs[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[vs[first].next].val), vhead ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[first].next ' + rl3 + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + (vs[first].next ' + rl3) + qrl, vs, ps, owns), markedp(rl0, ps0), markedp(rl1, vs), markedp(rl3, vs), markedp(rl1, ps), markedp(rl3, ps), markedp(rl1, vs0), markedp(rl3, vs0), markedp(rl0, vs0), markedp(rl1, ps0), markedp(rl3, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, first, vs0), noid(tid, rl1 + first ' + (vs[first].next ' + rl3) + qrl, vhead, vs), noid(tid, rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0, vhead, vs0), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl3) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), some?(vs0[vs[first].next].deqID), some?(ps0[vs[first].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), first ∈ rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0 from vhead, vtail0 ∈ rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0 from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + rl3) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl1 + rl3 + qrl), ¬ dups(rl1 + rl3 + rl0 + qrl0), ¬ dups(rl3), ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl3 + rl0 + qrl0), ¬ dups(rl1 + rl3), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + rl3 + rl0), ¬ dups(qrl0), ¬ dups(rl3 + qrl), ¬ dups(qrl), ¬ dups(rl3 + rl0), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl3, ¬ vs[first].next ∈ rl0, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ first ∈ rl3, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(vs[first].next ' + rl3 + qrl).last].next ≠ null → vs0[(vs[first].next ' + rl3 + qrl).last].next = vs[(vs[first].next ' + rl3 + qrl).last].next ∧ vs0[vs0[(vs[first].next ' + rl3 + qrl).last].next].val = vs[vs0[(vs[first].next ' + rl3 + qrl).last].next].val, ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ rl3 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 + first ' + vs[first].next ' + rl3 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl3, (vs[first].next ' + rl3 + rl0).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs[first].next ' + rl3 + rl0).butlast).last = first ∧ phead0 ≠ (vs[first].next ' + rl3 + rl0).last ∧ unmarkedp(qrl0, vs0), (vs[first].next ' + rl3).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl3).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl3).last ∧ unmarkedp(qrl, vs), lst = vs[first].next ∨ lst ∈ rl3 ∨ lst ∈ qrl, vtail0 = (vs[first].next ' + rl3 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[first].next ' + rl3 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (vs[first].next ' + rl3 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl3 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 ∈ rl3 ∨ phead0 ∈ rl0 ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: opttid, name:elim-Some, seq: ⊦ some?(opttid) → (tid = opttid.tid ↔ opttid = Some(tid)), subst:[opttid, tid] → [vs0[vs[first].next].deqID, tid0]

Additional information

Used simplifier rules: ⊦ some?(opttid) → (tid = opttid.tid ↔ opttid = Some(tid)); (elim) Used terms: vs0[vs[first].next].deqID, tid0

Proof step 43 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(othertid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, vs0[vs[first].next].deqID = Some(tid0), ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[first].val = ps0[first].val, vs[first].val = ps0[first].val, vs0[first].val = ps0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ null, addr ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[vs[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[vs[first].next].val), vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + (vs[first].next ' + rl3) + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0, vs0, ps0, owns0), listp(vs[first].next ' + rl3 + qrl, vs, ps, owns), markedp(rl3, ps0), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl3, vs0), markedp(rl1, vs0), markedp(rl3, ps), markedp(rl1, ps), markedp(rl3, vs), markedp(rl1, vs), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, first, vs0), noid(tid, rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0, vhead, vs0), noid(tid, rl1 + first ' + (vs[first].next ' + rl3) + qrl, vhead, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl3) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl3) + 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), some?(ps0[vs[first].next].deqID), some?(vs0[vs[first].next].deqID), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + (vs[first].next ' + rl3) + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, vtail0 ∈ rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0 from vtail, first ∈ rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl1 + rl3 + qrl), ¬ dups(rl1 + rl3 + rl0 + qrl0), ¬ dups(rl3), ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl3 + rl0 + qrl0), ¬ dups(rl1 + rl3), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + rl3 + rl0), ¬ dups(qrl0), ¬ dups(rl3 + qrl), ¬ dups(qrl), ¬ dups(rl3 + rl0), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl3, ¬ vs[first].next ∈ rl0, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ first ∈ rl3, vs[(vs[first].next ' + rl3 + qrl).last].next ≠ null → vs0[(vs[first].next ' + rl3 + qrl).last].next = vs[(vs[first].next ' + rl3 + qrl).last].next ∧ vs0[vs0[(vs[first].next ' + rl3 + qrl).last].next].val = vs[vs0[(vs[first].next ' + rl3 + qrl).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), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ rl3 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 ∈ rl3 ∨ phead0 ∈ rl0, vtail = (vs[first].next ' + rl3 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl3 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vs[first].next ' + rl3 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[first].next ' + rl3 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst = vs[first].next ∨ lst ∈ rl3 ∨ lst ∈ qrl, (vs[first].next ' + rl3).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl3).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl3).last ∧ unmarkedp(qrl, vs), (vs[first].next ' + rl3 + rl0).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs[first].next ' + rl3 + rl0).butlast).last = first ∧ phead0 ≠ (vs[first].next ' + rl3 + rl0).last ∧ unmarkedp(qrl0, vs0), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl3, phead0 ∈ rl1 + first ' + vs[first].next ' + rl3 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(Some(tid)); (s)

Proof step 44 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(othertid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, vs0[vs[first].next].deqID = Some(tid0), ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[first].val = ps0[first].val, vs[first].val = ps0[first].val, vs0[first].val = ps0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ null, addr ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[vs[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[vs[first].next].val), vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + (vs[first].next ' + rl3) + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0, vs0, ps0, owns0), listp(vs[first].next ' + rl3 + qrl, vs, ps, owns), markedp(rl3, ps0), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl3, vs0), markedp(rl1, vs0), markedp(rl3, ps), markedp(rl1, ps), markedp(rl3, vs), markedp(rl1, vs), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, first, vs0), noid(tid, rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0, vhead, vs0), noid(tid, rl1 + first ' + (vs[first].next ' + rl3) + qrl, vhead, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl3) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl3) + 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), some?(ps0[vs[first].next].deqID), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + (vs[first].next ' + rl3) + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, vtail0 ∈ rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0 from vtail, first ∈ rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl3 + rl0), ¬ dups(qrl), ¬ dups(rl3 + qrl), ¬ dups(qrl0), ¬ dups(rl1 + rl3 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + rl3), ¬ dups(rl3 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(rl3), ¬ dups(rl1 + rl3 + rl0 + qrl0), ¬ dups(rl1 + rl3 + qrl), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl3, ¬ first ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ rl0, ¬ vs[first].next ∈ rl3, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[(vs[first].next ' + rl3 + qrl).last].next ≠ null → vs0[(vs[first].next ' + rl3 + qrl).last].next = vs[(vs[first].next ' + rl3 + qrl).last].next ∧ vs0[vs0[(vs[first].next ' + rl3 + qrl).last].next].val = vs[vs0[(vs[first].next ' + rl3 + qrl).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), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ rl3 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 ∈ rl3 ∨ phead0 ∈ rl0, vtail = (vs[first].next ' + rl3 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl3 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vs[first].next ' + rl3 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[first].next ' + rl3 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst = vs[first].next ∨ lst ∈ rl3 ∨ lst ∈ qrl, (vs[first].next ' + rl3).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl3).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl3).last ∧ unmarkedp(qrl, vs), (vs[first].next ' + rl3 + rl0).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs[first].next ' + rl3 + rl0).butlast).last = first ∧ phead0 ≠ (vs[first].next ' + rl3 + rl0).last ∧ unmarkedp(qrl0, vs0), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl3, phead0 ∈ rl1 + first ' + vs[first].next ' + rl3 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:noid-def, seq:⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)), subst:[tid, rl, r, vs] → [tid, rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0, vhead, vs0], <all paths>

Additional information

Used terms: tid, rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0, vhead, vs0

Proof step 45 from proof stable-D27 (previous step) (back to tree)

⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid))

A spec-lemma

Proof step 46 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs0[vs[first].next].deqID = Some(tid0), ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(othertid), ps[first].deqID = vs[first].deqID, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, vs0[first].val = ps0[first].val, vs[first].val = ps0[first].val, ps[first].val = ps0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ null, addr ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[vs[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[vs[first].next].val), vhead ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[first].next ' + rl3 + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + (vs[first].next ' + rl3) + qrl, vs, ps, owns), markedp(rl0, ps0), markedp(rl1, vs), markedp(rl3, vs), markedp(rl1, ps), markedp(rl3, ps), markedp(rl1, vs0), markedp(rl3, vs0), markedp(rl0, vs0), markedp(rl1, ps0), markedp(rl3, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, first, vs0), noid(tid, rl1 + first ' + (vs[first].next ' + rl3) + qrl, vhead, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl3) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), some?(ps0[vs[first].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), first ∈ rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0 from vhead, vtail0 ∈ rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0 from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + rl3) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl3 + rl0), ¬ dups(qrl), ¬ dups(rl3 + qrl), ¬ dups(qrl0), ¬ dups(rl1 + rl3 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + rl3), ¬ dups(rl3 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(rl3), ¬ dups(rl1 + rl3 + rl0 + qrl0), ¬ dups(rl1 + rl3 + qrl), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl3, ¬ first ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ rl0, ¬ vs[first].next ∈ rl3, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(vs[first].next ' + rl3 + qrl).last].next ≠ null → vs0[(vs[first].next ' + rl3 + qrl).last].next = vs[(vs[first].next ' + rl3 + qrl).last].next ∧ vs0[vs0[(vs[first].next ' + rl3 + qrl).last].next].val = vs[vs0[(vs[first].next ' + rl3 + qrl).last].next].val, ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ rl3 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vhead ∧ r0 ∈ rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0 from vhead → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl1 + first ' + vs[first].next ' + rl3 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl3, (vs[first].next ' + rl3 + rl0).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs[first].next ' + rl3 + rl0).butlast).last = first ∧ phead0 ≠ (vs[first].next ' + rl3 + rl0).last ∧ unmarkedp(qrl0, vs0), (vs[first].next ' + rl3).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl3).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl3).last ∧ unmarkedp(qrl, vs), lst = vs[first].next ∨ lst ∈ rl3 ∨ lst ∈ qrl, vtail0 = (vs[first].next ' + rl3 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[first].next ' + rl3 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (vs[first].next ' + rl3 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl3 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 ∈ rl3 ∨ phead0 ∈ rl0 ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 111 terms: vs[first].next abort: F discard: F computed: T

Additional information

Used terms: vs[first].next

Proof step 47 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(othertid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, vs0[vs[first].next].deqID = Some(tid0), ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[first].val = ps0[first].val, vs[first].val = ps0[first].val, vs0[first].val = ps0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ null, addr ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[vs[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[vs[first].next].val), vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + (vs[first].next ' + rl3) + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0, vs0, ps0, owns0), listp(vs[first].next ' + rl3 + qrl, vs, ps, owns), markedp(rl3, ps0), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl3, vs0), markedp(rl1, vs0), markedp(rl3, ps), markedp(rl1, ps), markedp(rl3, vs), markedp(rl1, vs), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, first, vs0), noid(tid, rl1 + first ' + (vs[first].next ' + rl3) + qrl, vhead, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl3) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl3) + 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), some?(ps0[vs[first].next].deqID), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + (vs[first].next ' + rl3) + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, vtail0 ∈ rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0 from vtail, first ∈ rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl3 + rl0), ¬ dups(qrl), ¬ dups(rl3 + qrl), ¬ dups(qrl0), ¬ dups(rl1 + rl3 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + rl3), ¬ dups(rl3 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(rl3), ¬ dups(rl1 + rl3 + rl0 + qrl0), ¬ dups(rl1 + rl3 + qrl), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl3, ¬ first ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ rl0, ¬ vs[first].next ∈ rl3, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[(vs[first].next ' + rl3 + qrl).last].next ≠ null → vs0[(vs[first].next ' + rl3 + qrl).last].next = vs[(vs[first].next ' + rl3 + qrl).last].next ∧ vs0[vs0[(vs[first].next ' + rl3 + qrl).last].next].val = vs[vs0[(vs[first].next ' + rl3 + qrl).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), vs[first].next ≠ vhead ∧ vs[first].next ∈ rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0 from vhead → vs0[vs[first].next].deqID ≠ Some(tid), ∀ r0. r0 ≠ vhead ∧ r0 ∈ rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0 from vhead → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ rl3 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 ∈ rl3 ∨ phead0 ∈ rl0, vtail = (vs[first].next ' + rl3 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl3 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vs[first].next ' + rl3 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[first].next ' + rl3 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst = vs[first].next ∨ lst ∈ rl3 ∨ lst ∈ qrl, (vs[first].next ' + rl3).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl3).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl3).last ∧ unmarkedp(qrl, vs), (vs[first].next ' + rl3 + rl0).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs[first].next ' + rl3 + rl0).butlast).last = first ∧ phead0 ≠ (vs[first].next ' + rl3 + rl0).last ∧ unmarkedp(qrl0, vs0), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl3, phead0 ∈ rl1 + first ' + vs[first].next ' + rl3 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ Some(tid) = Some(tid0) ↔ tid = tid0; (s)

Proof step 48 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(othertid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, vs0[vs[first].next].deqID = Some(tid0), ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[first].val = ps0[first].val, vs[first].val = ps0[first].val, vs0[first].val = ps0[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ null, addr ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[vs[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[vs[first].next].val), vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + (vs[first].next ' + rl3) + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0, vs0, ps0, owns0), listp(vs[first].next ' + rl3 + qrl, vs, ps, owns), markedp(rl3, ps0), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl3, vs0), markedp(rl1, vs0), markedp(rl3, ps), markedp(rl1, ps), markedp(rl3, vs), markedp(rl1, vs), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, first, vs0), noid(tid, rl1 + first ' + (vs[first].next ' + rl3) + qrl, vhead, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl3) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl3) + 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), some?(ps0[vs[first].next].deqID), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + (vs[first].next ' + rl3) + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, vtail0 ∈ rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0 from vtail, first ∈ rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl1 + rl3 + qrl), ¬ dups(rl1 + rl3 + rl0 + qrl0), ¬ dups(rl3), ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl3 + rl0 + qrl0), ¬ dups(rl1 + rl3), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + rl3 + rl0), ¬ dups(qrl0), ¬ dups(rl3 + qrl), ¬ dups(qrl), ¬ dups(rl3 + rl0), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl3, ¬ vs[first].next ∈ rl0, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ first ∈ rl3, vs[(vs[first].next ' + rl3 + qrl).last].next ≠ null → vs0[(vs[first].next ' + rl3 + qrl).last].next = vs[(vs[first].next ' + rl3 + qrl).last].next ∧ vs0[vs0[(vs[first].next ' + rl3 + qrl).last].next].val = vs[vs0[(vs[first].next ' + rl3 + qrl).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), vs[first].next ≠ vhead ∧ vs[first].next ∈ rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0 from vhead → tid0 ≠ tid, ∀ r0. r0 ≠ vhead ∧ r0 ∈ rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0 from vhead → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ rl3 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 ∈ rl3 ∨ phead0 ∈ rl0, vtail = (vs[first].next ' + rl3 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl3 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vs[first].next ' + rl3 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[first].next ' + rl3 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst = vs[first].next ∨ lst ∈ rl3 ∨ lst ∈ qrl, (vs[first].next ' + rl3).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl3).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl3).last ∧ unmarkedp(qrl, vs), (vs[first].next ' + rl3 + rl0).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs[first].next ' + rl3 + rl0).butlast).last = first ∧ phead0 ≠ (vs[first].next ' + rl3 + rl0).last ∧ unmarkedp(qrl0, vs0), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl3, phead0 ∈ rl1 + first ' + vs[first].next ' + rl3 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl3

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ markedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ a '.butlast = []; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 49 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs0[vs[first].next].deqID = Some(tid0), ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(othertid), ps[first].deqID = vs[first].deqID, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, vs0[first].val = ps0[first].val, vs[first].val = ps0[first].val, ps[first].val = ps0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rl3 = first0 + rl2, rvowns(pretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ null, addr ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[vs[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[vs[first].next].val), vhead ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[first].next ' + rl3 + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + (vs[first].next ' + rl3) + qrl, vs, ps, owns), markedp(rl0, ps0), markedp(rl1, vs), markedp(rl3, vs), markedp(rl1, ps), markedp(rl3, ps), markedp(rl1, vs0), markedp(rl3, vs0), markedp(rl0, vs0), markedp(rl1, ps0), markedp(rl3, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, first, vs0), noid(tid, rl1 + first ' + (vs[first].next ' + rl3) + qrl, vhead, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl3) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), some?(ps0[vs[first].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), first ∈ rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0 from vhead, vtail0 ∈ rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0 from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + rl3) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl1 + rl3 + qrl), ¬ dups(rl1 + rl3 + rl0 + qrl0), ¬ dups(rl3), ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl3 + rl0 + qrl0), ¬ dups(rl1 + rl3), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + rl3 + rl0), ¬ dups(qrl0), ¬ dups(rl3 + qrl), ¬ dups(qrl), ¬ dups(rl3 + rl0), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl3, ¬ vs[first].next ∈ rl0, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ first ∈ rl3, vs[first].next ≠ vhead ∧ vs[first].next ∈ rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0 from vhead → tid0 ≠ tid, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(vs[first].next ' + rl3 + qrl).last].next ≠ null → vs0[(vs[first].next ' + rl3 + qrl).last].next = vs[(vs[first].next ' + rl3 + qrl).last].next ∧ vs0[vs0[(vs[first].next ' + rl3 + qrl).last].next].val = vs[vs0[(vs[first].next ' + rl3 + qrl).last].next].val, ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r ∈ rl3 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vhead ∧ r0 ∈ rl1 + first ' + (vs[first].next ' + rl3) + rl0 + qrl0 from vhead → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl1 + first ' + vs[first].next ' + rl3 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl3, (vs[first].next ' + rl3 + rl0).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs[first].next ' + rl3 + rl0).butlast).last = first ∧ phead0 ≠ (vs[first].next ' + rl3 + rl0).last ∧ unmarkedp(qrl0, vs0), (vs[first].next ' + rl3).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl3).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl3).last ∧ unmarkedp(qrl, vs), lst = vs[first].next ∨ lst ∈ rl3 ∨ lst ∈ qrl, vtail0 = (vs[first].next ' + rl3 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[first].next ' + rl3 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (vs[first].next ' + rl3 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl3 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 ∈ rl3 ∨ phead0 ∈ rl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ ¬ weak?(Some(tid)); (s) ⊦ some?(Some(tid)); (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a + x = a ' + x; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s)

Proof step 50 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps[vs[first].next].deqID = Some(othertid), vs0[vs[first].next].deqID = Some(tid0), ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(othertid), ps[first].deqID = vs[first].deqID, ps0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next = vs[vs[first].next].next, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps[vs[first].next].val = vs[vs[first].next].val, vs0[first].val = ps0[first].val, vs[first].val = ps0[first].val, ps[first].val = ps0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[first].next) = None, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ vs[vs[first].next].next, vs[first].next ≠ null, addr ≠ null, first ≠ vs[vs[first].next].next, first ≠ vs[first].next, first ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[vs[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[vs[first].next].val), vhead ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[vs[first].next].next ' + rl2 + qrl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl, vs, ps, owns), markedp(rl0, ps0), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl0, vs0), markedp(rl1, ps0), markedp(rl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, first, vs0), noid(tid, rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl, vhead, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[vs[vs[first].next].next].deqID), some?(ps[vs[vs[first].next].next].deqID), some?(vs0[vs[vs[first].next].next].deqID), some?(ps0[vs[vs[first].next].next].deqID), some?(vs[first].deqID), some?(ps0[vs[first].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vs[first].next ∈ ps, vs[first].next ∈ vs, first ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vhead, vtail0 ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ rl0, ¬ vs[first].next ∈ rl2, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, ¬ vs[vs[first].next].next ∈ qrl0, ¬ vs[vs[first].next].next ∈ rl0, ¬ vs[vs[first].next].next ∈ qrl, ¬ vs[vs[first].next].next ∈ rl2, ¬ vs[vs[first].next].next ∈ rl1, vs[first].next ≠ vhead ∧ vs[first].next ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vhead → tid0 ≠ tid, vs[(vs[vs[first].next].next ' + rl2 + qrl).last].next ≠ null → vs0[(vs[vs[first].next].next ' + rl2 + qrl).last].next = vs[(vs[vs[first].next].next ' + rl2 + qrl).last].next ∧ vs0[vs0[(vs[vs[first].next].next ' + rl2 + qrl).last].next].val = vs[vs0[(vs[vs[first].next].next ' + rl2 + qrl).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), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r = vs[vs[first].next].next ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vhead ∧ r0 ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vhead → vs0[r0].deqID ≠ Some(tid), lst = vs[first].next ∨ lst = vs[vs[first].next].next ∨ lst ∈ rl2 ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 = vs[vs[first].next].next ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, phead0 ∈ rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead = vs[vs[first].next].next ∨ phead ∈ rl2, (vs[vs[first].next].next ' + rl2 + rl0).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (vs[first].next ' + (vs[vs[first].next].next ' + rl2 + rl0).butlast).last = first ∧ phead0 ≠ (vs[vs[first].next].next ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), (vs[vs[first].next].next ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (vs[first].next ' + (vs[vs[first].next].next ' + rl2).butlast).last = vhead ∧ phead ≠ (vs[vs[first].next].next ' + rl2).last ∧ unmarkedp(qrl, vs), vtail0 = (vs[vs[first].next].next ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[vs[first].next].next ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (vs[vs[first].next].next ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[vs[first].next].next ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 134

Additional information

Proof step 51 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(othertid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, vs0[vs[first].next].deqID = Some(tid0), ps[vs[first].next].deqID = Some(othertid), (vs[vs[first].next].next ' + rl2 + rl0).last = first, ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[vs[first].next].next = vs[vs[first].next].next, ps0[vs[first].next].next = vs[vs[first].next].next, ps[first].val = ps0[first].val, vs[first].val = ps0[first].val, vs0[first].val = ps0[first].val, ps[vs[first].next].val = vs[vs[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, owns(vs[first].next) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ vs[vs[first].next].next, vs[first].next ≠ null, addr ≠ null, first ≠ vs[vs[first].next].next, first ≠ vs[first].next, first ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[vs[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[vs[first].next].val), vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0, vs0, ps0, owns0), listp(vs[vs[first].next].next ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, first, vs0), noid(tid, rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl, vhead, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + 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), some?(ps0[vs[first].next].deqID), some?(vs[first].deqID), some?(ps0[vs[vs[first].next].next].deqID), some?(vs0[vs[vs[first].next].next].deqID), some?(ps[vs[vs[first].next].next].deqID), some?(vs[vs[vs[first].next].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, vtail0 ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vtail, first ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vhead, vs[first].next ∈ vs, vs[first].next ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ rl0, ¬ vs[first].next ∈ rl2, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, ¬ vs[vs[first].next].next ∈ qrl0, ¬ vs[vs[first].next].next ∈ rl0, ¬ vs[vs[first].next].next ∈ qrl, ¬ vs[vs[first].next].next ∈ rl2, ¬ vs[vs[first].next].next ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(vs[vs[first].next].next ' + rl2 + qrl).last].next ≠ null → vs0[(vs[vs[first].next].next ' + rl2 + qrl).last].next = vs[(vs[vs[first].next].next ' + rl2 + qrl).last].next ∧ vs0[vs0[(vs[vs[first].next].next ' + rl2 + qrl).last].next].val = vs[vs0[(vs[vs[first].next].next ' + rl2 + qrl).last].next].val, vs[first].next ≠ vhead ∧ vs[first].next ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vhead → tid0 ≠ tid, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), ∀ r0. r0 ≠ vhead ∧ r0 ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vhead → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r = vs[vs[first].next].next ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail = (vs[vs[first].next].next ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[vs[first].next].next ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vs[vs[first].next].next ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[vs[first].next].next ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (vs[vs[first].next].next ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (vs[first].next ' + (vs[vs[first].next].next ' + rl2).butlast).last = vhead ∧ phead ≠ (vs[vs[first].next].next ' + rl2).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead = vs[vs[first].next].next ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 = vs[vs[first].next].next ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, lst = vs[first].next ∨ lst = vs[vs[first].next].next ∨ lst ∈ rl2 ∨ lst ∈ qrl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [vs[vs[first].next].next ', rl2 + rl0], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: vs[vs[first].next].next ', rl2 + rl0

Proof step 52 from proof stable-D27 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 53 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps[vs[first].next].deqID = Some(othertid), vs0[vs[first].next].deqID = Some(tid0), ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(othertid), ps[first].deqID = vs[first].deqID, (rl2 + rl0).last = first, ps0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next = vs[vs[first].next].next, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps[vs[first].next].val = vs[vs[first].next].val, vs0[first].val = ps0[first].val, vs[first].val = ps0[first].val, ps[first].val = ps0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[first].next) = None, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], vs[first].next ≠ vs[vs[first].next].next, vs[first].next ≠ null, addr ≠ null, first ≠ vs[vs[first].next].next, first ≠ vs[first].next, first ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[vs[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[vs[first].next].val), vhead ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[vs[first].next].next ' + rl2 + qrl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl, vs, ps, owns), markedp(rl0, ps0), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl0, vs0), markedp(rl1, ps0), markedp(rl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, first, vs0), noid(tid, rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl, vhead, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[vs[vs[first].next].next].deqID), some?(ps[vs[vs[first].next].next].deqID), some?(vs0[vs[vs[first].next].next].deqID), some?(ps0[vs[vs[first].next].next].deqID), some?(vs[first].deqID), some?(ps0[vs[first].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vs[first].next ∈ ps, vs[first].next ∈ vs, first ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vhead, vtail0 ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ rl0, ¬ vs[first].next ∈ rl2, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, ¬ vs[vs[first].next].next ∈ qrl0, ¬ vs[vs[first].next].next ∈ rl0, ¬ vs[vs[first].next].next ∈ qrl, ¬ vs[vs[first].next].next ∈ rl2, ¬ vs[vs[first].next].next ∈ rl1, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), vs[first].next ≠ vhead ∧ vs[first].next ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vhead → tid0 ≠ tid, vs[(vs[vs[first].next].next ' + rl2 + qrl).last].next ≠ null → vs0[(vs[vs[first].next].next ' + rl2 + qrl).last].next = vs[(vs[vs[first].next].next ' + rl2 + qrl).last].next ∧ vs0[vs0[(vs[vs[first].next].next ' + rl2 + qrl).last].next].val = vs[vs0[(vs[vs[first].next].next ' + rl2 + qrl).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), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r = vs[vs[first].next].next ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vhead ∧ r0 ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vhead → vs0[r0].deqID ≠ Some(tid), lst = vs[first].next ∨ lst = vs[vs[first].next].next ∨ lst ∈ rl2 ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 = vs[vs[first].next].next ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, phead0 ∈ rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead = vs[vs[first].next].next ∨ phead ∈ rl2, (vs[vs[first].next].next ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (vs[first].next ' + (vs[vs[first].next].next ' + rl2).butlast).last = vhead ∧ phead ≠ (vs[vs[first].next].next ' + rl2).last ∧ unmarkedp(qrl, vs), vtail0 = (vs[vs[first].next].next ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[vs[first].next].next ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (vs[vs[first].next].next ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[vs[first].next].next ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s)

Proof step 54 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps[(rl2 + rl0).last].deqID = vs[(rl2 + rl0).last].deqID, vs[vs[(rl2 + rl0).last].next].deqID = Some(othertid), vs0[(rl2 + rl0).last].deqID = vs[(rl2 + rl0).last].deqID, ps0[(rl2 + rl0).last].deqID = vs[(rl2 + rl0).last].deqID, vs0[vs[(rl2 + rl0).last].next].deqID = Some(tid0), ps[vs[(rl2 + rl0).last].next].deqID = Some(othertid), ps[(rl2 + rl0).last].next = vs[(rl2 + rl0).last].next, ps0[(rl2 + rl0).last].next = vs[(rl2 + rl0).last].next, vs0[(rl2 + rl0).last].next = vs[(rl2 + rl0).last].next, ps[vs[(rl2 + rl0).last].next].next = vs[vs[(rl2 + rl0).last].next].next, ps0[vs[(rl2 + rl0).last].next].next = vs[vs[(rl2 + rl0).last].next].next, ps[(rl2 + rl0).last].val = ps0[(rl2 + rl0).last].val, vs[(rl2 + rl0).last].val = ps0[(rl2 + rl0).last].val, vs0[(rl2 + rl0).last].val = ps0[(rl2 + rl0).last].val, ps[vs[(rl2 + rl0).last].next].val = vs[vs[(rl2 + rl0).last].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns((rl2 + rl0).last) = None, owns(vs[(rl2 + rl0).last].next) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs[(rl2 + rl0).last].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], (rl2 + rl0).last ≠ vs[vs[(rl2 + rl0).last].next].next, (rl2 + rl0).last ≠ vs[(rl2 + rl0).last].next, (rl2 + rl0).last ≠ null, (rl2 + rl0).last ≠ lst, vs[(rl2 + rl0).last].next ≠ vs[vs[(rl2 + rl0).last].next].next, vs[(rl2 + rl0).last].next ≠ null, addr ≠ null, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[vs[(rl2 + rl0).last].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[vs[(rl2 + rl0).last].next].val), vhead ≠ (rl2 + rl0).last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + (rl2 + rl0).last ' + vs[(rl2 + rl0).last].next ' + (vs[vs[(rl2 + rl0).last].next].next ' + rl2) + qrl, vs, ps, owns), listp(rl1 + (rl2 + rl0).last ' + vs[(rl2 + rl0).last].next ' + (vs[vs[(rl2 + rl0).last].next].next ' + rl2) + rl0 + qrl0, vs0, ps0, owns0), listp(vs[vs[(rl2 + rl0).last].next].next ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, (rl2 + rl0).last, vs0), noid(tid, rl1 + (rl2 + rl0).last ' + vs[(rl2 + rl0).last].next ' + (vs[vs[(rl2 + rl0).last].next].next ' + rl2) + qrl, vhead, vs), nonullRetRefs(rl1 + (rl2 + rl0).last ' + vs[(rl2 + rl0).last].next ' + (vs[vs[(rl2 + rl0).last].next].next ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs (rl1 + (rl2 + rl0).last ' + vs[(rl2 + rl0).last].next ' + (vs[vs[(rl2 + rl0).last].next].next ' + rl2) + 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), some?(ps0[vs[(rl2 + rl0).last].next].deqID), some?(vs[(rl2 + rl0).last].deqID), some?(ps0[vs[vs[(rl2 + rl0).last].next].next].deqID), some?(vs0[vs[vs[(rl2 + rl0).last].next].next].deqID), some?(ps[vs[vs[(rl2 + rl0).last].next].next].deqID), some?(vs[vs[vs[(rl2 + rl0).last].next].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), (rl2 + rl0).last ∈ ps, (rl2 + rl0).last ∈ vs, (rl2 + rl0).last ∈ ps0, (rl2 + rl0).last ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + (rl2 + rl0).last ' + vs[(rl2 + rl0).last].next ' + (vs[vs[(rl2 + rl0).last].next].next ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, vtail0 ∈ rl1 + (rl2 + rl0).last ' + vs[(rl2 + rl0).last].next ' + (vs[vs[(rl2 + rl0).last].next].next ' + rl2) + rl0 + qrl0 from vtail, (rl2 + rl0).last ∈ rl1 + (rl2 + rl0).last ' + vs[(rl2 + rl0).last].next ' + (vs[vs[(rl2 + rl0).last].next].next ' + rl2) + rl0 + qrl0 from vhead, vs[(rl2 + rl0).last].next ∈ vs, vs[(rl2 + rl0).last].next ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ weak?(vs[(rl2 + rl0).last].deqID), ¬ (rl2 + rl0).last ∈ rl2, ¬ (rl2 + rl0).last ∈ rl0, ¬ (rl2 + rl0).last ∈ qrl0, ¬ (rl2 + rl0).last ∈ qrl, ¬ vs[(rl2 + rl0).last].next ∈ qrl, ¬ vs[(rl2 + rl0).last].next ∈ qrl0, ¬ vs[(rl2 + rl0).last].next ∈ rl0, ¬ vs[(rl2 + rl0).last].next ∈ rl2, ¬ vs[(rl2 + rl0).last].next ∈ rl1, ¬ (rl2 + rl0).last ∈ rl1, ¬ vs[vs[(rl2 + rl0).last].next].next ∈ qrl0, ¬ vs[vs[(rl2 + rl0).last].next].next ∈ rl0, ¬ vs[vs[(rl2 + rl0).last].next].next ∈ qrl, ¬ vs[vs[(rl2 + rl0).last].next].next ∈ rl2, ¬ vs[vs[(rl2 + rl0).last].next].next ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(vs[vs[(rl2 + rl0).last].next].next ' + rl2 + qrl).last].next ≠ null → vs0[(vs[vs[(rl2 + rl0).last].next].next ' + rl2 + qrl).last].next = vs[(vs[vs[(rl2 + rl0).last].next].next ' + rl2 + qrl).last].next ∧ vs0[vs0[(vs[vs[(rl2 + rl0).last].next].next ' + rl2 + qrl).last].next].val = vs[vs0[(vs[vs[(rl2 + rl0).last].next].next ' + rl2 + qrl).last].next].val, vs[(rl2 + rl0).last].next ≠ vhead ∧ vs[(rl2 + rl0).last].next ∈ rl1 + (rl2 + rl0).last ' + vs[(rl2 + rl0).last].next ' + (vs[vs[(rl2 + rl0).last].next].next ' + rl2) + rl0 + qrl0 from vhead → tid0 ≠ tid, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), ∀ r0. r0 ≠ vhead ∧ r0 ∈ rl1 + (rl2 + rl0).last ' + vs[(rl2 + rl0).last].next ' + (vs[vs[(rl2 + rl0).last].next].next ' + rl2) + rl0 + qrl0 from vhead → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[(rl2 + rl0).last].next ∨ r = vs[vs[(rl2 + rl0).last].next].next ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail = (vs[vs[(rl2 + rl0).last].next].next ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[vs[(rl2 + rl0).last].next].next ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (vs[vs[(rl2 + rl0).last].next].next ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (vs[(rl2 + rl0).last].next ' + (vs[vs[(rl2 + rl0).last].next].next ' + rl2).butlast).last = vhead ∧ phead ≠ (vs[vs[(rl2 + rl0).last].next].next ' + rl2).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = (rl2 + rl0).last ∨ phead = vs[(rl2 + rl0).last].next ∨ phead = vs[vs[(rl2 + rl0).last].next].next ∨ phead ∈ rl2, phead0 ∈ rl1 + (rl2 + rl0).last ' + vs[(rl2 + rl0).last].next ' + vs[vs[(rl2 + rl0).last].next].next ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = (rl2 + rl0).last ∨ phead0 = vs[(rl2 + rl0).last].next ∨ phead0 = vs[vs[(rl2 + rl0).last].next].next ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, lst = vs[(rl2 + rl0).last].next ∨ lst = vs[vs[(rl2 + rl0).last].next].next ∨ lst ∈ rl2 ∨ lst ∈ qrl, vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [rl2, rl0], <all paths>

Additional information

Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ markedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl2, rl0

Proof step 55 from proof stable-D27 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 56 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(othertid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, vs0[vs[first].next].deqID = Some(tid0), ps[vs[first].next].deqID = Some(othertid), (vs[first].next ' + (vs[vs[first].next].next ' + rl2 + rl0).butlast).last = first, ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[vs[first].next].next = vs[vs[first].next].next, ps0[vs[first].next].next = vs[vs[first].next].next, ps[first].val = ps0[first].val, vs[first].val = ps0[first].val, vs0[first].val = ps0[first].val, ps[vs[first].next].val = vs[vs[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, owns(vs[first].next) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs[first].next ≠ vs[vs[first].next].next, vs[first].next ≠ null, addr ≠ null, first ≠ vs[vs[first].next].next, first ≠ vs[first].next, first ≠ null, first ≠ lst, phead0 ≠ (vs[vs[first].next].next ' + rl2 + rl0).last, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[vs[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[vs[first].next].val), vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0, vs0, ps0, owns0), listp(vs[vs[first].next].next ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, first, vs0), noid(tid, rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl, vhead, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + 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), some?(ps0[vs[first].next].deqID), some?(vs[first].deqID), some?(ps0[vs[vs[first].next].next].deqID), some?(vs0[vs[vs[first].next].next].deqID), some?(ps[vs[vs[first].next].next].deqID), some?(vs[vs[vs[first].next].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, vtail0 ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vtail, first ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vhead, vs[first].next ∈ vs, vs[first].next ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ rl0, ¬ vs[first].next ∈ rl2, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, ¬ vs[vs[first].next].next ∈ qrl0, ¬ vs[vs[first].next].next ∈ rl0, ¬ vs[vs[first].next].next ∈ qrl, ¬ vs[vs[first].next].next ∈ rl2, ¬ vs[vs[first].next].next ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(vs[vs[first].next].next ' + rl2 + qrl).last].next ≠ null → vs0[(vs[vs[first].next].next ' + rl2 + qrl).last].next = vs[(vs[vs[first].next].next ' + rl2 + qrl).last].next ∧ vs0[vs0[(vs[vs[first].next].next ' + rl2 + qrl).last].next].val = vs[vs0[(vs[vs[first].next].next ' + rl2 + qrl).last].next].val, vs[first].next ≠ vhead ∧ vs[first].next ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vhead → tid0 ≠ tid, ∀ r0. r0 ≠ vhead ∧ r0 ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vhead → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r = vs[vs[first].next].next ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail = (vs[vs[first].next].next ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[vs[first].next].next ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vs[vs[first].next].next ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[vs[first].next].next ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (vs[vs[first].next].next ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (vs[first].next ' + (vs[vs[first].next].next ' + rl2).butlast).last = vhead ∧ phead ≠ (vs[vs[first].next].next ' + rl2).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead = vs[vs[first].next].next ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 = vs[vs[first].next].next ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, lst = vs[first].next ∨ lst = vs[vs[first].next].next ∨ lst ∈ rl2 ∨ lst ∈ qrl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [vs[vs[first].next].next ', rl2 + rl0], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ [] + x = x; (s) ⊦ a '.butlast = []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: vs[vs[first].next].next ', rl2 + rl0

Proof step 57 from proof stable-D27 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 58 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps[vs[first].next].deqID = Some(othertid), vs0[vs[first].next].deqID = Some(tid0), ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(othertid), ps[first].deqID = vs[first].deqID, (vs[first].next ' + (vs[vs[first].next].next ' + rl2 + rl0).butlast).last = first, ps0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next = vs[vs[first].next].next, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps[vs[first].next].val = vs[vs[first].next].val, vs0[first].val = ps0[first].val, vs[first].val = ps0[first].val, ps[first].val = ps0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[first].next) = None, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], vs[first].next ≠ vs[vs[first].next].next, vs[first].next ≠ null, addr ≠ null, first ≠ vs[vs[first].next].next, first ≠ vs[first].next, first ≠ null, first ≠ lst, phead0 ≠ (rl2 + rl0).last, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[vs[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[vs[first].next].val), vhead ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[vs[first].next].next ' + rl2 + qrl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl, vs, ps, owns), markedp(rl0, ps0), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl0, vs0), markedp(rl1, ps0), markedp(rl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, first, vs0), noid(tid, rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl, vhead, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[vs[vs[first].next].next].deqID), some?(ps[vs[vs[first].next].next].deqID), some?(vs0[vs[vs[first].next].next].deqID), some?(ps0[vs[vs[first].next].next].deqID), some?(vs[first].deqID), some?(ps0[vs[first].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vs[first].next ∈ ps, vs[first].next ∈ vs, first ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vhead, vtail0 ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ rl0, ¬ vs[first].next ∈ rl2, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, ¬ vs[vs[first].next].next ∈ qrl0, ¬ vs[vs[first].next].next ∈ rl0, ¬ vs[vs[first].next].next ∈ qrl, ¬ vs[vs[first].next].next ∈ rl2, ¬ vs[vs[first].next].next ∈ rl1, vs[first].next ≠ vhead ∧ vs[first].next ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vhead → tid0 ≠ tid, vs[(vs[vs[first].next].next ' + rl2 + qrl).last].next ≠ null → vs0[(vs[vs[first].next].next ' + rl2 + qrl).last].next = vs[(vs[vs[first].next].next ' + rl2 + qrl).last].next ∧ vs0[vs0[(vs[vs[first].next].next ' + rl2 + qrl).last].next].val = vs[vs0[(vs[vs[first].next].next ' + rl2 + qrl).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), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r = vs[vs[first].next].next ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vhead ∧ r0 ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vhead → vs0[r0].deqID ≠ Some(tid), lst = vs[first].next ∨ lst = vs[vs[first].next].next ∨ lst ∈ rl2 ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 = vs[vs[first].next].next ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, phead0 ∈ rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead = vs[vs[first].next].next ∨ phead ∈ rl2, (vs[vs[first].next].next ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (vs[first].next ' + (vs[vs[first].next].next ' + rl2).butlast).last = vhead ∧ phead ≠ (vs[vs[first].next].next ' + rl2).last ∧ unmarkedp(qrl, vs), vtail0 = (vs[vs[first].next].next ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs[vs[first].next].next ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (vs[vs[first].next].next ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[vs[first].next].next ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s)

Proof step 59 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(othertid), vs0[first].deqID = vs[first].deqID, ps0[first].deqID = vs[first].deqID, vs0[vs[first].next].deqID = Some(tid0), ps[vs[first].next].deqID = Some(othertid), (vs[vs[first].next].next ' + (rl2 + rl0).butlast).last = first, ps[first].next = vs[first].next, ps0[first].next = vs[first].next, vs0[first].next = vs[first].next, ps[vs[first].next].next = vs[vs[first].next].next, ps0[vs[first].next].next = vs[vs[first].next].next, ps[first].val = ps0[first].val, vs[first].val = ps0[first].val, vs0[first].val = ps0[first].val, ps[vs[first].next].val = vs[vs[first].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, owns(vs[first].next) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], vs[first].next ≠ vs[vs[first].next].next, vs[first].next ≠ null, addr ≠ null, first ≠ vs[vs[first].next].next, first ≠ vs[first].next, first ≠ null, first ≠ lst, phead0 ≠ (rl2 + rl0).last, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[vs[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[vs[first].next].val), vhead ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0, vs0, ps0, owns0), listp(vs[vs[first].next].next ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, first, vs0), noid(tid, rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl, vhead, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + 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), some?(ps0[vs[first].next].deqID), some?(vs[first].deqID), some?(ps0[vs[vs[first].next].next].deqID), some?(vs0[vs[vs[first].next].next].deqID), some?(ps[vs[vs[first].next].next].deqID), some?(vs[vs[vs[first].next].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, vtail0 ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vtail, first ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vhead, vs[first].next ∈ vs, vs[first].next ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ rl0, ¬ vs[first].next ∈ rl2, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, ¬ vs[vs[first].next].next ∈ qrl0, ¬ vs[vs[first].next].next ∈ rl0, ¬ vs[vs[first].next].next ∈ qrl, ¬ vs[vs[first].next].next ∈ rl2, ¬ vs[vs[first].next].next ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(vs[vs[first].next].next ' + rl2 + qrl).last].next ≠ null → vs0[(vs[vs[first].next].next ' + rl2 + qrl).last].next = vs[(vs[vs[first].next].next ' + rl2 + qrl).last].next ∧ vs0[vs0[(vs[vs[first].next].next ' + rl2 + qrl).last].next].val = vs[vs0[(vs[vs[first].next].next ' + rl2 + qrl).last].next].val, vs[first].next ≠ vhead ∧ vs[first].next ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vhead → tid0 ≠ tid, ∀ r0. r0 ≠ vhead ∧ r0 ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vhead → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r = vs[vs[first].next].next ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail = (vs[vs[first].next].next ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[vs[first].next].next ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (vs[vs[first].next].next ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (vs[first].next ' + (vs[vs[first].next].next ' + rl2).butlast).last = vhead ∧ phead ≠ (vs[vs[first].next].next ' + rl2).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead = vs[vs[first].next].next ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 = vs[vs[first].next].next ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, lst = vs[first].next ∨ lst = vs[vs[first].next].next ∨ lst ∈ rl2 ∨ lst ∈ qrl, vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [vs[vs[first].next].next ', (rl2 + rl0).butlast], <all paths>

Additional information

Used simplifier rules: ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: vs[vs[first].next].next ', (rl2 + rl0).butlast

Proof step 60 from proof stable-D27 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 61 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps[vs[first].next].deqID = Some(othertid), vs0[vs[first].next].deqID = Some(tid0), ps0[first].deqID = vs[first].deqID, vs0[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(othertid), ps[first].deqID = vs[first].deqID, (rl2 + rl0).butlast.last = first, ps0[vs[first].next].next = vs[vs[first].next].next, ps[vs[first].next].next = vs[vs[first].next].next, vs0[first].next = vs[first].next, ps0[first].next = vs[first].next, ps[first].next = vs[first].next, ps[vs[first].next].val = vs[vs[first].next].val, vs0[first].val = ps0[first].val, vs[first].val = ps0[first].val, ps[first].val = ps0[first].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[first].next) = None, owns(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], (rl2 + rl0).butlast ≠ [], vs[first].next ≠ vs[vs[first].next].next, vs[first].next ≠ null, addr ≠ null, first ≠ vs[vs[first].next].next, first ≠ vs[first].next, first ≠ null, first ≠ lst, phead0 ≠ (rl2 + rl0).last, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[vs[first].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[vs[first].next].val), vhead ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[vs[first].next].next ' + rl2 + qrl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl, vs, ps, owns), markedp(rl0, ps0), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl0, vs0), markedp(rl1, ps0), markedp(rl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, first, vs0), noid(tid, rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl, vhead, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[vs[vs[first].next].next].deqID), some?(ps[vs[vs[first].next].next].deqID), some?(vs0[vs[vs[first].next].next].deqID), some?(ps0[vs[vs[first].next].next].deqID), some?(vs[first].deqID), some?(ps0[vs[first].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vs[first].next ∈ ps, vs[first].next ∈ vs, first ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vhead, vtail0 ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl0, ¬ vs[first].next ∈ rl0, ¬ vs[first].next ∈ rl2, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, ¬ vs[vs[first].next].next ∈ qrl0, ¬ vs[vs[first].next].next ∈ rl0, ¬ vs[vs[first].next].next ∈ qrl, ¬ vs[vs[first].next].next ∈ rl2, ¬ vs[vs[first].next].next ∈ rl1, vs[first].next ≠ vhead ∧ vs[first].next ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vhead → tid0 ≠ tid, vs[(vs[vs[first].next].next ' + rl2 + qrl).last].next ≠ null → vs0[(vs[vs[first].next].next ' + rl2 + qrl).last].next = vs[(vs[vs[first].next].next ' + rl2 + qrl).last].next ∧ vs0[vs0[(vs[vs[first].next].next ' + rl2 + qrl).last].next].val = vs[vs0[(vs[vs[first].next].next ' + rl2 + qrl).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), ∀ r. r ∈ rl1 ∨ r = vs[first].next ∨ r = vs[vs[first].next].next ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vhead ∧ r0 ∈ rl1 + first ' + vs[first].next ' + (vs[vs[first].next].next ' + rl2) + rl0 + qrl0 from vhead → vs0[r0].deqID ≠ Some(tid), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst = vs[first].next ∨ lst = vs[vs[first].next].next ∨ lst ∈ rl2 ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs[first].next ∨ phead0 = vs[vs[first].next].next ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, phead0 ∈ rl1 + first ' + vs[first].next ' + vs[vs[first].next].next ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead = vs[vs[first].next].next ∨ phead ∈ rl2, (vs[vs[first].next].next ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (vs[first].next ' + (vs[vs[first].next].next ' + rl2).butlast).last = vhead ∧ phead ≠ (vs[vs[first].next].next ' + rl2).last ∧ unmarkedp(qrl, vs), vtail = (vs[vs[first].next].next ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[vs[first].next].next ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss)

Proof step 62 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps[(rl2 + rl0).butlast.last].deqID = vs[(rl2 + rl0).butlast.last].deqID, vs[vs[(rl2 + rl0).butlast.last].next].deqID = Some(othertid), vs0[(rl2 + rl0).butlast.last].deqID = vs[(rl2 + rl0).butlast.last].deqID, ps0[(rl2 + rl0).butlast.last].deqID = vs[(rl2 + rl0).butlast.last].deqID, vs0[vs[(rl2 + rl0).butlast.last].next].deqID = Some(tid0), ps[vs[(rl2 + rl0).butlast.last].next].deqID = Some(othertid), ps[(rl2 + rl0).butlast.last].next = vs[(rl2 + rl0).butlast.last].next, ps0[(rl2 + rl0).butlast.last].next = vs[(rl2 + rl0).butlast.last].next, vs0[(rl2 + rl0).butlast.last].next = vs[(rl2 + rl0).butlast.last].next, ps[vs[(rl2 + rl0).butlast.last].next].next = vs[vs[(rl2 + rl0).butlast.last].next].next, ps0[vs[(rl2 + rl0).butlast.last].next].next = vs[vs[(rl2 + rl0).butlast.last].next].next, ps[(rl2 + rl0).butlast.last].val = ps0[(rl2 + rl0).butlast.last].val, vs[(rl2 + rl0).butlast.last].val = ps0[(rl2 + rl0).butlast.last].val, vs0[(rl2 + rl0).butlast.last].val = ps0[(rl2 + rl0).butlast.last].val, ps[vs[(rl2 + rl0).butlast.last].next].val = vs[vs[(rl2 + rl0).butlast.last].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns((rl2 + rl0).butlast.last) = None, owns(vs[(rl2 + rl0).butlast.last].next) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs[(rl2 + rl0).butlast.last].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], rl2 + rl0 ≠ (rl2 + rl0).head ', (rl2 + rl0).butlast.last ≠ vs[vs[(rl2 + rl0).butlast.last].next].next, (rl2 + rl0).butlast.last ≠ vs[(rl2 + rl0).butlast.last].next, (rl2 + rl0).butlast.last ≠ null, (rl2 + rl0).butlast.last ≠ lst, vs[(rl2 + rl0).butlast.last].next ≠ vs[vs[(rl2 + rl0).butlast.last].next].next, vs[(rl2 + rl0).butlast.last].next ≠ null, addr ≠ null, phead0 ≠ (rl2 + rl0).last, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[vs[(rl2 + rl0).butlast.last].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[vs[(rl2 + rl0).butlast.last].next].val), vhead ≠ (rl2 + rl0).butlast.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp (rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + qrl, vs, ps, owns), listp (rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + rl0 + qrl0, vs0, ps0, owns0), listp(vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, (rl2 + rl0).butlast.last, vs0), noid (tid, rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + qrl, vhead, vs), nonullRetRefs (rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs (rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + 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), some?(ps0[vs[(rl2 + rl0).butlast.last].next].deqID), some?(vs[(rl2 + rl0).butlast.last].deqID), some?(ps0[vs[vs[(rl2 + rl0).butlast.last].next].next].deqID), some?(vs0[vs[vs[(rl2 + rl0).butlast.last].next].next].deqID), some?(ps[vs[vs[(rl2 + rl0).butlast.last].next].next].deqID), some?(vs[vs[vs[(rl2 + rl0).butlast.last].next].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), (rl2 + rl0).butlast.last ∈ ps, (rl2 + rl0).butlast.last ∈ vs, (rl2 + rl0).butlast.last ∈ ps0, (rl2 + rl0).butlast.last ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, vtail0 ∈ rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + rl0 + qrl0 from vtail, (rl2 + rl0).butlast.last ∈ rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + rl0 + qrl0 from vhead, vs[(rl2 + rl0).butlast.last].next ∈ vs, vs[(rl2 + rl0).butlast.last].next ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ weak?(vs[(rl2 + rl0).butlast.last].deqID), ¬ (rl2 + rl0).butlast.last ∈ rl2, ¬ (rl2 + rl0).butlast.last ∈ rl0, ¬ (rl2 + rl0).butlast.last ∈ qrl0, ¬ (rl2 + rl0).butlast.last ∈ qrl, ¬ vs[(rl2 + rl0).butlast.last].next ∈ qrl, ¬ vs[(rl2 + rl0).butlast.last].next ∈ qrl0, ¬ vs[(rl2 + rl0).butlast.last].next ∈ rl0, ¬ vs[(rl2 + rl0).butlast.last].next ∈ rl2, ¬ vs[(rl2 + rl0).butlast.last].next ∈ rl1, ¬ (rl2 + rl0).butlast.last ∈ rl1, ¬ vs[vs[(rl2 + rl0).butlast.last].next].next ∈ qrl0, ¬ vs[vs[(rl2 + rl0).butlast.last].next].next ∈ rl0, ¬ vs[vs[(rl2 + rl0).butlast.last].next].next ∈ qrl, ¬ vs[vs[(rl2 + rl0).butlast.last].next].next ∈ rl2, ¬ vs[vs[(rl2 + rl0).butlast.last].next].next ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl).last].next ≠ null → vs0[(vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl).last].next = vs[(vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl).last].next ∧ vs0[vs0[(vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl).last].next].val = vs[vs0[(vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl).last].next].val, vs[(rl2 + rl0).butlast.last].next ≠ vhead ∧ vs[(rl2 + rl0).butlast.last].next ∈ rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + rl0 + qrl0 from vhead → tid0 ≠ tid, ∀ r0. r0 ≠ vhead ∧ r0 ∈ rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + rl0 + qrl0 from vhead → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[(rl2 + rl0).butlast.last].next ∨ r = vs[vs[(rl2 + rl0).butlast.last].next].next ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail = (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2).butlast).last = vhead ∧ phead ≠ (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = (rl2 + rl0).butlast.last ∨ phead = vs[(rl2 + rl0).butlast.last].next ∨ phead = vs[vs[(rl2 + rl0).butlast.last].next].next ∨ phead ∈ rl2, phead0 ∈ rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = (rl2 + rl0).butlast.last ∨ phead0 = vs[(rl2 + rl0).butlast.last].next ∨ phead0 = vs[vs[(rl2 + rl0).butlast.last].next].next ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, lst = vs[(rl2 + rl0).butlast.last].next ∨ lst = vs[vs[(rl2 + rl0).butlast.last].next].next ∨ lst ∈ rl2 ∨ lst ∈ qrl, vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [rl2 + rl0, vtail1, rl3]

Additional information

Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: rl2 + rl0, head, tail

Proof step 63 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, rl2 + rl0 = vtail1 + rl3, ps[vs[(rl2 + rl0).butlast.last].next].deqID = Some(othertid), vs0[vs[(rl2 + rl0).butlast.last].next].deqID = Some(tid0), ps0[(rl2 + rl0).butlast.last].deqID = vs[(rl2 + rl0).butlast.last].deqID, vs0[(rl2 + rl0).butlast.last].deqID = vs[(rl2 + rl0).butlast.last].deqID, vs[vs[(rl2 + rl0).butlast.last].next].deqID = Some(othertid), ps[(rl2 + rl0).butlast.last].deqID = vs[(rl2 + rl0).butlast.last].deqID, ps0[vs[(rl2 + rl0).butlast.last].next].next = vs[vs[(rl2 + rl0).butlast.last].next].next, ps[vs[(rl2 + rl0).butlast.last].next].next = vs[vs[(rl2 + rl0).butlast.last].next].next, vs0[(rl2 + rl0).butlast.last].next = vs[(rl2 + rl0).butlast.last].next, ps0[(rl2 + rl0).butlast.last].next = vs[(rl2 + rl0).butlast.last].next, ps[(rl2 + rl0).butlast.last].next = vs[(rl2 + rl0).butlast.last].next, ps[vs[(rl2 + rl0).butlast.last].next].val = vs[vs[(rl2 + rl0).butlast.last].next].val, vs0[(rl2 + rl0).butlast.last].val = ps0[(rl2 + rl0).butlast.last].val, vs[(rl2 + rl0).butlast.last].val = ps0[(rl2 + rl0).butlast.last].val, ps[(rl2 + rl0).butlast.last].val = ps0[(rl2 + rl0).butlast.last].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[(rl2 + rl0).butlast.last].next) = None, owns((rl2 + rl0).butlast.last) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs[(rl2 + rl0).butlast.last].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], rl2 + rl0 ≠ vtail1 ', (rl2 + rl0).butlast.last ≠ vs[vs[(rl2 + rl0).butlast.last].next].next, (rl2 + rl0).butlast.last ≠ vs[(rl2 + rl0).butlast.last].next, (rl2 + rl0).butlast.last ≠ null, (rl2 + rl0).butlast.last ≠ lst, vs[(rl2 + rl0).butlast.last].next ≠ vs[vs[(rl2 + rl0).butlast.last].next].next, vs[(rl2 + rl0).butlast.last].next ≠ null, addr ≠ null, phead0 ≠ (rl2 + rl0).last, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[vs[(rl2 + rl0).butlast.last].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[vs[(rl2 + rl0).butlast.last].next].val), vhead ≠ (rl2 + rl0).butlast.last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl, vs, ps, owns), listp (rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + rl0 + qrl0, vs0, ps0, owns0), listp (rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + qrl, vs, ps, owns), markedp(rl0, ps0), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl0, vs0), markedp(rl1, ps0), markedp(rl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, (rl2 + rl0).butlast.last, vs0), noid (tid, rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + qrl, vhead, vs), nonullRetRefs (rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + rl0 + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs (rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[vs[vs[(rl2 + rl0).butlast.last].next].next].deqID), some?(ps[vs[vs[(rl2 + rl0).butlast.last].next].next].deqID), some?(vs0[vs[vs[(rl2 + rl0).butlast.last].next].next].deqID), some?(ps0[vs[vs[(rl2 + rl0).butlast.last].next].next].deqID), some?(vs[(rl2 + rl0).butlast.last].deqID), some?(ps0[vs[(rl2 + rl0).butlast.last].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vs[(rl2 + rl0).butlast.last].next ∈ ps, vs[(rl2 + rl0).butlast.last].next ∈ vs, (rl2 + rl0).butlast.last ∈ rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + rl0 + qrl0 from vhead, vtail0 ∈ rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + rl0 + qrl0 from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, (rl2 + rl0).butlast.last ∈ vs0, (rl2 + rl0).butlast.last ∈ ps0, (rl2 + rl0).butlast.last ∈ vs, (rl2 + rl0).butlast.last ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(qrl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ weak?(vs[(rl2 + rl0).butlast.last].deqID), ¬ (rl2 + rl0).butlast.last ∈ rl2, ¬ (rl2 + rl0).butlast.last ∈ rl0, ¬ (rl2 + rl0).butlast.last ∈ qrl0, ¬ (rl2 + rl0).butlast.last ∈ qrl, ¬ vs[(rl2 + rl0).butlast.last].next ∈ qrl, ¬ vs[(rl2 + rl0).butlast.last].next ∈ qrl0, ¬ vs[(rl2 + rl0).butlast.last].next ∈ rl0, ¬ vs[(rl2 + rl0).butlast.last].next ∈ rl2, ¬ vs[(rl2 + rl0).butlast.last].next ∈ rl1, ¬ (rl2 + rl0).butlast.last ∈ rl1, ¬ vs[vs[(rl2 + rl0).butlast.last].next].next ∈ qrl0, ¬ vs[vs[(rl2 + rl0).butlast.last].next].next ∈ rl0, ¬ vs[vs[(rl2 + rl0).butlast.last].next].next ∈ qrl, ¬ vs[vs[(rl2 + rl0).butlast.last].next].next ∈ rl2, ¬ vs[vs[(rl2 + rl0).butlast.last].next].next ∈ rl1, vs[(rl2 + rl0).butlast.last].next ≠ vhead ∧ vs[(rl2 + rl0).butlast.last].next ∈ rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + rl0 + qrl0 from vhead → tid0 ≠ tid, vs[(vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl).last].next ≠ null → vs0[(vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl).last].next = vs[(vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl).last].next ∧ vs0[vs0[(vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl).last].next].val = vs[vs0[(vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl).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), ∀ r. r ∈ rl1 ∨ r = vs[(rl2 + rl0).butlast.last].next ∨ r = vs[vs[(rl2 + rl0).butlast.last].next].next ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vhead ∧ r0 ∈ rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + rl0 + qrl0 from vhead → vs0[r0].deqID ≠ Some(tid), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst = vs[(rl2 + rl0).butlast.last].next ∨ lst = vs[vs[(rl2 + rl0).butlast.last].next].next ∨ lst ∈ rl2 ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = (rl2 + rl0).butlast.last ∨ phead0 = vs[(rl2 + rl0).butlast.last].next ∨ phead0 = vs[vs[(rl2 + rl0).butlast.last].next].next ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, phead0 ∈ rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = (rl2 + rl0).butlast.last ∨ phead = vs[(rl2 + rl0).butlast.last].next ∨ phead = vs[vs[(rl2 + rl0).butlast.last].next].next ∨ phead ∈ rl2, (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2).butlast).last = vhead ∧ phead ≠ (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2).last ∧ unmarkedp(qrl, vs), vtail = (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ a + x = a ' + x; (s)

Proof step 64 from proof stable-D27 (previous step) (back to tree)

rl2 + rl0 = vtail1 ' + rl3, qrl + rl = rl0 + qrl0, ps[vs[(rl2 + rl0).butlast.last].next].deqID = Some(othertid), vs0[vs[(rl2 + rl0).butlast.last].next].deqID = Some(tid0), ps0[(rl2 + rl0).butlast.last].deqID = vs[(rl2 + rl0).butlast.last].deqID, vs0[(rl2 + rl0).butlast.last].deqID = vs[(rl2 + rl0).butlast.last].deqID, vs[vs[(rl2 + rl0).butlast.last].next].deqID = Some(othertid), ps[(rl2 + rl0).butlast.last].deqID = vs[(rl2 + rl0).butlast.last].deqID, ps0[vs[(rl2 + rl0).butlast.last].next].next = vs[vs[(rl2 + rl0).butlast.last].next].next, ps[vs[(rl2 + rl0).butlast.last].next].next = vs[vs[(rl2 + rl0).butlast.last].next].next, vs0[(rl2 + rl0).butlast.last].next = vs[(rl2 + rl0).butlast.last].next, ps0[(rl2 + rl0).butlast.last].next = vs[(rl2 + rl0).butlast.last].next, ps[(rl2 + rl0).butlast.last].next = vs[(rl2 + rl0).butlast.last].next, ps[vs[(rl2 + rl0).butlast.last].next].val = vs[vs[(rl2 + rl0).butlast.last].next].val, vs0[(rl2 + rl0).butlast.last].val = ps0[(rl2 + rl0).butlast.last].val, vs[(rl2 + rl0).butlast.last].val = ps0[(rl2 + rl0).butlast.last].val, ps[(rl2 + rl0).butlast.last].val = ps0[(rl2 + rl0).butlast.last].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[(rl2 + rl0).butlast.last].next) = None, owns((rl2 + rl0).butlast.last) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs[(rl2 + rl0).butlast.last].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ vtail1 ', rl2 + rl0 ≠ [], (rl2 + rl0).butlast.last ≠ lst, (rl2 + rl0).butlast.last ≠ null, (rl2 + rl0).butlast.last ≠ vs[(rl2 + rl0).butlast.last].next, (rl2 + rl0).butlast.last ≠ vs[vs[(rl2 + rl0).butlast.last].next].next, vs[(rl2 + rl0).butlast.last].next ≠ null, vs[(rl2 + rl0).butlast.last].next ≠ vs[vs[(rl2 + rl0).butlast.last].next].next, addr ≠ null, phead0 ≠ (rl2 + rl0).last, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[vs[(rl2 + rl0).butlast.last].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[vs[(rl2 + rl0).butlast.last].next].val), vhead ≠ (rl2 + rl0).butlast.last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl, vs, ps, owns), listp (rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + rl0 + qrl0, vs0, ps0, owns0), listp (rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + qrl, vs, ps, owns), markedp(rl0, ps0), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl0, vs0), markedp(rl1, ps0), markedp(rl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, (rl2 + rl0).butlast.last, vs0), noid (tid, rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + qrl, vhead, vs), nonullRetRefs (rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + rl0 + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs (rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[vs[vs[(rl2 + rl0).butlast.last].next].next].deqID), some?(ps[vs[vs[(rl2 + rl0).butlast.last].next].next].deqID), some?(vs0[vs[vs[(rl2 + rl0).butlast.last].next].next].deqID), some?(ps0[vs[vs[(rl2 + rl0).butlast.last].next].next].deqID), some?(vs[(rl2 + rl0).butlast.last].deqID), some?(ps0[vs[(rl2 + rl0).butlast.last].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vs[(rl2 + rl0).butlast.last].next ∈ ps, vs[(rl2 + rl0).butlast.last].next ∈ vs, (rl2 + rl0).butlast.last ∈ rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + rl0 + qrl0 from vhead, vtail0 ∈ rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + rl0 + qrl0 from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, (rl2 + rl0).butlast.last ∈ vs0, (rl2 + rl0).butlast.last ∈ ps0, (rl2 + rl0).butlast.last ∈ vs, (rl2 + rl0).butlast.last ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl0 + qrl0), ¬ dups(qrl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ weak?(vs[(rl2 + rl0).butlast.last].deqID), ¬ vs[vs[(rl2 + rl0).butlast.last].next].next ∈ rl1, ¬ vs[vs[(rl2 + rl0).butlast.last].next].next ∈ rl2, ¬ vs[vs[(rl2 + rl0).butlast.last].next].next ∈ qrl, ¬ vs[vs[(rl2 + rl0).butlast.last].next].next ∈ rl0, ¬ vs[vs[(rl2 + rl0).butlast.last].next].next ∈ qrl0, ¬ (rl2 + rl0).butlast.last ∈ rl1, ¬ vs[(rl2 + rl0).butlast.last].next ∈ rl1, ¬ vs[(rl2 + rl0).butlast.last].next ∈ rl2, ¬ vs[(rl2 + rl0).butlast.last].next ∈ rl0, ¬ vs[(rl2 + rl0).butlast.last].next ∈ qrl0, ¬ vs[(rl2 + rl0).butlast.last].next ∈ qrl, ¬ (rl2 + rl0).butlast.last ∈ qrl, ¬ (rl2 + rl0).butlast.last ∈ qrl0, ¬ (rl2 + rl0).butlast.last ∈ rl0, ¬ (rl2 + rl0).butlast.last ∈ rl2, vs[(rl2 + rl0).butlast.last].next ≠ vhead ∧ vs[(rl2 + rl0).butlast.last].next ∈ rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + rl0 + qrl0 from vhead → tid0 ≠ tid, vs[(vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl).last].next ≠ null → vs0[(vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl).last].next = vs[(vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl).last].next ∧ vs0[vs0[(vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl).last].next].val = vs[vs0[(vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl).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), ∀ r. r ∈ rl1 ∨ r = vs[(rl2 + rl0).butlast.last].next ∨ r = vs[vs[(rl2 + rl0).butlast.last].next].next ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vhead ∧ r0 ∈ rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + rl0 + qrl0 from vhead → vs0[r0].deqID ≠ Some(tid), vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst = vs[(rl2 + rl0).butlast.last].next ∨ lst = vs[vs[(rl2 + rl0).butlast.last].next].next ∨ lst ∈ rl2 ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = (rl2 + rl0).butlast.last ∨ phead0 = vs[(rl2 + rl0).butlast.last].next ∨ phead0 = vs[vs[(rl2 + rl0).butlast.last].next].next ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, phead0 ∈ rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = (rl2 + rl0).butlast.last ∨ phead = vs[(rl2 + rl0).butlast.last].next ∨ phead = vs[vs[(rl2 + rl0).butlast.last].next].next ∨ phead ∈ rl2, (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2).butlast).last = vhead ∧ phead ≠ (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2).last ∧ unmarkedp(qrl, vs), vtail = (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail1 ∈ rl2 ∨ vtail1 ∈ rl0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:bapp, seq: ⊦ y ≠ [] → (x + y).butlast = x + y.butlast, subst:[x, y] → [rl2, rl0], <all paths>

Additional information

Used terms: rl2, rl0

Proof step 65 from proof stable-D27 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).butlast = x + y.butlast

A spec-lemma

Proof step 66 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, rl2 + rl0 = vtail1 ' + rl3, ps[(rl2 + rl0).butlast.last].deqID = vs[(rl2 + rl0).butlast.last].deqID, vs[vs[(rl2 + rl0).butlast.last].next].deqID = Some(othertid), vs0[(rl2 + rl0).butlast.last].deqID = vs[(rl2 + rl0).butlast.last].deqID, ps0[(rl2 + rl0).butlast.last].deqID = vs[(rl2 + rl0).butlast.last].deqID, vs0[vs[(rl2 + rl0).butlast.last].next].deqID = Some(tid0), ps[vs[(rl2 + rl0).butlast.last].next].deqID = Some(othertid), ps[(rl2 + rl0).butlast.last].next = vs[(rl2 + rl0).butlast.last].next, ps0[(rl2 + rl0).butlast.last].next = vs[(rl2 + rl0).butlast.last].next, vs0[(rl2 + rl0).butlast.last].next = vs[(rl2 + rl0).butlast.last].next, ps[vs[(rl2 + rl0).butlast.last].next].next = vs[vs[(rl2 + rl0).butlast.last].next].next, ps0[vs[(rl2 + rl0).butlast.last].next].next = vs[vs[(rl2 + rl0).butlast.last].next].next, ps[(rl2 + rl0).butlast.last].val = ps0[(rl2 + rl0).butlast.last].val, vs[(rl2 + rl0).butlast.last].val = ps0[(rl2 + rl0).butlast.last].val, vs0[(rl2 + rl0).butlast.last].val = ps0[(rl2 + rl0).butlast.last].val, ps[vs[(rl2 + rl0).butlast.last].next].val = vs[vs[(rl2 + rl0).butlast.last].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns((rl2 + rl0).butlast.last) = None, owns(vs[(rl2 + rl0).butlast.last].next) = None, pretRefs(tid) = pretRefs0(tid), rl0 = [], rvowns(pretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs[(rl2 + rl0).butlast.last].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ vtail1 ', rl2 + rl0 ≠ [], (rl2 + rl0).butlast.last ≠ lst, (rl2 + rl0).butlast.last ≠ null, (rl2 + rl0).butlast.last ≠ vs[(rl2 + rl0).butlast.last].next, (rl2 + rl0).butlast.last ≠ vs[vs[(rl2 + rl0).butlast.last].next].next, vs[(rl2 + rl0).butlast.last].next ≠ null, vs[(rl2 + rl0).butlast.last].next ≠ vs[vs[(rl2 + rl0).butlast.last].next].next, addr ≠ null, phead0 ≠ (rl2 + rl0).last, pretRefs0(tid) ≠ null, rvowns(addr) ≠ Claimed(othertid, vs[vs[(rl2 + rl0).butlast.last].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[vs[(rl2 + rl0).butlast.last].next].val), vhead ≠ (rl2 + rl0).butlast.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp (rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + qrl, vs, ps, owns), listp (rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + rl0 + qrl0, vs0, ps0, owns0), listp(vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, (rl2 + rl0).butlast.last, vs0), noid (tid, rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + qrl, vhead, vs), nonullRetRefs (rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs (rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + 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), some?(ps0[vs[(rl2 + rl0).butlast.last].next].deqID), some?(vs[(rl2 + rl0).butlast.last].deqID), some?(ps0[vs[vs[(rl2 + rl0).butlast.last].next].next].deqID), some?(vs0[vs[vs[(rl2 + rl0).butlast.last].next].next].deqID), some?(ps[vs[vs[(rl2 + rl0).butlast.last].next].next].deqID), some?(vs[vs[vs[(rl2 + rl0).butlast.last].next].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), (rl2 + rl0).butlast.last ∈ ps, (rl2 + rl0).butlast.last ∈ vs, (rl2 + rl0).butlast.last ∈ ps0, (rl2 + rl0).butlast.last ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, vtail0 ∈ rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + rl0 + qrl0 from vtail, (rl2 + rl0).butlast.last ∈ rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + rl0 + qrl0 from vhead, vs[(rl2 + rl0).butlast.last].next ∈ vs, vs[(rl2 + rl0).butlast.last].next ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl0 + qrl0), ¬ dups(qrl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ weak?(vs[(rl2 + rl0).butlast.last].deqID), ¬ vs[vs[(rl2 + rl0).butlast.last].next].next ∈ rl1, ¬ vs[vs[(rl2 + rl0).butlast.last].next].next ∈ rl2, ¬ vs[vs[(rl2 + rl0).butlast.last].next].next ∈ qrl, ¬ vs[vs[(rl2 + rl0).butlast.last].next].next ∈ rl0, ¬ vs[vs[(rl2 + rl0).butlast.last].next].next ∈ qrl0, ¬ (rl2 + rl0).butlast.last ∈ rl1, ¬ vs[(rl2 + rl0).butlast.last].next ∈ rl1, ¬ vs[(rl2 + rl0).butlast.last].next ∈ rl2, ¬ vs[(rl2 + rl0).butlast.last].next ∈ rl0, ¬ vs[(rl2 + rl0).butlast.last].next ∈ qrl0, ¬ vs[(rl2 + rl0).butlast.last].next ∈ qrl, ¬ (rl2 + rl0).butlast.last ∈ qrl, ¬ (rl2 + rl0).butlast.last ∈ qrl0, ¬ (rl2 + rl0).butlast.last ∈ rl0, ¬ (rl2 + rl0).butlast.last ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl).last].next ≠ null → vs0[(vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl).last].next = vs[(vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl).last].next ∧ vs0[vs0[(vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl).last].next].val = vs[vs0[(vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl).last].next].val, vs[(rl2 + rl0).butlast.last].next ≠ vhead ∧ vs[(rl2 + rl0).butlast.last].next ∈ rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + rl0 + qrl0 from vhead → tid0 ≠ tid, ∀ r0. r0 ≠ vhead ∧ r0 ∈ rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2) + rl0 + qrl0 from vhead → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[(rl2 + rl0).butlast.last].next ∨ r = vs[vs[(rl2 + rl0).butlast.last].next].next ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail1 ∈ rl2 ∨ vtail1 ∈ rl0, vtail = (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (vs[(rl2 + rl0).butlast.last].next ' + (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2).butlast).last = vhead ∧ phead ≠ (vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = (rl2 + rl0).butlast.last ∨ phead = vs[(rl2 + rl0).butlast.last].next ∨ phead = vs[vs[(rl2 + rl0).butlast.last].next].next ∨ phead ∈ rl2, phead0 ∈ rl1 + (rl2 + rl0).butlast.last ' + vs[(rl2 + rl0).butlast.last].next ' + vs[vs[(rl2 + rl0).butlast.last].next].next ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = (rl2 + rl0).butlast.last ∨ phead0 = vs[(rl2 + rl0).butlast.last].next ∨ phead0 = vs[vs[(rl2 + rl0).butlast.last].next].next ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, lst = vs[(rl2 + rl0).butlast.last].next ∨ lst = vs[vs[(rl2 + rl0).butlast.last].next].next ∨ lst ∈ rl2 ∨ lst ∈ qrl, vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ a ' + x ≠ []; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ x + [] = x; (s) ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

Proof step 67 from proof stable-D27 (previous step) (back to tree)

ps[vs[vs[(vtail1 ' + rl3.butlast).last].next].next].deqID = vs[vs[vs[(vtail1 ' + rl3.butlast).last].next].next].deqID, ps[vs[(vtail1 ' + rl3.butlast).last].next].deqID = Some(othertid), vs0[vs[(vtail1 ' + rl3.butlast).last].next].deqID = Some(tid0), ps0[(vtail1 ' + rl3.butlast).last].deqID = vs[(vtail1 ' + rl3.butlast).last].deqID, vs0[(vtail1 ' + rl3.butlast).last].deqID = vs[(vtail1 ' + rl3.butlast).last].deqID, vs[vs[(vtail1 ' + rl3.butlast).last].next].deqID = Some(othertid), ps[(vtail1 ' + rl3.butlast).last].deqID = vs[(vtail1 ' + rl3.butlast).last].deqID, ps0[vs[vs[(vtail1 ' + rl3.butlast).last].next].next].next = vtail1, ps[vs[vs[(vtail1 ' + rl3.butlast).last].next].next].next = vtail1, ps0[vs[(vtail1 ' + rl3.butlast).last].next].next = vs[vs[(vtail1 ' + rl3.butlast).last].next].next, ps[vs[(vtail1 ' + rl3.butlast).last].next].next = vs[vs[(vtail1 ' + rl3.butlast).last].next].next, vs0[(vtail1 ' + rl3.butlast).last].next = vs[(vtail1 ' + rl3.butlast).last].next, ps0[(vtail1 ' + rl3.butlast).last].next = vs[(vtail1 ' + rl3.butlast).last].next, ps[(vtail1 ' + rl3.butlast).last].next = vs[(vtail1 ' + rl3.butlast).last].next, ps[vs[vs[(vtail1 ' + rl3.butlast).last].next].next].val = vs[vs[vs[(vtail1 ' + rl3.butlast).last].next].next].val, ps[vs[(vtail1 ' + rl3.butlast).last].next].val = vs[vs[(vtail1 ' + rl3.butlast).last].next].val, vs0[(vtail1 ' + rl3.butlast).last].val = ps0[(vtail1 ' + rl3.butlast).last].val, vs[(vtail1 ' + rl3.butlast).last].val = ps0[(vtail1 ' + rl3.butlast).last].val, ps[(vtail1 ' + rl3.butlast).last].val = ps0[(vtail1 ' + rl3.butlast).last].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[vs[(vtail1 ' + rl3.butlast).last].next].next) = None, owns(vs[(vtail1 ' + rl3.butlast).last].next) = None, owns((vtail1 ' + rl3.butlast).last) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs[(vtail1 ' + rl3.butlast).last].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vtail1 = vs[vs[vs[(vtail1 ' + rl3.butlast).last].next].next].next, (vtail1 ' + rl3.butlast).last ≠ vtail1, (vtail1 ' + rl3.butlast).last ≠ lst, (vtail1 ' + rl3.butlast).last ≠ null, (vtail1 ' + rl3.butlast).last ≠ vs[(vtail1 ' + rl3.butlast).last].next, (vtail1 ' + rl3.butlast).last ≠ vs[vs[(vtail1 ' + rl3.butlast).last].next].next, rl3.last ≠ (vtail1 ' + rl3.butlast).last, vs[vs[(vtail1 ' + rl3.butlast).last].next].next ≠ vtail1, vs[(vtail1 ' + rl3.butlast).last].next ≠ vtail1, vs[vs[(vtail1 ' + rl3.butlast).last].next].next ≠ null, vs[(vtail1 ' + rl3.butlast).last].next ≠ null, vs[(vtail1 ' + rl3.butlast).last].next ≠ vs[vs[(vtail1 ' + rl3.butlast).last].next].next, addr ≠ null, phead0 ≠ rl3.last, pretRefs0(tid) ≠ null, rl3 ≠ [], rvowns(addr) ≠ Claimed(othertid, vs[vs[(vtail1 ' + rl3.butlast).last].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[vs[(vtail1 ' + rl3.butlast).last].next].val), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vtail1 ' + rl3 + qrl, vs, ps, owns), listp ( rl1 + (vtail1 ' + rl3.butlast).last ' + vs[(vtail1 ' + rl3.butlast).last].next ' + vs[vs[(vtail1 ' + rl3.butlast).last].next].next ' + vtail1 ' + rl3 + qrl + rl, vs0, ps0, owns0), listp ( rl1 + (vtail1 ' + rl3.butlast).last ' + vs[(vtail1 ' + rl3.butlast).last].next ' + vs[vs[(vtail1 ' + rl3.butlast).last].next].next ' + vtail1 ' + rl3 + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl3, vs), markedp(rl1, ps), markedp(rl3, ps), markedp(rl1, vs0), markedp(rl3, vs0), markedp(rl1, ps0), markedp(rl3, ps0), nextnottid(tid, rl3.last, vs), nextnottidRely(tid, rl3.last, vs, (vtail1 ' + rl3.butlast).last, vs0), noid (tid, rl1 + (vtail1 ' + rl3.butlast).last ' + vs[(vtail1 ' + rl3.butlast).last].next ' + vs[vs[(vtail1 ' + rl3.butlast).last].next].next ' + vtail1 ' + rl3 + qrl, rl3.last, vs), nonullRetRefs ( rl1 + (vtail1 ' + rl3.butlast).last ' + vs[(vtail1 ' + rl3.butlast).last].next ' + vs[vs[(vtail1 ' + rl3.butlast).last].next].next ' + vtail1 ' + rl3 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs ( rl1 + (vtail1 ' + rl3.butlast).last ' + vs[(vtail1 ' + rl3.butlast).last].next ' + vs[vs[(vtail1 ' + rl3.butlast).last].next].next ' + vtail1 ' + rl3 + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[vs[vs[(vtail1 ' + rl3.butlast).last].next].next].deqID), some?(vs0[vs[vs[(vtail1 ' + rl3.butlast).last].next].next].deqID), some?(ps0[vs[vs[(vtail1 ' + rl3.butlast).last].next].next].deqID), some?(vs[(vtail1 ' + rl3.butlast).last].deqID), some?(ps0[vs[(vtail1 ' + rl3.butlast).last].next].deqID), some?(vs[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), unmarkedp(rl, vs0), unmarkedp(qrl, vs0), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), unmarkedp(qrl, ps), vs[(vtail1 ' + rl3.butlast).last].next ∈ ps, vs[(vtail1 ' + rl3.butlast).last].next ∈ vs, (vtail1 ' + rl3.butlast).last ∈ rl1 + (vtail1 ' + rl3.butlast).last ' + vs[(vtail1 ' + rl3.butlast).last].next ' + vs[vs[(vtail1 ' + rl3.butlast).last].next].next ' + vtail1 ' + rl3 + qrl + rl from rl3.last, vtail0 ∈ rl1 + (vtail1 ' + rl3.butlast).last ' + vs[(vtail1 ' + rl3.butlast).last].next ' + vs[vs[(vtail1 ' + rl3.butlast).last].next].next ' + vtail1 ' + rl3 + qrl + rl from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + (vtail1 ' + rl3.butlast).last ' + vs[(vtail1 ' + rl3.butlast).last].next ' + vs[vs[(vtail1 ' + rl3.butlast).last].next].next ' + vtail1 ' + rl3 + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, (vtail1 ' + rl3.butlast).last ∈ vs0, (vtail1 ' + rl3.butlast).last ∈ ps0, (vtail1 ' + rl3.butlast).last ∈ vs, (vtail1 ' + rl3.butlast).last ∈ ps, vs[vs[(vtail1 ' + rl3.butlast).last].next].next ∈ ps, vs[vs[(vtail1 ' + rl3.butlast).last].next].next ∈ vs, dom prvHp ⊆ dom prvHp0, ¬ dups(rl3), ¬ dups(rl), ¬ dups(qrl + rl), ¬ dups(rl3 + qrl + rl), ¬ dups(qrl), ¬ dups(rl1 + rl3), ¬ dups(rl3 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl3 + qrl), ¬ dups(rl1 + rl3 + qrl + rl), ¬ weak?(vs[(vtail1 ' + rl3.butlast).last].deqID), ¬ weak?(vs[vs[vs[(vtail1 ' + rl3.butlast).last].next].next].deqID), ¬ vs[vs[(vtail1 ' + rl3.butlast).last].next].next ∈ rl1, ¬ vs[vs[(vtail1 ' + rl3.butlast).last].next].next ∈ rl3, ¬ vs[vs[(vtail1 ' + rl3.butlast).last].next].next ∈ rl, ¬ vs[vs[(vtail1 ' + rl3.butlast).last].next].next ∈ qrl, ¬ (vtail1 ' + rl3.butlast).last ∈ rl1, ¬ vs[(vtail1 ' + rl3.butlast).last].next ∈ rl1, ¬ vs[(vtail1 ' + rl3.butlast).last].next ∈ rl3, ¬ vs[(vtail1 ' + rl3.butlast).last].next ∈ rl, ¬ vs[(vtail1 ' + rl3.butlast).last].next ∈ qrl, ¬ (vtail1 ' + rl3.butlast).last ∈ rl, ¬ (vtail1 ' + rl3.butlast).last ∈ qrl, ¬ (vtail1 ' + rl3.butlast).last ∈ rl3, ¬ vtail1 ∈ rl, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ rl3, ¬ vtail1 ∈ rl1, vs[rl3.last].next ≠ null ∧ vs[vs[rl3.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[rl3.last].next].deqID.tid)) = Claimed(vs[vs[rl3.last].next].deqID.tid, vs[vs[rl3.last].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[(vtail1 ' + rl3.butlast).last].next ≠ rl3.last ∧ vs[(vtail1 ' + rl3.butlast).last].next ∈ rl1 + (vtail1 ' + rl3.butlast).last ' + vs[(vtail1 ' + rl3.butlast).last].next ' + vs[vs[(vtail1 ' + rl3.butlast).last].next].next ' + vtail1 ' + rl3 + qrl + rl from rl3.last → tid0 ≠ tid, vs[(rl3 + qrl).last].next ≠ null → vs0[(rl3 + qrl).last].next = vs[(rl3 + qrl).last].next ∧ vs0[vs0[(rl3 + qrl).last].next].val = vs[vs0[(rl3 + qrl).last].next].val, ∀ r. r ∈ rl1 ∨ r = vs[(vtail1 ' + rl3.butlast).last].next ∨ r = vs[vs[(vtail1 ' + rl3.butlast).last].next].next ∨ r = vtail1 ∨ r ∈ rl3 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ rl3.last ∧ r0 ∈ rl1 + (vtail1 ' + rl3.butlast).last ' + vs[(vtail1 ' + rl3.butlast).last].next ' + vs[vs[(vtail1 ' + rl3.butlast).last].next].next ' + vtail1 ' + rl3 + qrl + rl from rl3.last → vs0[r0].deqID ≠ Some(tid), lst = vs[(vtail1 ' + rl3.butlast).last].next ∨ lst = vs[vs[(vtail1 ' + rl3.butlast).last].next].next ∨ lst = vtail1 ∨ lst ∈ rl3 ∨ lst ∈ qrl, vtail0 = (rl3 + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (rl3 + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, phead0 ∈ rl1 ∨ phead0 = (vtail1 ' + rl3.butlast).last ∨ phead0 = vs[(vtail1 ' + rl3.butlast).last].next ∨ phead0 = vs[vs[(vtail1 ' + rl3.butlast).last].next].next ∨ phead0 = vtail1 ∨ phead0 ∈ rl3, phead0 ∈ rl1 + (vtail1 ' + rl3.butlast).last ' + vs[(vtail1 ' + rl3.butlast).last].next ' + vs[vs[(vtail1 ' + rl3.butlast).last].next].next ' + vtail1 ' + rl3 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, phead ∈ rl1 ∨ phead = (vtail1 ' + rl3.butlast).last ∨ phead = vs[(vtail1 ' + rl3.butlast).last].next ∨ phead = vs[vs[(vtail1 ' + rl3.butlast).last].next].next ∨ phead = vtail1 ∨ phead ∈ rl3, vtail = (rl3 + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl3 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [rl3, phead1, qrl0]

Additional information

Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl3, phead1, y

Proof step 68 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, rl2 + rl0 = vtail1 ' + rl3, ps[(rl2 + rl0.butlast).last].deqID = vs[(rl2 + rl0.butlast).last].deqID, vs[vs[(rl2 + rl0.butlast).last].next].deqID = Some(othertid), vs0[(rl2 + rl0.butlast).last].deqID = vs[(rl2 + rl0.butlast).last].deqID, ps0[(rl2 + rl0.butlast).last].deqID = vs[(rl2 + rl0.butlast).last].deqID, vs0[vs[(rl2 + rl0.butlast).last].next].deqID = Some(tid0), ps[vs[(rl2 + rl0.butlast).last].next].deqID = Some(othertid), ps[(rl2 + rl0.butlast).last].next = vs[(rl2 + rl0.butlast).last].next, ps0[(rl2 + rl0.butlast).last].next = vs[(rl2 + rl0.butlast).last].next, vs0[(rl2 + rl0.butlast).last].next = vs[(rl2 + rl0.butlast).last].next, ps[vs[(rl2 + rl0.butlast).last].next].next = vs[vs[(rl2 + rl0.butlast).last].next].next, ps0[vs[(rl2 + rl0.butlast).last].next].next = vs[vs[(rl2 + rl0.butlast).last].next].next, ps[(rl2 + rl0.butlast).last].val = ps0[(rl2 + rl0.butlast).last].val, vs[(rl2 + rl0.butlast).last].val = ps0[(rl2 + rl0.butlast).last].val, vs0[(rl2 + rl0.butlast).last].val = ps0[(rl2 + rl0.butlast).last].val, ps[vs[(rl2 + rl0.butlast).last].next].val = vs[vs[(rl2 + rl0.butlast).last].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns((rl2 + rl0.butlast).last) = None, owns(vs[(rl2 + rl0.butlast).last].next) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs[(rl2 + rl0.butlast).last].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ vtail1 ', rl2 + rl0 ≠ [], (rl2 + rl0.butlast).last ≠ lst, (rl2 + rl0.butlast).last ≠ null, (rl2 + rl0.butlast).last ≠ vs[(rl2 + rl0.butlast).last].next, (rl2 + rl0.butlast).last ≠ vs[vs[(rl2 + rl0.butlast).last].next].next, vs[(rl2 + rl0.butlast).last].next ≠ null, vs[(rl2 + rl0.butlast).last].next ≠ vs[vs[(rl2 + rl0.butlast).last].next].next, addr ≠ null, phead0 ≠ (rl2 + rl0).last, pretRefs0(tid) ≠ null, rl0 ≠ [], rvowns(addr) ≠ Claimed(othertid, vs[vs[(rl2 + rl0.butlast).last].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[vs[(rl2 + rl0.butlast).last].next].val), vhead ≠ (rl2 + rl0.butlast).last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp (rl1 + (rl2 + rl0.butlast).last ' + vs[(rl2 + rl0.butlast).last].next ' + (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2) + qrl, vs, ps, owns), listp (rl1 + (rl2 + rl0.butlast).last ' + vs[(rl2 + rl0.butlast).last].next ' + (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2) + rl0 + qrl0, vs0, ps0, owns0), listp(vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, (rl2 + rl0.butlast).last, vs0), noid (tid, rl1 + (rl2 + rl0.butlast).last ' + vs[(rl2 + rl0.butlast).last].next ' + (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2) + qrl, vhead, vs), nonullRetRefs (rl1 + (rl2 + rl0.butlast).last ' + vs[(rl2 + rl0.butlast).last].next ' + (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs (rl1 + (rl2 + rl0.butlast).last ' + vs[(rl2 + rl0.butlast).last].next ' + (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2) + 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), some?(ps0[vs[(rl2 + rl0.butlast).last].next].deqID), some?(vs[(rl2 + rl0.butlast).last].deqID), some?(ps0[vs[vs[(rl2 + rl0.butlast).last].next].next].deqID), some?(vs0[vs[vs[(rl2 + rl0.butlast).last].next].next].deqID), some?(ps[vs[vs[(rl2 + rl0.butlast).last].next].next].deqID), some?(vs[vs[vs[(rl2 + rl0.butlast).last].next].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), (rl2 + rl0.butlast).last ∈ ps, (rl2 + rl0.butlast).last ∈ vs, (rl2 + rl0.butlast).last ∈ ps0, (rl2 + rl0.butlast).last ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + (rl2 + rl0.butlast).last ' + vs[(rl2 + rl0.butlast).last].next ' + (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, vtail0 ∈ rl1 + (rl2 + rl0.butlast).last ' + vs[(rl2 + rl0.butlast).last].next ' + (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2) + rl0 + qrl0 from vtail, (rl2 + rl0.butlast).last ∈ rl1 + (rl2 + rl0.butlast).last ' + vs[(rl2 + rl0.butlast).last].next ' + (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2) + rl0 + qrl0 from vhead, vs[(rl2 + rl0.butlast).last].next ∈ vs, vs[(rl2 + rl0.butlast).last].next ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl0 + qrl0), ¬ dups(qrl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ weak?(vs[(rl2 + rl0.butlast).last].deqID), ¬ vs[vs[(rl2 + rl0.butlast).last].next].next ∈ rl1, ¬ vs[vs[(rl2 + rl0.butlast).last].next].next ∈ rl2, ¬ vs[vs[(rl2 + rl0.butlast).last].next].next ∈ qrl, ¬ vs[vs[(rl2 + rl0.butlast).last].next].next ∈ rl0, ¬ vs[vs[(rl2 + rl0.butlast).last].next].next ∈ qrl0, ¬ (rl2 + rl0.butlast).last ∈ rl1, ¬ vs[(rl2 + rl0.butlast).last].next ∈ rl1, ¬ vs[(rl2 + rl0.butlast).last].next ∈ rl2, ¬ vs[(rl2 + rl0.butlast).last].next ∈ rl0, ¬ vs[(rl2 + rl0.butlast).last].next ∈ qrl0, ¬ vs[(rl2 + rl0.butlast).last].next ∈ qrl, ¬ (rl2 + rl0.butlast).last ∈ qrl, ¬ (rl2 + rl0.butlast).last ∈ qrl0, ¬ (rl2 + rl0.butlast).last ∈ rl0, ¬ (rl2 + rl0.butlast).last ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2 + qrl).last].next ≠ null → vs0[(vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2 + qrl).last].next = vs[(vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2 + qrl).last].next ∧ vs0[vs0[(vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2 + qrl).last].next].val = vs[vs0[(vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2 + qrl).last].next].val, vs[(rl2 + rl0.butlast).last].next ≠ vhead ∧ vs[(rl2 + rl0.butlast).last].next ∈ rl1 + (rl2 + rl0.butlast).last ' + vs[(rl2 + rl0.butlast).last].next ' + (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2) + rl0 + qrl0 from vhead → tid0 ≠ tid, ∀ r0. r0 ≠ vhead ∧ r0 ∈ rl1 + (rl2 + rl0.butlast).last ' + vs[(rl2 + rl0.butlast).last].next ' + (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2) + rl0 + qrl0 from vhead → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[(rl2 + rl0.butlast).last].next ∨ r = vs[vs[(rl2 + rl0.butlast).last].next].next ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail1 ∈ rl2 ∨ vtail1 ∈ rl0, vtail = (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (vs[(rl2 + rl0.butlast).last].next ' + (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2).butlast).last = vhead ∧ phead ≠ (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = (rl2 + rl0.butlast).last ∨ phead = vs[(rl2 + rl0.butlast).last].next ∨ phead = vs[vs[(rl2 + rl0.butlast).last].next].next ∨ phead ∈ rl2, phead0 ∈ rl1 + (rl2 + rl0.butlast).last ' + vs[(rl2 + rl0.butlast).last].next ' + vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = (rl2 + rl0.butlast).last ∨ phead0 = vs[(rl2 + rl0.butlast).last].next ∨ phead0 = vs[vs[(rl2 + rl0.butlast).last].next].next ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, lst = vs[(rl2 + rl0.butlast).last].next ∨ lst = vs[vs[(rl2 + rl0.butlast).last].next].next ∨ lst ∈ rl2 ∨ lst ∈ qrl, vtail0 = ((rl2 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((rl2 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s)

Proof step 69 from proof stable-D27 (previous step) (back to tree)

rl2 + rl0 = vtail1 ' + rl3, qrl + rl = rl0 + qrl0, ps[vs[(rl2 + rl0.butlast).last].next].deqID = Some(othertid), vs0[vs[(rl2 + rl0.butlast).last].next].deqID = Some(tid0), ps0[(rl2 + rl0.butlast).last].deqID = vs[(rl2 + rl0.butlast).last].deqID, vs0[(rl2 + rl0.butlast).last].deqID = vs[(rl2 + rl0.butlast).last].deqID, vs[vs[(rl2 + rl0.butlast).last].next].deqID = Some(othertid), ps[(rl2 + rl0.butlast).last].deqID = vs[(rl2 + rl0.butlast).last].deqID, ps0[vs[(rl2 + rl0.butlast).last].next].next = vs[vs[(rl2 + rl0.butlast).last].next].next, ps[vs[(rl2 + rl0.butlast).last].next].next = vs[vs[(rl2 + rl0.butlast).last].next].next, vs0[(rl2 + rl0.butlast).last].next = vs[(rl2 + rl0.butlast).last].next, ps0[(rl2 + rl0.butlast).last].next = vs[(rl2 + rl0.butlast).last].next, ps[(rl2 + rl0.butlast).last].next = vs[(rl2 + rl0.butlast).last].next, ps[vs[(rl2 + rl0.butlast).last].next].val = vs[vs[(rl2 + rl0.butlast).last].next].val, vs0[(rl2 + rl0.butlast).last].val = ps0[(rl2 + rl0.butlast).last].val, vs[(rl2 + rl0.butlast).last].val = ps0[(rl2 + rl0.butlast).last].val, ps[(rl2 + rl0.butlast).last].val = ps0[(rl2 + rl0.butlast).last].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[(rl2 + rl0.butlast).last].next) = None, owns((rl2 + rl0.butlast).last) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs[(rl2 + rl0.butlast).last].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ vtail1 ', rl2 + rl0 ≠ [], (rl2 + rl0.butlast).last ≠ lst, (rl2 + rl0.butlast).last ≠ null, (rl2 + rl0.butlast).last ≠ vs[(rl2 + rl0.butlast).last].next, (rl2 + rl0.butlast).last ≠ vs[vs[(rl2 + rl0.butlast).last].next].next, vs[(rl2 + rl0.butlast).last].next ≠ null, vs[(rl2 + rl0.butlast).last].next ≠ vs[vs[(rl2 + rl0.butlast).last].next].next, addr ≠ null, phead0 ≠ rl0.last, pretRefs0(tid) ≠ null, rl0 ≠ [], rvowns(addr) ≠ Claimed(othertid, vs[vs[(rl2 + rl0.butlast).last].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[vs[(rl2 + rl0.butlast).last].next].val), vhead ≠ (rl2 + rl0.butlast).last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2 + qrl, vs, ps, owns), listp (rl1 + (rl2 + rl0.butlast).last ' + vs[(rl2 + rl0.butlast).last].next ' + (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2) + rl0 + qrl0, vs0, ps0, owns0), listp (rl1 + (rl2 + rl0.butlast).last ' + vs[(rl2 + rl0.butlast).last].next ' + (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2) + qrl, vs, ps, owns), markedp(rl0, ps0), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl0, vs0), markedp(rl1, ps0), markedp(rl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, (rl2 + rl0.butlast).last, vs0), noid (tid, rl1 + (rl2 + rl0.butlast).last ' + vs[(rl2 + rl0.butlast).last].next ' + (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2) + qrl, vhead, vs), nonullRetRefs (rl1 + (rl2 + rl0.butlast).last ' + vs[(rl2 + rl0.butlast).last].next ' + (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2) + rl0 + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs (rl1 + (rl2 + rl0.butlast).last ' + vs[(rl2 + rl0.butlast).last].next ' + (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[vs[vs[(rl2 + rl0.butlast).last].next].next].deqID), some?(ps[vs[vs[(rl2 + rl0.butlast).last].next].next].deqID), some?(vs0[vs[vs[(rl2 + rl0.butlast).last].next].next].deqID), some?(ps0[vs[vs[(rl2 + rl0.butlast).last].next].next].deqID), some?(vs[(rl2 + rl0.butlast).last].deqID), some?(ps0[vs[(rl2 + rl0.butlast).last].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vs[(rl2 + rl0.butlast).last].next ∈ ps, vs[(rl2 + rl0.butlast).last].next ∈ vs, (rl2 + rl0.butlast).last ∈ rl1 + (rl2 + rl0.butlast).last ' + vs[(rl2 + rl0.butlast).last].next ' + (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2) + rl0 + qrl0 from vhead, vtail0 ∈ rl1 + (rl2 + rl0.butlast).last ' + vs[(rl2 + rl0.butlast).last].next ' + (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2) + rl0 + qrl0 from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + (rl2 + rl0.butlast).last ' + vs[(rl2 + rl0.butlast).last].next ' + (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, (rl2 + rl0.butlast).last ∈ vs0, (rl2 + rl0.butlast).last ∈ ps0, (rl2 + rl0.butlast).last ∈ vs, (rl2 + rl0.butlast).last ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl0 + qrl0), ¬ dups(qrl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ weak?(vs[(rl2 + rl0.butlast).last].deqID), ¬ vs[vs[(rl2 + rl0.butlast).last].next].next ∈ rl1, ¬ vs[vs[(rl2 + rl0.butlast).last].next].next ∈ rl2, ¬ vs[vs[(rl2 + rl0.butlast).last].next].next ∈ qrl, ¬ vs[vs[(rl2 + rl0.butlast).last].next].next ∈ rl0, ¬ vs[vs[(rl2 + rl0.butlast).last].next].next ∈ qrl0, ¬ (rl2 + rl0.butlast).last ∈ rl1, ¬ vs[(rl2 + rl0.butlast).last].next ∈ rl1, ¬ vs[(rl2 + rl0.butlast).last].next ∈ rl2, ¬ vs[(rl2 + rl0.butlast).last].next ∈ rl0, ¬ vs[(rl2 + rl0.butlast).last].next ∈ qrl0, ¬ vs[(rl2 + rl0.butlast).last].next ∈ qrl, ¬ (rl2 + rl0.butlast).last ∈ qrl, ¬ (rl2 + rl0.butlast).last ∈ qrl0, ¬ (rl2 + rl0.butlast).last ∈ rl0, ¬ (rl2 + rl0.butlast).last ∈ rl2, vs[(rl2 + rl0.butlast).last].next ≠ vhead ∧ vs[(rl2 + rl0.butlast).last].next ∈ rl1 + (rl2 + rl0.butlast).last ' + vs[(rl2 + rl0.butlast).last].next ' + (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2) + rl0 + qrl0 from vhead → tid0 ≠ tid, vs[(vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2 + qrl).last].next ≠ null → vs0[(vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2 + qrl).last].next = vs[(vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2 + qrl).last].next ∧ vs0[vs0[(vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2 + qrl).last].next].val = vs[vs0[(vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2 + qrl).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), ∀ r. r ∈ rl1 ∨ r = vs[(rl2 + rl0.butlast).last].next ∨ r = vs[vs[(rl2 + rl0.butlast).last].next].next ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vhead ∧ r0 ∈ rl1 + (rl2 + rl0.butlast).last ' + vs[(rl2 + rl0.butlast).last].next ' + (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2) + rl0 + qrl0 from vhead → vs0[r0].deqID ≠ Some(tid), lst = vs[(rl2 + rl0.butlast).last].next ∨ lst = vs[vs[(rl2 + rl0.butlast).last].next].next ∨ lst ∈ rl2 ∨ lst ∈ qrl, phead0 ∈ rl1 ∨ phead0 = (rl2 + rl0.butlast).last ∨ phead0 = vs[(rl2 + rl0.butlast).last].next ∨ phead0 = vs[vs[(rl2 + rl0.butlast).last].next].next ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, phead0 ∈ rl1 + (rl2 + rl0.butlast).last ' + vs[(rl2 + rl0.butlast).last].next ' + vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = (rl2 + rl0.butlast).last ∨ phead = vs[(rl2 + rl0.butlast).last].next ∨ phead = vs[vs[(rl2 + rl0.butlast).last].next].next ∨ phead ∈ rl2, (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (vs[(rl2 + rl0.butlast).last].next ' + (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2).butlast).last = vhead ∧ phead ≠ (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2).last ∧ unmarkedp(qrl, vs), vtail = (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[vs[(rl2 + rl0.butlast).last].next].next ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail1 ∈ rl2 ∨ vtail1 ∈ rl0, vtail0 = (rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [rl0, vhead0, qrl1]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl0, vhead0, y

Proof step 70 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, rl2 + rl0 = vtail1 ' + rl3, ps[(rl2 + qrl1).last].deqID = vs[(rl2 + qrl1).last].deqID, vs[vs[(rl2 + qrl1).last].next].deqID = Some(othertid), vs0[(rl2 + qrl1).last].deqID = vs[(rl2 + qrl1).last].deqID, ps0[(rl2 + qrl1).last].deqID = vs[(rl2 + qrl1).last].deqID, vs0[vs[(rl2 + qrl1).last].next].deqID = Some(tid0), ps[vs[(rl2 + qrl1).last].next].deqID = Some(othertid), ps[(rl2 + qrl1).last].next = vs[(rl2 + qrl1).last].next, ps0[(rl2 + qrl1).last].next = vs[(rl2 + qrl1).last].next, vs0[(rl2 + qrl1).last].next = vs[(rl2 + qrl1).last].next, ps[vs[(rl2 + qrl1).last].next].next = vs[vs[(rl2 + qrl1).last].next].next, ps0[vs[(rl2 + qrl1).last].next].next = vs[vs[(rl2 + qrl1).last].next].next, ps[(rl2 + qrl1).last].val = ps0[(rl2 + qrl1).last].val, vs[(rl2 + qrl1).last].val = ps0[(rl2 + qrl1).last].val, vs0[(rl2 + qrl1).last].val = ps0[(rl2 + qrl1).last].val, ps[vs[(rl2 + qrl1).last].next].val = vs[vs[(rl2 + qrl1).last].next].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns((rl2 + qrl1).last) = None, owns(vs[(rl2 + qrl1).last].next) = None, pretRefs(tid) = pretRefs0(tid), rl0 = qrl1 + vhead0 ', rvowns(pretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs[(rl2 + qrl1).last].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ vtail1 ', rl2 + rl0 ≠ [], (rl2 + qrl1).last ≠ lst, (rl2 + qrl1).last ≠ null, (rl2 + qrl1).last ≠ vs[(rl2 + qrl1).last].next, (rl2 + qrl1).last ≠ vs[vs[(rl2 + qrl1).last].next].next, vs[(rl2 + qrl1).last].next ≠ null, vs[(rl2 + qrl1).last].next ≠ vs[vs[(rl2 + qrl1).last].next].next, addr ≠ null, phead0 ≠ vhead0, pretRefs0(tid) ≠ null, rl0 ≠ [], rvowns(addr) ≠ Claimed(othertid, vs[vs[(rl2 + qrl1).last].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[vs[(rl2 + qrl1).last].next].val), vhead ≠ (rl2 + qrl1).last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + (rl2 + qrl1).last ' + vs[(rl2 + qrl1).last].next ' + (vs[vs[(rl2 + qrl1).last].next].next ' + rl2) + qrl, vs, ps, owns), listp(rl1 + (rl2 + qrl1).last ' + vs[(rl2 + qrl1).last].next ' + (vs[vs[(rl2 + qrl1).last].next].next ' + rl2) + rl0 + qrl0, vs0, ps0, owns0), listp(vs[vs[(rl2 + qrl1).last].next].next ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, (rl2 + qrl1).last, vs0), noid(tid, rl1 + (rl2 + qrl1).last ' + vs[(rl2 + qrl1).last].next ' + (vs[vs[(rl2 + qrl1).last].next].next ' + rl2) + qrl, vhead, vs), nonullRetRefs(rl1 + (rl2 + qrl1).last ' + vs[(rl2 + qrl1).last].next ' + (vs[vs[(rl2 + qrl1).last].next].next ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs (rl1 + (rl2 + qrl1).last ' + vs[(rl2 + qrl1).last].next ' + (vs[vs[(rl2 + qrl1).last].next].next ' + rl2) + 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), some?(ps0[vs[(rl2 + qrl1).last].next].deqID), some?(vs[(rl2 + qrl1).last].deqID), some?(ps0[vs[vs[(rl2 + qrl1).last].next].next].deqID), some?(vs0[vs[vs[(rl2 + qrl1).last].next].next].deqID), some?(ps[vs[vs[(rl2 + qrl1).last].next].next].deqID), some?(vs[vs[vs[(rl2 + qrl1).last].next].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), (rl2 + qrl1).last ∈ ps, (rl2 + qrl1).last ∈ vs, (rl2 + qrl1).last ∈ ps0, (rl2 + qrl1).last ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + (rl2 + qrl1).last ' + vs[(rl2 + qrl1).last].next ' + (vs[vs[(rl2 + qrl1).last].next].next ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, vtail0 ∈ rl1 + (rl2 + qrl1).last ' + vs[(rl2 + qrl1).last].next ' + (vs[vs[(rl2 + qrl1).last].next].next ' + rl2) + rl0 + qrl0 from vtail, (rl2 + qrl1).last ∈ rl1 + (rl2 + qrl1).last ' + vs[(rl2 + qrl1).last].next ' + (vs[vs[(rl2 + qrl1).last].next].next ' + rl2) + rl0 + qrl0 from vhead, vs[(rl2 + qrl1).last].next ∈ vs, vs[(rl2 + qrl1).last].next ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl0 + qrl0), ¬ dups(qrl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ weak?(vs[(rl2 + qrl1).last].deqID), ¬ vs[vs[(rl2 + qrl1).last].next].next ∈ rl1, ¬ vs[vs[(rl2 + qrl1).last].next].next ∈ rl2, ¬ vs[vs[(rl2 + qrl1).last].next].next ∈ qrl, ¬ vs[vs[(rl2 + qrl1).last].next].next ∈ rl0, ¬ vs[vs[(rl2 + qrl1).last].next].next ∈ qrl0, ¬ (rl2 + qrl1).last ∈ rl1, ¬ vs[(rl2 + qrl1).last].next ∈ rl1, ¬ vs[(rl2 + qrl1).last].next ∈ rl2, ¬ vs[(rl2 + qrl1).last].next ∈ rl0, ¬ vs[(rl2 + qrl1).last].next ∈ qrl0, ¬ vs[(rl2 + qrl1).last].next ∈ qrl, ¬ (rl2 + qrl1).last ∈ qrl, ¬ (rl2 + qrl1).last ∈ qrl0, ¬ (rl2 + qrl1).last ∈ rl0, ¬ (rl2 + qrl1).last ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(vs[vs[(rl2 + qrl1).last].next].next ' + rl2 + qrl).last].next ≠ null → vs0[(vs[vs[(rl2 + qrl1).last].next].next ' + rl2 + qrl).last].next = vs[(vs[vs[(rl2 + qrl1).last].next].next ' + rl2 + qrl).last].next ∧ vs0[vs0[(vs[vs[(rl2 + qrl1).last].next].next ' + rl2 + qrl).last].next].val = vs[vs0[(vs[vs[(rl2 + qrl1).last].next].next ' + rl2 + qrl).last].next].val, vs[(rl2 + qrl1).last].next ≠ vhead ∧ vs[(rl2 + qrl1).last].next ∈ rl1 + (rl2 + qrl1).last ' + vs[(rl2 + qrl1).last].next ' + (vs[vs[(rl2 + qrl1).last].next].next ' + rl2) + rl0 + qrl0 from vhead → tid0 ≠ tid, ∀ r0. r0 ≠ vhead ∧ r0 ∈ rl1 + (rl2 + qrl1).last ' + vs[(rl2 + qrl1).last].next ' + (vs[vs[(rl2 + qrl1).last].next].next ' + rl2) + rl0 + qrl0 from vhead → vs0[r0].deqID ≠ Some(tid), ∀ r. r ∈ rl1 ∨ r = vs[(rl2 + qrl1).last].next ∨ r = vs[vs[(rl2 + qrl1).last].next].next ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail0 = (rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail1 ∈ rl2 ∨ vtail1 ∈ rl0, vtail = (vs[vs[(rl2 + qrl1).last].next].next ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[vs[(rl2 + qrl1).last].next].next ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (vs[vs[(rl2 + qrl1).last].next].next ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (vs[(rl2 + qrl1).last].next ' + (vs[vs[(rl2 + qrl1).last].next].next ' + rl2).butlast).last = vhead ∧ phead ≠ (vs[vs[(rl2 + qrl1).last].next].next ' + rl2).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = (rl2 + qrl1).last ∨ phead = vs[(rl2 + qrl1).last].next ∨ phead = vs[vs[(rl2 + qrl1).last].next].next ∨ phead ∈ rl2, phead0 ∈ rl1 + (rl2 + qrl1).last ' + vs[(rl2 + qrl1).last].next ' + vs[vs[(rl2 + qrl1).last].next].next ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ rl1 ∨ phead0 = (rl2 + qrl1).last ∨ phead0 = vs[(rl2 + qrl1).last].next ∨ phead0 = vs[vs[(rl2 + qrl1).last].next].next ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, lst = vs[(rl2 + qrl1).last].next ∨ lst = vs[vs[(rl2 + qrl1).last].next].next ∨ lst ∈ rl2 ∨ lst ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) inapp-07: ⊦ a ' + x = y + b ' ∧ x ≠ [] → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 71 from proof stable-D27 (previous step) (back to tree)

rl2 + qrl1 + vhead0 ' = vtail1 ' + rl3, qrl + rl = (qrl1 + vhead0 ') + qrl0, ps[vs[(rl2 + qrl1).last].next].deqID = Some(othertid), vs0[vs[(rl2 + qrl1).last].next].deqID = Some(tid0), ps0[(rl2 + qrl1).last].deqID = vs[(rl2 + qrl1).last].deqID, vs0[(rl2 + qrl1).last].deqID = vs[(rl2 + qrl1).last].deqID, vs[vs[(rl2 + qrl1).last].next].deqID = Some(othertid), ps[(rl2 + qrl1).last].deqID = vs[(rl2 + qrl1).last].deqID, ps0[vs[(rl2 + qrl1).last].next].next = vs[vs[(rl2 + qrl1).last].next].next, ps[vs[(rl2 + qrl1).last].next].next = vs[vs[(rl2 + qrl1).last].next].next, vs0[(rl2 + qrl1).last].next = vs[(rl2 + qrl1).last].next, ps0[(rl2 + qrl1).last].next = vs[(rl2 + qrl1).last].next, ps[(rl2 + qrl1).last].next = vs[(rl2 + qrl1).last].next, ps[vs[(rl2 + qrl1).last].next].val = vs[vs[(rl2 + qrl1).last].next].val, vs0[(rl2 + qrl1).last].val = ps0[(rl2 + qrl1).last].val, vs[(rl2 + qrl1).last].val = ps0[(rl2 + qrl1).last].val, ps[(rl2 + qrl1).last].val = ps0[(rl2 + qrl1).last].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[(rl2 + qrl1).last].next) = None, owns((rl2 + qrl1).last) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid0)) = Claimed(tid0, vs0[vs[(rl2 + qrl1).last].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), (rl2 + qrl1).last ≠ lst, (rl2 + qrl1).last ≠ null, (rl2 + qrl1).last ≠ vs[(rl2 + qrl1).last].next, (rl2 + qrl1).last ≠ vs[vs[(rl2 + qrl1).last].next].next, (rl2 + qrl1).last ≠ vhead0, vs[(rl2 + qrl1).last].next ≠ null, vs[(rl2 + qrl1).last].next ≠ vs[vs[(rl2 + qrl1).last].next].next, vs[vs[(rl2 + qrl1).last].next].next ≠ vhead0, vs[(rl2 + qrl1).last].next ≠ vhead0, addr ≠ null, phead0 ≠ vhead0, pretRefs0(tid) ≠ null, rl3 ≠ [], rvowns(addr) ≠ Claimed(othertid, vs[vs[(rl2 + qrl1).last].next].val), rvowns0(addr) ≠ Claimed(othertid, vs[vs[(rl2 + qrl1).last].next].val), vhead ≠ (rl2 + qrl1).last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(vs[vs[(rl2 + qrl1).last].next].next ' + rl2 + qrl, vs, ps, owns), listp(rl1 + (rl2 + qrl1).last ' + vs[(rl2 + qrl1).last].next ' + (vs[vs[(rl2 + qrl1).last].next].next ' + rl2) + qrl + rl, vs0, ps0, owns0), listp(rl1 + (rl2 + qrl1).last ' + vs[(rl2 + qrl1).last].next ' + (vs[vs[(rl2 + qrl1).last].next].next ' + rl2) + qrl, vs, ps, owns), markedp(rl1, ps0), markedp(rl2, ps0), markedp(qrl1, ps0), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs0), markedp(rl2, vs0), markedp(qrl1, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, (rl2 + qrl1).last, vs0), noid(tid, rl1 + (rl2 + qrl1).last ' + vs[(rl2 + qrl1).last].next ' + (vs[vs[(rl2 + qrl1).last].next].next ' + rl2) + qrl, vhead, vs), nonullRetRefs (rl1 + (rl2 + qrl1).last ' + vs[(rl2 + qrl1).last].next ' + (vs[vs[(rl2 + qrl1).last].next].next ' + rl2) + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + (rl2 + qrl1).last ' + vs[(rl2 + qrl1).last].next ' + (vs[vs[(rl2 + qrl1).last].next].next ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[vs[vs[(rl2 + qrl1).last].next].next].deqID), some?(ps[vs[vs[(rl2 + qrl1).last].next].next].deqID), some?(vs0[vs[vs[(rl2 + qrl1).last].next].next].deqID), some?(ps0[vs[vs[(rl2 + qrl1).last].next].next].deqID), some?(vs[(rl2 + qrl1).last].deqID), some?(ps0[vs[(rl2 + qrl1).last].next].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ rl3, vs[(rl2 + qrl1).last].next ∈ ps, vs[(rl2 + qrl1).last].next ∈ vs, (rl2 + qrl1).last ∈ rl1 + (rl2 + qrl1).last ' + vs[(rl2 + qrl1).last].next ' + (vs[vs[(rl2 + qrl1).last].next].next ' + rl2) + qrl + rl from vhead, vtail0 ∈ rl1 + (rl2 + qrl1).last ' + vs[(rl2 + qrl1).last].next ' + (vs[vs[(rl2 + qrl1).last].next].next ' + rl2) + qrl + rl from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl1 + (rl2 + qrl1).last ' + vs[(rl2 + qrl1).last].next ' + (vs[vs[(rl2 + qrl1).last].next].next ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, (rl2 + qrl1).last ∈ vs0, (rl2 + qrl1).last ∈ ps0, (rl2 + qrl1).last ∈ vs, (rl2 + qrl1).last ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups((rl1 + rl2 + qrl1) + qrl0), ¬ dups(qrl), ¬ dups((rl2 + qrl1) + qrl0), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl1), ¬ dups(rl1 + rl2), ¬ dups(qrl1), ¬ dups(rl2), ¬ dups(qrl1 + qrl0), ¬ dups(qrl0), ¬ dups(rl2 + qrl1 + qrl0), ¬ dups(rl1 + rl2 + qrl1), ¬ weak?(vs[(rl2 + qrl1).last].deqID), ¬ (rl2 + qrl1).last ∈ rl2, ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl2, ¬ vhead0 ∈ qrl1, ¬ vhead0 ∈ qrl0, ¬ vs[vs[(rl2 + qrl1).last].next].next ∈ rl1, ¬ vs[vs[(rl2 + qrl1).last].next].next ∈ rl2, ¬ vs[vs[(rl2 + qrl1).last].next].next ∈ qrl, ¬ vs[vs[(rl2 + qrl1).last].next].next ∈ qrl1, ¬ vs[vs[(rl2 + qrl1).last].next].next ∈ qrl0, ¬ (rl2 + qrl1).last ∈ rl1, ¬ vs[(rl2 + qrl1).last].next ∈ rl1, ¬ vs[(rl2 + qrl1).last].next ∈ rl2, ¬ vs[(rl2 + qrl1).last].next ∈ qrl1, ¬ vs[(rl2 + qrl1).last].next ∈ qrl0, ¬ vs[(rl2 + qrl1).last].next ∈ qrl, ¬ (rl2 + qrl1).last ∈ qrl, ¬ (rl2 + qrl1).last ∈ qrl0, ¬ (rl2 + qrl1).last ∈ qrl1, vs[(rl2 + qrl1).last].next ≠ vhead ∧ vs[(rl2 + qrl1).last].next ∈ rl1 + (rl2 + qrl1).last ' + vs[(rl2 + qrl1).last].next ' + (vs[vs[(rl2 + qrl1).last].next].next ' + rl2) + qrl + rl from vhead → tid0 ≠ tid, vs[(vs[vs[(rl2 + qrl1).last].next].next ' + rl2 + qrl).last].next ≠ null → vs0[(vs[vs[(rl2 + qrl1).last].next].next ' + rl2 + qrl).last].next = vs[(vs[vs[(rl2 + qrl1).last].next].next ' + rl2 + qrl).last].next ∧ vs0[vs0[(vs[vs[(rl2 + qrl1).last].next].next ' + rl2 + qrl).last].next].val = vs[vs0[(vs[vs[(rl2 + qrl1).last].next].next ' + rl2 + qrl).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), ∀ r. r ∈ rl1 ∨ r = vs[(rl2 + qrl1).last].next ∨ r = vs[vs[(rl2 + qrl1).last].next].next ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ≠ vhead ∧ r0 ∈ rl1 + (rl2 + qrl1).last ' + vs[(rl2 + qrl1).last].next ' + (vs[vs[(rl2 + qrl1).last].next].next ' + rl2) + qrl + rl from vhead → vs0[r0].deqID ≠ Some(tid), vtail1 ∈ rl2 ∨ vtail1 ∈ qrl1 ∨ vtail1 = vhead0, lst = vs[(rl2 + qrl1).last].next ∨ lst = vs[vs[(rl2 + qrl1).last].next].next ∨ lst ∈ rl2 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = (rl2 + qrl1).last ∨ phead = vs[(rl2 + qrl1).last].next ∨ phead = vs[vs[(rl2 + qrl1).last].next].next ∨ phead ∈ rl2, (vs[vs[(rl2 + qrl1).last].next].next ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (vs[(rl2 + qrl1).last].next ' + (vs[vs[(rl2 + qrl1).last].next].next ' + rl2).butlast).last = vhead ∧ phead ≠ (vs[vs[(rl2 + qrl1).last].next].next ' + rl2).last ∧ unmarkedp(qrl, vs), vtail = (vs[vs[(rl2 + qrl1).last].next].next ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[vs[(rl2 + qrl1).last].next].next ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = (rl2 + qrl1).last ∨ phead0 = vs[(rl2 + qrl1).last].next ∨ phead0 = vs[vs[(rl2 + qrl1).last].next].next ∨ phead0 ∈ rl2 ∨ phead0 ∈ qrl1, phead0 ∈ rl1 + (rl2 + qrl1).last ' + vs[(rl2 + qrl1).last].next ' + vs[vs[(rl2 + qrl1).last].next].next ' + rl2 from phead ∨ phead0 ∈ qrl1 ∨ phead0 ∈ qrl0, vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail1 ∈ rl2 ∨ vtail1 ∈ qrl1 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [rl2, qrl1], <all paths>

Additional information

Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ markedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) inapp-07: ⊦ a ' + x = y + b ' ∧ x ≠ [] → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ [] + x = x; (s) ⊦ y ≠ [] → (a ' = x + y ↔ x = [] ∧ a ' = y); (ws) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl2, qrl1

Proof step 72 from proof stable-D27 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 73 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, 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), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ 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), ¬ vtail0 ∈ (orl + rl0) + qrl0 from lst, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 80

Additional information

Proof step 74 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vtail0 = ((orl + rl0) + qrl0).last, orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, 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, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, 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), ¬ vtail0 ∈ (orl + rl0) + qrl0 from lst, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].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), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ ¬ a ∈ []; (s) ⊦ ¬ r ∈ rl → rl from r = []; (s) ⊦ r ∈ rl from r0 → r ∈ rl; (ss) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s)

Proof step 75 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, 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), vtail ∈ qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, lst ∈ qrl, lst ∈ vs, lst ∈ ps, 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), ¬ lst ∈ qrl0, ¬ lst ∈ rl0, ¬ lst ∈ orl, ¬ lst ∈ orl from first, 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), 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, vtail ∈ orl ∨ vtail ∈ rl0 ∨ vtail ∈ qrl0, (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) ⊦

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-data[reflist], name:elim-list-c, seq:x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y, subst:[x, a, y] → [qrl, phead1, orl0]

Additional information

Used simplifier rules: ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ' + x ≠ []; (s) ⊦ a + x = a ' + x; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ in-14: ⊦ a ' + x = y → a ∈ y; (forward) 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 = qrl from r; (s) ⊦ ¬ r ∈ rl → rl from r = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ [] from r = []; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, phead1, y

Proof step 76 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vtail0 = ((orl + rl0) + qrl0.butlast).last, orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, qrl0 ≠ [], 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, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, 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), ¬ vtail0 ∈ (orl + rl0) + qrl0 from lst, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].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), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 77 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs0[qrl0.last].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs0[qrl0.last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, qrl0 ≠ [], 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), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, ((orl + rl0) + qrl0.butlast).last ∈ (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), ¬ ((orl + rl0) + qrl0.butlast).last ∈ (orl + rl0) + qrl0 from lst, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ unmarkedp(qrl0.tail, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [qrl0, vtail0, orl0]

Additional information

Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl0, head, tail

Proof step 78 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), qrl0 = vtail0 + orl0, rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, qrl0 ≠ [], 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, ((orl + rl0) + qrl0.butlast).last ∈ (orl + rl0) + qrl0 from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, 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), ¬ ((orl + rl0) + qrl0.butlast).last ∈ (orl + rl0) + qrl0 from lst, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), (orl + rl0).last = vhead0 ∧ unmarkedp(orl0, 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), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ' + x ≠ []; (s)

Proof step 79 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + orl0, vs0[(vtail0 ' + orl0).last].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps0[vtail0].deqID = None, vs0[(vtail0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, 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 + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(orl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, (orl + rl0 + (vtail0 ' + orl0).butlast).last ∈ orl + qrl + rl from vtail, vhead0 ∈ orl + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + orl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl0), ¬ dups(orl0), ¬ dups(orl), ¬ dups(rl0 + orl0), ¬ dups(orl + rl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl0, ¬ (orl + rl0 + (vtail0 ' + orl0).butlast).last ∈ orl + qrl + rl from lst, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl0, (orl + rl0).last = vhead0 ∧ unmarkedp(orl0, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl0, vs0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:bapp, seq: ⊦ y ≠ [] → (x + y).butlast = x + y.butlast, subst:[x, y] → [vtail0 ', orl0], <all paths>

Additional information

Used terms: vtail0 ', orl0

Proof step 80 from proof stable-D27 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).butlast = x + y.butlast

A spec-lemma

Proof step 81 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + orl0, ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs0[(vtail0 ' + orl0).last].deqID = None, vs0[(vtail0 ' + orl0).last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, orl0 = [], pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, 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 + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(orl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ orl + qrl + rl from vhead, (orl + rl0 + (vtail0 ' + orl0).butlast).last ∈ orl + qrl + rl from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + orl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl0), ¬ dups(orl0), ¬ dups(orl), ¬ dups(rl0 + orl0), ¬ dups(orl + rl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl0, ¬ (orl + rl0 + (vtail0 ' + orl0).butlast).last ∈ orl + qrl + rl from lst, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), (orl + rl0).last = vhead0 ∧ unmarkedp(orl0, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl0, vs0), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl0, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ unmarkedp([], vs); (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ a '.last = a; (s)

Proof step 82 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ', ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, 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 + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), (orl + rl0).last ∈ orl + qrl + rl from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ orl + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(orl), ¬ dups(rl0), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0), ¬ (orl + rl0).last ∈ orl + qrl + rl from lst, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), (orl + rl0).last = vhead0 ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl ∨ phead0 ∈ rl0, vtail0 ∈ qrl ∨ vtail0 ∈ rl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [orl, rl0], <all paths>

Additional information

Used terms: orl, rl0

Proof step 83 from proof stable-D27 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 84 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ', vs0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl0 = [], rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, 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 + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), vhead0 ∈ orl + qrl + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, (orl + rl0).last ∈ orl + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(orl), ¬ dups(rl0), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0), ¬ (orl + rl0).last ∈ orl + qrl + rl from lst, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 ∈ qrl ∨ vtail0 ∈ rl, phead0 ∈ orl ∨ phead0 ∈ rl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0, (orl + rl0).last = vhead0 ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s) ⊦ [] + x = x; (s)

Proof step 85 from proof stable-D27 (previous step) (back to tree)

qrl + rl = vtail0 ', ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, 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 + qrl + rl, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, orl + qrl + rl, vs0), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ orl + qrl + rl from vhead, orl.last ∈ orl + qrl + rl from vtail, phead0 ∈ orl, phead0 ∈ orl from phead, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl), ¬ vtail0 ∈ orl, ¬ orl.last ∈ orl + qrl + rl from lst, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 ∈ qrl ∨ vtail0 ∈ rl, orl.last = vhead0 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [orl, phead1, orl0]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, phead1, y

Proof step 86 from proof stable-D27 (previous step) (back to tree)

qrl + rl = vtail0 ', vs0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, orl = orl0 + phead1 ', pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, 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 + qrl + rl, vs0, ps0, owns0), markedp(orl, ps0), 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ orl from phead, phead0 ∈ orl, phead1 ∈ orl + qrl + rl from vtail, vhead0 ∈ orl + qrl + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl), ¬ vtail0 ∈ orl, ¬ phead1 ∈ orl + qrl + rl from lst, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), phead1 = vhead0 ∨ orl0 ≠ [] ∧ orl0.last = vhead0 ∧ phead0 ≠ phead1, vtail0 ∈ qrl ∨ vtail0 ∈ rl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 87 from proof stable-D27 (previous step) (back to tree)

qrl + rl = vtail0 ', ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((orl0 + phead1 ') + qrl, vs, ps, vs0, ps0), listp((orl0 + phead1 ') + qrl + rl, vs0, ps0, owns0), listp((orl0 + phead1 ') + qrl, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (orl0 + phead1 ') + qrl, vhead, vs), noidRely(tid, (orl0 + phead1 ') + qrl, vs, (orl0 + phead1 ') + qrl + rl, vs0), nonullRetRefs((orl0 + phead1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((orl0 + phead1 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(qrl, ps), addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ (orl0 + phead1 ') + qrl from lst, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ (orl0 + phead1 ') + qrl + rl from vhead, phead1 ∈ (orl0 + phead1 ') + qrl + rl from vtail, phead0 ∈ orl0 + phead1 ' from phead, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(orl0 + qrl), ¬ dups(orl0), ¬ dups(qrl), ¬ phead1 ∈ (orl0 + phead1 ') + qrl + rl from lst, ¬ phead1 ∈ orl0, ¬ phead1 ∈ qrl, ¬ vtail0 ∈ orl0, 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs), lst ∈ orl0 + phead1 ' from first ∨ lst ∈ qrl, vtail0 ∈ qrl ∨ vtail0 ∈ rl, phead1 = vhead0 ∨ orl0 ≠ [] ∧ orl0.last = vhead0 ∧ phead0 ≠ phead1, first ∈ orl0 ∨ first = phead1, phead ∈ orl0 ∨ phead = phead1, phead0 ∈ orl0 ∨ phead0 = phead1, vtail = (phead1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [orl0 + phead1 ', qrl + rl, lst], <all paths>

Additional information

Used simplifier rules: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ r ∈ rl → rl from r = []; (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) one: ⊦ x + y = a ' ∧ b ∈ x → a = b ∧ x = a ' ∧ y = []; (forward) from specification list[reflist] list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ ⊦ a ' = b ' ↔ a = b; (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ ¬ dups(a '); (s) ⊦ a '.last = a; (s) ⊦ a ' ≠ []; (s) ⊦ a '.tail = []; (s) ⊦ unmarkedp([], vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) Used terms: orl0 + phead1 ', qrl + rl, lst

Proof step 88 from proof stable-D27 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 89 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ', vs0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, rl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp(orl + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), vhead0 ∈ orl + qrl + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, rl0.last ∈ orl + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(orl), ¬ dups(rl0), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0), ¬ rl0.last ∈ orl + qrl + rl from lst, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 ∈ qrl ∨ vtail0 ∈ rl, phead0 ∈ orl ∨ phead0 ∈ rl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0, rl0.last = vhead0 ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ rl0.last ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ y ≠ [] → (x + y).butlast = x + y.butlast; (s)

Proof step 90 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ', ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, rl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), rl0.last ∈ orl + qrl + rl from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ orl + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(orl), ¬ dups(rl0), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0), ¬ rl0.last ∈ orl + qrl + rl from lst, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl ∨ phead0 ∈ rl0, vtail0 ∈ qrl ∨ vtail0 ∈ rl, rl0.last = vhead0 ∨ orl + rl0.butlast ≠ [] ∧ (orl + rl0.butlast).last = vhead0 ∧ phead0 ≠ rl0.last ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [rl0, phead1, orl0]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl0, phead1, y

Proof step 91 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ', vs0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl0 = orl0 + phead1 ', rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, rl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp(orl + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), vhead0 ∈ orl + qrl + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, phead1 ∈ orl + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(orl), ¬ dups(rl0), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0), ¬ phead1 ∈ orl + qrl + rl from lst, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), phead1 = vhead0 ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ phead1, vtail0 ∈ qrl ∨ vtail0 ∈ rl, phead0 ∈ orl ∨ phead0 ∈ rl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 92 from proof stable-D27 (previous step) (back to tree)

qrl + rl = (orl0 + phead1 ') + vtail0 ', ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl + rl, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(orl0, vs0), markedp(orl, ps0), markedp(orl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, orl + qrl + rl, vs0), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(qrl, ps), phead1 ∈ orl + qrl + rl from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ orl + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vtail0 ∈ orl, ¬ phead1 ∈ orl0, ¬ phead1 ∈ orl, ¬ phead1 ∈ orl + qrl + rl from lst, ¬ vtail0 ∈ orl0, 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 ∈ qrl ∨ vtail0 ∈ rl, phead1 = vhead0 ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ phead1, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = phead1, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = phead1 ∨ phead0 = vtail0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [orl, qrl + rl, lst], <all paths>

Additional information

Used simplifier rules: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) Used terms: orl, qrl + rl, lst

Proof step 93 from proof stable-D27 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 94 from proof stable-D27 (previous step) (back to tree)

qrl + rl = (orl0 + phead1 ') + vtail0 ', vs0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp(orl + qrl + rl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl, ps0), markedp(orl0, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl, ps), vhead0 ∈ orl + qrl + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, phead1 ∈ orl + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ lst ∈ orl, ¬ vtail0 ∈ orl, ¬ phead1 ∈ orl0, ¬ phead1 ∈ orl, ¬ phead1 ∈ orl + qrl + rl from lst, ¬ vtail0 ∈ orl0, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = phead1 ∨ phead0 = vtail0, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = phead1, phead1 = vhead0 ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ phead1, vtail0 ∈ qrl ∨ vtail0 ∈ rl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ r ∈ rl → rl from r = []; (s) ⊦ r ∈ rl from r0 → r ∈ rl; (ss) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)

Proof step 95 from proof stable-D27 (previous step) (back to tree)

qrl + rl = (orl0 + phead1 ') + vtail0 ', vs0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp(orl + qrl + rl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl, ps0), markedp(orl0, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl, ps), vtail ∈ qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, phead1 ∈ orl + qrl + rl from vtail, vhead0 ∈ orl + qrl + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, lst ∈ qrl, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ phead1 ∈ orl, ¬ phead1 ∈ orl0, ¬ vtail0 ∈ orl, ¬ lst ∈ orl, ¬ vtail0 ∈ orl0, ¬ lst ∈ orl from first, ¬ phead1 ∈ qrl from lst, ¬ phead1 ∈ rl, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = phead1 ∨ phead0 = vtail0, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = phead1, phead1 = vhead0 ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ phead1, vtail0 ∈ qrl ∨ vtail0 ∈ rl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[reflist], name:elim-list-c, seq:x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y, subst:[x, a, y] → [qrl, vhead1, orl1]

Additional information

Used simplifier rules: ⊦ [] + x = x; (s) ⊦ ¬ a ∈ x → x ≠ y + a ' + z; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, vhead1, y

Proof step 96 from proof stable-D27 (previous step) (back to tree)

qrl + rl = (orl0 + phead1 ') + vtail0 ', ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), qrl = vhead1 + orl1, rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, qrl ≠ [], vtail0 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl + rl, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(orl0, vs0), markedp(orl, ps0), markedp(orl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, orl + qrl + rl, vs0), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(qrl, ps), lst ∈ ps, lst ∈ vs, lst ∈ qrl, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ orl + qrl + rl from vhead, phead1 ∈ orl + qrl + rl from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ qrl from lst, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ phead1 ∈ orl, ¬ phead1 ∈ orl0, ¬ vtail0 ∈ orl, ¬ lst ∈ orl, ¬ vtail0 ∈ orl0, ¬ lst ∈ orl from first, ¬ phead1 ∈ qrl from lst, ¬ phead1 ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 ∈ qrl ∨ vtail0 ∈ rl, phead1 = vhead0 ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ phead1, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = phead1, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = phead1 ∨ phead0 = vtail0, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(orl1, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] inapp-10: ⊦ a ' + x = y + b ' ∧ a ≠ b → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] lapp-04: ⊦ a ' + x = y + b ' ∧ a ≠ b → x.last = b; (forward) from specification list-last[reflist] ⊦ ¬ a ∈ y → (y + c ' + z = a ' + z0 ↔ y = [] ∧ c = a ∧ z = z0); (ws) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a + x = a ' + x; (s) ⊦ a ' + x ≠ []; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws)

Proof step 97 from proof stable-D27 (previous step) (back to tree)

(vhead1 ' + orl1) + rl = (orl0 + phead1 ') + (orl1 + rl).last ', ps[vhead1].deqID = None, ps0[(orl1 + rl).last].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs0[(orl1 + rl).last].deqID = None, vs0[(orl1 + rl).last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl1 + rl ≠ [], (orl1 + rl).last ≠ phead1, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vhead1 ≠ (orl1 + rl).last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead1 ' + orl1, vs, ps, vs0, ps0), listp(orl + (vhead1 ' + orl1) + rl, vs0, ps0, owns0), listp(orl + vhead1 ' + orl1, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(orl0, vs0), markedp(orl, ps0), markedp(orl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + vhead1 ' + orl1, vhead, vs), noidRely(tid, orl + vhead1 ' + orl1, vs, orl + (vhead1 ' + orl1) + rl, vs0), nonullRetRefs(orl + (vhead1 ' + orl1) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vhead1 ' + orl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(orl1, ps), lst ∈ ps, lst ∈ vs, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ orl + (vhead1 ' + orl1) + rl from vhead, phead1 ∈ orl + (vhead1 ' + orl1) + rl from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ vhead1 ' + orl1 from lst, dom prvHp ⊆ dom prvHp0, ¬ dups(orl1), ¬ dups(orl), ¬ dups(rl), ¬ dups(orl + orl1), ¬ dups(orl + orl0), ¬ dups(orl0), ¬ phead1 ∈ vhead1 ' + orl1 from lst, ¬ lst ∈ orl from first, ¬ (orl1 + rl).last ∈ orl0, ¬ lst ∈ orl, ¬ (orl1 + rl).last ∈ orl, ¬ phead1 ∈ orl0, ¬ phead1 ∈ orl, ¬ vhead1 ∈ orl1, ¬ vhead1 ∈ orl, ¬ phead1 ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vtail = (vhead1 ' + orl1).last ∨ vtail = (orl + (vhead1 ' + orl1).butlast).last ∧ vs[(vhead1 ' + orl1).last].deqID = None ∧ vs[(vhead1 ' + orl1).last].next = null, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead1].deqID = None ∧ unmarkedp(orl1, vs), lst = vhead1 ∨ lst ∈ orl1, phead1 = vhead0 ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ phead1, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = phead1, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = phead1 ∨ phead0 = (orl1 + rl).last, vhead1 = phead1 ∨ vhead1 ∈ orl0, (orl1 + rl).last ∈ orl1 ∨ (orl1 + rl).last ∈ rl, vhead1 ∈ orl0 ∨ vhead1 = phead1 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [orl1, rl], <all paths>

Additional information

Used terms: orl1, rl

Proof step 98 from proof stable-D27 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 99 from proof stable-D27 (previous step) (back to tree)

(vhead1 ' + orl1) + rl = (orl0 + phead1 ') + (orl1 + rl).last ', vs0[(orl1 + rl).last].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps0[(orl1 + rl).last].deqID = None, ps[vhead1].deqID = None, vs0[(orl1 + rl).last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl = [], rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl1 + rl ≠ [], (orl1 + rl).last ≠ phead1, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vhead1 ≠ (orl1 + rl).last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead1 ' + orl1, vs, ps, vs0, ps0), listp(orl + vhead1 ' + orl1, vs, ps, owns), listp(orl + (vhead1 ' + orl1) + rl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl, ps0), markedp(orl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + vhead1 ' + orl1, vhead, vs), noidRely(tid, orl + vhead1 ' + orl1, vs, orl + (vhead1 ' + orl1) + rl, vs0), nonullRetRefs(orl + vhead1 ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs(orl + (vhead1 ' + orl1) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(orl1, ps), vtail ∈ vhead1 ' + orl1 from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, phead1 ∈ orl + (vhead1 ' + orl1) + rl from vtail, vhead0 ∈ orl + (vhead1 ' + orl1) + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl1), ¬ dups(orl), ¬ dups(rl), ¬ dups(orl + orl1), ¬ dups(orl + orl0), ¬ dups(orl0), ¬ phead1 ∈ vhead1 ' + orl1 from lst, ¬ lst ∈ orl from first, ¬ (orl1 + rl).last ∈ orl0, ¬ lst ∈ orl, ¬ (orl1 + rl).last ∈ orl, ¬ phead1 ∈ orl0, ¬ phead1 ∈ orl, ¬ vhead1 ∈ orl1, ¬ vhead1 ∈ orl, ¬ phead1 ∈ rl, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), vhead1 ∈ orl0 ∨ vhead1 = phead1, (orl1 + rl).last ∈ orl1 ∨ (orl1 + rl).last ∈ rl, vhead1 = phead1 ∨ vhead1 ∈ orl0, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = phead1 ∨ phead0 = (orl1 + rl).last, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = phead1, phead1 = vhead0 ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ phead1, lst = vhead1 ∨ lst ∈ orl1, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead1].deqID = None ∧ unmarkedp(orl1, vs), vtail = (vhead1 ' + orl1).last ∨ vtail = (orl + (vhead1 ' + orl1).butlast).last ∧ vs[(vhead1 ' + orl1).last].deqID = None ∧ vs[(vhead1 ' + orl1).last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ a ∈ z ∧ a ≠ c → c ' + z ≠ y1 + a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s) rl ≠ [] ⊦ ¬ dups(rl) → rl from rl.last = rl.last '; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] inapp-10: ⊦ a ' + x = y + b ' ∧ a ≠ b → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] ⊦ x + [] = x; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s)

Proof step 100 from proof stable-D27 (previous step) (back to tree)

vhead1 ' + orl1 = orl0 + phead1 ' + orl1.last ', vs[orl1.last].deqID = None, ps[vhead1].deqID = None, ps0[orl1.last].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs0[orl1.last].deqID = None, vs[orl1.last].next = null, vs0[orl1.last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), (vhead1 ' + orl1.butlast).last ≠ orl1.last, orl1.last ≠ phead1, ps[first].next ≠ null, addr ≠ null, first ≠ lst, lst ≠ vhead1, orl ≠ [], orl1 ≠ [], pretRefs0(tid) ≠ null, vhead1 ≠ orl1.last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead1 ' + orl1, vs, ps, vs0, ps0), listp(orl + vhead1 ' + orl1, vs0, ps0, owns0), listp(orl + vhead1 ' + orl1, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(orl0, vs0), markedp(orl, ps0), markedp(orl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + vhead1 ' + orl1, vhead, vs), noidRely(tid, orl + vhead1 ' + orl1, vs, orl + vhead1 ' + orl1, vs0), nonullRetRefs(orl + vhead1 ' + orl1, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vhead1 ' + orl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(orl1, ps), lst ∈ ps0, lst ∈ vs0, (vhead1 ' + orl1.butlast).last ∈ orl1 from lst, lst ∈ orl1, lst ∈ ps, lst ∈ vs, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ orl + vhead1 ' + orl1 from vhead, phead1 ∈ orl + vhead1 ' + orl1 from (vhead1 ' + orl1.butlast).last, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, dom prvHp ⊆ dom prvHp0, ¬ dups(orl1), ¬ dups(orl), ¬ dups(orl + orl1), ¬ dups(orl + orl0), ¬ dups(orl0), ¬ phead1 ∈ orl1 from lst, ¬ lst ∈ orl from first, ¬ orl1.last ∈ orl0, ¬ lst ∈ orl, ¬ orl1.last ∈ orl, ¬ phead1 ∈ orl0, ¬ phead1 ∈ orl, ¬ vhead1 ∈ orl1, ¬ vhead1 ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), phead1 = vhead0 ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ phead1, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = phead1, vhead1 = phead1 ∨ vhead1 ∈ orl0, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = phead1 ∨ phead0 = orl1.last, vhead1 ∈ orl0 ∨ vhead1 = phead1, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead1].deqID = None ∧ unmarkedp(orl1, vs) ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [orl1, lst0, orl2]

Additional information

Used simplifier rules: ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ x + a ' ≠ []; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ' + x = x0 + x1 → (a ∈ x0 ↔ x0 ≠ []); (ss) ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ ¬ a ∈ x → (a ∈ b ' + x ↔ a = b); (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl1, lst0, y

Proof step 101 from proof stable-D27 (previous step) (back to tree)

(vhead1 ' + orl1) + rl = (orl0 + phead1 ') + rl.last ', vs0[rl.last].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps0[rl.last].deqID = None, ps[vhead1].deqID = None, vs0[rl.last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl1 + rl ≠ [], rl.last ≠ phead1, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, rl ≠ [], vhead1 ≠ rl.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead1 ' + orl1, vs, ps, vs0, ps0), listp(orl + vhead1 ' + orl1, vs, ps, owns), listp(orl + (vhead1 ' + orl1) + rl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl, ps0), markedp(orl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + vhead1 ' + orl1, vhead, vs), noidRely(tid, orl + vhead1 ' + orl1, vs, orl + (vhead1 ' + orl1) + rl, vs0), nonullRetRefs(orl + vhead1 ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs(orl + (vhead1 ' + orl1) + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(orl1, ps), vtail ∈ vhead1 ' + orl1 from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, phead1 ∈ orl + (vhead1 ' + orl1) + rl from vtail, vhead0 ∈ orl + (vhead1 ' + orl1) + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl1), ¬ dups(orl), ¬ dups(rl), ¬ dups(orl + orl1), ¬ dups(orl + orl0), ¬ dups(orl0), ¬ phead1 ∈ vhead1 ' + orl1 from lst, ¬ lst ∈ orl from first, ¬ rl.last ∈ orl0, ¬ lst ∈ orl, ¬ rl.last ∈ orl, ¬ phead1 ∈ orl0, ¬ phead1 ∈ orl, ¬ vhead1 ∈ orl1, ¬ vhead1 ∈ orl, ¬ phead1 ∈ rl, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), vhead1 ∈ orl0 ∨ vhead1 = phead1, rl.last ∈ orl1 ∨ rl.last ∈ rl, vhead1 = phead1 ∨ vhead1 ∈ orl0, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = phead1 ∨ phead0 = rl.last, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = phead1, phead1 = vhead0 ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ phead1, lst = vhead1 ∨ lst ∈ orl1, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead1].deqID = None ∧ unmarkedp(orl1, vs), vtail = (vhead1 ' + orl1).last ∨ vtail = (orl + (vhead1 ' + orl1).butlast).last ∧ vs[(vhead1 ' + orl1).last].deqID = None ∧ vs[(vhead1 ' + orl1).last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] inapp-10: ⊦ a ' + x = y + b ' ∧ a ≠ b → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] lapp-04: ⊦ a ' + x = y + b ' ∧ a ≠ b → x.last = b; (forward) from specification list-last[reflist]

Proof step 102 from proof stable-D27 (previous step) (back to tree)

(vhead1 ' + orl1) + rl = (orl0 + phead1 ') + rl.last ', vs0[rl.last].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps0[rl.last].deqID = None, ps[vhead1].deqID = None, vs0[rl.last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl1 + rl ≠ [], rl.last ≠ phead1, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, rl ≠ [], vhead1 ≠ rl.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead1 ' + orl1, vs, ps, vs0, ps0), listp(orl + vhead1 ' + orl1, vs, ps, owns), listp(orl + (orl0 + phead1 ') + rl.last ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl, ps0), markedp(orl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + vhead1 ' + orl1, vhead, vs), noidRely(tid, orl + vhead1 ' + orl1, vs, orl + (orl0 + phead1 ') + rl.last ', vs0), nonullRetRefs(orl + vhead1 ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs(orl + (orl0 + phead1 ') + rl.last ', vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(orl1, ps), vtail ∈ vhead1 ' + orl1 from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, phead1 ∈ orl + (orl0 + phead1 ') + rl.last ' from vtail, vhead0 ∈ orl + (orl0 + phead1 ') + rl.last ' from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0), ¬ dups(orl + orl0), ¬ dups(orl + orl1), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl1), ¬ phead1 ∈ rl, ¬ vhead1 ∈ orl, ¬ vhead1 ∈ orl1, ¬ phead1 ∈ orl, ¬ phead1 ∈ orl0, ¬ rl.last ∈ orl, ¬ lst ∈ orl, ¬ rl.last ∈ orl0, ¬ lst ∈ orl from first, ¬ phead1 ∈ vhead1 ' + orl1 from lst, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), vhead1 = phead1 ∨ vhead1 ∈ orl0, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = phead1 ∨ phead0 = rl.last, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = phead1, phead1 = vhead0 ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ phead1, lst = vhead1 ∨ lst ∈ orl1, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead1].deqID = None ∧ unmarkedp(orl1, vs), vtail = (vhead1 ' + orl1).last ∨ vtail = (orl + (vhead1 ' + orl1).butlast).last ∧ vs[(vhead1 ' + orl1).last].deqID = None ∧ vs[(vhead1 ' + orl1).last].next = null, vhead1 ∈ orl0 ∨ vhead1 = phead1 ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [rl, vtail0, rl0]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl, vtail0, y

Proof step 103 from proof stable-D27 (previous step) (back to tree)

(vhead1 ' + orl1) + rl = (orl0 + phead1 ') + vtail0 ', ps[vhead1].deqID = None, ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl = rl0 + vtail0 ', rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl1 + rl ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, rl ≠ [], vhead1 ≠ vtail0, vtail0 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead1 ' + orl1, vs, ps, vs0, ps0), listp(orl + (orl0 + phead1 ') + vtail0 ', vs0, ps0, owns0), listp(orl + vhead1 ' + orl1, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(orl0, vs0), markedp(orl, ps0), markedp(orl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + vhead1 ' + orl1, vhead, vs), noidRely(tid, orl + vhead1 ' + orl1, vs, orl + (orl0 + phead1 ') + vtail0 ', vs0), nonullRetRefs(orl + (orl0 + phead1 ') + vtail0 ', vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vhead1 ' + orl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(orl1, ps), lst ∈ ps, lst ∈ vs, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ orl + (orl0 + phead1 ') + vtail0 ' from vhead, phead1 ∈ orl + (orl0 + phead1 ') + vtail0 ' from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ vhead1 ' + orl1 from lst, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0), ¬ dups(orl + orl0), ¬ dups(orl + orl1), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl1), ¬ phead1 ∈ rl, ¬ vhead1 ∈ orl, ¬ vhead1 ∈ orl1, ¬ phead1 ∈ orl, ¬ phead1 ∈ orl0, ¬ vtail0 ∈ orl, ¬ lst ∈ orl, ¬ vtail0 ∈ orl0, ¬ lst ∈ orl from first, ¬ phead1 ∈ vhead1 ' + orl1 from lst, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vhead1 ∈ orl0 ∨ vhead1 = phead1, vtail = (vhead1 ' + orl1).last ∨ vtail = (orl + (vhead1 ' + orl1).butlast).last ∧ vs[(vhead1 ' + orl1).last].deqID = None ∧ vs[(vhead1 ' + orl1).last].next = null, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead1].deqID = None ∧ unmarkedp(orl1, vs), lst = vhead1 ∨ lst ∈ orl1, phead1 = vhead0 ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ phead1, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = phead1, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = phead1 ∨ phead0 = vtail0, vhead1 = phead1 ∨ vhead1 ∈ orl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (x + a ').butlast = x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s) ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws)

Proof step 104 from proof stable-D27 (previous step) (back to tree)

vhead1 ' + orl1 = orl0 + phead1 ', vs0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps0[vtail0].deqID = None, ps[vhead1].deqID = None, vs0[vtail0].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, lst ≠ vhead1, orl ≠ [], pretRefs0(tid) ≠ null, vhead1 ≠ vtail0, vtail0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + orl0 + phead1 ', vs, ps, vs0, ps0), listp(orl + orl0 + phead1 ', vs, ps, owns), listp(orl + (orl0 + phead1 ') + vtail0 ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl, ps0), markedp(orl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + orl0 + phead1 ', vhead, vs), noidRely(tid, orl + orl0 + phead1 ', vs, orl + (orl0 + phead1 ') + vtail0 ', vs0), nonullRetRefs(orl + orl0 + phead1 ', vs, vretRefs, pretRefs), nonullRetRefs(orl + (orl0 + phead1 ') + vtail0 ', vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(orl1, ps), vtail ∈ orl1 from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, phead1 ∈ orl + (orl0 + phead1 ') + vtail0 ' from vtail, vhead0 ∈ orl + (orl0 + phead1 ') + vtail0 ' from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, lst ∈ vs, lst ∈ ps, lst ∈ orl1, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0), ¬ dups(orl + orl0), ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead1 ∈ orl1 from lst, ¬ vhead1 ∈ orl, ¬ vhead1 ∈ orl1, ¬ phead1 ∈ orl, ¬ phead1 ∈ orl0, ¬ vtail0 ∈ orl, ¬ lst ∈ orl, ¬ vtail0 ∈ orl0, ¬ lst ∈ orl from first, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead1].deqID = None ∧ unmarkedp(orl1, vs), phead1 = vhead1 ∨ phead1 ∈ orl1, vhead1 ∈ orl0 ∨ vhead1 = phead1, vhead1 = phead1 ∨ vhead1 ∈ orl0, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = phead1 ∨ phead0 = vtail0, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = phead1, phead1 = vhead0 ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ phead1, vtail = orl1.last ∨ vtail = (orl + orl0).last ∧ vs[orl1.last].deqID = None ∧ vs[orl1.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:splitlasteq-01, seq:y ≠ [] ⊦ y = x + a ' ↔ x = y.butlast ∧ a = y.last, subst:[y, x, a] → [vhead1 ' + orl1, orl0, phead1], <all paths>

Additional information

Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s) ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) Used terms: vhead1 ' + orl1, orl0, phead1

Proof step 105 from proof stable-D27 (previous step) (back to tree)

y ≠ [] ⊦ y = x + a ' ↔ x = y.butlast ∧ a = y.last

A spec-lemma

Proof step 106 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + orl0, ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs0[(vtail0 ' + orl0).last].deqID = None, vs0[(vtail0 ' + orl0).last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], orl0 ≠ [], 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 + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(orl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ orl + qrl + rl from vhead, (orl + rl0 + vtail0 ' + orl0.butlast).last ∈ orl + qrl + rl from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + orl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl0), ¬ dups(orl0), ¬ dups(orl), ¬ dups(rl0 + orl0), ¬ dups(orl + rl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl0, ¬ (orl + rl0 + vtail0 ' + orl0.butlast).last ∈ orl + qrl + rl from lst, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), (orl + rl0).last = vhead0 ∧ unmarkedp(orl0, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl0, vs0), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl0, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s)

Proof step 107 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + orl0, vs[ps[first].next].deqID = Some(othertid), ps0[vtail0].deqID = None, vs0[orl0.last].deqID = None, vs0[orl0.last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], orl0 ≠ [], 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 + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(orl0, ps0), vhead0 ∈ orl + qrl + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, (vtail0 ' + orl0.butlast).last ∈ orl + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + orl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl0), ¬ dups(orl0), ¬ dups(orl), ¬ dups(rl0 + orl0), ¬ dups(orl + rl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl0, ¬ (vtail0 ' + orl0.butlast).last ∈ orl + qrl + rl from lst, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl0, (orl + rl0).last = vhead0 ∧ unmarkedp(orl0, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl0, vs0) ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [orl0, phead1, orl1]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, phead1, y

Proof step 108 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + orl0, vs0[phead1].deqID = None, ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs0[phead1].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, orl0 = orl1 + phead1 ', pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], orl0 ≠ [], 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 + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(orl0, ps0), unmarkedp(qrl, ps), (vtail0 ' + orl1).last ∈ orl + qrl + rl from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ orl + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + orl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl0), ¬ dups(orl0), ¬ dups(orl), ¬ dups(rl0 + orl0), ¬ dups(orl + rl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl0, ¬ (vtail0 ' + orl1).last ∈ orl + qrl + rl from lst, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), (orl + rl0).last = vhead0 ∧ unmarkedp(orl0, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl0, vs0), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl0, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ x + a ' ≠ []; (s)

Proof step 109 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + orl1 + phead1 ', ps0[phead1].deqID = None, vs0[phead1].deqID = None, ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs0[phead1].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl + rl, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(orl1, ps0), unmarkedp(qrl, ps), (vtail0 ' + orl1).last ∈ orl + qrl + rl from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ orl + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0 + orl1), ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ phead1 ∈ orl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ orl, ¬ (vtail0 ' + orl1).last ∈ orl + qrl + rl from lst, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = phead1, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl ∨ phead0 ∈ rl0, phead1 ∈ qrl ∨ phead1 ∈ rl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:splitlasteq-01, seq:y ≠ [] ⊦ y = x + a ' ↔ x = y.butlast ∧ a = y.last, subst:[y, x, a] → [qrl + rl, rl0 + vtail0 ' + orl1, phead1], <all paths>

Additional information

Used simplifier rules: ⊦ [] + x = x; (s) ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: qrl + rl, rl0 + vtail0 ' + orl1, phead1

Proof step 110 from proof stable-D27 (previous step) (back to tree)

y ≠ [] ⊦ y = x + a ' ↔ x = y.butlast ∧ a = y.last

A spec-lemma

Proof step 111 from proof stable-D27 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = (qrl + rl).butlast, vs[ps[first].next].deqID = Some(othertid), ps0[vtail0].deqID = None, vs0[phead1].deqID = None, ps0[phead1].deqID = None, vs0[phead1].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, phead1 = (qrl + rl).last, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), qrl + rl ≠ [], orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp(orl + qrl + rl, vs0, ps0, owns0), markedp(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 + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(orl1, ps0), vhead0 ∈ orl + qrl + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, (vtail0 ' + orl1).last ∈ orl + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0 + orl1), ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ phead1 ∈ orl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ orl, ¬ (vtail0 ' + orl1).last ∈ orl + qrl + rl from lst, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), phead1 ∈ qrl ∨ phead1 ∈ rl, phead0 ∈ orl ∨ phead0 ∈ rl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = phead1, (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 112 from proof stable-D27 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = (qrl + rl).butlast, ps0[(qrl + rl).last].deqID = None, vs0[(qrl + rl).last].deqID = None, ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs0[(qrl + rl).last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), qrl + rl ≠ [], orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ (qrl + rl).last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(orl1, ps0), unmarkedp(qrl, ps), (vtail0 ' + orl1).last ∈ orl + qrl + rl from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ orl + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0 + orl1), ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ (qrl + rl).last ∈ orl1, ¬ (qrl + rl).last ∈ rl0, ¬ (qrl + rl).last ∈ orl, ¬ (vtail0 ' + orl1).last ∈ orl + qrl + rl from lst, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = (qrl + rl).last, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl ∨ phead0 ∈ rl0, (qrl + rl).last ∈ qrl ∨ (qrl + rl).last ∈ rl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [qrl, rl], <all paths>

Additional information

Used terms: qrl, rl

Proof step 113 from proof stable-D27 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 114 from proof stable-D27 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = (qrl + rl).butlast, vs[ps[first].next].deqID = Some(othertid), ps0[vtail0].deqID = None, vs0[(qrl + rl).last].deqID = None, ps0[(qrl + rl).last].deqID = None, vs0[(qrl + rl).last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl = [], rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), qrl + rl ≠ [], orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ (qrl + rl).last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp(orl + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(orl1, ps0), vhead0 ∈ orl + qrl + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, (vtail0 ' + orl1).last ∈ orl + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0 + orl1), ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ (qrl + rl).last ∈ orl1, ¬ (qrl + rl).last ∈ rl0, ¬ (qrl + rl).last ∈ orl, ¬ (vtail0 ' + orl1).last ∈ orl + qrl + rl from lst, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), (qrl + rl).last ∈ qrl ∨ (qrl + rl).last ∈ rl, phead0 ∈ orl ∨ phead0 ∈ rl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = (qrl + rl).last, (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ ¬ dups([]); (s)

Proof step 115 from proof stable-D27 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = qrl.butlast, ps0[qrl.last].deqID = None, vs0[qrl.last].deqID = None, ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs0[qrl.last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, qrl ≠ [], vtail0 ≠ qrl.last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp(orl + qrl, vs0, ps0, owns0), 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 + qrl, vs0), nonullRetRefs(orl + qrl, 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(orl1, ps0), unmarkedp(qrl, ps), (vtail0 ' + orl1).last ∈ orl + qrl from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ orl + qrl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0 + orl1), ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ qrl.last ∈ orl1, ¬ qrl.last ∈ rl0, ¬ qrl.last ∈ orl, ¬ (vtail0 ' + orl1).last ∈ orl + qrl from lst, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0), lst ∈ orl from first ∨ lst ∈ qrl, phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = qrl.last, orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [qrl, phead1, qrl0]

Additional information

Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, tail

Proof step 116 from proof stable-D27 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = qrl.butlast, vs[ps[first].next].deqID = Some(othertid), ps0[vtail0].deqID = None, vs0[qrl.last].deqID = None, ps0[qrl.last].deqID = None, vs0[qrl.last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), qrl = phead1 + qrl0, rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, qrl ≠ [], vtail0 ≠ qrl.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), 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 + qrl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl, 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(orl1, ps0), vhead0 ∈ orl + qrl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, (vtail0 ' + orl1).last ∈ orl + qrl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0 + orl1), ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ qrl.last ∈ orl1, ¬ qrl.last ∈ rl0, ¬ qrl.last ∈ orl, ¬ (vtail0 ' + orl1).last ∈ orl + qrl from lst, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = qrl.last, phead0 ∈ orl ∨ phead0 ∈ rl0, lst ∈ orl from first ∨ lst ∈ qrl, (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a + x = a ' + x; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ' + x ≠ []; (s)

Proof step 117 from proof stable-D27 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = (phead1 ' + qrl0).butlast, ps0[(phead1 ' + qrl0).last].deqID = None, vs0[(phead1 ' + qrl0).last].deqID = None, ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[phead1].deqID = None, vs0[(phead1 ' + qrl0).last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ (phead1 ' + qrl0).last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + phead1 ' + qrl0, vs, ps, vs0, ps0), listp(orl + phead1 ' + qrl0, vs, ps, owns), listp(orl + phead1 ' + qrl0, vs0, ps0, owns0), 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 + phead1 ' + qrl0, vhead, vs), noidRely(tid, orl + phead1 ' + qrl0, vs, orl + phead1 ' + qrl0, vs0), nonullRetRefs(orl + phead1 ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + phead1 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(orl1, ps0), unmarkedp(qrl0, ps), addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, (phead1 ' + qrl0).last ∈ orl + phead1 ' + qrl0 from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ orl + phead1 ' + qrl0 from vhead, (vtail0 ' + orl1).last ∈ phead1 ' + qrl0 from (phead1 ' + qrl0).last, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(orl + qrl0), ¬ dups(orl + rl0 + orl1), ¬ dups(orl), ¬ dups(qrl0), ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl, ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ (phead1 ' + qrl0).last ∈ orl1, ¬ (phead1 ' + qrl0).last ∈ rl0, ¬ (phead1 ' + qrl0).last ∈ orl, ¬ (vtail0 ' + orl1).last ∈ orl + phead1 ' + qrl0 from lst, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0), phead0 ∈ orl ∨ phead0 ∈ rl0, lst ∈ orl from first ∨ lst = phead1 ∨ lst ∈ qrl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = (phead1 ' + qrl0).last, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead1].deqID = None ∧ unmarkedp(qrl0, vs) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [phead1 ', qrl0], <all paths>

Additional information

Used simplifier rules: ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: phead1 ', qrl0

Proof step 118 from proof stable-D27 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 119 from proof stable-D27 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = (phead1 ' + qrl0).butlast, ps[phead1].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps0[vtail0].deqID = None, vs0[qrl0.last].deqID = None, ps0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, qrl0 ≠ [], vtail0 ≠ qrl0.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + phead1 ' + qrl0, vs, ps, vs0, ps0), listp(orl + phead1 ' + qrl0, vs0, ps0, owns0), listp(orl + phead1 ' + qrl0, vs, ps, owns), 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 + phead1 ' + qrl0, vhead, vs), noidRely(tid, orl + phead1 ' + qrl0, vs, orl + phead1 ' + qrl0, vs0), nonullRetRefs(orl + phead1 ' + qrl0, vs, vretRefs, pretRefs), nonullRetRefs(orl + phead1 ' + 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(qrl0, ps), unmarkedp(orl1, ps0), (vtail0 ' + orl1).last ∈ phead1 ' + qrl0 from qrl0.last, vhead0 ∈ orl + phead1 ' + qrl0 from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, qrl0.last ∈ orl + phead1 ' + qrl0 from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(orl + qrl0), ¬ dups(orl + rl0 + orl1), ¬ dups(orl), ¬ dups(qrl0), ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl, ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ qrl0.last ∈ orl1, ¬ qrl0.last ∈ rl0, ¬ qrl0.last ∈ orl, ¬ (vtail0 ' + orl1).last ∈ orl + phead1 ' + qrl0 from lst, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead1].deqID = None ∧ unmarkedp(qrl0, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = qrl0.last, lst ∈ orl from first ∨ lst = phead1 ∨ lst ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s)

Proof step 120 from proof stable-D27 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = phead1 ' + qrl0.butlast, ps[phead1].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps0[vtail0].deqID = None, vs0[qrl0.last].deqID = None, ps0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, qrl0 ≠ [], vtail0 ≠ qrl0.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + phead1 ' + qrl0, vs, ps, vs0, ps0), listp(orl + phead1 ' + qrl0, vs0, ps0, owns0), listp(orl + phead1 ' + qrl0, vs, ps, owns), 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 + phead1 ' + qrl0, vhead, vs), noidRely(tid, orl + phead1 ' + qrl0, vs, orl + phead1 ' + qrl0, vs0), nonullRetRefs(orl + phead1 ' + qrl0, vs, vretRefs, pretRefs), nonullRetRefs(orl + phead1 ' + 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(qrl0, ps), unmarkedp(orl1, ps0), (vtail0 ' + orl1).last ∈ phead1 ' + qrl0 from qrl0.last, vhead0 ∈ orl + phead1 ' + qrl0 from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, qrl0.last ∈ orl + phead1 ' + qrl0 from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(orl + rl0 + orl1), ¬ dups(orl + qrl0), ¬ dups(rl0), ¬ dups(orl1), ¬ dups(rl0 + orl1), ¬ dups(orl + rl0), ¬ (vtail0 ' + orl1).last ∈ orl + phead1 ' + qrl0 from lst, ¬ qrl0.last ∈ orl, ¬ qrl0.last ∈ rl0, ¬ qrl0.last ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl1, ¬ phead1 ∈ orl, ¬ phead1 ∈ qrl0, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead1].deqID = None ∧ unmarkedp(qrl0, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = qrl0.last, lst ∈ orl from first ∨ lst = phead1 ∨ lst ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0), phead1 ∈ rl0 ∨ phead1 = vtail0 ∨ phead1 ∈ orl1 ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [qrl0, vhead1, qrl]

Additional information

Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl0, vhead1, y

Proof step 121 from proof stable-D27 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = (qrl + rl).butlast, vs[ps[first].next].deqID = Some(othertid), ps0[vtail0].deqID = None, vs0[rl.last].deqID = None, ps0[rl.last].deqID = None, vs0[rl.last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), qrl + rl ≠ [], orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, rl ≠ [], vtail0 ≠ rl.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp(orl + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(orl1, ps0), vhead0 ∈ orl + qrl + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, (vtail0 ' + orl1).last ∈ orl + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0 + orl1), ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ rl.last ∈ orl1, ¬ rl.last ∈ rl0, ¬ rl.last ∈ orl, ¬ (vtail0 ' + orl1).last ∈ orl + qrl + rl from lst, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), rl.last ∈ qrl ∨ rl.last ∈ rl, phead0 ∈ orl ∨ phead0 ∈ rl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = rl.last, (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ y ≠ [] → (x + y).butlast = x + y.butlast; (s)

Proof step 122 from proof stable-D27 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = qrl + rl.butlast, ps0[rl.last].deqID = None, vs0[rl.last].deqID = None, ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs0[rl.last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), qrl + rl ≠ [], orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, rl ≠ [], vtail0 ≠ rl.last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(orl1, ps0), unmarkedp(qrl, ps), (vtail0 ' + orl1).last ∈ orl + qrl + rl from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ orl + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0 + orl1), ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ rl.last ∈ orl1, ¬ rl.last ∈ rl0, ¬ rl.last ∈ orl, ¬ (vtail0 ' + orl1).last ∈ orl + qrl + rl from lst, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = rl.last, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [rl, phead1, qrl0]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl, phead1, y

Proof step 123 from proof stable-D27 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = qrl + qrl0, vs[ps[first].next].deqID = Some(othertid), ps0[vtail0].deqID = None, vs0[phead1].deqID = None, ps0[phead1].deqID = None, vs0[phead1].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl = qrl0 + phead1 ', rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), qrl + rl ≠ [], orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, rl ≠ [], vtail0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp(orl + qrl + rl, vs0, ps0, owns0), markedp(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 + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(orl1, ps0), vhead0 ∈ orl + qrl + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, (vtail0 ' + orl1).last ∈ orl + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0 + orl1), ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ phead1 ∈ orl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ orl, ¬ (vtail0 ' + orl1).last ∈ orl + qrl + rl from lst, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = phead1, (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)

Proof step 124 from proof stable-D27 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = qrl + qrl0, ps0[phead1].deqID = None, vs0[phead1].deqID = None, ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs0[phead1].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl + qrl0 + phead1 ', 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 + qrl + qrl0 + phead1 ', vs0), nonullRetRefs(orl + qrl + qrl0 + phead1 ', 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(orl1, ps0), unmarkedp(qrl, ps), (vtail0 ' + orl1).last ∈ orl + qrl + qrl0 + phead1 ' from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ orl + qrl + qrl0 + phead1 ' from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0 + orl1), ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(qrl0), ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ phead1 ∈ orl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ orl, ¬ (vtail0 ' + orl1).last ∈ orl + qrl + qrl0 + phead1 ' from lst, ¬ phead1 ∈ 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = phead1, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [orl, qrl + qrl0 + phead1 ', lst], <all paths>

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: orl, qrl + qrl0 + phead1 ', lst

Proof step 125 from proof stable-D27 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 126 from proof stable-D27 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = qrl + qrl0, vs[ps[first].next].deqID = Some(othertid), ps0[vtail0].deqID = None, vs0[phead1].deqID = None, ps0[phead1].deqID = None, vs0[phead1].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp(orl + qrl + qrl0 + phead1 ', 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 + qrl + qrl0 + phead1 ', vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl + qrl0 + phead1 ', 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(orl1, ps0), vhead0 ∈ orl + qrl + qrl0 + phead1 ' from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, (vtail0 ' + orl1).last ∈ orl + qrl + qrl0 + phead1 ' from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0 + orl1), ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(qrl0), ¬ lst ∈ orl, ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ phead1 ∈ orl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ orl, ¬ (vtail0 ' + orl1).last ∈ orl + qrl + qrl0 + phead1 ' from lst, ¬ phead1 ∈ qrl0, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = phead1, (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ r ∈ rl → rl from r = []; (s) ⊦ r ∈ rl from r0 → r ∈ rl; (ss) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)

Proof step 127 from proof stable-D27 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = qrl + qrl0, vs[ps[first].next].deqID = Some(othertid), ps0[vtail0].deqID = None, vs0[phead1].deqID = None, ps0[phead1].deqID = None, vs0[phead1].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], (vtail0 ' + orl1).last ≠ phead1, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp(orl + qrl + qrl0 + phead1 ', 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 + qrl + qrl0 + phead1 ', vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl + qrl0 + phead1 ', 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(orl1, ps0), vtail ∈ qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, (vtail0 ' + orl1).last ∈ orl + qrl + qrl0 + phead1 ' from vtail, vhead0 ∈ orl + qrl + qrl0 + phead1 ' from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, lst ∈ qrl, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(orl1), ¬ dups(orl), ¬ dups(rl0 + orl1), ¬ dups(orl + rl0), ¬ dups(orl + rl0 + orl1), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ phead1 ∈ orl, ¬ phead1 ∈ rl0, ¬ phead1 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl1, ¬ lst ∈ orl, ¬ phead1 ∈ qrl0, ¬ lst ∈ orl from first, ¬ (vtail0 ' + orl1).last ∈ qrl from lst, ¬ (vtail0 ' + orl1).last ∈ qrl0, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = phead1, (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0), phead0 ∈ orl ∨ phead0 ∈ rl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[reflist], name:elim-list-c, seq:x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y, subst:[x, a, y] → [qrl, vhead1, qrl1]

Additional information

Used simplifier rules: ⊦ [] + x = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ [] from r = []; (s) ⊦ ¬ a ∈ []; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, vhead1, y

Proof step 128 from proof stable-D27 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = qrl + qrl0, ps0[phead1].deqID = None, vs0[phead1].deqID = None, ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs0[phead1].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), qrl = vhead1 + qrl1, rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], (vtail0 ' + orl1).last ≠ phead1, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, qrl ≠ [], vtail0 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl + qrl0 + phead1 ', 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 + qrl + qrl0 + phead1 ', vs0), nonullRetRefs(orl + qrl + qrl0 + phead1 ', 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(orl1, ps0), unmarkedp(qrl, ps), lst ∈ ps, lst ∈ vs, lst ∈ qrl, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ orl + qrl + qrl0 + phead1 ' from vhead, (vtail0 ' + orl1).last ∈ orl + qrl + qrl0 + phead1 ' from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ qrl from lst, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(orl1), ¬ dups(orl), ¬ dups(rl0 + orl1), ¬ dups(orl + rl0), ¬ dups(orl + rl0 + orl1), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ phead1 ∈ orl, ¬ phead1 ∈ rl0, ¬ phead1 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl1, ¬ lst ∈ orl, ¬ phead1 ∈ qrl0, ¬ lst ∈ orl from first, ¬ (vtail0 ' + orl1).last ∈ qrl from lst, ¬ (vtail0 ' + orl1).last ∈ 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl ∨ phead0 ∈ rl0, (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = phead1, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl1, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ a + x = a ' + x; (s) ⊦ a ' + x ≠ []; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws)

Proof step 129 from proof stable-D27 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = (vhead1 ' + qrl1) + qrl0, ps[vhead1].deqID = None, ps0[phead1].deqID = None, vs0[phead1].deqID = None, ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs0[phead1].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], (vtail0 ' + orl1).last ≠ phead1, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead1 ' + qrl1, vs, ps, vs0, ps0), listp(orl + (vhead1 ' + qrl1) + qrl0 + phead1 ', vs0, ps0, owns0), listp(orl + vhead1 ' + qrl1, 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 + vhead1 ' + qrl1, vhead, vs), noidRely(tid, orl + vhead1 ' + qrl1, vs, orl + (vhead1 ' + qrl1) + qrl0 + phead1 ', vs0), nonullRetRefs(orl + (vhead1 ' + qrl1) + qrl0 + phead1 ', vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vhead1 ' + qrl1, 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(orl1, ps0), unmarkedp(qrl1, ps), lst ∈ ps, lst ∈ vs, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ orl + (vhead1 ' + qrl1) + qrl0 + phead1 ' from vhead, (vtail0 ' + orl1).last ∈ orl + (vhead1 ' + qrl1) + qrl0 + phead1 ' from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ vhead1 ' + qrl1 from lst, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1), ¬ dups(orl), ¬ dups(orl + qrl1), ¬ dups(orl + rl0 + orl1), ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(qrl0), ¬ (vtail0 ' + orl1).last ∈ vhead1 ' + qrl1 from lst, ¬ lst ∈ orl from first, ¬ phead1 ∈ qrl0, ¬ lst ∈ orl, ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ phead1 ∈ orl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ orl, ¬ vhead1 ∈ qrl1, ¬ vhead1 ∈ orl, ¬ (vtail0 ' + orl1).last ∈ 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vtail = (vhead1 ' + qrl1).last ∨ vtail = (orl + (vhead1 ' + qrl1).butlast).last ∧ vs[(vhead1 ' + qrl1).last].deqID = None ∧ vs[(vhead1 ' + qrl1).last].next = null, orl.last = vhead ∧ unmarkedp(qrl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead1].deqID = None ∧ unmarkedp(qrl1, vs), lst = vhead1 ∨ lst ∈ qrl1, phead0 ∈ orl ∨ phead0 ∈ rl0, (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = phead1, vhead1 ∈ rl0 ∨ vhead1 = vtail0 ∨ vhead1 ∈ orl1 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [vtail0 ', orl1], <all paths>

Additional information

Used terms: vtail0 ', orl1

Proof step 130 from proof stable-D27 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 131 from proof stable-D27 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = (vhead1 ' + qrl1) + qrl0, vs[ps[first].next].deqID = Some(othertid), ps0[vtail0].deqID = None, vs0[phead1].deqID = None, ps0[phead1].deqID = None, ps[vhead1].deqID = None, vs0[phead1].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, orl1 = [], pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], (vtail0 ' + orl1).last ≠ phead1, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead1 ' + qrl1, vs, ps, vs0, ps0), listp(orl + vhead1 ' + qrl1, vs, ps, owns), listp(orl + (vhead1 ' + qrl1) + qrl0 + phead1 ', 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 + vhead1 ' + qrl1, vhead, vs), noidRely(tid, orl + vhead1 ' + qrl1, vs, orl + (vhead1 ' + qrl1) + qrl0 + phead1 ', vs0), nonullRetRefs(orl + vhead1 ' + qrl1, vs, vretRefs, pretRefs), nonullRetRefs(orl + (vhead1 ' + qrl1) + qrl0 + phead1 ', 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(qrl1, ps), unmarkedp(orl1, ps0), vtail ∈ vhead1 ' + qrl1 from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, (vtail0 ' + orl1).last ∈ orl + (vhead1 ' + qrl1) + qrl0 + phead1 ' from vtail, vhead0 ∈ orl + (vhead1 ' + qrl1) + qrl0 + phead1 ' from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1), ¬ dups(orl), ¬ dups(orl + qrl1), ¬ dups(orl + rl0 + orl1), ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(qrl0), ¬ (vtail0 ' + orl1).last ∈ vhead1 ' + qrl1 from lst, ¬ lst ∈ orl from first, ¬ phead1 ∈ qrl0, ¬ lst ∈ orl, ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ phead1 ∈ orl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ orl, ¬ vhead1 ∈ qrl1, ¬ vhead1 ∈ orl, ¬ (vtail0 ' + orl1).last ∈ qrl0, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), vhead1 ∈ rl0 ∨ vhead1 = vtail0 ∨ vhead1 ∈ orl1, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = phead1, (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0), phead0 ∈ orl ∨ phead0 ∈ rl0, lst = vhead1 ∨ lst ∈ qrl1, orl.last = vhead ∧ unmarkedp(qrl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead1].deqID = None ∧ unmarkedp(qrl1, vs), vtail = (vhead1 ' + qrl1).last ∨ vtail = (orl + (vhead1 ' + qrl1).butlast).last ∧ vs[(vhead1 ' + qrl1).last].deqID = None ∧ vs[(vhead1 ' + qrl1).last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ x + [] = x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] ⊦ unmarkedp([], vs); (s) ⊦ a '.last = a; (s)

Proof step 132 from proof stable-D27 (previous step) (back to tree)

rl0 + vtail0 ' = vhead1 ' + qrl1, ps[vhead1].deqID = None, ps0[phead1].deqID = None, vs0[phead1].deqID = None, ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs0[phead1].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, lst ≠ vhead1, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead1 ' + qrl1, vs, ps, vs0, ps0), listp(orl + vhead1 ' + qrl1 + phead1 ', vs0, ps0, owns0), listp(orl + vhead1 ' + qrl1, 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 + vhead1 ' + qrl1, vhead, vs), noidRely(tid, orl + vhead1 ' + qrl1, vs, orl + vhead1 ' + qrl1 + phead1 ', vs0), nonullRetRefs(orl + vhead1 ' + qrl1 + phead1 ', vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vhead1 ' + qrl1, 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(qrl1, ps), vtail ∈ qrl1 from lst, lst ∈ qrl1, lst ∈ ps, lst ∈ vs, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ orl + vhead1 ' + qrl1 + phead1 ' from vhead, vtail0 ∈ orl + vhead1 ' + qrl1 + phead1 ' from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1), ¬ dups(orl), ¬ dups(orl + qrl1), ¬ dups(orl + rl0), ¬ dups(rl0), ¬ vtail0 ∈ qrl1 from lst, ¬ lst ∈ orl from first, ¬ lst ∈ orl, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ phead1 ∈ rl0, ¬ phead1 ∈ orl, ¬ vhead1 ∈ qrl1, ¬ vhead1 ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vtail = qrl1.last ∨ vtail = (orl + (vhead1 ' + qrl1).butlast).last ∧ vs[qrl1.last].deqID = None ∧ vs[qrl1.last].next = null, phead0 ∈ orl ∨ phead0 ∈ rl0, (orl + rl0).last = vhead0 ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 = phead1, vhead1 ∈ rl0 ∨ vhead1 = vtail0, vtail0 = vhead1 ∨ vtail0 ∈ qrl1, orl.last = vhead ∧ unmarkedp(qrl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead1].deqID = None ∧ unmarkedp(qrl1, vs) ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: rl0

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws) ⊦ x + a ' + y ≠ []; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ markedp([], vs); (s) ⊦ ¬ dups([]); (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ ⊦ x + [] = x; (s) ⊦ unmarkedp([], vs); (s) ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s)

Proof step 133 from proof stable-D27 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = (vhead1 ' + qrl1) + qrl0, vs[ps[first].next].deqID = Some(othertid), ps0[vtail0].deqID = None, vs0[phead1].deqID = None, ps0[phead1].deqID = None, ps[vhead1].deqID = None, vs0[phead1].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl1.last ≠ phead1, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], orl1 ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead1 ' + qrl1, vs, ps, vs0, ps0), listp(orl + vhead1 ' + qrl1, vs, ps, owns), listp(orl + (vhead1 ' + qrl1) + qrl0 + phead1 ', 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 + vhead1 ' + qrl1, vhead, vs), noidRely(tid, orl + vhead1 ' + qrl1, vs, orl + (vhead1 ' + qrl1) + qrl0 + phead1 ', vs0), nonullRetRefs(orl + vhead1 ' + qrl1, vs, vretRefs, pretRefs), nonullRetRefs(orl + (vhead1 ' + qrl1) + qrl0 + phead1 ', 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(qrl1, ps), unmarkedp(orl1, ps0), vtail ∈ vhead1 ' + qrl1 from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, orl1.last ∈ orl + (vhead1 ' + qrl1) + qrl0 + phead1 ' from vtail, vhead0 ∈ orl + (vhead1 ' + qrl1) + qrl0 + phead1 ' from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1), ¬ dups(orl), ¬ dups(orl + qrl1), ¬ dups(orl + rl0 + orl1), ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(qrl0), ¬ orl1.last ∈ vhead1 ' + qrl1 from lst, ¬ lst ∈ orl from first, ¬ phead1 ∈ qrl0, ¬ lst ∈ orl, ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ phead1 ∈ orl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ orl, ¬ vhead1 ∈ qrl1, ¬ vhead1 ∈ orl, ¬ orl1.last ∈ qrl0, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), vhead1 ∈ rl0 ∨ vhead1 = vtail0 ∨ vhead1 ∈ orl1, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = phead1, (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0), phead0 ∈ orl ∨ phead0 ∈ rl0, lst = vhead1 ∨ lst ∈ qrl1, orl.last = vhead ∧ unmarkedp(qrl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead1].deqID = None ∧ unmarkedp(qrl1, vs), vtail = (vhead1 ' + qrl1).last ∨ vtail = (orl + (vhead1 ' + qrl1).butlast).last ∧ vs[(vhead1 ' + qrl1).last].deqID = None ∧ vs[(vhead1 ' + qrl1).last].next = null ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl0

Additional information

Used simplifier rules: reflist freely generated by [], +;;

Proof step 134 from proof stable-D27 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = (vhead1 ' + qrl1) + qrl0, ps[vhead1].deqID = None, ps0[phead1].deqID = None, vs0[phead1].deqID = None, ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs0[phead1].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl0 = [], rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl1.last ≠ phead1, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], orl1 ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead1 ' + qrl1, vs, ps, vs0, ps0), listp(orl + (vhead1 ' + qrl1) + qrl0 + phead1 ', vs0, ps0, owns0), listp(orl + vhead1 ' + qrl1, 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 + vhead1 ' + qrl1, vhead, vs), noidRely(tid, orl + vhead1 ' + qrl1, vs, orl + (vhead1 ' + qrl1) + qrl0 + phead1 ', vs0), nonullRetRefs(orl + (vhead1 ' + qrl1) + qrl0 + phead1 ', vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vhead1 ' + qrl1, 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(orl1, ps0), unmarkedp(qrl1, ps), lst ∈ ps, lst ∈ vs, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ orl + (vhead1 ' + qrl1) + qrl0 + phead1 ' from vhead, orl1.last ∈ orl + (vhead1 ' + qrl1) + qrl0 + phead1 ' from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ vhead1 ' + qrl1 from lst, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1), ¬ dups(orl), ¬ dups(orl + qrl1), ¬ dups(orl + rl0 + orl1), ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(qrl0), ¬ orl1.last ∈ vhead1 ' + qrl1 from lst, ¬ lst ∈ orl from first, ¬ phead1 ∈ qrl0, ¬ lst ∈ orl, ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ phead1 ∈ orl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ orl, ¬ vhead1 ∈ qrl1, ¬ vhead1 ∈ orl, ¬ orl1.last ∈ 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vtail = (vhead1 ' + qrl1).last ∨ vtail = (orl + (vhead1 ' + qrl1).butlast).last ∧ vs[(vhead1 ' + qrl1).last].deqID = None ∧ vs[(vhead1 ' + qrl1).last].next = null, orl.last = vhead ∧ unmarkedp(qrl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead1].deqID = None ∧ unmarkedp(qrl1, vs), lst = vhead1 ∨ lst ∈ qrl1, phead0 ∈ orl ∨ phead0 ∈ rl0, (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = phead1, vhead1 ∈ rl0 ∨ vhead1 = vtail0 ∨ vhead1 ∈ orl1 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ x ∧ a ∈ y → dups(x + y); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s) ⊦ [] + x = x; (s) ⊦ markedp([], vs); (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)

Proof step 135 from proof stable-D27 (previous step) (back to tree)

ps[vhead1].deqID = None, ps0[phead1].deqID = None, vs0[phead1].deqID = None, ps0[vhead1].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs0[phead1].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), qrl1 + qrl0 ≠ [], (qrl1 + qrl0).last ≠ phead1, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vhead1 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead1 ' + qrl1, vs, ps, vs0, ps0), listp(orl + (vhead1 ' + qrl1) + qrl0 + phead1 ', vs0, ps0, owns0), listp(orl + vhead1 ' + qrl1, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + vhead1 ' + qrl1, vhead, vs), noidRely(tid, orl + vhead1 ' + qrl1, vs, orl + (vhead1 ' + qrl1) + qrl0 + phead1 ', vs0), nonullRetRefs(orl + (vhead1 ' + qrl1) + qrl0 + phead1 ', vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vhead1 ' + qrl1, 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(qrl1, ps), unmarkedp(qrl1, ps0), unmarkedp(qrl0, ps0), lst ∈ ps, lst ∈ vs, first ∈ orl, phead ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ orl + (vhead1 ' + qrl1) + qrl0 + phead1 ' from vhead, (qrl1 + qrl0).last ∈ orl + (vhead1 ' + qrl1) + qrl0 + phead1 ' from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ vhead1 ' + qrl1 from lst, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ orl, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl1 + qrl0), ¬ dups(orl), ¬ dups(qrl1 + qrl0), ¬ dups(orl + qrl1), ¬ dups(qrl0), ¬ dups(qrl1), ¬ lst ∈ orl, ¬ phead1 ∈ qrl0, ¬ lst ∈ orl from first, ¬ (qrl1 + qrl0).last ∈ vhead1 ' + qrl1 from lst, ¬ (qrl1 + qrl0).last ∈ qrl0, ¬ vhead1 ∈ qrl1, ¬ phead1 ∈ orl, ¬ phead1 ∈ qrl1, ¬ vhead1 ∈ orl, ¬ vhead1 ∈ qrl0, ¬ phead0 ∈ qrl1, 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vtail = (vhead1 ' + qrl1).last ∨ vtail = (orl + (vhead1 ' + qrl1).butlast).last ∧ vs[(vhead1 ' + qrl1).last].deqID = None ∧ vs[(vhead1 ' + qrl1).last].next = null, orl.last = vhead ∧ unmarkedp(qrl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead1].deqID = None ∧ unmarkedp(qrl1, vs), lst = vhead1 ∨ lst ∈ qrl1, phead0 ∈ qrl0 ∨ phead0 ∈ orl from phead, orl.last = vhead0 ∧ unmarkedp(qrl1, vs0) ∧ unmarkedp(qrl0, vs0) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ vs0[vhead1].deqID = None ∧ unmarkedp(qrl1, vs0) ∧ unmarkedp(qrl0, vs0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [qrl1, qrl0], <all paths>

Additional information

Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ ¬ a ∈ []; (s) ⊦ unmarkedp([], vs); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s) Used terms: qrl1, qrl0

Proof step 136 from proof stable-D27 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 137 from proof stable-D27 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = (vhead1 ' + qrl1) + qrl0, ps[vhead1].deqID = None, ps0[phead1].deqID = None, vs0[phead1].deqID = None, ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs0[phead1].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl0 = vtail1 + rl, rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl1.last ≠ phead1, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], orl1 ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead1 ' + qrl1, vs, ps, vs0, ps0), listp(orl + (vhead1 ' + qrl1) + qrl0 + phead1 ', vs0, ps0, owns0), listp(orl + vhead1 ' + qrl1, 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 + vhead1 ' + qrl1, vhead, vs), noidRely(tid, orl + vhead1 ' + qrl1, vs, orl + (vhead1 ' + qrl1) + qrl0 + phead1 ', vs0), nonullRetRefs(orl + (vhead1 ' + qrl1) + qrl0 + phead1 ', vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vhead1 ' + qrl1, 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(orl1, ps0), unmarkedp(qrl1, ps), lst ∈ ps, lst ∈ vs, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ orl + (vhead1 ' + qrl1) + qrl0 + phead1 ' from vhead, orl1.last ∈ orl + (vhead1 ' + qrl1) + qrl0 + phead1 ' from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ vhead1 ' + qrl1 from lst, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl1), ¬ dups(orl), ¬ dups(orl + qrl1), ¬ dups(orl + rl0 + orl1), ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(qrl0), ¬ orl1.last ∈ vhead1 ' + qrl1 from lst, ¬ lst ∈ orl from first, ¬ phead1 ∈ qrl0, ¬ lst ∈ orl, ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ phead1 ∈ orl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ orl, ¬ vhead1 ∈ qrl1, ¬ vhead1 ∈ orl, ¬ orl1.last ∈ 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vtail = (vhead1 ' + qrl1).last ∨ vtail = (orl + (vhead1 ' + qrl1).butlast).last ∧ vs[(vhead1 ' + qrl1).last].deqID = None ∧ vs[(vhead1 ' + qrl1).last].next = null, orl.last = vhead ∧ unmarkedp(qrl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead1].deqID = None ∧ unmarkedp(qrl1, vs), lst = vhead1 ∨ lst ∈ qrl1, phead0 ∈ orl ∨ phead0 ∈ rl0, (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = phead1, vhead1 ∈ rl0 ∨ vhead1 = vtail0 ∨ vhead1 ∈ orl1 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a + x = a ' + x; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' + y ≠ []; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)

Proof step 138 from proof stable-D27 (previous step) (back to tree)

rl + vtail0 ' + orl1 = qrl1 + qrl0, ps[vhead1].deqID = None, ps0[phead1].deqID = None, vs0[phead1].deqID = None, ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs0[phead1].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl1.last ≠ phead1, ps[first].next ≠ null, addr ≠ null, first ≠ lst, lst ≠ vhead1, orl ≠ [], orl1 ≠ [], phead1 ≠ vhead1, pretRefs0(tid) ≠ null, vtail0 ≠ vhead1, vtail0 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead1 ' + qrl1, vs, ps, vs0, ps0), listp(orl + (vhead1 ' + qrl1) + qrl0 + phead1 ', vs0, ps0, owns0), listp(orl + vhead1 ' + qrl1, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl, vs0), markedp(orl, ps0), markedp(rl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + vhead1 ' + qrl1, vhead, vs), noidRely(tid, orl + vhead1 ' + qrl1, vs, orl + (vhead1 ' + qrl1) + qrl0 + phead1 ', vs0), nonullRetRefs(orl + (vhead1 ' + qrl1) + qrl0 + phead1 ', vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vhead1 ' + qrl1, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vhead1].deqID), some?(ps0[vhead1].deqID), unmarkedp(orl1, ps0), unmarkedp(qrl1, ps), lst ∈ qrl1, lst ∈ ps, lst ∈ vs, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ orl + (vhead1 ' + qrl1) + qrl0 + phead1 ' from vhead, orl1.last ∈ orl + (vhead1 ' + qrl1) + qrl0 + phead1 ' from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ qrl1 from lst, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(orl + rl + orl1), ¬ dups(orl + qrl1), ¬ dups(qrl1), ¬ dups(orl + rl), ¬ dups(rl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ dups(rl), ¬ vhead1 ∈ orl1, ¬ vhead1 ∈ rl, ¬ orl1.last ∈ qrl0, ¬ vhead1 ∈ orl, ¬ vhead1 ∈ qrl1, ¬ phead1 ∈ orl, ¬ phead1 ∈ rl, ¬ phead1 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl, ¬ vtail0 ∈ orl1, ¬ lst ∈ orl, ¬ phead1 ∈ qrl0, ¬ lst ∈ orl from first, ¬ orl1.last ∈ qrl1 from lst, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), phead0 ∈ orl from phead ∨ phead0 = vhead1 ∨ phead0 ∈ rl ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = phead1, phead0 ∈ orl ∨ phead0 = vhead1 ∨ phead0 ∈ rl, (vhead1 ' + rl).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ orl + (vhead1 ' + rl).butlast ≠ [] ∧ (orl + (vhead1 ' + rl).butlast).last = vhead0 ∧ phead0 ≠ (vhead1 ' + rl).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0), orl.last = vhead ∧ unmarkedp(qrl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead1].deqID = None ∧ unmarkedp(qrl1, vs), vtail = qrl1.last ∨ vtail = (orl + (vhead1 ' + qrl1).butlast).last ∧ vs[qrl1.last].deqID = None ∧ vs[qrl1.last].next = null ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [orl1, lst0, qrl]

Additional information

Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ x + [] = x; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl1, lst0, y

Proof step 139 from proof stable-D27 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = qrl + qrl0, vs[ps[first].next].deqID = Some(othertid), ps0[vtail0].deqID = None, vs0[phead1].deqID = None, ps0[phead1].deqID = None, vs0[phead1].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp(orl + qrl + qrl0 + phead1 ', 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 + qrl + qrl0 + phead1 ', vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl + qrl0 + phead1 ', 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(orl1, ps0), vhead0 ∈ orl + qrl + qrl0 + phead1 ' from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, (vtail0 ' + orl1).last ∈ orl + qrl + qrl0 + phead1 ' from vtail, lst ∈ orl, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0 + orl1), ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(qrl0), ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ phead1 ∈ orl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ orl, ¬ (vtail0 ' + orl1).last ∈ (orl from lst) + qrl + qrl0 + phead1 ', ¬ phead1 ∈ qrl0, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = phead1, (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x ∧ a ∈ y → dups(x + y); (s) ⊦ a ∈ b ' ↔ a = b; (s) list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s)

Proof step 140 from proof stable-D27 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = qrl + qrl0, vs[ps[first].next].deqID = Some(othertid), ps0[vtail0].deqID = None, vs0[phead1].deqID = None, ps0[phead1].deqID = None, vs0[phead1].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], (vtail0 ' + orl1).last ≠ phead1, (vtail0 ' + orl1).last ≠ vtail0, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp(orl + qrl + qrl0 + phead1 ', 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 + qrl + qrl0 + phead1 ', vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl + qrl0 + phead1 ', 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(orl1, ps0), lst ∈ ps, lst ∈ vs, lst ∈ ps0, lst ∈ vs0, vhead0 ∈ orl + qrl + qrl0 + phead1 ' from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, (vtail0 ' + orl1).last ∈ orl + qrl + qrl0 + phead1 ' from vtail, lst ∈ orl, lst ∈ orl from first, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(orl1), ¬ dups(orl), ¬ dups(rl0 + orl1), ¬ dups(orl + rl0), ¬ dups(orl + rl0 + orl1), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ (vtail0 ' + orl1).last ∈ rl0, ¬ (vtail0 ' + orl1).last ∈ qrl0, ¬ (vtail0 ' + orl1).last ∈ qrl, ¬ (vtail0 ' + orl1).last ∈ orl from lst, ¬ phead1 ∈ orl, ¬ phead1 ∈ rl0, ¬ phead1 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl1, ¬ phead1 ∈ qrl0, ¬ (vtail0 ' + orl1).last ∈ orl1, ¬ lst ∈ qrl, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = phead1, (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0), vtail ∈ orl from lst ∨ vtail ∈ qrl, phead0 ∈ orl ∨ phead0 ∈ rl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [vtail0 ', orl1], <all paths>

Additional information

Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: vtail0 ', orl1

Proof step 141 from proof stable-D27 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 142 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, 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), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ 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), ¬ lst ∈ orl from first, ¬ lst ∈ rl0, ¬ lst ∈ qrl0, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ

Proof step 143 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, 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, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, lst ∈ qrl, lst ∈ vs, lst ∈ ps, 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), ¬ lst ∈ orl from first, ¬ lst ∈ rl0, ¬ lst ∈ 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-data[reflist], name:elim-list-c, seq:x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y, subst:[x, a, y] → [qrl, phead1, orl0]

Additional information

Used simplifier rules: ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ' + x ≠ []; (s) ⊦ a + x = a ' + x; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ in-14: ⊦ a ' + x = y → a ∈ y; (forward) 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) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, phead1, y

Proof step 144 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, vs[ps[first].next].val ≠ vs0[ps[first].next].val, addr ≠ null, first ≠ lst, 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), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:equalrl-def, seq:⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val)), subst:[ps, rl, ps0, vs0, vs] → [ps, orl + qrl, ps0, vs0, vs], <all paths>

Additional information

Used terms: ps, orl + qrl, ps0, vs0, vs

Proof step 145 from proof stable-D27 (previous step) (back to tree)

⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ (vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val))

A spec-lemma

Proof step 146 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, vs[ps[first].next].val ≠ vs0[ps[first].next].val, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), 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, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ∀ r. r ∈ orl + qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].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), lst ∈ orl from first ∨ lst ∈ qrl, 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 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)

Proof step 147 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, vs[ps[first].next].val ≠ vs0[ps[first].next].val, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), 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), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].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, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 76 terms: ps[first].next abort: F discard: F computed: T

Additional information

Used terms: ps[first].next

Proof step 148 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, vs[ps[first].next].val ≠ vs0[ps[first].next].val, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), 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, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ∈ orl ∨ ps[first].next ∈ qrl → vs[ps[first].next].val = vs0[ps[first].next].val ∧ ps[ps[first].next].val = ps0[ps[first].next].val ∧ (vs[ps[first].next].deqID ≠ None → vs0[ps[first].next].deqID = vs[ps[first].next].deqID) ∧ (ps[ps[first].next].deqID ≠ None → ps0[ps[first].next].deqID = ps[ps[first].next].deqID) ∧ (vs[ps[first].next].next ≠ null → vs0[ps[first].next].next = vs[ps[first].next].next) ∧ (ps[ps[first].next].next ≠ null → ps0[ps[first].next].next = ps[ps[first].next].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].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), lst ∈ orl from first ∨ lst ∈ qrl, 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 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 149 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, vs[ps[first].next].val ≠ vs0[ps[first].next].val, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), 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), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ 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), ¬ ps[first].next ∈ orl, ¬ ps[first].next ∈ qrl, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].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, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-in-postfix1, seq:⊦ listp(rl + rl0, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + rl0, vs, ps, owns)), subst:[ps, rl, owns, r, rl0, vs] → [ps, orl, owns, first, qrl, vs]

Additional information

Used terms: ps, orl, owns, first, qrl, vs

Proof step 150 from proof stable-D27 (previous step) (back to tree)

⊦ listp(rl + rl0, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + rl0, vs, ps, owns))

A spec-lemma

Proof step 151 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, vs[ps[first].next].val ≠ vs0[ps[first].next].val, addr ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), 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, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, 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), ¬ ps[first].next ∈ orl, ¬ ps[first].next ∈ qrl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), listp(orl + qrl, vs, ps, owns) ∧ first ∈ orl → (∃ rl1, rl2. orl = rl1 + first ' + rl2 ∧ listp(first ' + rl2 + qrl, vs, ps, owns)), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].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), lst ∈ orl from first ∨ lst ∈ qrl, 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 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' + y ≠ []; (s) ⊦ x = y + a ' + z → a ∈ x; (s)

Proof step 152 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ first, ps[first].next ≠ null, vs[ps[first].next].val ≠ vs0[ps[first].next].val, addr ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(((rl1 + first ' + rl2) + 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), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ ps[first].next ∈ rl2, ¬ ps[first].next ∈ rl1, ¬ ps[first].next ∈ qrl, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), ∀ r. r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl2

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 153 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl2 = [], rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ first, ps[first].next ≠ null, vs[ps[first].next].val ≠ vs0[ps[first].next].val, addr ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(first ' + rl2 + qrl, vs, ps, owns), listp(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl0, ps0), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl0, vs0), markedp(rl1, ps0), markedp(rl2, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs(((rl1 + first ' + rl2) + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[first].deqID), some?(ps[first].deqID), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(rl2), ¬ dups(rl0 + qrl0), ¬ dups(rl2 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl0), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ ps[first].next ∈ rl2, ¬ ps[first].next ∈ rl1, ¬ ps[first].next ∈ qrl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ∀ r. r ∈ rl1 ∨ r = first ∨ r ∈ rl2 ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(first ' + rl2 + qrl).last].next ≠ null → vs0[(first ' + rl2 + qrl).last].next = vs[(first ' + rl2 + qrl).last].next ∧ vs0[vs0[(first ' + rl2 + qrl).last].next].val = vs[vs0[(first ' + rl2 + qrl).last].next].val), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail0 = (first ' + rl2 + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

Proof step 154 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ first, ps[first].next ≠ null, vs[ps[first].next].val ≠ vs0[ps[first].next].val, addr ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(rl1 + first ' + qrl, vs, ps, owns), listp(rl1 + first ' + rl0 + qrl0, vs0, ps0, owns0), listp(first ' + qrl, vs, ps, owns), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl1, ps), markedp(rl1, vs), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, rl1 + first ' + qrl, vhead, vs), noidRely(tid, rl1 + first ' + qrl, vs, rl1 + first ' + rl0 + qrl0, vs0), nonullRetRefs(rl1 + first ' + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + 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), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ vrvHp, vtail0 ∈ rl1 + first ' + rl0 + qrl0 from vtail, vhead0 ∈ rl1 + first ' + rl0 + qrl0 from vhead, lst ∈ qrl, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl0 + qrl0), ¬ dups(rl1 + qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups(qrl), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl1, ¬ ps[first].next ∈ rl1, ¬ ps[first].next ∈ qrl, vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), ∀ r. r ∈ rl1 ∨ r = first ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ (vs[qrl.last].next ≠ null → vs0[qrl.last].next = vs[qrl.last].next ∧ vs0[vs0[qrl.last].next].val = vs[vs0[qrl.last].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0, vtail0 = (first ' + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, first = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 ≠ [] ∧ rl1.last = vhead ∧ phead ≠ first ∧ unmarkedp(qrl, vs), (first ' + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl0).last ∧ unmarkedp(qrl0, vs0), phead ∈ rl1 ∨ phead = first, phead0 ∈ rl1 + first ' from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-data[reflist], name:elim-list-c, seq:x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y, subst:[x, a, y] → [qrl, vtail1, rl2]

Additional information

Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, vtail1, y

Proof step 155 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, 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), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:noidRely-head-1, seq: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), subst:[qrl, rl, vhead, vhead0, tid, qrl0, orl, vs0, rl0, vs] → [qrl, rl, vhead, vhead0, tid, qrl0, orl, vs0, rl0, vs], <all paths>

Additional information

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

Proof step 156 from proof stable-D27 (previous step) (back to tree)

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)

A spec-lemma

Proof step 157 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, 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, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].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), lst ∈ orl from first ∨ lst ∈ qrl, 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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 158 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, 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), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, addr ∈ 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + 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)

Heuristic use patterns applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 159 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl.last ≠ vhead, ps[first].next ≠ null, addr ≠ null, first ≠ lst, 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, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].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), lst ∈ orl from first ∨ lst ∈ qrl, 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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss)

Proof step 160 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl.butlast = [], vs[ps[first].next].deqID = Some(othertid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl.last ≠ [].last, ps[first].next ≠ null, addr ≠ null, first ≠ lst, 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, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, 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), [].last = first → rvowns(addr) = Claimed(othertid, vs[ps[[].last].next].val), lst ∈ orl from first ∨ lst ∈ qrl, 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) ⊦

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [orl, vtail1, orl0]

Additional information

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

Proof step 161 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(othertid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], (orl + rl0).last ≠ vhead0, ps[first].next ≠ null, addr ≠ null, first ≠ lst, 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, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].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), lst ∈ orl from first ∨ lst ∈ qrl, 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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 162 from proof stable-D27 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (orl + rl0).butlast = [], vs[ps[first].next].deqID = Some(othertid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ orl.head ', orl + rl0 ≠ [], (orl + rl0).last ≠ [].last, ps[first].next ≠ null, addr ≠ null, first ≠ lst, 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, addr ∈ vrvHp, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, 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), vhead = first → rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, 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 ⊦

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [orl, vtail1, orl0]

Additional information

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

Proof Tree for stable-D27 (View conclusion)

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.

the proof tree