[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-D21 (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.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ 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.nxt ≠ null ∧ ls.first ∈ gs0.orl ∧ ls.nxt = gs0.ps[ls.first].next ∧ gs0.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs0.ps[ls.nxt].deqID = None → gs0.vhead = ls.first) ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.nxt, gs0.vs) ∧ (gs0.qrl ≠ [] ∧ gs0.vs[gs0.qrl.head].deqID = Some(ls.tid) → gs0.vhead = ls.first)) ∧ (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.success ∧ gs0.vretRefs(ls.tid) ∈ gs0.vrvHp ∧ gs0.vretRefs(ls.tid) ≠ null ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs0.vs[ls.nxt].val)) ∧ (gs0.vhead ≠ ls.first → nextnottid(ls.tid, 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-D21 (previous step) (back to tree)

gs.vs[ls.nxt].deqID = Some(ls.tid), 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)) = Claimed(ls.tid, ls.optval.val), 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.first ≠ ls.lst, ls.nxt ≠ null, gs0.orl ≠ [], gs.orl ≠ [], ls.rvref ≠ null, gs.vretRefs(ls.tid) ≠ null, ls.success, 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), nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noid(ls.tid, gs.orl + gs.qrl, ls.nxt, 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, gs.vretRefs(ls.tid) ∈ gs.vrvHp, gs0.phead ∈ gs0.orl, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ dups(gs0.orl + gs0.qrl), ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first, gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first, gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∃ 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.nxt ≠ null ∧ ls.first ∈ gs0.orl ∧ ls.nxt = gs0.ps[ls.first].next ∧ gs0.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs0.ps[ls.nxt].deqID = None → gs0.vhead = ls.first) ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.nxt, gs0.vs) ∧ (gs0.qrl ≠ [] ∧ gs0.vs[gs0.qrl.head].deqID = Some(ls.tid) → gs0.vhead = ls.first)) ∧ (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.success ∧ gs0.vretRefs(ls.tid) ∈ gs0.vrvHp ∧ gs0.vretRefs(ls.tid) ≠ null ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs0.vs[ls.nxt].val)) ∧ (gs0.vhead ≠ ls.first → nextnottid(ls.tid, 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) = Claimed(othertid, v) ∧ addr ∈ vrvHp ∧ addr ≠ null → (rvowns0(addr) = Claimed(othertid, v) ↔ true); (ss) ⊦ Val(val).val = val; (s) ⊦ dom prvHp = dom vrvHp ∧ dom vrvHp ⊆ dom vrvHp0 ∧ dom prvHp0 = dom vrvHp0 ∧ rvref ∈ prvHp → rvref ∈ prvHp0; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ noowns(tid, owns) ∧ ownsRely(tid, owns, owns0) → noowns(tid, owns0); (ss) ⊦ 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-D21 (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.tid), ls.nxt = gs.ps[ls.first].next, ls.optval = Val(gs.vs[ls.nxt].val), gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(ls.rvref) = Claimed(ls.tid, gs.vs[ls.nxt].val), 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.first ≠ ls.lst, ls.nxt ≠ null, gs.orl ≠ [], gs0.orl ≠ [], ls.rvref ≠ null, ls.success, 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), nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noid(ls.tid, gs.orl + gs.qrl, ls.nxt, 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, gs0.phead ∈ gs0.orl, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.prvHp ⊆ dom gs0.prvHp, ¬ dups(gs0.qrl), ¬ dups(gs0.orl), ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), ¬ dups(gs0.orl + gs0.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first, gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first, gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), gs.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.tid) ∧ (gs0.ps[ls.nxt].deqID = None → gs0.vhead = ls.first) ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.nxt, gs0.vs) ∧ (gs0.qrl ≠ [] ∧ gs0.vs[gs0.qrl.head].deqID = Some(ls.tid) → gs0.vhead = ls.first) ∧ 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 ∧ (gs0.vhead ≠ ls.first → nextnottid(ls.tid, 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-D21 (previous step) (back to tree)

orl + rl0 = gs0.orl, orl + qrl + rl = gs0.orl + gs0.qrl, vs[ls.nxt].deqID = Some(ls.tid), 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) = Claimed(ls.tid, vs[ls.nxt].val), vretRefs(ls.tid) = ls.rvref, ls.first ≠ ls.lst, ls.nxt ≠ null, gs0.orl ≠ [], ls.rvref ≠ null, orl ≠ [], ls.success, 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), nextnottidRely(ls.tid, vhead, vs, gs0.vhead, gs0.vs), noid(ls.tid, orl + qrl, ls.nxt, 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.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, ¬ 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), vhead ≠ ls.first → nextnottid(ls.tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(ls.tid) → vhead = ls.first, ps[ls.nxt].deqID = None → vhead = ls.first, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), 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.tid) ∧ (gs0.ps[ls.nxt].deqID = None → gs0.vhead = ls.first) ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.nxt, gs0.vs) ∧ (gs0.qrl ≠ [] ∧ gs0.vs[gs0.qrl.head].deqID = Some(ls.tid) → gs0.vhead = ls.first) ∧ 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 ∧ (gs0.vhead ≠ ls.first → nextnottid(ls.tid, 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) ⊦ noidRely(tid, orl + qrl, vs, orl + rl0 + qrl0, vs0) ∧ noid(tid, orl + qrl, first, vs) → noid(tid, orl + rl0 + qrl0, first, vs0); (ss) ⊦ 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-D21 (previous step) (back to tree)

orl + rl0 = gs0.orl, qrl + rl = rl0 + gs0.qrl, vs[ls.nxt].deqID = Some(ls.tid), 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) = Claimed(ls.tid, vs[ls.nxt].val), vretRefs(ls.tid) = ls.rvref, orl + rl0 ≠ [], ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ null, orl ≠ [], ls.success, 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), nextnottidRely(ls.tid, vhead, vs, gs0.vhead, gs0.vs), noid(ls.tid, orl + qrl, ls.nxt, 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.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, ¬ 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), vhead ≠ ls.first → nextnottid(ls.tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(ls.tid) → vhead = ls.first, ps[ls.nxt].deqID = None → vhead = ls.first, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (orl + rl0).last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = gs0.vhead ∧ gs0.phead ≠ (orl + rl0).last ∧ unmarkedp(gs0.qrl, gs0.vs), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), 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.tid) ∧ (gs0.ps[ls.nxt].deqID = None → gs0.vhead = ls.first) ∧ (gs0.qrl ≠ [] ∧ gs0.vs[gs0.qrl.head].deqID = Some(ls.tid) → gs0.vhead = ls.first) ∧ 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 ∧ (gs0.vhead ≠ ls.first → nextnottid(ls.tid, 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-D21 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl + rl0 = orl0, vs[ls.nxt].deqID = Some(ls.tid), 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) = Claimed(ls.tid, vs[ls.nxt].val), vretRefs(ls.tid) = ls.rvref, orl + rl0 ≠ [], ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ null, orl ≠ [], ls.success, 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), nextnottidRely(ls.tid, vhead, vs, vhead0, vs0), noid(ls.tid, orl + qrl, ls.nxt, 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, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(qrl + rl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ls.nxt].deqID = None → vhead = ls.first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(ls.tid) → vhead = ls.first, vhead ≠ ls.first → nextnottid(ls.tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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.tid) ∧ (ps0[ls.nxt].deqID = None → vhead0 = ls.first) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(ls.tid) → vhead0 = ls.first) ∧ 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 ∧ (vhead0 ≠ ls.first → nextnottid(ls.tid, 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-D21 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ls.nxt].deqID = Some(ls.tid), 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) = Claimed(ls.tid, vs[ls.nxt].val), vretRefs(ls.tid) = ls.rvref, orl + rl0 ≠ [], ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ null, orl ≠ [], ls.success, 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), nextnottidRely(ls.tid, vhead, vs, vhead0, vs0), noid(ls.tid, orl + qrl, ls.nxt, 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.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, ¬ 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), vhead ≠ ls.first → nextnottid(ls.tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(ls.tid) → vhead = ls.first, ps[ls.nxt].deqID = None → vhead = ls.first, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), 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.tid) ∧ (ps0[ls.nxt].deqID = None → vhead0 = ls.first) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(ls.tid) → vhead0 = ls.first) ∧ 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 ∧ (vhead0 ≠ ls.first → nextnottid(ls.tid, 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-D21 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[nxt].deqID = Some(tid), 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) = Claimed(tid, vs[nxt].val), rvref = vretRefs0(tid), rvref = pretRefs0(tid), success, vretRefs(tid) = rvref, orl + rl0 ≠ [], 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, nxt, 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, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[nxt].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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(tid) ∧ (ps0[nxt].deqID = None → vhead0 = first) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first) ∧ vtail0 ∈ (orl + rl0) + qrl0 from lst ∧ (lst ∈ orl from first ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ vs[nxt].val = vs0[nxt].val ∧ (vhead0 ≠ first → nextnottid(tid, 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-D21 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, ps[first].next, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, 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), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), 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(tid) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first) ∧ vtail0 ∈ (orl + rl0) + qrl0 from lst ∧ (lst ∈ orl from first ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ vs[ps[first].next].val = vs0[ps[first].next].val ∧ (vhead0 ≠ first → nextnottid(tid, vhead0, 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 10 from proof stable-D21 (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 11 from proof stable-D21 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, ps[first].next, 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, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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)), 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) ⊦ ps[first].next = ps0[first].next ∧ vs0[ps[first].next].deqID = Some(tid) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first) ∧ vtail0 ∈ (orl + rl0) + qrl0 from lst ∧ (lst ∈ orl from first ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ vs[ps[first].next].val = vs0[ps[first].next].val ∧ (vhead0 ≠ first → nextnottid(tid, 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] ⊦ 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).last = (a ' + y).last; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (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 12 from proof stable-D21 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ 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), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, 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, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[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 ' + 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 ⊦ ps[first].next = ps0[first].next ∧ vs0[ps[first].next].deqID = Some(tid) ∧ (ps0[ps[first].next].deqID = None → vhead0 = first) ∧ (qrl0 ≠ [] ∧ vs0[qrl0.head].deqID = Some(tid) → vhead0 = first) ∧ vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from lst ∧ (lst ∈ rl2 ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ vs[ps[first].next].val = vs0[ps[first].next].val ∧ (vhead0 ≠ first → nextnottid(tid, vhead0, vs0))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

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

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ ps0[first].next, ps[first].next ≠ 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), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, 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, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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 ∈ 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) ⊦

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, (rl1 + first ' + rl2) + qrl, ps0, vs0, vs], <all paths>

Additional information

Used terms: ps, (rl1 + first ' + rl2) + qrl, ps0, vs0, vs

Proof step 14 from proof stable-D21 (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 15 from proof stable-D21 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ ps0[first].next, ps[first].next ≠ 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, 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, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[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 + first ' + rl2) + 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[((rl1 + first ' + rl2) + qrl).last].next ≠ null → vs0[((rl1 + first ' + rl2) + qrl).last].next = vs[((rl1 + first ' + rl2) + qrl).last].next ∧ vs0[vs0[((rl1 + first ' + rl2) + qrl).last].next].val = vs[vs0[((rl1 + 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 ⊦

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) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s)

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

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ ps0[first].next, ps[first].next ≠ 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, 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, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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) ⊦

User applied rule all left

And closed the goal!

Rule argument

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

Additional information

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

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

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs0[ps[first].next].deqID ≠ Some(tid), ps[first].next ≠ 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), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, 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, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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 ∈ 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) ⊦

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, (rl1 + first ' + rl2) + qrl, ps0, vs0, vs], <all paths>

Additional information

Used terms: ps, (rl1 + first ' + rl2) + qrl, ps0, vs0, vs

Proof step 18 from proof stable-D21 (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 19 from proof stable-D21 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs0[ps[first].next].deqID ≠ Some(tid), ps[first].next ≠ 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, 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, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[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 + first ' + rl2) + 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[((rl1 + first ' + rl2) + qrl).last].next ≠ null → vs0[((rl1 + first ' + rl2) + qrl).last].next = vs[((rl1 + first ' + rl2) + qrl).last].next ∧ vs0[vs0[((rl1 + first ' + rl2) + qrl).last].next].val = vs[vs0[((rl1 + 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 ⊦

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) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s)

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

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs0[ps[first].next].deqID ≠ Some(tid), ps[first].next ≠ 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, 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, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: ps[first].next

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

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs0[ps[first].next].deqID ≠ Some(tid), ps[first].next ≠ 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, 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, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[first].next ∈ rl1 ∨ ps[first].next = first ∨ ps[first].next ∈ rl2 ∨ 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[(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 = 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 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs0[ps[first].next].deqID ≠ Some(tid), ps[first].next ≠ null, ps[first].next ≠ first, 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, 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(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ ps[first].next ∈ rl1, ¬ ps[first].next ∈ rl2, ¬ 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), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[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 = 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-D21 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl2 = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs0[ps[first].next].deqID ≠ Some(tid), ps[first].next ≠ null, ps[first].next ≠ first, 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ ps[first].next ∈ rl1, ¬ ps[first].next ∈ rl2, ¬ ps[first].next ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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-D21 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs0[ps[first].next].deqID ≠ Some(tid), ps[first].next ≠ null, ps[first].next ≠ first, 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, rl1 + first ' + qrl, ps[first].next, 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, 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), ¬ dups(rl0 + qrl0), ¬ dups(rl1 + rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ first ∈ rl1, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, ¬ 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), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[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 = 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-D21 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps0[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vhead0 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, 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, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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 ∈ 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) ⊦

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) ⊦ ¬ 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 ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a + x = a ' + x; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ some?(opttid) → opttid ≠ None; (as)

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

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), ps0[ps[first].next].deqID = None, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl2 = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vhead0 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, 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, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[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 ' + 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 ⊦

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 '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

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

qrl + rl = rl0 + qrl0, ps0[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vhead0 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + qrl, vs, ps, vs0, ps0), listp(first ' + qrl, vs, ps, owns), listp(rl1 + first ' + qrl, vs, ps, owns), listp(rl1 + first ' + rl0 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl1, ps), markedp(rl1, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, rl1 + first ' + qrl, ps[first].next, 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, 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, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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 ∈ rl1 + first ' from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first, 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), 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 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, vtail1, rl2]

Additional information

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

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

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), ps0[ps[first].next].deqID = None, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), qrl = vtail1 + rl2, rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, qrl ≠ [], vhead0 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, rl1 + first ' + qrl, ps[first].next, 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), lst ∈ ps, lst ∈ vs, lst ∈ qrl, vhead0 ∈ rl1 + first ' + rl0 + qrl0 from vhead, vtail0 ∈ rl1 + first ' + rl0 + qrl0 from vtail, 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, 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, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[vtail1].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (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(rl2, 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, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl0, phead ∈ rl1 ∨ phead = first, phead0 ∈ rl1 + first ' 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).tid = tid; (s) ⊦ None ≠ Some(tid); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (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 ' ↔ a = b; (s) 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] notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ' + x ≠ []; (s) ⊦ a + x = a ' + x; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ 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) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s)

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

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

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl0

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws) ⊦ 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) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ x + a ' + y ≠ []; (s) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (b ' + a ' + x).last = (a ' + x).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] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ some?(opttid) → opttid ≠ None; (as)

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

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

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 ⊦ a ∈ x ∧ a ∈ y → dups(x + y); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ' + x ≠ []; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (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 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 in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

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

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

Heuristic use patterns 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] → [rl1, vtail1, rl0]

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 ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (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: rl1, vtail1, y

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

qrl + rl = rl0 + qrl0, vs0[qrl0.head].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, qrl0 ≠ [], vhead0 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, 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, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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 ∈ 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] ⊦ y ≠ [] → (a ' + x + y).last = y.last; (s)

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

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), vs0[qrl0.head].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, qrl0 ≠ [], vhead0 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, 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, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[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 ' + 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, 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, (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(qrl0.tail, vs0) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = qrl0.last ∨ vtail0 = (first ' + 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] → [qrl0, phead1, rl3]

