[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 step-E5-E6 (conclusion) (back to tree)

⊦ ( gs.owns(ls.node) = Some(ls.tid) ∧ ( 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.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E5, a) ∧ pcstepf(gs, ls, E5, a) = E6 → ( gstepf(gs, ls, E5, a).owns(lstepf(gs, ls, E5, a).node) = Some(lstepf(gs, ls, E5, a).tid) ∧ lstepf(gs, ls, E5, a).lst ∈ gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl ∧ (gstepf(gs, ls, E5, a).ps[lstepf(gs, ls, E5, a).lst].next = null → lstepf(gs, ls, E5, a).lst = gstepf(gs, ls, E5, a).vtail)) ∧ ( listp(gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vs, gstepf(gs, ls, E5, a).ps, gstepf(gs, ls, E5, a).owns) ∧ ¬ dups(gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl) ∧ markedp(gstepf(gs, ls, E5, a).orl, gstepf(gs, ls, E5, a).ps) ∧ markedp(gstepf(gs, ls, E5, a).orl, gstepf(gs, ls, E5, a).vs) ∧ unmarkedp(gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).ps) ∧ gstepf(gs, ls, E5, a).orl ≠ [] ∧ gstepf(gs, ls, E5, a).phead ∈ gstepf(gs, ls, E5, a).orl ∧ rvownerok(gstepf(gs, ls, E5, a).vretRefs, gstepf(gs, ls, E5, a).vrvHp, gstepf(gs, ls, E5, a).rvowns) ∧ allocrv(gstepf(gs, ls, E5, a).vretRefs, gstepf(gs, ls, E5, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vs, gstepf(gs, ls, E5, a).vretRefs, gstepf(gs, ls, E5, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E5, a).pretRefs, gstepf(gs, ls, E5, a).prvHp, gstepf(gs, ls, E5, a).rvowns) ∧ allocrv(gstepf(gs, ls, E5, a).pretRefs, gstepf(gs, ls, E5, a).prvHp) ∧ dom gstepf(gs, ls, E5, a).vrvHp = dom gstepf(gs, ls, E5, a).prvHp ∧ ( gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next ≠ null ∧ gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E5, a).rvowns (gstepf(gs, ls, E5, a).vretRefs(gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next].deqID.tid, gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E5, a).orl.last = gstepf(gs, ls, E5, a).vhead ∧ (gstepf(gs, ls, E5, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E5, a).qrl.tail, gstepf(gs, ls, E5, a).vs)) ∨ gstepf(gs, ls, E5, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E5, a).orl.butlast.last = gstepf(gs, ls, E5, a).vhead ∧ gstepf(gs, ls, E5, a).phead ≠ gstepf(gs, ls, E5, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vs)) ∧ ( gstepf(gs, ls, E5, a).vtail = (gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl).last ∨ gstepf(gs, ls, E5, a).qrl ≠ [] ∧ gstepf(gs, ls, E5, a).vtail = (gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl.butlast).last ∧ gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E5, a).vs[(gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).ps ∧ lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).vs ∧ lstepf(gs, ls, E5, a).node ≠ null ∧ ¬ lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).orl ∧ ¬ lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).qrl) ∧ gstepf(gs, ls, E5, a).vs[lstepf(gs, ls, E5, a).node] = mk(lstepf(gs, ls, E5, a).value, None, null) ∧ gstepf(gs, ls, E5, a).ps[lstepf(gs, ls, E5, a).node] = gstepf(gs, ls, E5, a).vs[lstepf(gs, ls, E5, a).node] ∧ ¬ lstepf(gs, ls, E5, a).success ∧ nextnottid(lstepf(gs, ls, E5, a).tid, gstepf(gs, ls, E5, a).vhead, gstepf(gs, ls, E5, a).vs) ∧ noid(lstepf(gs, ls, E5, a).tid, gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vhead, gstepf(gs, ls, E5, a).vs) ∧ oneowns(lstepf(gs, ls, E5, a).tid, lstepf(gs, ls, E5, a).node, gstepf(gs, ls, E5, a).owns, gstepf(gs, ls, E5, a).vs, gstepf(gs, ls, E5, a).ps)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof step-E5-E6 (previous step) (back to tree)