Additional information

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

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

qrl + rl = rl0 + qrl0, vs0[phead1].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), qrl0 = phead1 + rl3, rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, qrl0 ≠ [], vhead0 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, 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, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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 = qrl0.last ∨ vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ unmarkedp(qrl0, vs0), 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, 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) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ None ≠ Some(tid); (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] ⊦ 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) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ 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 35 from proof stable-D21 (previous step) (back to tree)

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

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 + qrl + rl, vs], <all paths>

Additional information

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

Proof step 36 from proof stable-D21 (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 37 from proof stable-D21 (previous step) (back to tree)

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

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: ps[first].next

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

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

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 39 from proof stable-D21 (previous step) (back to tree)

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

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 ' + rl2 + qrl + rl, ps[first].next, vs0], <all paths>

Additional information

Used terms: tid, rl1 + first ' + rl2 + qrl + rl, ps[first].next, vs0

Proof step 40 from proof stable-D21 (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 41 from proof stable-D21 (previous step) (back to tree)

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

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 99 terms: phead1 abort: F discard: T computed: T

Additional information

Used terms: phead1

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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

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] → [first ', rl2], <all paths>

Additional information

Used terms: first ', rl2

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

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

A spec-lemma

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

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

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 ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ a '.last = a; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

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

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

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, vtail1, rl2]

Additional information

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

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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ Some(tid).tid = tid; (s) ⊦ None ≠ Some(tid); (s) 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 ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) 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] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a + x = a ' + x; (s) ⊦ a ' + x ≠ []; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ 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)

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

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

Heuristic use patterns 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] → [first ', rl0], <all paths>

Additional information

Used simplifier rules: ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ ¬ a ∈ y → (y + c ' + z = a ' + z0 ↔ y = [] ∧ c = a ∧ z = z0); (ws) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ a ∈ x → (a ∈ b ' + x ↔ a = b); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ [] + x = x; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) Used terms: first ', rl0

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

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

A spec-lemma

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

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

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) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ x + a ' + y ≠ []; (s)

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

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

Heuristic use patterns 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 terms: rl2, rl0

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

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

A spec-lemma

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

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

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-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 54 from proof stable-D21 (previous step) (back to tree)

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

Heuristic use patterns 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] → [rl2, vtail1, rl0]

Additional information

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

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

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

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) ⊦ (x + a ' + y).last = (a ' + y).last; (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) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (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 56 from proof stable-D21 (previous step) (back to tree)

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

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: qrl

Additional information

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

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

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

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 ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ a ∈ x → (a ∈ b ' + x ↔ a = b); (s) 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 in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s)

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

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

User applied rule constructor cut

And closed the goal!

Rule argument

var: rl0

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

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

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

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 ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x).head = a; (s) ⊦ a ' + x ≠ []; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ (a ' + x).tail = x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)

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

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

User applied rule constructor cut

And closed the goal!

Rule argument

var: rl0

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) ⊦ ¬ 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 ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a + x = a ' + x; (s) 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) ⊦ ¬ 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 ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ markedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ ¬ weak?(Some(tid)); (s) ⊦ None ≠ Some(tid); (s) ⊦ some?(Some(tid)); (s)

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

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

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)

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

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

Heuristic use patterns 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, vtail1, rl4]

Additional information

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

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

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

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) ⊦ 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) ⊦ ¬ 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 64 from proof stable-D21 (previous step) (back to tree)

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

User applied rule constructor cut

And closed the goal!

Rule argument

var: rl2

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ a ' + x ≠ []; (s) ⊦ 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(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 = a ' + x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ a ≠ 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 ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (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-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: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s)

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

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ 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), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, 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), ¬ vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from lst, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ 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), ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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 ∈ 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) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 95

Additional information

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

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vtail0 = (first ' + rl2 + rl0 + qrl0).last, ps[first].next ≠ 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), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, 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), ¬ vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from lst, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[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 ' + 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, 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 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ 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), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, (first ' + rl2 + rl0 + qrl0).last ∈ ((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 ' + rl2 + rl0 + qrl0).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from lst, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ 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), ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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 ∈ 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, 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) ⊦

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] → [first ', rl2 + rl0 + qrl0], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ markedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ unmarkedp([], vs); (s) ⊦ a '.butlast = []; (s) ⊦ a '.last = a; (s) ⊦ [] + x = x; (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ x + [] = x; (s) 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] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ a ∈ []; (s) Used terms: first ', rl2 + rl0 + qrl0

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

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

A spec-lemma

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

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 + qrl0 ≠ [], ps[first].next ≠ 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), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, (rl2 + rl0 + qrl0).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, 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), ¬ (rl2 + rl0 + qrl0).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from lst, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[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 ' + 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, 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 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 + qrl0], <all paths>

Additional information

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

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

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

A spec-lemma

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

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl0 + qrl0 ≠ [], rl2 + rl0 + qrl0 ≠ [], ps[first].next ≠ 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), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, (rl0 + qrl0).last ∈ ((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), ¬ (rl0 + qrl0).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from lst, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ 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), ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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 ∈ 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, 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) ⊦

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] → [(rl1 + first ' + rl2) + rl0, qrl0, lst], <all paths>

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: (rl1 + first ' + rl2) + rl0, qrl0, lst

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

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

A spec-lemma

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

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl0 + qrl0 ≠ [], rl2 + rl0 + qrl0 ≠ [], ps[first].next ≠ 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), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, (rl0 + qrl0).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, 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), ¬ lst ∈ (rl1 + first ' + rl2) + rl0, ¬ (rl0 + qrl0).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from lst, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[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 ' + 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, 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 ⊦

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 ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s)

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

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl0 + qrl0 ≠ [], rl2 + rl0 + qrl0 ≠ [], ps[first].next ≠ 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), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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), pretRefs0(tid) ∈ vrvHp, (rl0 + qrl0).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ qrl from lst, lst ∈ qrl, lst ∈ vs, lst ∈ 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, ¬ lst ∈ rl1, ¬ lst ∈ rl2, ¬ lst ∈ rl0, ¬ (rl0 + qrl0).last ∈ qrl0 from lst, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (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), 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 ⊦

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, phead1, rl3]

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, phead1, y

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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

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

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] → [phead1 ', rl3, lst], <all paths>

Additional information

Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ' + x = x0 + x1 → (a ∈ x0 ↔ x0 ≠ []); (ss) ⊦ markedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) ⊦ [] + x = x; (s) ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s) ⊦ ¬ a ∈ []; (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 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) + z = x + y + z; from specification list[reflist] Used terms: phead1 ', rl3, lst

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

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

A spec-lemma

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

(phead1 ' + rl3) + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), ps[phead1].deqID = None, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 + qrl0 ≠ [], rl0 + qrl0 ≠ [], ps[first].next ≠ null, first ≠ phead1, 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), equalrl(rl1 + first ' + rl2 + phead1 ' + rl3, vs, ps, vs0, ps0), listp(first ' + rl2 + phead1 ' + rl3, vs, ps, owns), listp(rl1 + first ' + rl2 + phead1 ' + rl3, 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, rl1 + first ' + rl2 + phead1 ' + rl3, ps[first].next, vs), noidRely(tid, rl1 + first ' + rl2 + phead1 ' + rl3, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs(rl1 + first ' + rl2 + phead1 ' + rl3, 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(rl3, ps), unmarkedp(qrl0, ps0), pretRefs0(tid) ∈ vrvHp, (rl0 + qrl0).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ phead1 ' + rl3 from lst, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl3), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl3), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl), ¬ dups((rl1 + rl2) + rl3), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + rl0), ¬ lst ∈ phead1 ', ¬ first ∈ rl, ¬ first ∈ rl3, ¬ first ∈ qrl0, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl3, ¬ phead1 ∈ rl2, ¬ (rl0 + qrl0).last ∈ qrl0 from lst, ¬ lst ∈ rl0, ¬ lst ∈ rl2, ¬ lst ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ps[first].next].deqID = None → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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[phead1].deqID = Some(tid) → vhead = first, phead1 ∈ rl0 ∨ phead1 ∈ qrl0, (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), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, lst = phead1 ∨ lst ∈ rl3, (first ' + rl2).last = vhead ∧ unmarkedp(rl3, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[phead1].deqID = None ∧ unmarkedp(rl3, vs), vtail = (phead1 ' + rl3).last ∨ vtail = (first ' + rl2 + (phead1 ' + rl3).butlast).last ∧ vs[(phead1 ' + rl3).last].deqID = None ∧ vs[(phead1 ' + rl3).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 → (b ' + x).last = x.last; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)

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

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

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 112

Additional information

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

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

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

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

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] → [rl3, vhead1, qrl]

Additional information

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

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

(phead1 ' + rl3) + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), ps[phead1].deqID = None, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl3 = qrl + vhead1 ', rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 + qrl0 ≠ [], rl0 + qrl0 ≠ [], ps[first].next ≠ null, first ≠ phead1, first ≠ lst, lst ≠ phead1, pretRefs0(tid) ≠ null, rl3 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + phead1 ' + rl3, vs, ps, vs0, ps0), listp(first ' + rl2 + phead1 ' + rl3, vs, ps, owns), listp(rl1 + first ' + rl2 + phead1 ' + rl3, 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, rl1 + first ' + rl2 + phead1 ' + rl3, ps[first].next, vs), noidRely(tid, rl1 + first ' + rl2 + phead1 ' + rl3, vs, ((rl1 + first ' + rl2) + rl0) + qrl0, vs0), nonullRetRefs(rl1 + first ' + rl2 + phead1 ' + rl3, 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(rl3, ps), unmarkedp(qrl0, ps0), lst ∈ rl3, lst ∈ vs, lst ∈ ps, pretRefs0(tid) ∈ vrvHp, (rl0 + qrl0).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead1, vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl3), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl3), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl), ¬ dups((rl1 + rl2) + rl3), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2 + rl0), ¬ first ∈ rl, ¬ first ∈ rl3, ¬ first ∈ qrl0, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl3, ¬ phead1 ∈ rl2, ¬ (rl0 + qrl0).last ∈ qrl0 from lst, ¬ lst ∈ rl0, ¬ lst ∈ rl2, ¬ lst ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ps[first].next].deqID = None → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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[phead1].deqID = Some(tid) → vhead = first, (first ' + rl2).last = vhead ∧ unmarkedp(rl3, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[phead1].deqID = None ∧ unmarkedp(rl3, vs), phead1 ∈ rl0 ∨ phead1 ∈ qrl0, (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), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, 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 ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ≠ b → (a ∈ b ' + x ↔ 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] notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)

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

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

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] → [rl0, qrl0], <all paths>

Additional information

Used simplifier rules: ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s) 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) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) ⊦ [] from r = []; (s) ⊦ x = y + a ' + z → a ∈ x; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ y ≠ [] → (x + y).butlast = x + y.butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ a ∈ []; (s) in-14: ⊦ a ' + x = 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 ⊦ x + a ' + y ≠ []; (s) ⊦ a ' + x ≠ []; (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) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ (a ' + x + b ' + y).last = (b ' + y).last; (s) Used terms: rl0, qrl0

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

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

A spec-lemma

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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

Additional information

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

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

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

A spec-lemma

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

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl0 + qrl0 ≠ [], rl2 + rl0 + qrl0 ≠ [], ps[first].next ≠ 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), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, (rl0 + qrl0).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, 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, lst ∈ (rl1 + first ' + rl2) + rl0, 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), ¬ (rl0 + qrl0).last ∈ ((rl1 + first ' + rl2) + rl0 from lst) + qrl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[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 ' + 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, 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 ⊦

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 ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s)

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

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl0 + qrl0 ≠ [], rl2 + rl0 + qrl0 ≠ [], ps[first].next ≠ 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), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, (rl0 + qrl0).last ∈ ((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, ¬ (rl0 + qrl0).last ∈ (rl1 + first ' + rl2) + rl0 from lst, ¬ (rl0 + qrl0).last ∈ 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), ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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 ∈ 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, 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), lst ∈ rl1 ∨ lst ∈ rl2 ∨ lst ∈ 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] → [rl1 + first ' + rl2, rl0, lst], <all paths>

Additional information

Used terms: rl1 + first ' + rl2, rl0, lst

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

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

A spec-lemma

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

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl0 + qrl0 ≠ [], rl2 + rl0 + qrl0 ≠ [], ps[first].next ≠ 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), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, (rl0 + qrl0).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, 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), ¬ lst ∈ rl1 + first ' + rl2, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ (rl0 + qrl0).last ∈ (rl1 + first ' + rl2) + rl0 from lst, ¬ (rl0 + qrl0).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), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ rl1 ∨ lst ∈ rl2 ∨ lst ∈ rl0, (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, 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 ⊦

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 ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)

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

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl0 + qrl0 ≠ [], rl2 + rl0 + qrl0 ≠ [], ps[first].next ≠ 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), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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), pretRefs0(tid) ∈ vrvHp, (rl0 + qrl0).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, vhead0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ qrl from lst, lst ∈ qrl, lst ∈ rl0, lst ∈ vs, lst ∈ 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), ¬ (rl0 + qrl0).last ∈ qrl0, ¬ lst ∈ rl1, ¬ lst ∈ rl2, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ (rl0 + qrl0).last ∈ rl0 from lst, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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 ∈ 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, (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 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, phead1, rl3]

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, phead1, y

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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

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

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] → [rl0, qrl0], <all paths>

Additional information

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

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

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

A spec-lemma

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

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl0 + qrl0 ≠ [], rl2 + rl0 + qrl0 ≠ [], ps[first].next ≠ 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), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, (rl0 + qrl0).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, 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, lst ∈ rl1 + first ' + rl2, 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, ¬ (rl0 + qrl0).last ∈ (rl1 + first ' + rl2 from lst) + rl0, ¬ (rl0 + qrl0).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), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ rl1 ∨ lst ∈ rl2 ∨ lst ∈ rl0, (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, 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 ⊦

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 ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s)

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

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl0 + qrl0 ≠ [], rl2 + rl0 + qrl0 ≠ [], ps[first].next ≠ 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), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, (rl0 + qrl0).last ∈ ((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), ¬ (rl0 + qrl0).last ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ (rl0 + qrl0).last ∈ rl1 + first ' + rl2 from lst, ¬ (rl0 + qrl0).last ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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 ∈ 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, 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), lst ∈ rl1 ∨ lst ∈ rl2 ∨ lst ∈ rl0, lst ∈ rl1 ∨ lst ∈ rl2 ⊦

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] → [rl0, qrl0], <all paths>

Additional information

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

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

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

A spec-lemma

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

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), 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)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vtail0 = (first ' + rl2 + rl0 + qrl0.butlast).last, ps[first].next ≠ null, first ≠ lst, 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((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, 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), ¬ vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from lst, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[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 ' + 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, 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 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

qrl + rl = rl0 + qrl0, vs0[qrl0.last].deqID = None, vs[ps[first].next].deqID = Some(tid), vs0[qrl0.last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, 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((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, (first ' + rl2 + rl0 + qrl0.butlast).last ∈ ((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 ' + rl2 + rl0 + qrl0.butlast).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from lst, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ 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), ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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 ∈ 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, 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 ∧ 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 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, rl3]

Additional information

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

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

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), qrl0 = vtail0 + rl3, rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, 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((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, (first ' + rl2 + rl0 + qrl0.butlast).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, 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 ' + rl2 + rl0 + qrl0.butlast).last ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from lst, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[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 ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, 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, 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 ⊦

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) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ 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 102 from proof stable-D21 (previous step) (back to tree)

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

Additional information

Used terms: vtail0 ', rl3

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

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

A spec-lemma

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

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

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 105 from proof stable-D21 (previous step) (back to tree)

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

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] → [rl1, first ' + rl2 + qrl + rl, lst], <all paths>

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl1, first ' + rl2 + qrl + rl, lst

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

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

A spec-lemma

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

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

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

qrl + rl = rl0 + vtail0 ', ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(tid), vs0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ vtail0, 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), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, 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(qrl, ps), phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, (first ' + rl2 + rl0).last ∈ rl1 + first ' + rl2 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl2 + qrl from lst, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0), ¬ dups(rl2 + qrl), ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ lst ∈ rl1, ¬ (first ' + rl2 + rl0).last ∈ rl2 + 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), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[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 ' + rl2 + rl0).last = vhead0 ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0, (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, 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, 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] → [first ', rl2 + rl0], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ markedp([], vs); (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a '.butlast = []; (s) ⊦ [] + x = x; (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: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ' = b ' ↔ a = b; (s) ⊦ x + [] = x; (s) ⊦ listp(r ' + r0 ', 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 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ ¬ dups(a '); (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ a '.last = a; (s) ⊦ a '.tail = []; (s) ⊦ unmarkedp([], vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ a ' ≠ []; (s) ⊦ a '.head = a; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl 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) Used terms: first ', rl2 + rl0

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

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

A spec-lemma

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

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

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

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

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 = x; (s) ⊦ markedp([], vs); (s) ⊦ x + a ' + y ≠ []; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (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(a '); (s) ⊦ ¬ dups([]); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ a '.head = a; (s) ⊦ a ' ≠ []; (s) ⊦ a '.tail = []; (s) ⊦ unmarkedp([], vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ (x + a ').last = a; (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) Used terms: rl2, rl0

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

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

A spec-lemma

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

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

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

qrl + rl = rl0 + vtail0 ', ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(tid), vs0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ vtail0, first ≠ lst, 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((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, 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(qrl, ps), phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, rl0.last ∈ rl1 + first ' + rl2 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ rl2 + qrl from lst, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0), ¬ dups(rl2 + qrl), ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ lst ∈ rl1, ¬ rl0.last ∈ rl2 + 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), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0, (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, 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, vtail0 ∈ qrl ∨ vtail0 ∈ rl, rl0.last = vhead0 ∨ (first ' + rl2 + 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, rl3]

Additional information

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

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

qrl + rl = rl0 + vtail0 ', vs0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(tid), ps0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl0 = rl3 + phead1 ', rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], ps[first].next ≠ null, first ≠ vtail0, first ≠ lst, 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((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + 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[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vtail ∈ rl2 + qrl from lst, pretRefs0(tid) ∈ vrvHp, phead1 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0), ¬ dups(rl2 + qrl), ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ lst ∈ rl1, ¬ phead1 ∈ rl2 + qrl + rl from lst, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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 ∨ (first ' + rl2 + rl3).last = vhead0 ∧ phead0 ≠ phead1, vtail0 ∈ qrl ∨ vtail0 ∈ rl, 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, 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), phead0 ∈ rl1 + first ' + rl2 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] 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) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ b ' ↔ a = b; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ 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 116 from proof stable-D21 (previous step) (back to tree)

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

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 117 from proof stable-D21 (previous step) (back to tree)

qrl + rl = (rl3 + phead1 ') + vtail0 ', ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(tid), vs0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), qrl = vhead1 + rl0, rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ phead1, first ≠ lst, first ≠ vtail0, 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((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, 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(rl3, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl3, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, 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), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(qrl, ps), lst ∈ ps, lst ∈ vs, vtail ∈ qrl from lst, lst ∈ qrl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, phead1 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl3), ¬ dups(rl1), ¬ dups(rl3), ¬ dups(rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl3), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ lst ∈ rl1, ¬ first ∈ qrl, ¬ lst ∈ rl2, ¬ first ∈ rl3, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl1, ¬ phead1 ∈ rl2, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl3, ¬ 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), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[vhead1].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vtail0 ∈ qrl ∨ vtail0 ∈ rl, phead1 = vhead0 ∨ (first ' + rl2 + rl3).last = vhead0 ∧ phead0 ≠ phead1, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl3 ∨ phead0 = phead1, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl3 ∨ phead0 = phead1 ∨ phead0 = vtail0, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(rl0, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).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 ≠ []; (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x + b ' + y).last = (b ' + y).last; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws)

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

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

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] → [vhead1 ', rl0, lst], <all paths>

Additional information

Used terms: vhead1 ', rl0, lst

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

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

A spec-lemma

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

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

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

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

Additional information

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

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

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

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] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ 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-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 123 from proof stable-D21 (previous step) (back to tree)

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

Additional information

Used terms: rl0, rl

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

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

A spec-lemma

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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] rl ≠ [] ⊦ ¬ dups(rl) → rl from rl.last = rl.last '; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (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 ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) 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 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] ⊦ (a ' + x + b ' + y).last = (b ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s)

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

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

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] → [rl0, lst0, rl]

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] ⊦ 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 ' + 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 + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ a ∈ x → (a ∈ b ' + x ↔ a = b); (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (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: rl0, lst0, y

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

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

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] inapp-12: ⊦ x + y = z + a ' ∧ b ∈ x ∧ y ≠ [] → b ∈ z; (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 128 from proof stable-D21 (previous step) (back to tree)

(vhead1 ' + rl0) + rl = (rl3 + phead1 ') + rl.last ', rl0 + rl = rl4 + rl.last ', vs0[rl.last].deqID = None, vs[ps[first].next].deqID = Some(tid), 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)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl0 + rl ≠ [], rl.last ≠ phead1, ps[first].next ≠ null, first ≠ phead1, first ≠ lst, first ≠ rl.last, first ≠ vhead1, lst ≠ vhead1, 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(rl1 + first ' + rl2 + vhead1 ' + rl0, vs, ps, vs0, ps0), listp(first ' + rl2 + vhead1 ' + rl0, vs, ps, owns), listp(rl1 + first ' + rl2 + vhead1 ' + rl0, vs, ps, owns), listp(rl1 + first ' + rl2 + (rl3 + phead1 ') + rl.last ', vs0, ps0, owns0), markedp(rl3, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl3, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, rl1 + first ' + rl2 + vhead1 ' + rl0, ps[first].next, vs), noidRely(tid, rl1 + first ' + rl2 + vhead1 ' + rl0, vs, rl1 + first ' + rl2 + (rl3 + phead1 ') + rl.last ', vs0), nonullRetRefs(rl1 + first ' + rl2 + vhead1 ' + rl0, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + (rl3 + 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), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl0, ps), lst ∈ rl4, lst ∈ rl0, vtail ∈ rl0 from lst, lst ∈ vs, lst ∈ ps, pretRefs0(tid) ∈ vrvHp, phead1 ∈ rl1 + first ' + rl2 + (rl3 + phead1 ') + rl.last ' from vtail, vhead0 ∈ rl1 + first ' + rl2 + (rl3 + 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, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + rl3), ¬ dups(rl3), ¬ dups(rl1 + rl2 + rl3), ¬ dups((rl1 + rl2) + rl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl0), ¬ dups(rl2), ¬ phead1 ∈ rl0 from lst, ¬ phead1 ∈ rl, ¬ vhead1 ∈ rl2, ¬ vhead1 ∈ rl0, ¬ vhead1 ∈ rl1, ¬ lst ∈ rl1, ¬ first ∈ rl0, ¬ lst ∈ rl2, ¬ first ∈ rl3, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ rl.last ∈ rl2, ¬ rl.last ∈ rl3, ¬ rl.last ∈ rl1, ¬ phead1 ∈ rl2, ¬ phead1 ∈ rl1, ¬ phead1 ∈ 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), ps[ps[first].next].deqID = None → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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[vhead1].deqID = Some(tid) → vhead = first, vtail = rl0.last ∨ vtail = (first ' + rl2 + (vhead1 ' + rl0).butlast).last ∧ vs[rl0.last].deqID = None ∧ vs[rl0.last].next = null, (first ' + rl2).last = vhead ∧ unmarkedp(rl0, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[vhead1].deqID = None ∧ unmarkedp(rl0, vs), vhead1 = phead1 ∨ vhead1 ∈ rl3, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl3 ∨ phead0 = phead1 ∨ phead0 = rl.last, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl3 ∨ phead0 = phead1, phead1 = vhead0 ∨ (first ' + rl2 + rl3).last = vhead0 ∧ phead0 ≠ phead1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead1 ∈ rl3 ∨ 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, rl5]

Additional information

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

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

rl0 + rl = rl4 + vtail0 ', (vhead1 ' + rl0) + rl = (rl3 + phead1 ') + vtail0 ', ps[vhead1].deqID = None, ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(tid), vs0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl = rl5 + vtail0 ', rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl0 + rl ≠ [], ps[first].next ≠ null, first ≠ phead1, first ≠ lst, first ≠ vtail0, first ≠ vhead1, lst ≠ vhead1, 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(rl1 + first ' + rl2 + vhead1 ' + rl0, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + (rl3 + phead1 ') + vtail0 ', vs0, ps0, owns0), listp(rl1 + first ' + rl2 + vhead1 ' + rl0, vs, ps, owns), listp(first ' + rl2 + vhead1 ' + rl0, vs, ps, owns), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl3, vs0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl3, ps0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, rl1 + first ' + rl2 + vhead1 ' + rl0, ps[first].next, vs), noidRely(tid, rl1 + first ' + rl2 + vhead1 ' + rl0, vs, rl1 + first ' + rl2 + (rl3 + phead1 ') + vtail0 ', vs0), nonullRetRefs(rl1 + first ' + rl2 + (rl3 + phead1 ') + vtail0 ', vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + rl2 + vhead1 ' + rl0, 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), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(rl0, ps), phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + (rl3 + phead1 ') + vtail0 ' from vhead, phead1 ∈ rl1 + first ' + rl2 + (rl3 + phead1 ') + vtail0 ' from vtail, pretRefs0(tid) ∈ vrvHp, lst ∈ ps, lst ∈ vs, vtail ∈ rl0 from lst, lst ∈ rl0, lst ∈ rl4, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + rl3), ¬ dups(rl3), ¬ dups(rl1 + rl2 + rl3), ¬ dups((rl1 + rl2) + rl0), ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl0), ¬ dups(rl2), ¬ phead1 ∈ rl0 from lst, ¬ phead1 ∈ rl, ¬ vhead1 ∈ rl2, ¬ vhead1 ∈ rl0, ¬ vhead1 ∈ rl1, ¬ lst ∈ rl1, ¬ first ∈ rl0, ¬ lst ∈ rl2, ¬ first ∈ rl3, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl1, ¬ phead1 ∈ rl2, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl3, vs[vhead1].deqID = Some(tid) → vhead = 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), vhead ≠ first → nextnottid(tid, vhead, vs), ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead1 ∈ rl3 ∨ vhead1 = phead1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead1 = vhead0 ∨ (first ' + rl2 + rl3).last = vhead0 ∧ phead0 ≠ phead1, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl3 ∨ phead0 = phead1, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl3 ∨ phead0 = phead1 ∨ phead0 = vtail0, vhead1 = phead1 ∨ vhead1 ∈ rl3, (first ' + rl2).last = vhead ∧ unmarkedp(rl0, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[vhead1].deqID = None ∧ unmarkedp(rl0, vs), vtail = rl0.last ∨ vtail = (first ' + rl2 + (vhead1 ' + rl0).butlast).last ∧ vs[rl0.last].deqID = None ∧ vs[rl0.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 + 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 ∈ []; (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 130 from proof stable-D21 (previous step) (back to tree)

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

Additional information

Used simplifier rules: ⊦ x + a ' = y + b ' ↔ x = y ∧ a = b; (ws) ⊦ x + a ' ≠ []; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) 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 → (a ∈ b ' + x ↔ a = b); (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 ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (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) ⊦ x + [] = x; (s) ⊦ a ' = x + b ' ↔ a = b ∧ x = []; (ws) ⊦ ¬ a ∈ []; (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl0, lst0, y

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

(vhead1 ' + rl0) + rl = (rl3 + phead1 ') + (rl0 + rl).last ', vs0[(rl0 + rl).last].deqID = None, vs[ps[first].next].deqID = Some(tid), ps0[(rl0 + rl).last].deqID = None, ps[vhead1].deqID = None, vs0[(rl0 + rl).last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl0 + rl ≠ [], (rl0 + rl).last ≠ phead1, ps[first].next ≠ null, first ≠ vhead1, first ≠ (rl0 + rl).last, first ≠ lst, first ≠ phead1, pretRefs0(tid) ≠ null, vhead1 ≠ (rl0 + rl).last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + vhead1 ' + rl0, vs, ps, vs0, ps0), listp(first ' + rl2 + vhead1 ' + rl0, vs, ps, owns), listp(rl1 + first ' + rl2 + vhead1 ' + rl0, vs, ps, owns), listp(rl1 + first ' + rl2 + (vhead1 ' + rl0) + rl, vs0, ps0, owns0), markedp(rl3, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl3, vs0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, rl1 + first ' + rl2 + vhead1 ' + rl0, ps[first].next, vs), noidRely(tid, rl1 + first ' + rl2 + vhead1 ' + rl0, vs, rl1 + first ' + rl2 + (vhead1 ' + rl0) + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + vhead1 ' + rl0, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + (vhead1 ' + rl0) + 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), some?(ps0[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl0, ps), pretRefs0(tid) ∈ vrvHp, phead1 ∈ rl1 + first ' + rl2 + (vhead1 ' + rl0) + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + (vhead1 ' + rl0) + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ (vhead1 ' from lst) + rl0, lst ∈ vs, lst ∈ ps, lst ∈ vhead1 ', dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(rl), ¬ dups((rl1 + rl2) + rl0), ¬ dups(rl1 + rl2 + rl3), ¬ dups(rl3), ¬ dups(rl2 + rl3), ¬ phead1 ∈ (vhead1 ' from lst) + rl0, ¬ phead1 ∈ rl3, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl2, ¬ (rl0 + rl).last ∈ rl1, ¬ (rl0 + rl).last ∈ rl3, ¬ (rl0 + rl).last ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl3, ¬ lst ∈ rl2, ¬ first ∈ rl0, ¬ lst ∈ rl1, ¬ vhead1 ∈ rl1, ¬ vhead1 ∈ rl0, ¬ vhead1 ∈ rl2, ¬ phead1 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ps[first].next].deqID = None → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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[vhead1].deqID = Some(tid) → vhead = first, vhead1 ∈ rl3 ∨ vhead1 = phead1, (rl0 + rl).last ∈ rl0 ∨ (rl0 + rl).last ∈ rl, vhead1 = phead1 ∨ vhead1 ∈ rl3, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl3 ∨ phead0 = phead1 ∨ phead0 = (rl0 + rl).last, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl3 ∨ phead0 = phead1, phead1 = vhead0 ∨ (first ' + rl2 + rl3).last = vhead0 ∧ phead0 ≠ phead1, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, lst = vhead1 ∨ lst ∈ rl0, (first ' + rl2).last = vhead ∧ unmarkedp(rl0, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[vhead1].deqID = None ∧ unmarkedp(rl0, vs), vtail = (vhead1 ' + rl0).last ∨ vtail = (first ' + rl2 + (vhead1 ' + rl0).butlast).last ∧ vs[(vhead1 ' + rl0).last].deqID = None ∧ vs[(vhead1 ' + rl0).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 ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s)

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

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

Additional information

Used simplifier rules: ⊦ [] + x = x; (s) ⊦ ¬ a ∈ z ∧ a ≠ c → c ' + z ≠ y1 + a ' + x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl0, vtail0, y

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

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

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] ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x → a ∈ x + y; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) 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 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] ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ a ' + x ≠ []; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (a ' + x + b ' + y).last = (b ' + y).last; (s) ⊦ (x + a ').butlast = x; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s) ⊦ x + a ' + y ≠ []; (s)

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

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

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] → [rl4, first0, rl0]

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) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ 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) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl4, first0, y

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