gs.owns(ls.node) = Some(ls.tid), gs.vs[ls.node] = mk(ls.value, None, null), gs.ps[ls.node] = gs.vs[ls.node], dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, E5, a) = E6, ls.node ≠ null, gs.orl ≠ [], allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), pre(gs, ls, E5, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ls.node ∈ gs.ps, ls.node ∈ gs.vs, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), ¬ ls.node ∈ gs.qrl, ¬ ls.node ∈ gs.orl, 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 ⊦ ( gstepf(gs, ls, E5, a).owns(lstepf(gs, ls, E5, a).node) = Some(lstepf(gs, ls, E5, a).tid) ∧ lstepf(gs, ls, E5, a).lst ∈ gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl ∧ (gstepf(gs, ls, E5, a).ps[lstepf(gs, ls, E5, a).lst].next = null → lstepf(gs, ls, E5, a).lst = gstepf(gs, ls, E5, a).vtail)) ∧ ( listp(gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vs, gstepf(gs, ls, E5, a).ps, gstepf(gs, ls, E5, a).owns) ∧ ¬ dups(gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl) ∧ markedp(gstepf(gs, ls, E5, a).orl, gstepf(gs, ls, E5, a).ps) ∧ markedp(gstepf(gs, ls, E5, a).orl, gstepf(gs, ls, E5, a).vs) ∧ unmarkedp(gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).ps) ∧ gstepf(gs, ls, E5, a).orl ≠ [] ∧ gstepf(gs, ls, E5, a).phead ∈ gstepf(gs, ls, E5, a).orl ∧ rvownerok(gstepf(gs, ls, E5, a).vretRefs, gstepf(gs, ls, E5, a).vrvHp, gstepf(gs, ls, E5, a).rvowns) ∧ allocrv(gstepf(gs, ls, E5, a).vretRefs, gstepf(gs, ls, E5, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vs, gstepf(gs, ls, E5, a).vretRefs, gstepf(gs, ls, E5, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E5, a).pretRefs, gstepf(gs, ls, E5, a).prvHp, gstepf(gs, ls, E5, a).rvowns) ∧ allocrv(gstepf(gs, ls, E5, a).pretRefs, gstepf(gs, ls, E5, a).prvHp) ∧ dom gstepf(gs, ls, E5, a).vrvHp = dom gstepf(gs, ls, E5, a).prvHp ∧ ( gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next ≠ null ∧ gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E5, a).rvowns (gstepf(gs, ls, E5, a).vretRefs(gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next].deqID.tid, gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E5, a).orl.last = gstepf(gs, ls, E5, a).vhead ∧ (gstepf(gs, ls, E5, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E5, a).qrl.tail, gstepf(gs, ls, E5, a).vs)) ∨ gstepf(gs, ls, E5, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E5, a).orl.butlast.last = gstepf(gs, ls, E5, a).vhead ∧ gstepf(gs, ls, E5, a).phead ≠ gstepf(gs, ls, E5, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vs)) ∧ ( gstepf(gs, ls, E5, a).vtail = (gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl).last ∨ gstepf(gs, ls, E5, a).qrl ≠ [] ∧ gstepf(gs, ls, E5, a).vtail = (gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl.butlast).last ∧ gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E5, a).vs[(gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).ps ∧ lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).vs ∧ lstepf(gs, ls, E5, a).node ≠ null ∧ ¬ lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).orl ∧ ¬ lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).qrl) ∧ gstepf(gs, ls, E5, a).vs[lstepf(gs, ls, E5, a).node] = mk(lstepf(gs, ls, E5, a).value, None, null) ∧ gstepf(gs, ls, E5, a).ps[lstepf(gs, ls, E5, a).node] = gstepf(gs, ls, E5, a).vs[lstepf(gs, ls, E5, a).node] ∧ ¬ lstepf(gs, ls, E5, a).success ∧ nextnottid(lstepf(gs, ls, E5, a).tid, gstepf(gs, ls, E5, a).vhead, gstepf(gs, ls, E5, a).vs) ∧ noid(lstepf(gs, ls, E5, a).tid, gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vhead, gstepf(gs, ls, E5, a).vs) ∧ oneowns(lstepf(gs, ls, E5, a).tid, lstepf(gs, ls, E5, a).node, gstepf(gs, ls, E5, a).owns, gstepf(gs, ls, E5, a).vs, gstepf(gs, ls, E5, a).ps)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ gstepf(gs, ls, E5, τ) = gs; (s) ⊦ (ls.lst:= node0).node = ls.node; (s) ⊦ lstepf(gs, ls, E5, τ) = ls.lst:= gs.vtail; (s) ⊦ (ls.lst:= node0).tid = ls.tid; (s) ⊦ (ls.lst:= node0).success ↔ ls.success; (s) ⊦ (ls.lst:= node0).value = ls.value; (s) ⊦ (ls.lst:= node0).lst = node0; (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] fw-some-oneowns: ⊦ oneowns(tid, r0, owns, vs, ps) ∧ owns(r) = Some(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ pre(gs, ls, E5, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E5, a) = E6; (s)

Proof step 3 from proof step-E5-E6 (previous step) (back to tree)

gs.owns(ls.node) = Some(ls.tid), gs.ps[ls.node] = mk(ls.value, None, null), gs.vs[ls.node] = mk(ls.value, None, null), dom gs.vrvHp = dom gs.prvHp, ls.node ≠ null, gs.orl ≠ [], allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.node ∈ gs.vs, ls.node ∈ gs.ps, gs.phead ∈ gs.orl, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ ls.node ∈ gs.qrl, ¬ ls.node ∈ gs.orl, ¬ gs.vtail ∈ gs.orl, ¬ gs.vtail ∈ 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.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.qrl.last].next = null ⊦

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 step-E5-E6 (previous step) (back to tree)