qrl + rl = rl0 + vtail0 ', vs0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(tid), ps0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ vtail0, 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), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(rl1 + first ' + rl2 + qrl + rl, 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + 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[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, 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, (first ' + rl2 + rl0).last ∈ rl1 + first ' + rl2 + qrl + rl from vtail, lst ∈ rl1, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0), ¬ dups(rl2 + qrl), ¬ (first ' + rl2 + rl0).last ∈ (rl1 from lst) + first ' + rl2 + qrl + rl, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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, 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, 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), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0, (first ' + rl2 + rl0).last = vhead0 ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + 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] ⊦ a ∈ x ∧ a ∈ y → dups(x + y); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (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) 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 ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s)

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

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

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, phead1, rl3]

Additional information

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

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

qrl + rl = rl0 + vtail0 ', ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(tid), vs0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), qrl = phead1 + rl3, rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), (first ' + rl2 + rl0).last ≠ first, ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, pretRefs0(tid) ≠ null, qrl ≠ [], vtail ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, 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(qrl, ps), lst ∈ qrl, lst ∈ rl1, (first ' + rl2 + rl0).last ∈ rl1 + first ' + rl2 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, lst ∈ vs0, lst ∈ ps0, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl2 + rl0), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl1 + rl2), ¬ dups(rl2), ¬ (first ' + rl2 + rl0).last ∈ rl, ¬ (first ' + rl2 + rl0).last ∈ qrl, ¬ (first ' + rl2 + rl0).last ∈ rl2, ¬ (first ' + rl2 + rl0).last ∈ rl1 from lst, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl1, ¬ lst ∈ rl2, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[phead1].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (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, vtail0 ∈ qrl ∨ vtail0 ∈ rl, vtail ∈ qrl ∨ vtail ∈ rl2 ∨ vtail ∈ rl1 from lst, (first ' + rl2 + rl0).last = vhead0 ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(rl3, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).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 ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (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] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ a ' + x ≠ []; (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x + b ' + y).last = (b ' + y).last; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws)

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

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

Additional information

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

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

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

A spec-lemma

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

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

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

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

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: ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ markedp([], vs); (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last ∈ x ↔ x ≠ []; (s) Used terms: rl2, rl0

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

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

A spec-lemma

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

(phead1 ' + rl3) + rl = rl0 + vtail0 ', vs0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(tid), ps0[vtail0].deqID = None, ps[phead1].deqID = None, vs0[vtail0].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl2 + rl0 ≠ [], rl0.last ≠ phead1, rl0.last ≠ first, ps[first].next ≠ null, first ≠ phead1, first ≠ vtail0, first ≠ lst, pretRefs0(tid) ≠ null, rl0 ≠ [], vtail ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + phead1 ' + rl3, vs, ps, vs0, ps0), listp(first ' + rl2 + phead1 ' + rl3, vs, ps, owns), listp(rl1 + first ' + rl2 + phead1 ' + rl3, vs, ps, owns), listp(rl1 + first ' + rl2 + rl0 + vtail0 ', 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, rl1 + first ' + rl2 + phead1 ' + rl3, ps[first].next, vs), noidRely(tid, rl1 + first ' + rl2 + phead1 ' + rl3, vs, rl1 + first ' + rl2 + rl0 + vtail0 ', vs0), nonullRetRefs(rl1 + first ' + rl2 + phead1 ' + rl3, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + rl0 + 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[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl3, ps), lst ∈ ps, lst ∈ vs, lst ∈ ps0, lst ∈ vs0, vhead0 ∈ rl1 + first ' + rl2 + rl0 + vtail0 ' from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, pretRefs0(tid) ∈ vrvHp, rl0.last ∈ rl1 + first ' + rl2 + rl0 + vtail0 ' from vtail, lst ∈ rl1, lst ∈ rl3, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl3), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl3), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(rl), ¬ dups((rl1 + rl2) + rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + rl0), ¬ first ∈ rl3, ¬ rl0.last ∈ rl1 from lst, ¬ rl0.last ∈ rl2, ¬ rl0.last ∈ rl3, ¬ rl0.last ∈ rl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl3, ¬ phead1 ∈ rl2, ¬ lst ∈ rl2, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, vs[phead1].deqID = Some(tid) → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ps[first].next].deqID = None → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), rl0.last = vhead0 ∨ (first ' + (rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ rl0.last, vtail0 = phead1 ∨ vtail0 ∈ rl3 ∨ vtail0 ∈ rl, phead1 ∈ rl0 ∨ phead1 = vtail0, (first ' + rl2).last = vhead ∧ unmarkedp(rl3, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[phead1].deqID = None ∧ unmarkedp(rl3, vs), vtail = phead1 ∨ vtail ∈ rl3 ∨ vtail ∈ rl2 ∨ vtail ∈ rl1 from lst, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, vtail = rl3.last ∨ vtail = (first ' + rl2 + (phead1 ' + rl3).butlast).last ∧ vs[rl3.last].deqID = None ∧ vs[rl3.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) inapp-08: ⊦ a ' + x = y + b ' ∧ y ≠ [] → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] ⊦ y ≠ [] → (x + y).butlast = x + y.butlast; (s)

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

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

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, vhead1, rl4]

Additional information

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

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

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

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 ∈ x + 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 ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

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

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

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] → [rl3, lst0, rl0]

Additional information

Used simplifier rules: ⊦ [] + x = x; (s) ⊦ ¬ a ∈ z ∧ a ≠ c → c ' + z ≠ y1 + a ' + x; (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, lst0, y

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

(phead1 ' + rl3) + rl = (rl4 + vhead1 ') + vtail0 ', vs0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(tid), ps0[vtail0].deqID = None, ps[phead1].deqID = None, vs0[vtail0].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl3 = rl0 + lst0 ', rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ phead1, first ≠ vtail0, first ≠ lst, pretRefs0(tid) ≠ null, rl3 ≠ [], vhead1 ≠ phead1, vhead1 ≠ first, vtail ≠ first, vtail0 ≠ vhead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + phead1 ' + rl3, vs, ps, vs0, ps0), listp(first ' + rl2 + phead1 ' + rl3, vs, ps, owns), listp(rl1 + first ' + rl2 + phead1 ' + rl3, vs, ps, owns), listp(rl1 + first ' + rl2 + (rl4 + vhead1 ') + vtail0 ', vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), markedp(rl4, ps0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl4, vs0), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, rl1 + first ' + rl2 + phead1 ' + rl3, ps[first].next, vs), noidRely(tid, rl1 + first ' + rl2 + phead1 ' + rl3, vs, rl1 + first ' + rl2 + (rl4 + vhead1 ') + vtail0 ', vs0), nonullRetRefs(rl1 + first ' + rl2 + phead1 ' + rl3, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + (rl4 + vhead1 ') + 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[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), some?(ps0[vhead1].deqID), some?(vs0[vhead1].deqID), unmarkedp(rl3, ps), phead1 ∈ rl4, lst ∈ ps, lst ∈ vs, lst ∈ ps0, lst ∈ vs0, vhead0 ∈ rl1 + first ' + rl2 + (rl4 + vhead1 ') + vtail0 ' from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, pretRefs0(tid) ∈ vrvHp, vhead1 ∈ rl1 + first ' + rl2 + (rl4 + vhead1 ') + vtail0 ' from vtail, lst ∈ rl1, lst ∈ rl3, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl4), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl4), ¬ dups(rl1), ¬ dups(rl3), ¬ dups(rl2 + rl3), ¬ dups(rl), ¬ dups((rl1 + rl2) + rl3), ¬ dups(rl1 + rl2 + rl4), ¬ vtail0 ∈ rl4, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl4, ¬ vhead1 ∈ rl1, ¬ vhead1 ∈ rl4, ¬ first ∈ rl3, ¬ vhead1 ∈ rl1 from lst, ¬ vhead1 ∈ rl2, ¬ vhead1 ∈ rl3, ¬ vhead1 ∈ rl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl3, ¬ phead1 ∈ rl2, ¬ lst ∈ rl2, ¬ vtail0 ∈ rl1, vs[phead1].deqID = Some(tid) → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ps[first].next].deqID = None → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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 = vhead0 ∨ (first ' + rl2 + rl4).last = vhead0 ∧ phead0 ≠ vhead1, (first ' + rl2).last = vhead ∧ unmarkedp(rl3, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[phead1].deqID = None ∧ unmarkedp(rl3, vs), vtail = phead1 ∨ vtail ∈ rl3 ∨ vtail ∈ rl2 ∨ vtail ∈ rl1 from lst, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vtail = lst0 ∨ vtail = (first ' + rl2 + (phead1 ' + rl3).butlast).last ∧ vs[lst0].deqID = None ∧ vs[lst0].next = null, vtail0 ∈ rl3 ∨ vtail0 ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl4 ∨ phead0 = vhead1, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl4 ∨ phead0 = vhead1 ∨ 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 ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ (a ' + x + b ' + y).last = (b ' + y).last; (s) ⊦ (x + a ').butlast = x; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)

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

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

User applied rule constructor cut

And closed the goal!

Rule argument

var: rl4

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ a + x = a ' + x; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws) ⊦ ¬ a ∈ y ∧ ¬ a ∈ z ∧ a ≠ c → y + c ' + z ≠ y1 + a ' + x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ [] + x = x; (s)

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

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

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 ' + y).last = (b ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s)

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

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

Additional information

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

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

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

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 152 from proof stable-D21 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + rl4 + phead1 ', ps0[phead1].deqID = None, vs0[phead1].deqID = None, ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(tid), vs0[phead1].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ phead1, first ≠ vtail0, 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((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, 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(rl4, ps0), unmarkedp(qrl, ps), (vtail0 ' + rl4).last ∈ rl1 + first ' + rl2 + qrl + rl from vtail, 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, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + rl0), ¬ dups(rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl0 + rl4), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + rl4), ¬ dups(rl1), ¬ dups(rl4), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + rl4), ¬ dups(rl2 + qrl), ¬ vtail0 ∈ rl4, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ rl4, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl4, ¬ phead1 ∈ rl0, ¬ phead1 ∈ rl2, ¬ (vtail0 ' + rl4).last ∈ rl1 + first ' + rl2 + qrl + rl from lst, ¬ vtail0 ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[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 ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl4, vs0) ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl4, vs0), phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl4 ∨ phead0 = phead1, (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, 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, phead1 ∈ qrl ∨ phead1 ∈ 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] → [vtail0 ', rl4], <all paths>

Additional information

Used terms: vtail0 ', rl4

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

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

A spec-lemma

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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ a ∈ []; (s) ⊦ unmarkedp([], vs); (s) ⊦ a '.last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s) ⊦ [] + x = x; (s)

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

qrl + rl = rl0 + vtail0 ' + phead1 ', ps0[phead1].deqID = None, vs0[phead1].deqID = None, ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(tid), vs0[phead1].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ phead1, first ≠ vtail0, 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((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, 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(qrl, ps), 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, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, vtail0 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ phead1 ∈ rl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ rl2, ¬ vtail0 ∈ rl1 + first ' + rl2 + 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), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[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 ' + 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, 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, phead1 ∈ qrl ∨ phead1 ∈ rl, (first ' + rl2 + rl0).last = vhead0 ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 = phead1 ⊦

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] → [rl1, first ' + rl2 + qrl + rl, lst], <all paths>

Additional information

Used simplifier rules: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (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: rl1, first ' + rl2 + qrl + rl, lst

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

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

A spec-lemma

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

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

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) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ b ' ↔ a = b; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s)

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

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

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, rl3]

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 159 from proof stable-D21 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + phead1 ', ps0[phead1].deqID = None, vs0[phead1].deqID = None, ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(tid), vs0[phead1].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), qrl = vhead1 + rl3, rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, first ≠ phead1, 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((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, 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(qrl, ps), lst ∈ ps, lst ∈ vs, vtail ∈ qrl from lst, lst ∈ qrl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, vtail0 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl0), ¬ dups(rl1), ¬ dups(rl2 + rl0), ¬ dups(rl1 + rl2), ¬ dups(rl2), ¬ phead1 ∈ rl2, ¬ phead1 ∈ rl0, ¬ phead1 ∈ rl1, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl1, ¬ lst ∈ rl1, ¬ lst ∈ rl2, ¬ vtail0 ∈ qrl from lst, ¬ vtail0 ∈ 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), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[vhead1].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (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, phead1 ∈ qrl ∨ phead1 ∈ rl, (first ' + rl2 + rl0).last = vhead0 ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 = phead1, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(rl3, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).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 ≠ []; (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x + b ' + y).last = (b ' + y).last; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws)

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

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

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] → [rl3, rl], <all paths>

Additional information

Used terms: rl3, rl

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

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

A spec-lemma

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

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

Proof step 163 from proof stable-D21 (previous step) (back to tree)

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

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: rl3, phead1, y

Proof step 164 from proof stable-D21 (previous step) (back to tree)

(vhead1 ' + rl3) + rl = rl0 + vtail0 ' + rl.last ', vs[ps[first].next].deqID = Some(tid), ps0[vtail0].deqID = None, vs0[rl.last].deqID = None, 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)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl3 + rl ≠ [], ps[first].next ≠ null, first ≠ vhead1, first ≠ rl.last, first ≠ vtail0, first ≠ lst, pretRefs0(tid) ≠ null, rl ≠ [], vhead1 ≠ rl.last, vtail0 ≠ rl.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + vhead1 ' + rl3, vs, ps, vs0, ps0), listp(first ' + rl2 + vhead1 ' + rl3, vs, ps, owns), listp(rl1 + first ' + rl2 + vhead1 ' + rl3, vs, ps, owns), listp(rl1 + first ' + rl2 + (vhead1 ' + rl3) + rl, 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, rl1 + first ' + rl2 + vhead1 ' + rl3, ps[first].next, vs), noidRely(tid, rl1 + first ' + rl2 + vhead1 ' + rl3, vs, rl1 + first ' + rl2 + (vhead1 ' + rl3) + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + vhead1 ' + rl3, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + (vhead1 ' + rl3) + 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[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl3, ps), pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + rl2 + (vhead1 ' + rl3) + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + (vhead1 ' + rl3) + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ vhead1 ' + rl3 from lst, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl3), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl3), ¬ dups(rl1), ¬ dups(rl2 + rl0), ¬ dups(rl0), ¬ dups(rl), ¬ dups((rl1 + rl2) + rl3), ¬ dups(rl1 + rl2 + rl0), ¬ vtail0 ∈ vhead1 ' + rl3 from lst, ¬ lst ∈ rl2, ¬ lst ∈ rl1, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ rl3, ¬ rl.last ∈ rl1, ¬ rl.last ∈ rl0, ¬ rl.last ∈ rl2, ¬ vhead1 ∈ rl1, ¬ vhead1 ∈ rl3, ¬ vhead1 ∈ rl2, ¬ vtail0 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ps[first].next].deqID = None → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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[vhead1].deqID = Some(tid) → vhead = first, vhead1 ∈ rl0 ∨ vhead1 = vtail0, rl.last ∈ rl3 ∨ rl.last ∈ rl, vhead1 = vtail0 ∨ vhead1 ∈ rl0, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 = rl.last, (first ' + rl2 + rl0).last = vhead0 ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, lst = vhead1 ∨ lst ∈ rl3, (first ' + rl2).last = vhead ∧ unmarkedp(rl3, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[vhead1].deqID = None ∧ unmarkedp(rl3, vs), vtail = (vhead1 ' + rl3).last ∨ vtail = (first ' + rl2 + (vhead1 ' + rl3).butlast).last ∧ vs[(vhead1 ' + rl3).last].deqID = None ∧ vs[(vhead1 ' + rl3).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 165 from proof stable-D21 (previous step) (back to tree)

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

Additional information

Used terms: vhead1 ', rl3, lst

Proof step 166 from proof stable-D21 (previous step) (back to tree)

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

A spec-lemma

Proof step 167 from proof stable-D21 (previous step) (back to tree)

(vhead1 ' + rl3) + rl = rl0 + vtail0 ' + rl.last ', ps[vhead1].deqID = None, ps0[rl.last].deqID = None, vs0[rl.last].deqID = None, ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(tid), vs0[rl.last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl3 + rl ≠ [], ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, first ≠ rl.last, first ≠ vhead1, pretRefs0(tid) ≠ null, rl ≠ [], vhead1 ≠ rl.last, vtail0 ≠ rl.last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + vhead1 ' + rl3, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + (vhead1 ' + rl3) + rl, vs0, ps0, owns0), listp(rl1 + first ' + rl2 + vhead1 ' + rl3, vs, ps, owns), listp(first ' + rl2 + vhead1 ' + rl3, 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, rl1 + first ' + rl2 + vhead1 ' + rl3, ps[first].next, vs), noidRely(tid, rl1 + first ' + rl2 + vhead1 ' + rl3, vs, rl1 + first ' + rl2 + (vhead1 ' + rl3) + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + (vhead1 ' + rl3) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + rl2 + vhead1 ' + rl3, 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(rl3, ps), lst ∈ ps, lst ∈ vs, vtail ∈ vhead1 ' + rl3 from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + (vhead1 ' + rl3) + rl from vhead, vtail0 ∈ rl1 + first ' + rl2 + (vhead1 ' + rl3) + rl from vtail, pretRefs0(tid) ∈ vrvHp, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + rl0), ¬ dups((rl1 + rl2) + rl3), ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(rl2 + rl3), ¬ dups(rl1 + rl2), ¬ dups(rl3), ¬ dups(rl2), ¬ lst ∈ vhead1 ', ¬ vtail0 ∈ rl, ¬ vhead1 ∈ rl2, ¬ vhead1 ∈ rl3, ¬ vhead1 ∈ rl1, ¬ rl.last ∈ rl2, ¬ rl.last ∈ rl0, ¬ rl.last ∈ rl1, ¬ first ∈ rl3, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl1, ¬ lst ∈ rl1, ¬ lst ∈ rl2, ¬ vtail0 ∈ vhead1 ' + rl3 from lst, vs[vhead1].deqID = Some(tid) → vhead = 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), vhead ≠ first → nextnottid(tid, vhead, vs), ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead1 ∈ rl0 ∨ vhead1 = vtail0, vtail = (vhead1 ' + rl3).last ∨ vtail = (first ' + rl2 + (vhead1 ' + rl3).butlast).last ∧ vs[(vhead1 ' + rl3).last].deqID = None ∧ vs[(vhead1 ' + rl3).last].next = null, (first ' + rl2).last = vhead ∧ unmarkedp(rl3, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[vhead1].deqID = None ∧ unmarkedp(rl3, vs), lst = vhead1 ∨ lst ∈ rl3, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2 + rl0).last = vhead0 ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 = rl.last, vhead1 = vtail0 ∨ vhead1 ∈ 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 → (b ' + x).last = x.last; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)

Proof step 168 from proof stable-D21 (previous step) (back to tree)

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

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.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl3, phead1, y

Proof step 169 from proof stable-D21 (previous step) (back to tree)

(vhead1 ' + rl3) + rl = rl0 + vtail0 ' + rl.last ', ps[vhead1].deqID = None, ps0[rl.last].deqID = None, vs0[rl.last].deqID = None, ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(tid), vs0[rl.last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl3 = rl4 + phead1 ', rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl3 + rl ≠ [], ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, first ≠ rl.last, first ≠ vhead1, lst ≠ vhead1, pretRefs0(tid) ≠ null, rl ≠ [], rl3 ≠ [], vhead1 ≠ rl.last, vtail0 ≠ rl.last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + vhead1 ' + rl3, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + (vhead1 ' + rl3) + rl, vs0, ps0, owns0), listp(rl1 + first ' + rl2 + vhead1 ' + rl3, vs, ps, owns), listp(first ' + rl2 + vhead1 ' + rl3, 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, rl1 + first ' + rl2 + vhead1 ' + rl3, ps[first].next, vs), noidRely(tid, rl1 + first ' + rl2 + vhead1 ' + rl3, vs, rl1 + first ' + rl2 + (vhead1 ' + rl3) + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + (vhead1 ' + rl3) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + rl2 + vhead1 ' + rl3, 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(rl3, ps), lst ∈ rl3, vtail ∈ rl3 from lst, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + (vhead1 ' + rl3) + rl from vhead, vtail0 ∈ rl1 + first ' + rl2 + (vhead1 ' + rl3) + rl from vtail, pretRefs0(tid) ∈ vrvHp, lst ∈ ps, lst ∈ vs, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + rl0), ¬ dups((rl1 + rl2) + rl3), ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(rl2 + rl3), ¬ dups(rl1 + rl2), ¬ dups(rl3), ¬ dups(rl2), ¬ vtail0 ∈ rl, ¬ vhead1 ∈ rl2, ¬ vhead1 ∈ rl3, ¬ vhead1 ∈ rl1, ¬ rl.last ∈ rl2, ¬ rl.last ∈ rl0, ¬ rl.last ∈ rl1, ¬ first ∈ rl3, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl1, ¬ lst ∈ rl1, ¬ lst ∈ rl2, ¬ vtail0 ∈ rl3 from lst, vs[vhead1].deqID = Some(tid) → vhead = 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), vhead ≠ first → nextnottid(tid, vhead, vs), ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = phead1 ∨ vtail = (first ' + rl2 + (vhead1 ' + rl3).butlast).last ∧ vs[phead1].deqID = None ∧ vs[phead1].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2 + rl0).last = vhead0 ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 = rl.last, vhead1 = vtail0 ∨ vhead1 ∈ rl0, vhead1 ∈ rl0 ∨ vhead1 = vtail0, (first ' + rl2).last = vhead ∧ unmarkedp(rl3, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[vhead1].deqID = None ∧ unmarkedp(rl3, 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 ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ x + a ' ≠ []; (s) ⊦ y ≠ [] → (a ' = x + y ↔ x = [] ∧ a ' = y); (ws) ⊦ ¬ a ∈ y → (y + c ' + z = a ' + z0 ↔ y = [] ∧ c = a ∧ z = z0); (ws) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ y ≠ [] → (x + y).last = y.last; (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] 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 ' + x + b ' + y).last = (b ' + y).last; (s) ⊦ (x + a ').butlast = x; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' + y ≠ []; (s)

Proof step 170 from proof stable-D21 (previous step) (back to tree)

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

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] → [rl, lst0, rl3]

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) 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] ⊦ x + a ' = y + b ' ↔ x = y ∧ a = b; (ws) ⊦ a ∈ x → a ∈ x + y; (s) ⊦ x + [] = x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (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) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl, lst0, y

Proof step 171 from proof stable-D21 (previous step) (back to tree)

(vhead1 ' + rl3) + rl = rl0 + vtail0 ' + rl.last ', ps[vhead1].deqID = None, ps0[rl.last].deqID = None, vs0[rl.last].deqID = None, ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(tid), vs0[rl.last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl3 + rl ≠ [], ps[first].next ≠ null, first ≠ lst, first ≠ vtail0, first ≠ rl.last, first ≠ vhead1, pretRefs0(tid) ≠ null, rl ≠ [], vhead1 ≠ rl.last, vtail0 ≠ rl.last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + vhead1 ' + rl3, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + (vhead1 ' + rl3) + rl, vs0, ps0, owns0), listp(rl1 + first ' + rl2 + vhead1 ' + rl3, vs, ps, owns), listp(first ' + rl2 + vhead1 ' + rl3, 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, rl1 + first ' + rl2 + vhead1 ' + rl3, ps[first].next, vs), noidRely(tid, rl1 + first ' + rl2 + vhead1 ' + rl3, vs, rl1 + first ' + rl2 + (vhead1 ' + rl3) + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + (vhead1 ' + rl3) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + rl2 + vhead1 ' + rl3, 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(rl3, ps), lst ∈ ps, lst ∈ vs, vtail ∈ (vhead1 ' from lst) + rl3, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + (vhead1 ' + rl3) + rl from vhead, vtail0 ∈ rl1 + first ' + rl2 + (vhead1 ' + rl3) + rl from vtail, pretRefs0(tid) ∈ vrvHp, lst ∈ vhead1 ', dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + rl2 + rl0), ¬ dups((rl1 + rl2) + rl3), ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl2 + rl0), ¬ dups(rl1), ¬ dups(rl2 + rl3), ¬ dups(rl1 + rl2), ¬ dups(rl3), ¬ dups(rl2), ¬ vtail0 ∈ rl, ¬ vhead1 ∈ rl2, ¬ vhead1 ∈ rl3, ¬ vhead1 ∈ rl1, ¬ rl.last ∈ rl2, ¬ rl.last ∈ rl0, ¬ rl.last ∈ rl1, ¬ first ∈ rl3, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl1, ¬ lst ∈ rl1, ¬ lst ∈ rl2, ¬ vtail0 ∈ (vhead1 ' from lst) + rl3, vs[vhead1].deqID = Some(tid) → vhead = 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), vhead ≠ first → nextnottid(tid, vhead, vs), ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead1 ∈ rl0 ∨ vhead1 = vtail0, vtail = (vhead1 ' + rl3).last ∨ vtail = (first ' + rl2 + (vhead1 ' + rl3).butlast).last ∧ vs[(vhead1 ' + rl3).last].deqID = None ∧ vs[(vhead1 ' + rl3).last].next = null, (first ' + rl2).last = vhead ∧ unmarkedp(rl3, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[vhead1].deqID = None ∧ unmarkedp(rl3, vs), lst = vhead1 ∨ lst ∈ rl3, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, (first ' + rl2 + rl0).last = vhead0 ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 = rl.last, vhead1 = vtail0 ∨ vhead1 ∈ 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 ∈ x → (b ' + x).last = x.last; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s)

Proof step 172 from proof stable-D21 (previous step) (back to tree)

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

Additional information

Used simplifier rules: ⊦ [] + x = x; (s) ⊦ ¬ a ∈ z ∧ a ≠ c → c ' + z ≠ y1 + a ' + x; (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 173 from proof stable-D21 (previous step) (back to tree)

(vhead1 ' + rl3) + rl = rl0 + vtail0 ' + rl.last ', vs[ps[first].next].deqID = Some(tid), ps0[vtail0].deqID = None, vs0[rl.last].deqID = None, 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), rl3 = rl4 + phead1 ', rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl3 + rl ≠ [], ps[first].next ≠ null, first ≠ rl.last, first ≠ vtail0, first ≠ vhead1, pretRefs0(tid) ≠ null, rl ≠ [], rl3 ≠ [], vhead1 ≠ rl.last, vtail ≠ vhead1, vtail0 ≠ vhead1, vtail0 ≠ rl.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + vhead1 ' + rl3, vs, ps, vs0, ps0), listp(first ' + rl2 + vhead1 ' + rl3, vs, ps, owns), listp(rl1 + first ' + rl2 + vhead1 ' + rl3, vs, ps, owns), listp(rl1 + first ' + rl2 + (vhead1 ' + rl3) + rl, 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, rl1 + first ' + rl2 + vhead1 ' + rl3, ps[first].next, vs), noidRely(tid, rl1 + first ' + rl2 + vhead1 ' + rl3, vs, rl1 + first ' + rl2 + (vhead1 ' + rl3) + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + vhead1 ' + rl3, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + rl2 + (vhead1 ' + rl3) + 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[first].deqID), some?(vs0[first].deqID), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(rl3, ps), vtail ∈ ps, vtail ∈ vs, vtail ∈ rl3, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + rl2 + (vhead1 ' + rl3) + rl from vtail, vhead0 ∈ rl1 + first ' + rl2 + (vhead1 ' + rl3) + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vhead1 ∈ vs, vhead1 ∈ ps, vhead1 ∈ rl0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl3), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl3), ¬ dups(rl1), ¬ dups(rl2 + rl0), ¬ dups(rl0), ¬ dups(rl), ¬ dups((rl1 + rl2) + rl3), ¬ dups(rl1 + rl2 + rl0), ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ rl3, ¬ rl.last ∈ rl1, ¬ rl.last ∈ rl0, ¬ rl.last ∈ rl2, ¬ vhead1 ∈ rl1, ¬ vhead1 ∈ rl3, ¬ vhead1 ∈ rl2, ¬ vtail0 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ps[first].next].deqID = None → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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[vhead1].deqID = Some(tid) → vhead = first, vtail = phead1 ∨ vtail = (first ' + rl2 + (vhead1 ' + rl3).butlast).last ∧ vs[phead1].deqID = None ∧ vs[phead1].next = null, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 = rl.last, (first ' + rl2 + rl0).last = vhead0 ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, (first ' + rl2).last = vhead ∧ unmarkedp(rl3, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[vhead1].deqID = None ∧ unmarkedp(rl3, 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 ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x → a ∈ x + y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (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] 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 ' + x + b ' + y).last = (b ' + y).last; (s) ⊦ (x + a ').butlast = x; (s) ⊦ 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) ⊦ x + a ' ≠ []; (s) ⊦ x + a ' + y ≠ []; (s)

Proof step 174 from proof stable-D21 (previous step) (back to tree)

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

User applied rule constructor cut

And closed the goal!

Rule argument

var: rl0

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ a + x = a ' + x; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws) ⊦ ¬ a ∈ y ∧ ¬ a ∈ z ∧ a ≠ c → y + c ' + z ≠ y1 + a ' + x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ [] + x = x; (s)

Proof step 175 from proof stable-D21 (previous step) (back to tree)

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

Additional information

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

Proof step 176 from proof stable-D21 (previous step) (back to tree)

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

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 ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ x + a ' ≠ []; (s)

Proof step 177 from proof stable-D21 (previous step) (back to tree)

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

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] → [rl1, first ' + rl2 + qrl + rl, lst], <all paths>

Additional information

Used simplifier rules: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (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: rl1, first ' + rl2 + qrl + rl, lst

Proof step 178 from proof stable-D21 (previous step) (back to tree)

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

A spec-lemma

Proof step 179 from proof stable-D21 (previous step) (back to tree)

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

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) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ b ' ↔ a = b; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s)

Proof step 180 from proof stable-D21 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + (rl3 + vhead1 ') + phead1 ', ps0[vhead1].deqID = None, ps0[phead1].deqID = None, vs0[phead1].deqID = None, ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(tid), vs0[phead1].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ vhead1, first ≠ lst, first ≠ vtail0, first ≠ phead1, 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((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + qrl + rl, 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), noidRely(tid, (rl1 + first ' + rl2) + qrl, vs, rl1 + first ' + rl2 + qrl + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + qrl + rl, 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(rl3, ps0), unmarkedp(qrl, ps), phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + qrl + rl from vhead, vhead1 ∈ rl1 + first ' + rl2 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, lst ∈ qrl, vtail ∈ qrl from lst, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(rl2 + rl0), ¬ dups(rl2), ¬ dups(rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl0 + rl3), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl0 + rl3), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + rl3), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ phead1 ∈ rl2, ¬ phead1 ∈ rl0, ¬ lst ∈ rl1, ¬ phead1 ∈ rl3, ¬ phead1 ∈ rl1, ¬ first ∈ rl3, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl3, ¬ vhead1 ∈ rl1, ¬ vhead1 ∈ rl2, ¬ vhead1 ∈ rl3, ¬ vhead1 ∈ rl0, ¬ vtail0 ∈ rl1, ¬ lst ∈ rl2, ¬ vhead1 ∈ qrl from lst, ¬ vhead1 ∈ 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), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (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, phead1 ∈ qrl ∨ phead1 ∈ rl, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl3 ∨ phead0 = vhead1 ∨ phead0 = phead1, (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∧ vs0[vhead1].deqID = None ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl3, vs0) ∧ vs0[vhead1].deqID = None, (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) ⊦

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, lst0, rl4]

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, lst0, y

Proof step 181 from proof stable-D21 (previous step) (back to tree)

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

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 ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (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 ≠ []; (s) ⊦ a + x = a ' + x; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ (a ' + x + b ' + y).last = (b ' + y).last; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws)

Proof step 182 from proof stable-D21 (previous step) (back to tree)

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

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] → [rl4, rl], <all paths>

Additional information

Used terms: rl4, rl

Proof step 183 from proof stable-D21 (previous step) (back to tree)

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

A spec-lemma

Proof step 184 from proof stable-D21 (previous step) (back to tree)

(lst0 ' + rl4) + rl = rl0 + vtail0 ' + (rl3 + vhead1 ') + (rl4 + rl).last ', ps0[vhead1].deqID = None, ps0[(rl4 + rl).last].deqID = None, vs0[(rl4 + rl).last].deqID = None, ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(tid), ps[lst0].deqID = None, vs0[(rl4 + rl).last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl4 + rl ≠ [], (rl4 + rl).last ≠ vhead1, ps[first].next ≠ null, first ≠ lst0, first ≠ (rl4 + rl).last, first ≠ vtail0, first ≠ lst, first ≠ vhead1, lst0 ≠ vhead1, lst0 ≠ (rl4 + rl).last, pretRefs0(tid) ≠ null, vtail0 ≠ (rl4 + rl).last, vtail0 ≠ vhead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + lst0 ' + rl4, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + (lst0 ' + rl4) + rl, vs0, ps0, owns0), listp(rl1 + first ' + rl2 + lst0 ' + rl4, vs, ps, owns), listp(first ' + rl2 + lst0 ' + rl4, 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, rl1 + first ' + rl2 + lst0 ' + rl4, ps[first].next, vs), noidRely(tid, rl1 + first ' + rl2 + lst0 ' + rl4, vs, rl1 + first ' + rl2 + (lst0 ' + rl4) + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + (lst0 ' + rl4) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + rl2 + lst0 ' + rl4, 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(rl3, ps0), unmarkedp(rl4, ps), phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + (lst0 ' + rl4) + rl from vhead, vhead1 ∈ rl1 + first ' + rl2 + (lst0 ' + rl4) + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ lst0 ' + rl4 from lst, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl4), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl4), ¬ dups(rl1), ¬ dups(rl), ¬ dups((rl1 + rl2) + rl4), ¬ dups(rl1 + rl2 + rl0 + rl3), ¬ dups(rl2 + rl0 + rl3), ¬ dups(rl0 + rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl3), ¬ dups(rl2 + rl0), ¬ dups(rl0), ¬ vhead1 ∈ lst0 ' + rl4 from lst, ¬ lst ∈ rl2, ¬ vtail0 ∈ rl1, ¬ vhead1 ∈ rl0, ¬ vhead1 ∈ rl3, ¬ vhead1 ∈ rl2, ¬ vhead1 ∈ rl1, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ rl4, ¬ first ∈ rl3, ¬ (rl4 + rl).last ∈ rl1, ¬ (rl4 + rl).last ∈ rl3, ¬ lst ∈ rl1, ¬ (rl4 + rl).last ∈ rl0, ¬ (rl4 + rl).last ∈ rl2, ¬ lst0 ∈ rl1, ¬ lst0 ∈ rl4, ¬ lst0 ∈ rl2, ¬ vhead1 ∈ 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), vhead ≠ first → nextnottid(tid, vhead, vs), ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[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[lst0].deqID = Some(tid) → vhead = first, lst0 ∈ rl0 ∨ lst0 = vtail0 ∨ lst0 ∈ rl3, (rl4 + rl).last ∈ rl4 ∨ (rl4 + rl).last ∈ rl, lst0 ∈ rl3 ∨ lst0 = vtail0 ∨ lst0 ∈ rl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl3 ∨ phead0 = vhead1 ∨ phead0 = (rl4 + rl).last, (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∧ vs0[vhead1].deqID = None ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl3, vs0) ∧ vs0[vhead1].deqID = None, lst = lst0 ∨ lst ∈ rl4, vtail = (lst0 ' + rl4).last ∨ vtail = (first ' + rl2 + (lst0 ' + rl4).butlast).last ∧ vs[(lst0 ' + rl4).last].deqID = None ∧ vs[(lst0 ' + rl4).last].next = null, (first ' + rl2).last = vhead ∧ unmarkedp(rl4, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[lst0].deqID = None ∧ unmarkedp(rl4, 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 ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ a ∈ z ∧ a ≠ c → c ' + z ≠ y1 + a ' + x; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ 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 ∈ 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) ⊦ (a ' + x + b ' + y).last = (b ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s)

Proof step 185 from proof stable-D21 (previous step) (back to tree)

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

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) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) lapp-04: ⊦ a ' + x = y + b ' ∧ a ≠ b → x.last = b; (forward) from specification list-last[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ ¬ a ∈ x → (a ' + x = y + a ' + z ↔ y = [] ∧ z = x); (ws) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) inapp-10: ⊦ a ' + x = y + b ' ∧ a ≠ b → a ∈ y ∧ b ∈ x; (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 ∈ y → a ∈ x + y; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x → a ∈ x + y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ x.last ∈ x ↔ x ≠ []; (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: rl4, phead1, y

Proof step 186 from proof stable-D21 (previous step) (back to tree)

(lst0 ' + rl4) + rl = rl0 + vtail0 ' + (rl3 + vhead1 ') + rl.last ', ps0[vhead1].deqID = None, ps0[rl.last].deqID = None, vs0[rl.last].deqID = None, ps0[vtail0].deqID = None, vs[ps[first].next].deqID = Some(tid), ps[lst0].deqID = None, vs0[rl.last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl4 + rl ≠ [], rl.last ≠ vhead1, ps[first].next ≠ null, first ≠ lst0, first ≠ rl.last, first ≠ vtail0, first ≠ lst, first ≠ vhead1, lst0 ≠ vhead1, lst0 ≠ rl.last, pretRefs0(tid) ≠ null, rl ≠ [], vtail0 ≠ rl.last, vtail0 ≠ vhead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + rl2 + lst0 ' + rl4, vs, ps, vs0, ps0), listp(rl1 + first ' + rl2 + (lst0 ' + rl4) + rl, vs0, ps0, owns0), listp(rl1 + first ' + rl2 + lst0 ' + rl4, vs, ps, owns), listp(first ' + rl2 + lst0 ' + rl4, 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, rl1 + first ' + rl2 + lst0 ' + rl4, ps[first].next, vs), noidRely(tid, rl1 + first ' + rl2 + lst0 ' + rl4, vs, rl1 + first ' + rl2 + (lst0 ' + rl4) + rl, vs0), nonullRetRefs(rl1 + first ' + rl2 + (lst0 ' + rl4) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(rl1 + first ' + rl2 + lst0 ' + rl4, 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(rl3, ps0), unmarkedp(rl4, ps), phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ rl1 + first ' + rl2 + (lst0 ' + rl4) + rl from vhead, vhead1 ∈ rl1 + first ' + rl2 + (lst0 ' + rl4) + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ lst0 ' + rl4 from lst, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(rl4), ¬ dups(rl1 + rl2), ¬ dups(rl2 + rl4), ¬ dups(rl1), ¬ dups(rl), ¬ dups((rl1 + rl2) + rl4), ¬ dups(rl1 + rl2 + rl0 + rl3), ¬ dups(rl2 + rl0 + rl3), ¬ dups(rl0 + rl3), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl3), ¬ dups(rl2 + rl0), ¬ dups(rl0), ¬ vhead1 ∈ lst0 ' + rl4 from lst, ¬ lst ∈ rl2, ¬ vtail0 ∈ rl1, ¬ vhead1 ∈ rl0, ¬ vhead1 ∈ rl3, ¬ vhead1 ∈ rl2, ¬ vhead1 ∈ rl1, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl2, ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ rl4, ¬ first ∈ rl3, ¬ rl.last ∈ rl1, ¬ rl.last ∈ rl3, ¬ lst ∈ rl1, ¬ rl.last ∈ rl0, ¬ rl.last ∈ rl2, ¬ lst0 ∈ rl1, ¬ lst0 ∈ rl4, ¬ lst0 ∈ rl2, ¬ vhead1 ∈ 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), vhead ≠ first → nextnottid(tid, vhead, vs), ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[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[lst0].deqID = Some(tid) → vhead = first, lst0 ∈ rl0 ∨ lst0 = vtail0 ∨ lst0 ∈ rl3, rl.last ∈ rl4 ∨ rl.last ∈ rl, lst0 ∈ rl3 ∨ lst0 = vtail0 ∨ lst0 ∈ rl0, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ∨ phead0 ∈ rl0, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, phead0 ∈ rl1 + first ' + rl2 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ rl3 ∨ phead0 = vhead1 ∨ phead0 = rl.last, (first ' + rl2 + rl0).last = vhead0 ∧ unmarkedp(rl3, vs0) ∧ vs0[vhead1].deqID = None ∨ rl1 + (first ' + rl2 + rl0).butlast ≠ [] ∧ (rl1 + (first ' + rl2 + rl0).butlast).last = vhead0 ∧ phead0 ≠ (first ' + rl2 + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(rl3, vs0) ∧ vs0[vhead1].deqID = None, lst = lst0 ∨ lst ∈ rl4, vtail = (lst0 ' + rl4).last ∨ vtail = (first ' + rl2 + (lst0 ' + rl4).butlast).last ∧ vs[(lst0 ' + rl4).last].deqID = None ∧ vs[(lst0 ' + rl4).last].next = null, (first ' + rl2).last = vhead ∧ unmarkedp(rl4, vs) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ vs[lst0].deqID = None ∧ unmarkedp(rl4, 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 ∈ 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 187 from proof stable-D21 (previous step) (back to tree)

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

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] → [rl, phead1, rl5]

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) lapp-04: ⊦ a ' + x = y + b ' ∧ a ≠ b → x.last = b; (forward) from specification list-last[reflist] inapp-10: ⊦ a ' + x = y + b ' ∧ a ≠ b → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] 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 + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ (a ' + x + b ' + y).last = (b ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ 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) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl, phead1, y

Proof step 188 from proof stable-D21 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ 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), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, 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), ¬ lst ∈ rl2, ¬ lst ∈ rl0, ¬ lst ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ 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), ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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 ∈ 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] 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 189 from proof stable-D21 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ 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), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, 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, lst ∈ qrl, lst ∈ vs, lst ∈ 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), ¬ lst ∈ rl2, ¬ lst ∈ rl0, ¬ lst ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail0 = (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, (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) ⊦

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, rl3]

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) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ (a ' + x + b ' + y).last = (b ' + y).last; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ a + x = a ' + x; (s) ⊦ a ' + x ≠ []; (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 190 from proof stable-D21 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, vs[ps[first].next].val ≠ vs0[ps[first].next].val, 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), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, 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, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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 ∈ 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) ⊦

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, (rl1 + first ' + rl2) + qrl, ps0, vs0, vs], <all paths>

Additional information

Used terms: ps, (rl1 + first ' + rl2) + qrl, ps0, vs0, vs

Proof step 191 from proof stable-D21 (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 192 from proof stable-D21 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, vs[ps[first].next].val ≠ vs0[ps[first].next].val, 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, 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, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[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 + first ' + rl2) + 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[((rl1 + first ' + rl2) + qrl).last].next ≠ null → vs0[((rl1 + first ' + rl2) + qrl).last].next = vs[((rl1 + first ' + rl2) + qrl).last].next ∧ vs0[vs0[((rl1 + first ' + rl2) + qrl).last].next].val = vs[vs0[((rl1 + 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 ⊦

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) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s)

Proof step 193 from proof stable-D21 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, vs[ps[first].next].val ≠ vs0[ps[first].next].val, 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, 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, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: ps[first].next

Proof step 194 from proof stable-D21 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, vs[ps[first].next].val ≠ vs0[ps[first].next].val, 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, 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, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[first].next ∈ rl1 ∨ ps[first].next = first ∨ ps[first].next ∈ rl2 ∨ 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[(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 = 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 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 195 from proof stable-D21 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, ps[first].next ≠ first, vs[ps[first].next].val ≠ vs0[ps[first].next].val, 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, 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 ∈ rl1, ¬ ps[first].next ∈ rl2, ¬ ps[first].next ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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) ⊦

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 196 from proof stable-D21 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl2 = [], rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, ps[first].next ≠ first, vs[ps[first].next].val ≠ vs0[ps[first].next].val, 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, 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 ∈ rl1, ¬ ps[first].next ∈ rl2, ¬ 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), vhead ≠ first → nextnottid(tid, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, ps[ps[first].next].deqID = None → vhead = first, vs[vhead].next ≠ null ∧ vs[vs[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 = 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 ⊦

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) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

Proof step 197 from proof stable-D21 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, ps[first].next ≠ first, vs[ps[first].next].val ≠ vs0[ps[first].next].val, 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 ' + qrl, vs, ps, owns), listp(rl1 + first ' + qrl, vs, ps, owns), listp(rl1 + first ' + rl0 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl1, ps0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl1, ps), markedp(rl1, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, rl1 + first ' + qrl, ps[first].next, 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, 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, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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 + first ' from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first, 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), 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 198 from proof stable-D21 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vhead0 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, 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), ¬ nextnottid(tid, vhead0, vs0), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ 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), ps[ps[first].next].deqID = None → vhead = first, qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead = first, vhead ≠ first → nextnottid(tid, vhead, vs), vs0[vhead0].next ≠ null ∧ vs0[vs0[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 ∈ 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 ∈ x + y ↔ a ∈ x ∨ a ∈ y; (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) ⊦ nextnottidRely(tid, vhead, vs, vhead0, vs0) ∧ nextnottid(tid, vhead, vs) → nextnottid(tid, vhead0, vs0); (ss)

Proof step 199 from proof stable-D21 (previous step) (back to tree)

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

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:nextnottid-def, seq:⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid), subst:[tid, vhead, vs] → [tid, vhead0, vs0], <all paths>

Additional information

Used terms: tid, vhead0, vs0

Proof step 200 from proof stable-D21 (previous step) (back to tree)

⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid)

A spec-lemma

Proof step 201 from proof stable-D21 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs0[vs0[vhead0].next].deqID = Some(tid), vs[ps[first].next].deqID = Some(tid), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, vs0[vhead0].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vhead0 ≠ first, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, first, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, 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, vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, 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), ¬ nextnottid(tid, first, vs), ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ first ∈ rl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[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[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), vhead0 ∈ rl2 ∨ vhead0 ∈ rl0 ∨ vhead0 ∈ qrl0, 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 = first ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = first ∧ 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: ⊦ Some(tid).tid = tid; (s) ⊦ None ≠ Some(tid); (s)

Proof step 202 from proof stable-D21 (previous step) (back to tree)

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

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 203 from proof stable-D21 (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 204 from proof stable-D21 (previous step) (back to tree)

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

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: ps[first].next

Proof step 205 from proof stable-D21 (previous step) (back to tree)

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

Proof step 206 from proof stable-D21 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ps[first].next].deqID = Some(tid), vs0[vs0[vhead0].next].deqID = Some(tid), dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[ps[first].next].val), rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[vs0[vhead0].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs0[vhead0].next ≠ null, ps[first].next ≠ null, first ≠ lst, pretRefs0(tid) ≠ null, vhead0 ≠ first, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((rl1 + first ' + rl2) + qrl, vs, ps, vs0, ps0), 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), nextnottidRely(tid, first, vs, vhead0, vs0), noid(tid, (rl1 + first ' + rl2) + qrl, ps[first].next, vs), noid(tid, ((rl1 + first ' + rl2) + rl0) + qrl0, ps[first].next, 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), vtail0 ∈ ((rl1 + first ' + rl2) + rl0) + qrl0 from vtail, 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(rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl2 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl2), ¬ dups(rl), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1 + rl2 + rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl2 + rl0 + qrl0), ¬ dups(rl1 + rl2), ¬ dups(rl1 + rl2 + rl0), ¬ dups(rl2 + qrl), ¬ nextnottid(tid, first, vs), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ rl0, ¬ first ∈ qrl, ¬ first ∈ qrl0, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].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 = first ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = first ∧ 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, vhead0 ∈ rl2 ∨ vhead0 ∈ rl0 ∨ vhead0 ∈ 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 ' + rl2) + rl0) + qrl0, ps[first].next, vs0], <all paths>

Additional information

Used terms: tid, ((rl1 + first ' + rl2) + rl0) + qrl0, ps[first].next, vs0

Proof step 207 from proof stable-D21 (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 208 from proof stable-D21 (previous step) (back to tree)

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

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 89 terms: vs0[vhead0].next abort: F discard: F computed: F

Additional information

Used terms: vs0[vhead0].next

Proof step 209 from proof stable-D21 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 210 from proof stable-D21 (previous step) (back to tree)

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

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-postfix, seq: ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []), subst:[ps, rl, owns, rl0, vs] → [ps0, rl1, owns0, first ' + rl2 + rl0 + qrl0, vs0]

Additional information

Used terms: ps0, rl1, owns0, first ' + rl2 + rl0 + qrl0, vs0

Proof step 211 from proof stable-D21 (previous step) (back to tree)

⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])

A spec-lemma

Proof step 212 from proof stable-D21 (previous step) (back to tree)

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

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 ≠ []; (s)

Proof step 213 from proof stable-D21 (previous step) (back to tree)

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

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] → [ps0, first ' + rl2 + rl0, owns0, vhead0, qrl0, vs0]

Additional information

Used terms: ps0, first ' + rl2 + rl0, owns0, vhead0, qrl0, vs0

Proof step 214 from proof stable-D21 (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 215 from proof stable-D21 (previous step) (back to tree)

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

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 ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s)

Proof step 216 from proof stable-D21 (previous step) (back to tree)

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

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: vhead0 ∈ rl2 ∨ vhead0 ∈ rl0

Additional information

Used formulas: vhead0 ∈ rl2 ∨ vhead0 ∈ rl0

Proof step 217 from proof stable-D21 (previous step) (back to tree)

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

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 ∈ y → (y + c ' + z = a ' + z0 ↔ y = [] ∧ c = a ∧ z = z0); (ws) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist]

Proof step 218 from proof stable-D21 (previous step) (back to tree)

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

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] → [first ', rl2], <all paths>

Additional information

Used terms: first ', rl2

Proof step 219 from proof stable-D21 (previous step) (back to tree)

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

A spec-lemma

Proof step 220 from proof stable-D21 (previous step) (back to tree)

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

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 ⊦ [] + x = x; (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

Proof step 221 from proof stable-D21 (previous step) (back to tree)

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

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, phead1, rl2]

Additional information

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

Proof step 222 from proof stable-D21 (previous step) (back to tree)

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

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] ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) 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] notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ Some(tid).tid = tid; (s) ⊦ None ≠ Some(tid); (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a + x = a ' + x; (s) ⊦ a ' + x ≠ []; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ 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) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s)

Proof step 223 from proof stable-D21 (previous step) (back to tree)

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

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl3

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ [] + x = x; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 224 from proof stable-D21 (previous step) (back to tree)

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

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) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ (a ' + x + b ' + y).last = (b ' + y).last; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x = y + a ' + z → a ∈ x; (s) ⊦ a + x = a ' + x; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)

Proof step 225 from proof stable-D21 (previous step) (back to tree)

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

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] → [vhead0 ', rl4], <all paths>

Additional information

Used terms: vhead0 ', rl4

Proof step 226 from proof stable-D21 (previous step) (back to tree)

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

A spec-lemma

Proof step 227 from proof stable-D21 (previous step) (back to tree)

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

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] ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

Proof step 228 from proof stable-D21 (previous step) (back to tree)

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

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl5

Additional information

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

Proof step 229 from proof stable-D21 (previous step) (back to tree)

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

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 ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) 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 ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (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([], vs); (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)

Proof step 230 from proof stable-D21 (previous step) (back to tree)

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

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl2

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (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) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a ' + x ≠ []; (s) ⊦ (a ' + x).tail = x; (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) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ ¬ weak?(Some(tid)); (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 231 from proof stable-D21 (previous step) (back to tree)

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

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) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ ¬ weak?(Some(tid)); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ unmarkedp([], vs); (s)

Proof step 232 from proof stable-D21 (previous step) (back to tree)

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

User applied rule constructor cut

And closed the goal!

Rule argument

var: rl

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(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) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a ' + x ≠ []; (s) ⊦ (a ' + x).tail = x; (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] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ unmarkedp([], vs); (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ a ∈ []; (s) ⊦ None ≠ Some(tid); (s)

Proof step 233 from proof stable-D21 (previous step) (back to tree)

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

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 ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ a ∈ b ' ↔ a = b; (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 ⊦ a + x = a ' + x; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ 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) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)

Proof step 234 from proof stable-D21 (previous step) (back to tree)

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

Proof step 235 from proof stable-D21 (previous step) (back to tree)

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

Proof step 236 from proof stable-D21 (previous step) (back to tree)

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

User applied rule constructor cut

And closed the goal!

Rule argument

var: qrl0

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ 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) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ (a ' + x).tail = x; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a ' + x ≠ []; (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] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ unmarkedp([], vs); (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ a ∈ []; (s) ⊦ None ≠ Some(tid); (s)

Proof step 237 from proof stable-D21 (previous step) (back to tree)

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

Proof step 238 from proof stable-D21 (previous step) (back to tree)

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

User applied rule constructor cut

And closed the goal!

Rule argument

var: qrl0

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ 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) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a ' + x ≠ []; (s) ⊦ (a ' + x).tail = x; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ a + x = a ' + x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) 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) + z = x + y + z; from specification list[reflist] ⊦ unmarkedp([], vs); (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ a ∈ []; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ None ≠ Some(tid); (s)

Proof step 239 from proof stable-D21 (previous step) (back to tree)

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

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 ' + y).last = (b ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s)

Proof step 240 from proof stable-D21 (previous step) (back to tree)

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

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl5

Additional information

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

Proof step 241 from proof stable-D21 (previous step) (back to tree)

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

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 ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) 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) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (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([], vs); (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)

Proof step 242 from proof stable-D21 (previous step) (back to tree)

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

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] → [rl4, phead1, qrl]