vs[ls.node] = mk(ls.value, None, null), ps[ls.node] = mk(ls.value, None, null), dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), owns(ls.node) = Some(ls.tid), ls.node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ls.node ∈ ps, ls.node ∈ vs, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ ls.node ∈ qrl, ¬ ls.node ∈ orl, ¬ vtail ∈ orl, ¬ vtail ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] 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 5 from proof step-E5-E6 (previous step) (back to tree)

ps[ls.node] = mk(ls.value, None, null), vs[ls.node] = mk(ls.value, None, null), dom vrvHp = dom prvHp, owns(ls.node) = Some(ls.tid), ls.node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), ls.node ∈ vs, ls.node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ ls.node ∈ qrl, ¬ ls.node ∈ orl, ¬ vtail ∈ orl, ¬ vtail ∈ 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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 6 from proof step-E5-E6 (previous step) (back to tree)

vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns(node) = Some(tid), ¬ success, node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, ¬ vtail ∈ orl, ¬ vtail ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 7 from proof step-E5-E6 (previous step) (back to tree)

ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), node ∈ vs, node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, ¬ vtail ∈ orl, ¬ vtail ∈ 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 8 from proof step-E5-E6 (previous step) (back to tree)

vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, orl = qrl0 + vtail0 ', owns(node) = Some(tid), node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ qrl, ¬ node ∈ orl, ¬ vtail ∈ orl, ¬ vtail ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 9 from proof step-E5-E6 (previous step) (back to tree)

ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, vtail ≠ vtail0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), node ∈ vs, node ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl, ¬ node ∈ qrl0, ¬ vtail ∈ 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 36

Additional information

Proof step 10 from proof step-E5-E6 (previous step) (back to tree)

vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vtail0 = vhead, node ≠ null, node ≠ vtail0, vtail ≠ vtail0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ ps, node ∈ vs, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl, ¬ node ∈ qrl0, ¬ vtail ∈ 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), qrl ≠ [] → unmarkedp(qrl.tail, vs), vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl0 ∨ phead = vtail0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 11 from proof step-E5-E6 (previous step) (back to tree)

ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vhead, vtail ≠ vhead, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vhead ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vhead ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vhead ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(qrl, ps), node ∈ vs, node ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail ∈ qrl, ¬ vhead ∈ qrl0, ¬ vhead ∈ qrl, ¬ node ∈ qrl, ¬ node ∈ qrl0, ¬ vtail ∈ qrl0, qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ qrl0 ∨ phead = vhead, vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 38

Additional information

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

Proof step 12 from proof step-E5-E6 (previous step) (back to tree)