Additional information

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

Proof step 243 from proof stable-D21 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (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] 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) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ 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 244 from proof stable-D21 (previous step) (back to tree)

rl2 + rl = (qrl + phead1 ') + qrl0, ps0[first].deqID = vs0[first].deqID, ps[first].deqID = vs[first].deqID, ps[vs0[first].next].deqID = None, vs0[vs0[vs0[first].next].next].deqID = Some(tid), vs[vs0[first].next].deqID = Some(tid), (vs0[first].next ' + qrl).last = vs0[first].next, ps0[first].next = vs0[first].next, vs[first].next = vs0[first].next, ps[first].next = vs0[first].next, ps0[first].val = vs0[first].val, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(first) = None, owns0(first) = None, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Claimed(tid, vs[vs0[first].next].val), rvowns0(pretRefs0(tid)) = Claimed(tid, vs0[vs0[vs0[first].next].next].val), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), vs0[first].next ≠ phead1, vs0[first].next ≠ first, vs0[vs0[first].next].next ≠ null, vs0[first].next ≠ null, first ≠ phead1, first ≠ null, first ≠ lst, phead0 ≠ phead1, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(rl1 + first ' + vs0[first].next ' + rl2, vs, ps, vs0, ps0), listp(rl1 + first ' + vs0[first].next ' + rl2 + rl, vs0, ps0, owns0), listp(vs0[first].next ' + rl2 + rl, vs0, ps0, owns0), listp(vs0[first].next ' + rl2, vs, ps, owns), listp(rl1 + first ' + vs0[first].next ' + rl2, vs, ps, owns), markedp(qrl, ps0), markedp(rl1, ps0), markedp(qrl, vs0), markedp(rl1, vs0), markedp(rl1, ps), markedp(rl1, vs), nextnottidRely(tid, first, vs, vs0[first].next, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + rl2, vs0[first].next, vs), nonullRetRefs(rl1 + first ' + vs0[first].next ' + rl2, vs, vretRefs, pretRefs), nonullRetRefs(rl1 + first ' + vs0[first].next ' + rl2 + 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), some?(vs0[first].deqID), some?(vs[first].deqID), some?(ps0[vs0[first].next].deqID), some?(vs0[vs0[first].next].deqID), unmarkedp(qrl0, vs0), unmarkedp(rl2, vs), unmarkedp(rl2, ps), unmarkedp(qrl0, ps0), lst ∈ ps, lst ∈ vs, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail ∈ rl1 + first ' + vs0[first].next ' + rl2 from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ rl1 + first ' + vs0[first].next ' + rl2 + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl1 + qrl), ¬ dups(qrl + qrl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl), ¬ dups(rl1 + rl2), ¬ dups((rl1 + qrl) + qrl0), ¬ dups(rl2), ¬ nextnottid(tid, first, vs), ¬ weak?(vs0[first].deqID), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl, ¬ first ∈ rl, ¬ vs0[first].next ∈ qrl, ¬ vs0[first].next ∈ qrl0, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl, ¬ phead1 ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl0, ¬ vs0[first].next ∈ rl2, ¬ vs0[first].next ∈ rl1, ¬ first ∈ rl1, ∀ r0. r0 ≠ vs0[first].next ∧ (r0 ∈ qrl ∨ r0 = phead1 ∨ r0 ∈ qrl0) → vs0[r0].deqID ≠ Some(tid), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ qrl, phead0 ∈ rl1 + first ' from phead ∨ phead0 = vs0[first].next ∨ phead0 ∈ qrl ∨ phead0 ∈ qrl0, phead ∈ rl1 ∨ phead = first, vtail = (vs0[first].next ' + rl2).last ∨ vtail = (first ' + (vs0[first].next ' + rl2).butlast).last ∧ vs[(vs0[first].next ' + rl2).last].deqID = None ∧ vs[(vs0[first].next ' + rl2).last].next = null, lst = vs0[first].next ∨ lst ∈ rl2, vtail0 = (phead1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (phead1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ vs0[vs0[first].next].next ≠ vs0[first].next ∧ (vs0[vs0[first].next].next ∈ qrl ∨ vs0[vs0[first].next].next = phead1 ∨ vs0[vs0[first].next].next ∈ 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 [], +;; ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (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) ⊦ 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) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a + x = a ' + x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ ¬ weak?(Some(tid)); (s) 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 ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 245 from proof stable-D21 (previous step) (back to tree)

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

Proof step 246 from proof stable-D21 (previous step) (back to tree)

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

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] → [vs0[first].next ', qrl], <all paths>

Additional information

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

Proof step 247 from proof stable-D21 (previous step) (back to tree)

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

A spec-lemma

Proof step 248 from proof stable-D21 (previous step) (back to tree)

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

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 ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ a ∈ b ' ↔ a = b; (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 ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ ¬ a ∈ x ∧ ¬ 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) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)

Proof step 249 from proof stable-D21 (previous step) (back to tree)

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

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] → [rl4, phead1, qrl]

Additional information

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

Proof step 250 from proof stable-D21 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 251 from proof stable-D21 (previous step) (back to tree)

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

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] → [vhead0 ', qrl], <all paths>

Additional information

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

Proof step 252 from proof stable-D21 (previous step) (back to tree)

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

A spec-lemma

Proof step 253 from proof stable-D21 (previous step) (back to tree)

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

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) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ x + a ' + y ≠ []; (s)

Proof step 254 from proof stable-D21 (previous step) (back to tree)

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

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 terms: rl2, rl0

Proof step 255 from proof stable-D21 (previous step) (back to tree)

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

A spec-lemma

Proof step 256 from proof stable-D21 (previous step) (back to tree)

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

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) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

Proof step 257 from proof stable-D21 (previous step) (back to tree)

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

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl3

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ [] + x = x; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 258 from proof stable-D21 (previous step) (back to tree)

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

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 ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (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) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (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) ⊦ a + x = a ' + x; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)

Proof step 259 from proof stable-D21 (previous step) (back to tree)

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

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 260 from proof stable-D21 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(Some(tid)); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ Some(tid).tid = tid; (s) ⊦ None ≠ Some(tid); (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (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([], vs); (s)

Proof step 261 from proof stable-D21 (previous step) (back to tree)

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

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl4

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(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ (b ' + a ' + x).last = (a ' + x).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] ⊦ some?(Some(tid)); (s) ⊦ ¬ weak?(Some(tid)); (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 262 from proof stable-D21 (previous step) (back to tree)

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

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 ∈ []; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

Proof step 263 from proof stable-D21 (previous step) (back to tree)

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

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: qrl

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ 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) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a ' + x ≠ []; (s) ⊦ (a ' + x).tail = x; (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) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ some?(Some(tid)); (s) ⊦ ¬ weak?(Some(tid)); (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 264 from proof stable-D21 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 265 from proof stable-D21 (previous step) (back to tree)

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

User applied rule constructor cut

And closed the goal!

Rule argument

var: rl

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) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a ' + x ≠ []; (s) ⊦ (a ' + x).tail = x; (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] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ unmarkedp([], vs); (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ a ∈ []; (s) ⊦ None ≠ Some(tid); (s)

Proof step 266 from proof stable-D21 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(Some(tid)); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ Some(tid).tid = tid; (s) ⊦ None ≠ 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); (ss) ⊦ 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 267 from proof stable-D21 (previous step) (back to tree)

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

Additional information

Used terms: vhead0 ', rl4

Proof step 268 from proof stable-D21 (previous step) (back to tree)

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

A spec-lemma

Proof step 269 from proof stable-D21 (previous step) (back to tree)

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

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 ∈ []; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

Proof step 270 from proof stable-D21 (previous step) (back to tree)

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

Heuristic use patterns 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[first].next ', rl2], <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: vs[first].next ', rl2

Proof step 271 from proof stable-D21 (previous step) (back to tree)

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

A spec-lemma

Proof step 272 from proof stable-D21 (previous step) (back to tree)

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

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 ' + y).last = (b ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s)

Proof step 273 from proof stable-D21 (previous step) (back to tree)

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

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] → [rl4, 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) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (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: rl4, phead1, y

Proof step 274 from proof stable-D21 (previous step) (back to tree)

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

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) ⊦ y ≠ [] → (x + y).butlast = x + y.butlast; (s) ⊦ x + a ' + y ≠ []; (s)