vs[qrl.last].deqID = None, vs[qrl.last].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vtail = (vhead ' + qrl.butlast).last, node ≠ null, node ≠ vhead, qrl ≠ [], vtail ≠ vhead, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vhead ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vhead ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vhead ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ ps, node ∈ vs, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail ∈ qrl, ¬ vhead ∈ qrl0, ¬ vhead ∈ qrl, ¬ node ∈ qrl, ¬ node ∈ qrl0, ¬ vtail ∈ 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), qrl ≠ [] → unmarkedp(qrl.tail, vs), phead ∈ qrl0 ∨ phead = vhead ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 13 from proof step-E5-E6 (previous step) (back to tree)

vs[qrl.last].deqID = None, vs[qrl.last].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), (vhead ' + qrl.butlast).last ≠ vhead, node ≠ null, node ≠ vhead, qrl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vhead ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vhead ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vhead ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(qrl, ps), unmarkedp(qrl.tail, vs), node ∈ vs, node ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ (vhead ' + qrl.butlast).last ∈ qrl, ¬ vhead ∈ qrl0, ¬ vhead ∈ qrl, ¬ node ∈ qrl, ¬ node ∈ qrl0, ¬ (vhead ' + qrl.butlast).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), phead ∈ qrl0 ∨ phead = vhead ⊦

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

Additional information

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

Proof step 14 from proof step-E5-E6 (previous step) (back to tree)

vs[qrl.last].deqID = None, vs[qrl.last].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), qrl = phead0 + qrl1, (vhead ' + qrl.butlast).last ≠ vhead, node ≠ null, node ≠ vhead, qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vhead ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vhead ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vhead ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(qrl1, vs), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ ps, node ∈ vs, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ (vhead ' + qrl.butlast).last ∈ qrl, ¬ vhead ∈ qrl0, ¬ vhead ∈ qrl, ¬ node ∈ qrl, ¬ node ∈ qrl0, ¬ (vhead ' + qrl.butlast).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), phead ∈ qrl0 ∨ phead = vhead ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] 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 ' + 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) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ' + x ≠ []; (s)

Proof step 15 from proof step-E5-E6 (previous step) (back to tree)

ps[ps[vhead].next].deqID = None, vs[(ps[vhead].next ' + qrl1).last].deqID = None, vs[(ps[vhead].next ' + qrl1).last].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), (vhead ' + (ps[vhead].next ' + qrl1).butlast).last ≠ ps[vhead].next, (vhead ' + (ps[vhead].next ' + qrl1).butlast).last ≠ vhead, node ≠ ps[vhead].next, node ≠ vhead, node ≠ null, vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(qrl0 + vhead ' + ps[vhead].next ' + qrl1, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, qrl0 + vhead ' + ps[vhead].next ' + qrl1, vhead, vs), nonullRetRefs(qrl0 + vhead ' + ps[vhead].next ' + qrl1, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(qrl1, vs), unmarkedp(qrl1, ps), phead ∈ ps, phead ∈ vs, node ∈ ps, node ∈ vs, ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(qrl0 + qrl1), ¬ (vhead ' + (ps[vhead].next ' + qrl1).butlast).last ∈ qrl0, ¬ node ∈ qrl0, ¬ node ∈ qrl1, ¬ vhead ∈ qrl1, ¬ vhead ∈ qrl0, ¬ (vhead ' + (ps[vhead].next ' + qrl1).butlast).last ∈ qrl1, ¬ ps[vhead].next ∈ qrl1, ¬ ps[vhead].next ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ qrl0 ∨ phead = vhead ⊦

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] → [ps[vhead].next ', qrl1], <all paths>

Additional information

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

Proof step 16 from proof step-E5-E6 (previous step) (back to tree)

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

A spec-lemma

Proof step 17 from proof step-E5-E6 (previous step) (back to tree)

vs[(ps[vhead].next ' + qrl1).last].deqID = None, ps[ps[vhead].next].deqID = None, vs[(ps[vhead].next ' + qrl1).last].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), (vhead ' + ps[vhead].next ' + qrl1.butlast).last ≠ ps[vhead].next, (vhead ' + ps[vhead].next ' + qrl1.butlast).last ≠ vhead, node ≠ ps[vhead].next, node ≠ vhead, node ≠ null, qrl1 ≠ [], vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(qrl0 + vhead ' + ps[vhead].next ' + qrl1, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, qrl0 + vhead ' + ps[vhead].next ' + qrl1, vhead, vs), nonullRetRefs(qrl0 + vhead ' + ps[vhead].next ' + qrl1, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(qrl1, ps), unmarkedp(qrl1, vs), node ∈ vs, node ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(qrl0 + qrl1), ¬ (vhead ' + ps[vhead].next ' + qrl1.butlast).last ∈ qrl0, ¬ node ∈ qrl0, ¬ node ∈ qrl1, ¬ vhead ∈ qrl1, ¬ vhead ∈ qrl0, ¬ (vhead ' + ps[vhead].next ' + qrl1.butlast).last ∈ qrl1, ¬ ps[vhead].next ∈ qrl1, ¬ ps[vhead].next ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ qrl0 ∨ phead = vhead ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 18 from proof step-E5-E6 (previous step) (back to tree)

ps[ps[vhead].next].deqID = None, vs[qrl1.last].deqID = None, vs[qrl1.last].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), (ps[vhead].next ' + qrl1.butlast).last ≠ ps[vhead].next, (ps[vhead].next ' + qrl1.butlast).last ≠ vhead, node ≠ ps[vhead].next, node ≠ vhead, node ≠ null, qrl1 ≠ [], vhead ≠ ps[vhead].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(qrl0 + vhead ' + ps[vhead].next ' + qrl1, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, qrl0 + vhead ' + ps[vhead].next ' + qrl1, vhead, vs), nonullRetRefs(qrl0 + vhead ' + ps[vhead].next ' + qrl1, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(qrl1, vs), unmarkedp(qrl1, ps), phead ∈ ps, phead ∈ vs, node ∈ ps, node ∈ vs, ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(qrl0 + qrl1), ¬ ps[vhead].next ∈ qrl1, ¬ ps[vhead].next ∈ qrl0, ¬ (ps[vhead].next ' + qrl1.butlast).last ∈ qrl0, ¬ node ∈ qrl0, ¬ node ∈ qrl1, ¬ vhead ∈ qrl1, ¬ vhead ∈ qrl0, ¬ (ps[vhead].next ' + qrl1.butlast).last ∈ qrl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ qrl0 ∨ phead = vhead ⊦

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, phead0, qrl]