Proof step 275 from proof stable-D21 (previous step) (back to tree)

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

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, qrl1]

Additional information

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

Proof step 276 from proof stable-D21 (previous step) (back to tree)

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

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-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] inapp-11: ⊦ x + y = z + a ' ∧ b ∈ x ∧ a ≠ b → b ∈ z; (forward) from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 277 from proof stable-D21 (previous step) (back to tree)

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

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl3

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ [] + x = x; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 278 from proof stable-D21 (previous step) (back to tree)

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

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-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a + x = a ' + x; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)

Proof step 279 from proof stable-D21 (previous step) (back to tree)

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

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:splitlasteq, seq:y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last, subst:[x, a, y] → [rl2 + qrl1, phead1, rl0 + vhead0 ' + rl4], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl2 + qrl1, phead1, rl0 + vhead0 ' + rl4

Proof step 280 from proof stable-D21 (previous step) (back to tree)

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

A spec-lemma

Proof step 281 from proof stable-D21 (previous step) (back to tree)

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

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 ' + y ≠ []; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s)

Proof step 282 from proof stable-D21 (previous step) (back to tree)

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

Heuristic use patterns 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] → [vhead0 ', rl4], <all paths>

Additional information

Used terms: vhead0 ', rl4

Proof step 283 from proof stable-D21 (previous step) (back to tree)

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

A spec-lemma

Proof step 284 from proof stable-D21 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 285 from proof stable-D21 (previous step) (back to tree)

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

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: qrl

Additional information

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

Proof step 286 from proof stable-D21 (previous step) (back to tree)

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

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] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) 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 ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ unmarkedp([], vs); (s) ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s)

Proof step 287 from proof stable-D21 (previous step) (back to tree)

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

Heuristic use patterns 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] → [rl2, vtail, qrl]

Additional information

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

Proof step 288 from proof stable-D21 (previous step) (back to tree)

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

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) ⊦ (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) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (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 289 from proof stable-D21 (previous step) (back to tree)

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

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] → [first ', qrl], <all paths>

Additional information

Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) Used terms: first ', qrl

Proof step 290 from proof stable-D21 (previous step) (back to tree)

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

A spec-lemma

Proof step 291 from proof stable-D21 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(Some(tid)); (s) 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 ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ Some(tid).tid = tid; (s) ⊦ None ≠ Some(tid); (s) ⊦ ¬ weak?(Some(tid)); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ listp(r ' + r0 ', 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 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (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([], vs); (s) ⊦ a '.last = a; (s)

Proof step 292 from proof stable-D21 (previous step) (back to tree)

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

User applied rule constructor cut

And closed the goal!

Rule argument

var: qrl0

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ 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 ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ (a ' + x).tail = x; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a ' + x ≠ []; (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] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ unmarkedp([], vs); (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ a ∈ []; (s) ⊦ None ≠ Some(tid); (s)

Proof step 293 from proof stable-D21 (previous step) (back to tree)

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

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) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ (a ' + x).tail = x; (s) ⊦ a ' + x ≠ []; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ ¬ 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)

Proof step 294 from proof stable-D21 (previous step) (back to tree)

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

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: qrl0

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ unmarkedp([], vs); (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ ¬ dups([]); (s) ⊦ a '.last = a; (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) 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 + y) + z = x + y + z; from specification list[reflist] ⊦ None ≠ Some(tid); (s)

Proof step 295 from proof stable-D21 (previous step) (back to tree)

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

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 → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ 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] ⊦ ¬ 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) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ (a ' + x).tail = x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ ¬ 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) ⊦ 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)

Proof step 296 from proof stable-D21 (previous step) (back to tree)

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

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: qrl1

Additional information

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

Proof step 297 from proof stable-D21 (previous step) (back to tree)

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

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-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)

Proof step 298 from proof stable-D21 (previous step) (back to tree)

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

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] → [rl2, vtail1, rl0]

Additional information

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

Proof step 299 from proof stable-D21 (previous step) (back to tree)

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

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) 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] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (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) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (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 300 from proof stable-D21 (previous step) (back to tree)

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

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] → [first ', rl0], <all paths>

Additional information

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

Proof step 301 from proof stable-D21 (previous step) (back to tree)

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

A spec-lemma

Proof step 302 from proof stable-D21 (previous step) (back to tree)

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

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 = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)

Proof step 303 from proof stable-D21 (previous step) (back to tree)

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

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] → [rl2, vtail1, rl0]

Additional information

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

Proof step 304 from proof stable-D21 (previous step) (back to tree)

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

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 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) ⊦ (x + a ' + y).last = (a ' + y).last; (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) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (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 305 from proof stable-D21 (previous step) (back to tree)

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

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] → [first ', rl0], <all paths>

Additional information

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

Proof step 306 from proof stable-D21 (previous step) (back to tree)

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

A spec-lemma

Proof step 307 from proof stable-D21 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s)

Proof step 308 from proof stable-D21 (previous step) (back to tree)

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

Heuristic use patterns 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] → [rl4, vtail1, rl3]

Additional information

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

Proof step 309 from proof stable-D21 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ x + a ' ≠ []; (s)

Proof step 310 from proof stable-D21 (previous step) (back to tree)

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

Heuristic use patterns 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 terms: rl2, qrl1

Proof step 311 from proof stable-D21 (previous step) (back to tree)

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

A spec-lemma

Proof step 312 from proof stable-D21 (previous step) (back to tree)

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

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-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ x + [] = x; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

Proof step 313 from proof stable-D21 (previous step) (back to tree)

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

Heuristic use patterns 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] → [rl2, phead1, rl4]

Additional information

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

Proof step 314 from proof stable-D21 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 315 from proof stable-D21 (previous step) (back to tree)

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

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] → [first ', rl4], <all paths>

Additional information

Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) Used terms: first ', rl4

Proof step 316 from proof stable-D21 (previous step) (back to tree)

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

A spec-lemma

Proof step 317 from proof stable-D21 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(Some(tid)); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ Some(tid).tid = tid; (s) ⊦ None ≠ Some(tid); (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (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([], vs); (s) ⊦ a '.last = a; (s)

Proof step 318 from proof stable-D21 (previous step) (back to tree)

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

User applied rule constructor cut

And closed the goal!

Rule argument

var: qrl

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws) ⊦ 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) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a ' + x ≠ []; (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ some?(Some(tid)); (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ ¬ weak?(Some(tid)); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ unmarkedp([], vs); (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ ¬ dups([]); (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ a ∈ []; (s) in-14: ⊦ a ' + x = 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 ∈ x → (a ∈ b ' + x ↔ a = b); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ b ' ↔ a = b; (s)

Proof step 319 from proof stable-D21 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ x.last ∈ x ↔ x ≠ []; (s)

Proof step 320 from proof stable-D21 (previous step) (back to tree)

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

Heuristic use patterns 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] → [qrl1, phead1, rl4]

Additional information

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

Proof step 321 from proof stable-D21 (previous step) (back to tree)

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

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-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (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 322 from proof stable-D21 (previous step) (back to tree)

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

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] → [rl2, lst0, qrl1]

Additional information

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

Proof step 323 from proof stable-D21 (previous step) (back to tree)

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

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) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 324 from proof stable-D21 (previous step) (back to tree)

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

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:splitlasteq, seq:y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last, subst:[x, a, y] → [qrl1 + lst0 ' + rl4, phead1, rl0 + phead1 ' + rl3], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: qrl1 + lst0 ' + rl4, phead1, rl0 + phead1 ' + rl3

Proof step 325 from proof stable-D21 (previous step) (back to tree)

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

A spec-lemma

Proof step 326 from proof stable-D21 (previous step) (back to tree)

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

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 ≠ []; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s)

Proof step 327 from proof stable-D21 (previous step) (back to tree)

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

Heuristic use patterns 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] → [phead1 ', rl3], <all paths>

Additional information

Used simplifier rules: ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ ¬ a ∈ y ∧ ¬ a ∈ z ∧ a ≠ c → y + c ' + z ≠ y1 + a ' + x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: phead1 ', rl3

Proof step 328 from proof stable-D21 (previous step) (back to tree)

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

A spec-lemma

Proof step 329 from proof stable-D21 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(Some(tid)); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ a ∈ []; (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) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ a '.last = a; (s)

Proof step 330 from proof stable-D21 (previous step) (back to tree)

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

User applied rule constructor cut

And closed the goal!

Rule argument

var: qrl1

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ 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 ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a + x = a ' + x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ None ≠ Some(tid); (s) ⊦ Some(tid).tid = tid; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ x → (b ' + x).last = x.last; (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 ' + x ↔ a = b ∨ a ∈ x; (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-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: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a '.last = a; (s) ⊦ markedp([], vs); (s) ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s)

Proof step 331 from proof stable-D21 (previous step) (back to tree)

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

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 332 from proof stable-D21 (previous step) (back to tree)

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

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] → [qrl0, vtail1, rl3]

Additional information

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

Proof step 333 from proof stable-D21 (previous step) (back to tree)

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

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 = a ' + x; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ' + x ≠ []; (s) ⊦ (a ' + x + b ' + y).last = (b ' + y).last; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s)

Proof step 334 from proof stable-D21 (previous step) (back to tree)

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

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] → [first ', rl2 + rl0], <all paths>

Additional information

Used terms: first ', rl2 + rl0

Proof step 335 from proof stable-D21 (previous step) (back to tree)

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

A spec-lemma

Proof step 336 from proof stable-D21 (previous step) (back to tree)

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

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 = x0 + x1 → (a ∈ x0 ↔ x0 ≠ []); (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ [] + x = x; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ x ∧ a ∈ y → dups(x + y); (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ ¬ a ∈ []; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ x + [] = x; (s) ⊦ unmarkedp([], vs); (s) ⊦ a '.butlast = []; (s) ⊦ a '.last = a; (s) ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s) ⊦ x + y = [] ↔ x = [] ∧ y = []; (as)

Proof step 337 from proof stable-D21 (previous step) (back to tree)

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

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, rl0]

Additional information

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

Proof step 338 from proof stable-D21 (previous step) (back to tree)

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

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 ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) 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(tid).tid = tid; (s) ⊦ None ≠ Some(tid); (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (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) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ' + x ≠ []; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)

Proof step 339 from proof stable-D21 (previous step) (back to tree)

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

Heuristic use patterns 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] → [rl1, vtail1, rl2]

Additional information

Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ 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: rl1, vtail1, y

Proof step 340 from proof stable-D21 (previous step) (back to tree)

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

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).butlast = a ' + x.butlast; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s)

Proof step 341 from proof stable-D21 (previous step) (back to tree)

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

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] → [first ', rl2], <all paths>

Additional information

Used terms: first ', rl2

Proof step 342 from proof stable-D21 (previous step) (back to tree)

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

A spec-lemma

Proof step 343 from proof stable-D21 (previous step) (back to tree)

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

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 ⊦ [] + x = x; (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

Proof step 344 from proof stable-D21 (previous step) (back to tree)

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

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, phead1, rl2]

Additional information

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

Proof step 345 from proof stable-D21 (previous step) (back to tree)

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

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 ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ x → a ∈ x + y; (s) 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] ⊦ Some(tid).tid = tid; (s) ⊦ None ≠ Some(tid); (s) ⊦ ¬ 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) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ 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)

Proof step 346 from proof stable-D21 (previous step) (back to tree)

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

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, rl4]

Additional information

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

Proof step 347 from proof stable-D21 (previous step) (back to tree)

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

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) 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] 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) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ 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 348 from proof stable-D21 (previous step) (back to tree)

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

Heuristic use patterns 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] → [first ', rl4], <all paths>

Additional information

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

Proof step 349 from proof stable-D21 (previous step) (back to tree)

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

A spec-lemma

Proof step 350 from proof stable-D21 (previous step) (back to tree)

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

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).butlast = a ' + x.butlast; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s)

Proof step 351 from proof stable-D21 (previous step) (back to tree)

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

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] → [rl2, phead1, rl4]

Additional information

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

Proof step 352 from proof stable-D21 (previous step) (back to tree)

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

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; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s) ⊦ x + a ' + y ≠ []; (s)

Proof step 353 from proof stable-D21 (previous step) (back to tree)

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

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 ', rl0], <all paths>

Additional information

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

Proof step 354 from proof stable-D21 (previous step) (back to tree)

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

A spec-lemma

Proof step 355 from proof stable-D21 (previous step) (back to tree)

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

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 ' + y).last = (b ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s)

Proof step 356 from proof stable-D21 (previous step) (back to tree)

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

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, phead2, rl2]

Additional information

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

Proof step 357 from proof stable-D21 (previous step) (back to tree)

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

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) ⊦ 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 358 from proof stable-D21 (previous step) (back to tree)

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

Heuristic use patterns 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 ', rl2], <all paths>

Additional information

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

Proof step 359 from proof stable-D21 (previous step) (back to tree)

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

A spec-lemma

Proof Tree for stable-D21 (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