Additional information

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

Proof step 19 from proof step-E5-E6 (previous step) (back to tree)

vs[phead0].deqID = None, ps[ps[vhead].next].deqID = None, vs[phead0].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), qrl1 = qrl + phead0 ', (ps[vhead].next ' + qrl).last ≠ ps[vhead].next, (ps[vhead].next ' + qrl).last ≠ vhead, node ≠ ps[vhead].next, node ≠ vhead, node ≠ null, qrl1 ≠ [], vhead ≠ ps[vhead].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(qrl0 + vhead ' + ps[vhead].next ' + qrl1, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, qrl0 + vhead ' + ps[vhead].next ' + qrl1, vhead, vs), nonullRetRefs(qrl0 + vhead ' + ps[vhead].next ' + qrl1, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(qrl1, ps), unmarkedp(qrl1, vs), node ∈ vs, node ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(qrl0 + qrl1), ¬ ps[vhead].next ∈ qrl1, ¬ ps[vhead].next ∈ qrl0, ¬ (ps[vhead].next ' + qrl).last ∈ qrl0, ¬ node ∈ qrl0, ¬ node ∈ qrl1, ¬ vhead ∈ qrl1, ¬ vhead ∈ qrl0, ¬ (ps[vhead].next ' + qrl).last ∈ qrl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ qrl0 ∨ phead = vhead ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 20 from proof step-E5-E6 (previous step) (back to tree)

ps[ps[vhead].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[phead0].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), (ps[vhead].next ' + qrl).last ≠ ps[vhead].next, (ps[vhead].next ' + qrl).last ≠ vhead, (ps[vhead].next ' + qrl).last ≠ phead0, ps[vhead].next ≠ phead0, node ≠ ps[vhead].next, node ≠ vhead, node ≠ null, node ≠ phead0, vhead ≠ ps[vhead].next, vhead ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(qrl0 + vhead ' + ps[vhead].next ' + qrl + phead0 ', vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, qrl0 + vhead ' + ps[vhead].next ' + qrl + phead0 ', vhead, vs), nonullRetRefs(qrl0 + vhead ' + ps[vhead].next ' + qrl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ ps, node ∈ vs, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ phead0 ∈ qrl, ¬ phead0 ∈ qrl0, ¬ ps[vhead].next ∈ qrl, ¬ ps[vhead].next ∈ qrl0, ¬ (ps[vhead].next ' + qrl).last ∈ qrl0, ¬ node ∈ qrl0, ¬ node ∈ qrl, ¬ vhead ∈ qrl, ¬ vhead ∈ qrl0, ¬ (ps[vhead].next ' + qrl).last ∈ 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), phead ∈ qrl0 ∨ phead = vhead ⊦

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] → [ps[vhead].next ', qrl], <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: ps[vhead].next ', qrl

Proof step 21 from proof step-E5-E6 (previous step) (back to tree)

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

A spec-lemma

Proof step 22 from proof step-E5-E6 (previous step) (back to tree)

qrl0.last = vhead, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, phead ≠ vtail0, qrl0 ≠ [], vtail ≠ vtail0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (qrl0 + vtail0 ') + qrl, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ ps, phead ∈ vs, node ∈ ps, node ∈ vs, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl, ¬ node ∈ qrl0, ¬ vtail ∈ 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), vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl0 ∨ phead = vtail0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 23 from proof step-E5-E6 (previous step) (back to tree)

ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, node ≠ vtail0, phead ≠ vtail0, qrl0 ≠ [], vtail ≠ vtail0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, qrl0.last, vs), noid(tid, (qrl0 + vtail0 ') + qrl, qrl0.last, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), node ∈ vs, node ∈ ps, phead ∈ vs, phead ∈ ps, phead ∈ qrl0, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl, ¬ node ∈ qrl0, ¬ vtail ∈ qrl0, vs[qrl0.last].next ≠ null ∧ vs[vs[qrl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[qrl0.last].next].deqID.tid)) = Claimed(vs[vs[qrl0.last].next].deqID.tid, vs[vs[qrl0.last].next].val), vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.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] → [qrl0, phead0, qrl1]

Additional information

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

Proof step 24 from proof step-E5-E6 (previous step) (back to tree)

vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), qrl0 = qrl1 + phead0 ', node ≠ null, node ≠ vtail0, phead ≠ vtail0, qrl0 ≠ [], vtail ≠ vtail0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, phead0, vs), noid(tid, (qrl0 + vtail0 ') + qrl, phead0, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ qrl0, phead ∈ ps, phead ∈ vs, node ∈ ps, node ∈ vs, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ node ∈ qrl, ¬ node ∈ qrl0, ¬ vtail ∈ qrl0, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 25 from proof step-E5-E6 (previous step) (back to tree)

vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), ps[phead0].next ≠ phead0, node ≠ phead0, node ≠ ps[phead0].next, node ≠ null, phead ≠ ps[phead0].next, vtail ≠ phead0, vtail ≠ ps[phead0].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((qrl1 + phead0 ') + ps[phead0].next ') + qrl, vs, ps, owns), markedp(qrl1, ps), markedp(qrl1, vs), nextnottid(tid, phead0, vs), noid(tid, ((qrl1 + phead0 ') + ps[phead0].next ') + qrl, phead0, vs), nonullRetRefs(((qrl1 + phead0 ') + ps[phead0].next ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), some?(ps[ps[phead0].next].deqID), some?(vs[ps[phead0].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ ps, phead ∈ vs, node ∈ ps, node ∈ vs, ¬ dups(qrl), ¬ dups(qrl1), ¬ dups(qrl1 + qrl), ¬ vtail ∈ qrl1, ¬ node ∈ qrl1, ¬ node ∈ qrl, ¬ ps[phead0].next ∈ qrl, ¬ ps[phead0].next ∈ qrl1, ¬ vtail ∈ qrl, ¬ phead0 ∈ qrl, ¬ phead0 ∈ qrl1, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ qrl1 ∨ phead = phead0, vtail = (ps[phead0].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (ps[phead0].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 46

Additional information

Proof step 26 from proof step-E5-E6 (previous step) (back to tree)

ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vtail = (ps[phead0].next ' + qrl).last, ps[phead0].next ≠ phead0, node ≠ phead0, node ≠ ps[phead0].next, node ≠ null, phead ≠ ps[phead0].next, vtail ≠ phead0, vtail ≠ ps[phead0].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((qrl1 + phead0 ') + ps[phead0].next ') + qrl, vs, ps, owns), markedp(qrl1, vs), markedp(qrl1, ps), nextnottid(tid, phead0, vs), noid(tid, ((qrl1 + phead0 ') + ps[phead0].next ') + qrl, phead0, vs), nonullRetRefs(((qrl1 + phead0 ') + ps[phead0].next ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[ps[phead0].next].deqID), some?(ps[ps[phead0].next].deqID), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), node ∈ vs, node ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(qrl1), ¬ dups(qrl1 + qrl), ¬ vtail ∈ qrl1, ¬ node ∈ qrl1, ¬ node ∈ qrl, ¬ ps[phead0].next ∈ qrl, ¬ ps[phead0].next ∈ qrl1, ¬ vtail ∈ qrl, ¬ phead0 ∈ qrl, ¬ phead0 ∈ qrl1, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ qrl1 ∨ phead = phead0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 27 from proof step-E5-E6 (previous step) (back to tree)

vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), (ps[phead0].next ' + qrl).last ≠ phead0, (ps[phead0].next ' + qrl).last ≠ ps[phead0].next, ps[phead0].next ≠ phead0, node ≠ phead0, node ≠ ps[phead0].next, node ≠ null, phead ≠ ps[phead0].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((qrl1 + phead0 ') + ps[phead0].next ') + qrl, vs, ps, owns), markedp(qrl1, ps), markedp(qrl1, vs), nextnottid(tid, phead0, vs), noid(tid, ((qrl1 + phead0 ') + ps[phead0].next ') + qrl, phead0, vs), nonullRetRefs(((qrl1 + phead0 ') + ps[phead0].next ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), some?(ps[ps[phead0].next].deqID), some?(vs[ps[phead0].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ ps, phead ∈ vs, node ∈ ps, node ∈ vs, ¬ dups(qrl), ¬ dups(qrl1), ¬ dups(qrl1 + qrl), ¬ (ps[phead0].next ' + qrl).last ∈ qrl1, ¬ node ∈ qrl1, ¬ node ∈ qrl, ¬ ps[phead0].next ∈ qrl, ¬ ps[phead0].next ∈ qrl1, ¬ (ps[phead0].next ' + qrl).last ∈ qrl, ¬ phead0 ∈ qrl, ¬ phead0 ∈ qrl1, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ qrl1 ∨ phead = phead0 ⊦

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] → [ps[phead0].next ', qrl], <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: ps[phead0].next ', qrl

Proof step 28 from proof step-E5-E6 (previous step) (back to tree)

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

A spec-lemma

Proof step 29 from proof step-E5-E6 (previous step) (back to tree)

vs[qrl.last].deqID = None, vs[qrl.last].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vtail = (ps[phead0].next ' + qrl.butlast).last, ps[phead0].next ≠ phead0, node ≠ phead0, node ≠ ps[phead0].next, node ≠ null, phead ≠ ps[phead0].next, qrl ≠ [], vtail ≠ phead0, vtail ≠ ps[phead0].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((qrl1 + phead0 ') + ps[phead0].next ') + qrl, vs, ps, owns), markedp(qrl1, vs), markedp(qrl1, ps), nextnottid(tid, phead0, vs), noid(tid, ((qrl1 + phead0 ') + ps[phead0].next ') + qrl, phead0, vs), nonullRetRefs(((qrl1 + phead0 ') + ps[phead0].next ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[ps[phead0].next].deqID), some?(ps[ps[phead0].next].deqID), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), node ∈ vs, node ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(qrl1), ¬ dups(qrl1 + qrl), ¬ vtail ∈ qrl1, ¬ node ∈ qrl1, ¬ node ∈ qrl, ¬ ps[phead0].next ∈ qrl, ¬ ps[phead0].next ∈ qrl1, ¬ vtail ∈ qrl, ¬ phead0 ∈ qrl, ¬ phead0 ∈ qrl1, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ qrl1 ∨ phead = phead0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 30 from proof step-E5-E6 (previous step) (back to tree)

vs[qrl.last].deqID = None, vs[qrl.last].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), (ps[phead0].next ' + qrl.butlast).last ≠ phead0, (ps[phead0].next ' + qrl.butlast).last ≠ ps[phead0].next, ps[phead0].next ≠ phead0, node ≠ phead0, node ≠ ps[phead0].next, node ≠ null, phead ≠ ps[phead0].next, qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((qrl1 + phead0 ') + ps[phead0].next ') + qrl, vs, ps, owns), markedp(qrl1, ps), markedp(qrl1, vs), nextnottid(tid, phead0, vs), noid(tid, ((qrl1 + phead0 ') + ps[phead0].next ') + qrl, phead0, vs), nonullRetRefs(((qrl1 + phead0 ') + ps[phead0].next ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), some?(ps[ps[phead0].next].deqID), some?(vs[ps[phead0].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ ps, phead ∈ vs, node ∈ ps, node ∈ vs, ¬ dups(qrl), ¬ dups(qrl1), ¬ dups(qrl1 + qrl), ¬ (ps[phead0].next ' + qrl.butlast).last ∈ qrl1, ¬ node ∈ qrl1, ¬ node ∈ qrl, ¬ ps[phead0].next ∈ qrl, ¬ ps[phead0].next ∈ qrl1, ¬ (ps[phead0].next ' + qrl.butlast).last ∈ qrl, ¬ phead0 ∈ qrl, ¬ phead0 ∈ qrl1, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ qrl1 ∨ phead = phead0 ⊦

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

Additional information

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

Proof step 31 from proof step-E5-E6 (previous step) (back to tree)

vs[phead1].deqID = None, vs[phead1].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), qrl = qrl0 + phead1 ', (ps[phead0].next ' + qrl0).last ≠ phead0, (ps[phead0].next ' + qrl0).last ≠ ps[phead0].next, ps[phead0].next ≠ phead0, node ≠ phead0, node ≠ ps[phead0].next, node ≠ null, phead ≠ ps[phead0].next, qrl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(((qrl1 + phead0 ') + ps[phead0].next ') + qrl, vs, ps, owns), markedp(qrl1, vs), markedp(qrl1, ps), nextnottid(tid, phead0, vs), noid(tid, ((qrl1 + phead0 ') + ps[phead0].next ') + qrl, phead0, vs), nonullRetRefs(((qrl1 + phead0 ') + ps[phead0].next ') + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[ps[phead0].next].deqID), some?(ps[ps[phead0].next].deqID), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), node ∈ vs, node ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(qrl1), ¬ dups(qrl1 + qrl), ¬ (ps[phead0].next ' + qrl0).last ∈ qrl1, ¬ node ∈ qrl1, ¬ node ∈ qrl, ¬ ps[phead0].next ∈ qrl, ¬ ps[phead0].next ∈ qrl1, ¬ (ps[phead0].next ' + qrl0).last ∈ qrl, ¬ phead0 ∈ qrl, ¬ phead0 ∈ qrl1, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ qrl1 ∨ phead = phead0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 32 from proof step-E5-E6 (previous step) (back to tree)

vs[phead1].deqID = None, ps[phead1].deqID = None, vs[phead1].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), (ps[phead0].next ' + qrl0).last ≠ phead0, (ps[phead0].next ' + qrl0).last ≠ ps[phead0].next, (ps[phead0].next ' + qrl0).last ≠ phead1, ps[phead0].next ≠ phead0, ps[phead0].next ≠ phead1, node ≠ phead0, node ≠ ps[phead0].next, node ≠ null, node ≠ phead1, phead ≠ ps[phead0].next, phead0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((qrl1 + phead0 ') + ps[phead0].next ') + qrl0 + phead1 ', vs, ps, owns), markedp(qrl1, ps), markedp(qrl1, vs), nextnottid(tid, phead0, vs), noid(tid, ((qrl1 + phead0 ') + ps[phead0].next ') + qrl0 + phead1 ', phead0, vs), nonullRetRefs(((qrl1 + phead0 ') + ps[phead0].next ') + qrl0 + phead1 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), some?(ps[ps[phead0].next].deqID), some?(vs[ps[phead0].next].deqID), unmarkedp(qrl0, ps), unmarkedp(qrl0, vs), phead ∈ ps, phead ∈ vs, node ∈ ps, node ∈ vs, ¬ dups(qrl1 + qrl0), ¬ dups(qrl1), ¬ dups(qrl0), ¬ phead0 ∈ qrl1, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ qrl1, ¬ (ps[phead0].next ' + qrl0).last ∈ qrl1, ¬ node ∈ qrl1, ¬ node ∈ qrl0, ¬ ps[phead0].next ∈ qrl0, ¬ ps[phead0].next ∈ qrl1, ¬ (ps[phead0].next ' + qrl0).last ∈ qrl0, ¬ phead0 ∈ qrl0, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ qrl1 ∨ phead = phead0 ⊦

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] → [ps[phead0].next ', qrl0], <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: ps[phead0].next ', qrl0

Proof step 33 from proof step-E5-E6 (previous step) (back to tree)

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

A spec-lemma

Proof Tree for step-E5-E6 (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